632 search results - page 78 / 127 » On Routing in Circulant Graphs |
GD
2006
Springer
14 years 1 months ago
2006
Springer
Circular graph layout is a drawing scheme where all nodes are placed on the perimeter of a circle. An inherent issue with circular layouts is that the rigid restriction on node pla...
MST
2002
13 years 9 months ago
2002
We study the average number of delays suffered by packets routed using greedy (work conserving) scheduling policies. We obtain tight bounds on the worst-case average number of del...
HOTNETS
2010
13 years 4 months ago
2010
This paper presents Packet Re-cycling (PR), a technique that takes advantage of cellular graph embeddings to reroute packets that would otherwise be dropped in case of link or nod...
ICC
2007
IEEE
14 years 4 months ago
2007
IEEE
—The Internet AS level topology, upon which BGP4 runs, plays a vital role in the analysis and study of the global routing behavior. However, the study of the topology itself is n...
INFOCOM
2003
IEEE
14 years 3 months ago
2003
IEEE
— Embedding of a graph metric in Euclidean space efficiently and accurately is an important problem in general with applications in topology aggregation, closest mirror selectio...