Sciweavers

211 search results - page 42 / 43
» Routing and Capacity Optimization for IP Networks
Sort
View
TCAD
2008
128views more  TCAD 2008»
13 years 6 months ago
Obstacle-Avoiding Rectilinear Steiner Tree Construction Based on Spanning Graphs
Given a set of pins and a set of obstacles on a plane, an obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) connects these pins, possibly through some additional points (...
Chung-Wei Lin, Szu-Yu Chen, Chi-Feng Li, Yao-Wen C...
CONEXT
2010
ACM
13 years 4 months ago
LEGUP: using heterogeneity to reduce the cost of data center network upgrades
Fundamental limitations of traditional data center network architectures have led to the development of architectures that provide enormous bisection bandwidth for up to hundreds ...
Andrew R. Curtis, S. Keshav, Alejandro Lópe...
SPAA
2005
ACM
13 years 11 months ago
Admission control to minimize rejections and online set cover with repetitions
We study the admission control problem in general networks. Communication requests arrive over time, and the online algorithm accepts or rejects each request while maintaining the...
Noga Alon, Yossi Azar, Shai Gutner
ATMOS
2008
103views Optimization» more  ATMOS 2008»
13 years 7 months ago
IP-based Techniques for Delay Management with Priority Decisions
Delay management is an important issue in the daily operations of any railway company. The task is to update the planned timetable to a disposition timetable in such a way that the...
Michael Schachtebeck, Anita Schöbel
CISS
2008
IEEE
14 years 21 days ago
Peer-to-Peer utility maximization
—In this paper, we study the problem of utility maximization in Peer-to-Peer (P2P) systems, in which aggregate utilities are maximized by running distributed algorithms on P2P no...
Minghua Chen, Sudipta Sengupta, Miroslav Ponec, Ph...