Providing movement information to applications in wireless IPv6 and mobile IPv6 terminals
EUNICE'07 Proceedings of the 13th open European summer school and IFIP TC6.6 conference on Dependable and adaptable networks and services
A topology-aware application layer multicast protocol
CCNC'10 Proceedings of the 7th IEEE conference on Consumer communications and networking conference
| Hi-index | 0.00 |
This work describes a novel location-aware, self-organizing, fault-tolerant peer-to-peer (P2P) overlay network, referred to as Laptop. Network locality-aware considerations are a very important metric for designing a P2P overlay network. Several network proximity schemes have been proposed to enhance the routing efficiency of existing DHT-based overlay networks. However, these schemes have some drawbacks such as high overlay network and routing table maintenance overhead, or not being completely self-organizing. As a result, they may result in poor scalability as the number of nodes in the system grows.Laptop constructs a location-aware overlay network without pre-determined landmarks and adopts a routing cache scheme to avoid maintaining the routing table periodically. In addition, Laptop significantly reduces the overlay maintenance overhead by making each node maintain only the connectivity between parent and itself. Mathematical analysis and simulations are conducted to evaluate the efficiency, scalability, and robustness of Laptop. Our mathematical analysis shows that the routing path length is bounded by logd N, and the joining and leaving overhead is bounded by d logd N, where N is the number of nodes in the system, and d is the maximum degree of each node on the overlay tree. Our simulation results show that the average latency stretch is 1.6 and the average routing path length is only about three in 10 000 Laptop nodes, and the maximum degree of a node is bounded by 32. Copyright © 2006 John Wiley & Sons, Ltd.