Sciweavers

269 search results - page 14 / 54
» Online oblivious routing
Sort
View
BROADNETS
2007
IEEE
14 years 1 months ago
Reduced flow routing: Leveraging residual capacity to reduce blocking in GMPLS networks
— Traffic engineering has been extensively studied to maximize network resource utilization while minimizing call blocking [1]. As the the demand for high data rate services ove...
Xiaolan J. Zhang, Sun-il Kim, Steven S. Lumetta
INFOCOM
2003
IEEE
14 years 23 days ago
On-demand Power Management for Ad Hoc Networks
— Battery power is an important resource in ad hoc networks. It has been observed that in ad hoc networks, energy consumption does not reflect the communication activities in th...
Rong Zheng, Robin Kravets
INFOCOM
2005
IEEE
14 years 1 months ago
Provably competitive adaptive routing
Abstract— An ad hoc wireless network is an autonomous selforganizing system of mobile nodes connected by wireless links where nodes not in direct range communicate via intermedia...
Baruch Awerbuch, David Holmer, Herbert Rubens, Rob...
WWW
2011
ACM
13 years 2 months ago
Inverted index compression via online document routing
Modern search engines are expected to make documents searchable shortly after they appear on the ever changing Web. To satisfy this requirement, the Web is frequently crawled. Due...
Gal Lavee, Ronny Lempel, Edo Liberty, Oren Somekh
ICALP
2001
Springer
13 years 12 months ago
Online Packet Routing on Linear Arrays and Rings
In contrast to classical offline k-k routing, the online packet routing problem allows for an arbitrary number of packets with arbitrary end points and release times. We study this...
Jessen T. Havill