论文标题

机会网络中的服务组成:负载和移动性意识解决方案

Service Composition in Opportunistic Networks: A Load and Mobility Aware Solution

论文作者

Sadiq, Umair, Kumar, Mohan, Passarella, Andrea, Conti, Marco

论文摘要

用户移动设备形成的普遍网络有可能利用一组丰富的分布式服务组件,可以为每个用户提供多种应用程序级服务。但是,在许多具有挑战性的情况下,需要机会性网络技术来实现通信,因为设备遭受了间歇性连通性,断开连接和分区的影响。这给服务组成技术带来了新的挑战。尽管有几项工作讨论了在良好的有线网络和稳定的MANET环境中的服务组成的中间件和体系结构,但在机会性网络的重要挑战性网络环境中选择和转发服务请求的基本机制尚未完全解决。该问题包括三个阶段:i)从可用服务中选择适当的服务序列以获得所需的应用程序级服务; ii)通过多跳跃机会性路径与下一个阶段的上一个阶段的路由结果; iii)将最终服务结果路由回到请求者。拟议的算法通过考虑服务提供商的估计负载以及预期的时间在设备之间提供机会信息,从而提高了效率和有效性。基于此信息,算法估计获得所需服务的最佳组成。结果表明,仅使用以分布式方式收集的本地知识,可以实现接近实时集中系统的性能。通过对真实/合成痕迹的大量模拟,建立了一系列移动特性中服务组成算法的适用性和性能保证。

Pervasive networks formed by users' mobile devices have the potential to exploit a rich set of distributed service components that can be composed to provide each user with a multitude of application level services. However, in many challenging scenarios, opportunistic networking techniques are required to enable communication as devices suffer from intermittent connectivity, disconnections and partitions. This poses novel challenges to service composition techniques. While several works have discussed middleware and architectures for service composition in well-connected wired networks and in stable MANET environments, the underlying mechanism for selecting and forwarding service requests in the significantly challenging networking environment of opportunistic networks has not been entirely addressed. The problem comprises three stages: i) selecting an appropriate service sequence set out of available services to obtain the required application level service; ii) routing results of a previous stage in the composition to the next one through a multi-hop opportunistic path; and iii) routing final service outcomes back to the requester. The proposed algorithm derives efficiency and effectiveness by taking into account the estimated load at service providers and expected time to opportunistically route information between devices. Based on this information the algorithm estimates the best composition to obtain a required service. It is shown that using only local knowledge collected in a distributed manner, performance close to a real-time centralized system can be achieved. Applicability and performance guarantee of the service composition algorithm in a range of mobility characteristics are established through extensive simulations on real/synthetic traces.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源