306 search results - page 29 / 62 » Routing Algorithms for Anycast Messages |
138
click to vote
ESA
2007
Springer
15 years 3 months ago
2007
Springer
We consider the price of selfish routing in terms of tradeoffs and from an average-case perspective. Each player in a network game seeks to send a message with a certain length by...
IPPS
2002
IEEE
15 years 4 months ago
2002
IEEE
‘ We take advantage of the hierarchical structure of the star graph network to obtain an efficient method for constructing node-disjoint paths between arbitrary pairs of nodes in...
102
click to vote
INFOCOM
2010
IEEE
14 years 10 months ago
2010
IEEE
— In opportunistic networks, end-to-end paths between two communicating nodes are rarely available. In such situations, the nodes might still copy and forward messages to nodes t...
109
Voted
ICPADS
2002
IEEE
15 years 4 months ago
2002
IEEE
Wormhole routing is most common in parallel architectures in which messages are sent in small fragments called flits. It is a lightweight and efficient method of routing message...
121
click to vote
SIGMETRICS
2010
ACM
14 years 10 months ago
2010
ACM
Many network-management problems in large backbone networks need the answer to a seemingly simple question: where does a given IP packet, entering the network at a particular plac...