Sciweavers

58 search results - page 4 / 12
» Two Tree-Based Algorithms for Network Spare Capacity Design
Sort
View
FOCS
2002
IEEE
14 years 13 days ago
A Constant-Factor Approximation Algorithm for the Multicommodity
We present the first constant-factor approximation algorithm for network design with multiple commodities and economies of scale. We consider the rent-or-buy problem, a type of m...
Amit Kumar, Anupam Gupta, Tim Roughgarden
FIRBPERF
2005
IEEE
259views Algorithms» more  FIRBPERF 2005»
14 years 1 months ago
Performance Issues in Video Streaming Environments
The main motivation for applying capacity planning techniques to the design of Internet-based video services is that very often these systems incur significant delays that decrea...
Giuliano Casale, Paolo Cremonesi, Giuseppe Serazzi...
CN
2004
150views more  CN 2004»
13 years 7 months ago
Optimizing interconnection policies
There are two basic types of interconnection agreements between providers in the Internet: peering and transit. A decision every Internet network service provider (INSP) has to ma...
Oliver Heckmann, Jens Schmitt, Ralf Steinmetz
INFOCOM
2007
IEEE
14 years 1 months ago
Two-Tier Load Balancing in OSPF Wireless Back-Hauls
Abstract— High-speed wireless communication technology (e.g. WiMAX) makes it feasible and cost-effective to build wireless back-hauls for Internet access. Compared to wired count...
Xiaowen Zhang, Hao Zhu
ANOR
2006
133views more  ANOR 2006»
13 years 7 months ago
An integrated model for logistics network design
In this paper we introduce a new formulation of the logistics network design problem encountered in deterministic, single-country, single-period contexts. Our formulation is flexi...
Jean-François Cordeau, Federico Pasin, Mari...