Sciweavers

11371 search results - page 307 / 2275
» The network inhibition problem
Sort
View
FOCS
2006
IEEE
16 years 25 days ago
Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design
We consider approximation algorithms for non-uniform buy-at-bulk network design problems. The first nontrivial approximation algorithm for this problem is due to Charikar and Kar...
Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Ko...
GLOBECOM
2006
IEEE
16 years 25 days ago
Secure Aggregation in Large Scale Overlay Networks
Overlay networks have been very useful in solving large scale data dissemination problems. In this paper, we consider the case of data gathering which is the inverse of disseminat...
Waseem Ahmad, Ashfaq A. Khokhar
INFOCOM
2006
IEEE
16 years 24 days ago
Fault-Tolerant Wireless Access Network Design for Dual-Homed Users
— In this paper, we study the survivability problem in hierarchical wireless access networks with dual-homed end users, who are connected to two base stations (BSs), a primary BS...
Xiaodong Huang, Jianping Wang, Vinod Vokkarane, Ja...
SIROCCO
2004
15 years 8 months ago
Path Layout on Tree Networks: Bounds in Different Label Switching Models
Path Layout is a fundamental graph problem in label switching protocols. This problem is raised in various protocols such as the traditional ATM protocol and MPLS which is a new l...
Anat Bremler-Barr, Leah Epstein
JPDC
2006
187views more  JPDC 2006»
15 years 6 months ago
Maximum lifetime data sensing and extraction in energy constrained networked sensor systems
We focus on data gathering problems in energy constrained networked sensor systems. The system operates in rounds where a subset of the sensors generate a certain number of data p...
Bo Hong, Viktor K. Prasanna