We study how protocol design for various functionalities within a communication network architecture can be viewed as a distributed resource allocation problem. This involves …
DS Lun, N Ratnakar, M Médard… - … on information theory, 2006 - ieeexplore.ieee.org
We consider the problem of establishing minimum-cost multicast connections over coded packet networks, ie, packet networks where the contents of outgoing packets are arbitrary …
J Wang, L Li, SH Low, JC Doyle - IEEE/ACM Transactions on …, 2005 - ieeexplore.ieee.org
TCP-AQM can be interpreted as distributed primal-dual algorithms to maximize aggregate utility over source rates. We show that an equilibrium of TCP/IP, if exists, maximizes …
In this paper, we study the problem of utility maximization in P2P systems, in which aggregate application-specific utilities are maximized by running distributed algorithms on …
E Van Zijst - US Patent 7,733,868, 2010 - Google Patents
(73) Assignee: Internet Broadcasting Corp., Oost 6,577,609 B2 6, 2003 SE, al (NL) 6,691,192 B2 2/2004 Ajanovic et al.(*) Notice: Subject to any disclaimer, the term of …
Recent advances in network coding have shown great potential for efficient information multicasting in communication networks, in terms of both network throughput and network …
This paper proposes a novel and efficient distributed flow control scheme for multirate multicast (MR-M), based on the well-known Proportional Integral and Derivative (PID) …
SH Low, R Srikant - Networks and Spatial Economics, 2004 - Springer
We survey some recent results on modeling, analysis and design of congestion control schemes for the Internet. Using tools from convex optimization and control theory, we show …
Y Xi, EM Yeh - IEEE/ACM Transactions on Networking, 2009 - ieeexplore.ieee.org
Network coding techniques are used to find the minimum-cost transmission scheme for multicast sessions with or without elastic rate demand. It is shown that in wireline networks …