Distributed asynchronous algorithms in the Internet - new routing and traffic control methods

The paper presents several new algorithms concerning the third (network) and the fourth (transport) layer of ISO/OSI network model. For the third layer two classes of the shortest paths algorithms – label correcting and auction algorithms – are proposed. For the fourth layer an application of price decomposition to network optimization and Internet congestion control is suggested. Keywords— computer networks, optimization, shortest path, traffic control, decomposition, distributed computations, asynchronous algorithms.

[1]  Frank Kelly,et al.  Charging and rate control for elastic traffic , 1997, Eur. Trans. Telecommun..

[2]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[3]  Andrzej Karbowski.  Correction to Low and Lapsley's article "Optimization Flow Control, I: Basic Algorithm and Convergence" , 2002, ArXiv.

[4]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[5]  Dimitri P. Bertsekas,et al.  An Auction Algorithm for Shortest Paths , 1991, SIAM J. Optim..

[6]  Douglas Comer,et al.  Internetworking with TCP/IP , 1988 .

[7]  Cheng Jin,et al.  FAST TCP: Motivation, Architecture, Algorithms, Performance , 2006, IEEE/ACM Transactions on Networking.

[8]  Steven H. Low,et al.  Convergence of Asynchronous Optimization Flow Control , 1999, Broadband Communications.

[9]  Dimitri P. Bertsekas,et al.  A simple and fast label correcting algorithm for shortest paths , 1993, Networks.

[10]  D. Bertsekas,et al.  Parallel asynchronous label-correcting methods for shortest paths , 1996 .

[11]  Steven H. Low,et al.  Optimization Flow Control, II: Implementation , 2000 .

[12]  Steven H. Low,et al.  A duality model of TCP and queue management algorithms , 2003, TNET.

[13]  Fernando Paganini,et al.  Internet congestion control , 2002 .

[14]  Dimitri P. Bertsekas,et al.  Parallel Shortest Path Auction Algorithms , 1994, Parallel Comput..

[15]  Steven H. Low,et al.  Optimization flow control with on-line measurement or multiple paths , 1999 .

[16]  R. Musmanno,et al.  Parallel Asynchronous Algorithms for the K Shortest Paths Problem , 2000 .

[17]  Catherine Rosenberg,et al.  A game theoretic framework for bandwidth allocation and pricing in broadband networks , 2000, TNET.

[18]  Steven H. Low,et al.  Optimization flow control—I: basic algorithm and convergence , 1999, TNET.

[19]  V. Jacobson,et al.  Congestion avoidance and control , 1988, CCRV.

[20]  Cheng Jin,et al.  FAST TCP: Motivation, Architecture, Algorithms, and Performance , 2004, INFOCOM.