Sciweavers

5079 search results - page 153 / 1016
» Hidden-Action in Network Routing
Sort
View
ATMOS
2010
163views Optimization» more  ATMOS 2010»
14 years 9 months ago
Railway Track Allocation by Rapid Branching
The track allocation problem, also known as train routing problem or train timetabling problem, is to find a conflict-free set of train routes of maximum value in a railway netw...
Ralf Borndörfer, Thomas Schlechte, Steffen We...
IPSN
2010
Springer
15 years 5 months ago
Routing without routes: the backpressure collection protocol
Current data collection protocols for wireless sensor networks are mostly based on quasi-static minimum-cost routing trees. We consider an alternative, highly-agile approach calle...
Scott Moeller, Avinash Sridharan, Bhaskar Krishnam...
CCR
2002
98views more  CCR 2002»
14 years 10 months ago
Efficient flooding with Passive Clustering (PC) in ad hoc networks
An ad hoc network is a fast deployable selfconfiguring wireless network characterized by node mobility, dynamic topology structure, unreliable media and limited power supply. Node...
Taek Jin Kwon, Mario Gerla
ICN
2005
Springer
15 years 3 months ago
Fault Free Shortest Path Routing on the de Bruijn Networks
It is shown that the de Bruijn graph (dBG) can be used as an architecture for interconnection networks and a suitable structure for parallel computation. Recent works have classi...
Ngoc Chi Nguyen, Vo Dinh Minh Nhat, Sungyoung Lee
CCR
2008
91views more  CCR 2008»
14 years 10 months ago
UFO: a resilient layered routing architecture
Conventional wisdom has held that routing protocols cannot achieve both scalability and high availability. Despite scaling relatively well, today's Internet routing system do...
Yaping Zhu, Andy C. Bavier, Nick Feamster, Sampath...