Sciweavers

481 search results - page 58 / 97
» Routing without routes: the backpressure collection protocol
Sort
View
ASPLOS
2010
ACM
14 years 2 months ago
Power routing: dynamic power provisioning in the data center
Data center power infrastructure incurs massive capital costs, which typically exceed energy costs over the life of the facility. To squeeze maximum value from the infrastructure,...
Steven Pelley, David Meisner, Pooya Zandevakili, T...
ICDE
2007
IEEE
170views Database» more  ICDE 2007»
14 years 9 months ago
Tree-Pattern Similarity Estimation for Scalable Content-based Routing
With the advent of XML as the de facto language for data publishing and exchange, scalable distribution of XML data to large, dynamic populations of consumers remains an important...
Raphaël Chand, Pascal Felber, Minos N. Garofa...
MOBICOM
2003
ACM
14 years 27 days ago
Minimum energy disjoint path routing in wireless ad-hoc networks
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
Anand Srinivas, Eytan Modiano
TON
2008
96views more  TON 2008»
13 years 7 months ago
MICRON: a framework for connection establishment in optical networks
Traffic grooming in optical networks has gained significance due to the prevailing sub-wavelength requirement of end users. Optical networks get upgraded to the latest technology s...
Srinivasan Ramasubramanian, Arun K. Somani
GLOBECOM
2007
IEEE
13 years 11 months ago
S-OSPF: A Traffic Engineering Solution for OSPF Based Best Effort Networks
Open Shortest Path First (OSPF) is one of the most widely used intra-domain routing protocol. It is well known that OSPF protocol does not provide flexibility in terms of packet fo...
Aditya Kumar Mishra, Anirudha Sahoo