Sciweavers

33 search results - page 4 / 7
» On Algorithm for All-Pairs Most Reliable Quickest Paths
Sort
View
109
Voted
STOC
2007
ACM
134views Algorithms» more  STOC 2007»
16 years 1 months ago
Hardness of routing with congestion in directed graphs
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khann...
115
Voted
TMC
2010
138views more  TMC 2010»
14 years 11 months ago
Reliable Anchor-Based Sensor Localization in Irregular Areas
—Localization is a fundamental problem in wireless sensor networks and its accuracy impacts the efficiency of location-aware protocols and applications, such as routing and stora...
Bin Xiao, Lin Chen, Qingjun Xiao, Minglu Li
116
Voted
INFOCOM
2002
IEEE
15 years 6 months ago
Restoration Algorithms for Virtual Private Networks in the Hose Model
—A Virtual Private Network (VPN) aims to emulate the services provided by a private network over the shared Internet. The endpoints of e connected using abstractions such as Virt...
Giuseppe F. Italiano, Rajeev Rastogi, Bülent ...
119
Voted
NETWORK
2006
96views more  NETWORK 2006»
15 years 1 months ago
Optimizing TCP and RLC interaction in the UMTS radio access network
TCP, the dominant transport protocol for Internet applications, suffers severe performance degradation due to packet losses when a wireless link is present in the endto-end path. ...
Juan J. Alcaraz, Fernando Cerdán, Joan Garc...
122
Voted
DIALM
2003
ACM
139views Algorithms» more  DIALM 2003»
15 years 6 months ago
dBBlue: low diameter and self-routing bluetooth scatternet
This paper addresses the problem of scatternet formation for singlehop Bluetooth based ad hoc networks, with minimal communication overhead. We adopt the well-known structure de B...
Wen-Zhan Song, Xiang-Yang Li, Yu Wang 0003, Weizha...