Sciweavers

671 search results - page 49 / 135
» Context-specific Route Directions
Sort
View
CONEXT
2005
ACM
13 years 10 months ago
TIE breaking: tunable interdomain egress selection
— The separation of intradomain and interdomain routing has been a key feature of the Internet’s routing architecture from the early days of the ARPAnet. However, the appropria...
Renata Teixeira, Timothy G. Griffin, Mauricio G. C...
APBC
2004
124views Bioinformatics» more  APBC 2004»
13 years 10 months ago
BRINet: A BioResource Integration Network
Addressing queries interactively to a chain of two or more biological resources is an everyday task for many scientists, as they use in-silico methods to characterize a biological...
Jason E. Sew Hoy, Alan F. McCulloch, John R. McDon...
CORR
2008
Springer
118views Education» more  CORR 2008»
13 years 8 months ago
Decentralized Search with Random Costs
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
Oskar Sandberg
INFOCOM
2008
IEEE
14 years 3 months ago
Throughput Anonymity Trade-off in Wireless Networks under Latency Constraints
—Providing anonymity to routes in a wireless ad hoc network from passive eavesdroppers is considered. Using Shannon’s equivocation as an information theoretic measure of anonym...
Parvathinathan Venkitasubramaniam, Lang Tong
ONDM
2000
13 years 10 months ago
Distributed Router Architecture for Packet-Routed Optical Networks
: A new proposal for an optical packet-routed network based on a distributed router architecture in a WDM network is described. Buffering, scheduling and wavelength assignment func...
Michael Düser, Eugene Kozlovski, Robert I. Ki...