Sciweavers

995 search results - page 78 / 199
» Minimizing Congestion in General Networks
Sort
View
SPAA
2004
ACM
14 years 1 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
MOBIDE
2005
ACM
14 years 1 months ago
Video-streaming for fast moving users in 3G mobile networks
The emergence of third-generation (3G) mobile networks offers new opportunities for the effective delivery of data with rich content including multimedia messaging and video-strea...
Anna Kyriakidou, Nikos Karelos, Alex Delis
ICMCS
2005
IEEE
110views Multimedia» more  ICMCS 2005»
14 years 1 months ago
Estimating Packet Arrival Times in Bursty Video Applications
In retransmission-based error-control methods, the most fundamental yet the paramount problem is to determine how long the sender (or the receiver) should wait before deciding tha...
Ali C. Begen, Yucel Altunbasak
INFOCOM
2003
IEEE
14 years 1 months ago
Can Shortest-path Routing and TCP Maximize Utility
TCP-AQM protocols can be interpreted as distributed primal-dual algorithms over the Internet to maximize aggregate utility over source rates. In this paper we study whether TCP–...
Jiantao Wang, Lun Li, Steven H. Low, John Doyle
SIGCOMM
2010
ACM
13 years 8 months ago
R3: resilient routing reconfiguration
Network resiliency is crucial to IP network operations. Existing techniques to recover from one or a series of failures do not offer performance predictability and may cause serio...
Ye Wang, Hao Wang, Ajay Mahimkar, Richard Alimi, Y...