Sciweavers

155 search results - page 22 / 31
» A New Necessary Condition for Shortest Path Routing
Sort
View
WSNA
2003
ACM
14 years 1 months ago
Parametric probabilistic sensor network routing
Motivated by realistic sensor network scenarios that have mis-informed nodes and variable network topologies, we propose a fundamentally different approach to routing that combine...
Christopher L. Barrett, Stephan Eidenbenz, Lukas K...
COMCOM
2008
153views more  COMCOM 2008»
13 years 8 months ago
Available bandwidth estimation and admission control for QoS routing in wireless mesh networks
This article presents an integrated admission control and routing mechanism for multi-rate wireless mesh networks. Admission control depends on precise estimates of available band...
Mesut Ali Ergin, Marco Gruteser, Lin Luo, Dipankar...
PODC
2003
ACM
14 years 1 months ago
Scaling properties of the Internet graph
As the Internet grows in size, it becomes crucial to understand how the speeds of links in the network must improve in order to sustain the pressure of new end-nodes being added e...
Aditya Akella, Shuchi Chawla, Arvind Kannan, Srini...
CIC
2004
118views Communications» more  CIC 2004»
13 years 9 months ago
An Efficient Delay Sensitive Multicast Routing Algorithm
As a key issue in multicast routing with quality of service (QoS) support, constrained minimum Steiner tree (CMST) problem has been a research focus for more than a decade, and ten...
Gang Feng
INFOCOM
2002
IEEE
14 years 1 months ago
Constraint-based path selection methods for on-demand provisioning in WDM networks
Abstract-- We propose a framework for decentralized path selection and on-demand wavelength channel provisioning in WDM networks with routing constraints. Within this framework, th...
Admela Jukan, Gerald Franzl