Sciweavers

1815 search results - page 103 / 363
» Path Planning for Network Performance
Sort
View
GLOBECOM
2007
IEEE
14 years 2 months ago
A Better Approach to Reliable Multi-Path Provisioning
— We study the problem of reliably provisioning traffic in high-capacity backbone mesh networks supporting virtual concatenation (VCAT). VCAT enables a connection to be inversel...
Ananya Das, Charles U. Martel, Biswanath Mukherjee...
WEA
2010
Springer
281views Algorithms» more  WEA 2010»
14 years 1 months ago
Distributed Time-Dependent Contraction Hierarchies
Server based route planning in road networks is now powerful enough to find quickest paths in a matter of milliseconds, even if detailed information on time-dependent travel times...
Tim Kieritz, Dennis Luxen, Peter Sanders, Christia...
GSN
2009
Springer
155views Sensor Networks» more  GSN 2009»
14 years 6 days ago
Distributed Network Configuration for Wavelet-Based Compression in Sensor Networks
En-route data compression is fundamental to reduce the power consumed for data gathering in sensor networks. Typical in-network compression schemes involve the distributed computat...
Paula Tarrío, Giuseppe Valenzise, Godwin Sh...
COMCOM
2006
105views more  COMCOM 2006»
13 years 8 months ago
Dynamic bandwidth reservation for label switched paths: An on-line predictive approach
Managing the bandwidth allocated to a Label Switched Path in MPLS networks plays a major role for provisioning of Quality of Service and efficient use of resources. In doing so, t...
Tricha Anjali, Carlo Bruni, Daniela Iacoviello, Ca...
WWW
2004
ACM
14 years 9 months ago
SPT-based topology algorithm for constructing power efficient wireless ad hoc networks
In this paper, we present a localized Shortest Path Tree (SPT) based algorithm for constructing a sub-network with the minimum-energy property for a given wireless ad hoc network....
Szu-Chi Wang, David S. L. Wei, Sy-Yen Kuo