Description: 在状态转移规则的基础上，局部更新规则和全局更新的蚁群算法的规则，我们提出一个IM证明蚂蚁的最低成本的服务质量蚁群算法（QoS）的路径用于解决网络路由问题与延迟以及背包约束中进行模拟。约52.33％蚂蚁找到成功的QoS路由。并收敛到最佳。-based on the state transition rule，the local updating rule and the global updating rule of ant colony algorithm ，we propose an im proved ant colony algorithm of the least cost quality of service(QoS)unicast routing．The algorithm is used for solving the routing problem with delay．delay jitter．bandwidth，and packet lOSS constrained． In the simulation，about 52．33 ants find the Successful QoS routing ．and converge to the best． It is proved that the algorithm is efficient and effective． Platform: |
Size: 176128 |
Author:lifei |
Hits:
Description: Hermes算法
随着越来越多可连接的嵌入式设备，大量在网络上的资源，以云计算的形式，变得更容易获得。这些设备要么遭受严格电池使用限制，或有限的处理能力，像传感器，不能够本地运行计算复杂型任务。利用远程资源，更高效的应用程序，需要大量的数据处理和计算才可以及时实现可接受的性能。因此计算卸载 -将发送计算密集型任务给资源更丰富的服务设备。是一种潜在的处理本地资源，和缩短处理时间的方式。-With mobile devices increasingly able to connect
to cloud servers anywhere, resource-constrained devices
can potentially perform offloading of computational tasks to
either improve resource usage or improve performance. It is of
interest to find optimal assignments of tasks to local and remote
devices that can take into account the application-specific profile,
availability of computational resources, and link connectivity,
and find a balance between energy consumption costs of mobile
devices and latency for delay-sensitive applications. Given an
application described by a task dependency graph, we formulate
an optimization problem to minimize the latency while meeting
prescribed resource utilization constraints. Different most of
existing works that either rely on an integer linear programming
which is is NP-hard
NP-hard and
and not
is applicable
not applicable
to general
formulation, which
to general
task
task dependency
for latency
metrics,
on intuitively
Platform: |
Size: 537600 |
Author:安云初 |
Hits:
Search - Delay Constrained