306 search results - page 13 / 62 » Routing Algorithms for Anycast Messages |
AINA
2006
IEEE
15 years 5 months ago
2006
IEEE
Abstract— We design a scalable and expressive naming system called SENS, which can retrieve information of computing and content resources distributed widely on the Internet by e...
IJNSEC
2007
14 years 11 months ago
2007
The ability of communicating with a selected party anonymously is an important aspect of network security. Communicating anonymously means that no adversary can discern who is com...
INFOCOM
1997
IEEE
15 years 3 months ago
1997
IEEE
In this paper, we study the NP-hard delay-constrained least-cost path problem. A solution to this problem is needed to provide real-time communication service to connection-orient...
103
click to vote
TPDS
1998
14 years 11 months ago
1998
—Unicast_V is a progressive, misrouting algorithm for packet or virtual cut-through networks. A progressive protocol forwards a message at an intermediate node if a nonfaulty pro...
92
Voted
INFOCOM
2003
IEEE
15 years 5 months ago
2003
IEEE
— We present a new algorithm for routing of messages in ad-hoc networks where the nodes are energy-constrained. The routing objective is to maximize the total number of messages ...