Sciweavers

2343 search results - page 169 / 469
» The Locomotive Routing Problem
Sort
View
INFOCOM
2002
IEEE
15 years 11 months ago
Performance Analysis of Deflection Routing in Optical Burst-Switched Networks
This paper concerns itself with the performance of deflection routing in optical burst-switched networks based on Just-Enough-Time (JET) signaling. Generally speaking, buffer requi...
Ching-Fang Hsu, Te-Lung Liu, Nen-Fu Huang
IPPS
2000
IEEE
15 years 10 months ago
Network Survivability Simulation of a Commercially Deployed Dynamic Routing System Protocol
With the ever-increasing demands on server applications, many new server services are distributed in nature. We evaluated one hundred deployed systems and found that over a one-yea...
Abdur Chowdhury, Ophir Frieder, Paul Luse, Peng-Ju...
SODA
2008
ACM
140views Algorithms» more  SODA 2008»
15 years 7 months ago
Minimizing average latency in oblivious routing
We consider the problem of minimizing average latency cost while obliviously routing traffic in a network with linear latency functions. This is roughly equivalent to minimizing t...
Prahladh Harsha, Thomas P. Hayes, Hariharan Naraya...
CN
2007
148views more  CN 2007»
15 years 6 months ago
Using taxonomies for content-based routing with ants
Although the ant metaphor has been successfully applied to routing of data packets both in wireless and fixed networks, little is known yet about its appropriateness for search i...
Elke Michlmayr, Arno Pany, Gerti Kappel
CORR
2007
Springer
99views Education» more  CORR 2007»
15 years 6 months ago
Optimal Routing for Decode-and-Forward based Cooperation in Wireless Networks
Abstract- We investigate cooperative wireless relay networks in which the nodes can help each other in data transmission. We study different coding strategies in the single-source ...
Lawrence Ong, Mehul Motani