Sciweavers

1204 search results - page 159 / 241
» Optimal Routing in a Small-World Network
Sort
View
NETWORKING
2010
15 years 7 months ago
Cost Bounds of Multicast Light-Trees in WDM Networks
The construction of light-trees is one principal subproblem for multicast routing in sparse splitting Wavelength Division Multiplexing (WDM) networks. Due to the light splitting co...
Fen Zhou, Miklós Molnár, Bernard Cou...
ATAL
2005
Springer
15 years 11 months ago
Efficient information retrieval using mobile agents
We are concerned with the use of Mobile Agents for information retrieval. A multi-agent system is considered; a number of agents are involved in a collective effort to retrieve di...
Irene Sygkouna, Miltiades E. Anagnostou
SWAT
2004
Springer
120views Algorithms» more  SWAT 2004»
15 years 11 months ago
Railway Delay Management: Exploring Its Algorithmic Complexity
We consider delay management in railway systems. Given delayed trains, we want to find a waiting policy for the connecting trains minimizing the weighted total passenger delay. If...
Michael Gatto, Björn Glaus, Riko Jacob, Leon ...
SIGCOMM
2005
ACM
15 years 11 months ago
Using redundancy to cope with failures in a delay tolerant network
We consider the problem of routing in a delay tolerant network (DTN) in the presence of path failures. Previous work on DTN routing has focused on using precisely known network dy...
Sushant Jain, Michael J. Demmer, Rabin K. Patra, K...
CISS
2008
IEEE
16 years 21 days ago
On the delay and throughput of digital and analog network coding for wireless broadcast
— We address the problem of exchanging broadcast packets among multiple wireless terminals through a single relay node. The objective is to evaluate the delay and throughput gain...
Yalin Evren Sagduyu, Dongning Guo, Randall Berry