Papillon: Greedy Routing in Rings
نویسندگان
چکیده
We study greedy routing over n nodes placed in a ring, with the distance between two nodes defined to be the clockwise or the absolute distance between them along the ring. Such graphs arise in the context of modeling social networks and in routing networks for peer-to-peer systems. We construct the first network over n nodes in which greedy routing takes O(log n/ log d) hops in the worst-case, with d out-going links per node. Our result has the first asymptotically optimal greedy routing complexity. Previous constructions required O( log 2 n
منابع مشابه
Brief Announcement: Papillon: Greedy Routing in Rings
We construct the first n-node degree-d ring-based network with worst-case greedy routes of length Θ(log n/ log d) hops. We study greedy routing over uni-dimensional metrics defined over n nodes lying in a ring. greedy routing in graph (V, E) with distance function δ : V × V → R entails the following decision: Given target node t, node u with neighbors N(u) forwards a message to v ∈ N(u) such th...
متن کاملUsing Greedy Clustering Method to Solve Capacitated Location-Routing Problem with Fuzzy Demands
Using Greedy Clustering Method to Solve Capacitated Location-Routing Problem with Fuzzy Demands Abstract In this paper, the capacitated location routing problem with fuzzy demands (CLRP_FD) is considered. In CLRP_FD, facility location problem (FLP) and vehicle routing problem (VRP) are observed simultaneously. Indeed the vehicles and the depots have a predefined capacity to serve the customerst...
متن کاملPacket Routing and Information Gathering in Lines, Rings and Trees
We study the problem of online packet routing and information gathering in lines, rings and trees. A network consists of n nodes. At each node there is a buffer of size B. Each buffer can transmit one packet to the next buffer at each time step. The packets injection is under adversarial control. Packets arriving at a full buffer must be discarded. In information gathering all packets have the ...
متن کاملPeriodically Regular Chordal Rings
ÐChordal rings have been proposed in the past as networks that combine the simple routing framework of rings with the lower diameter, wider bisection, and higher resilience of other architectures. Virtually all proposed chordal ring networks are nodesymmetric, i.e., all nodes have the same in/out degree and interconnection pattern. Unfortunately, such regular chordal rings are not scalable. In ...
متن کاملAn Improved Junction-Based Directional Routing Protocol (IJDRP) for VANETs
Vehicular Ad-Hoc Networks (VANETs) is a novel technology that has recently emerged and due to its swift changing topology and high mobility nature, it has become problematic to design an efficient routing protocol in VANETs’ amongst both moving and stationary units. Also, the existing routing algorithms are not very effective to satisfy all requirements of VANETs. This paper explores the need o...
متن کامل