Efficient communication through structured node labeling in peer-to-peer networks

Item

Title
Efficient communication through structured node labeling in peer-to-peer networks
Identifier
d_2009_2013:5920df1c82d0:11899
identifier
12520
Creator
Toce, Andi,
Contributor
Abbe Mowshowitz
Date
2013
Language
English
Publisher
City University of New York.
Subject
Computer science | Distributed Networks | Distributed Routing | Hypercube Topologies | Labeled Networks | P2P Networks | Structured Overlay Networks
Abstract
Peer to Peer (P2P) networks have become increasingly popular in recent years as administrators are choosing to move away from monolithic centralized networks. These networks, while offering significant advantages in a variety of applications, are presented with a new set of challenges, from communication efficiency to network vulnerability and security. Numerous researchers have proposed a variety of solutions to improve the quality of service in P2P networks. A critical factor in maintaining an acceptable level of service quality is the efficiency and reliability of communication among nodes. One way of improving communication is to assign identifiers (labels) to each node and then use these labels to facilitate and improve message routing. This proposed work introduces two labeling schemata for P2P networks. Each participating node is assigned a label set. Labels are then used to determine node positions within an engineered logical overlay and identify routing paths during communication. We prove that the assignment of labels reduces the overall cost of communication thus saving valuable network resources. These theoretical findings are confirmed by experimental results with randomly selected P2P networks of various sizes. Detailed statistics on the performance of each protocol are provided which show clearly the practical utility of the labeling approach.
Type
dissertation
Source
2009_2013.csv
degree
Ph.D.
Program
Computer Science