Decentralized traffic control in data networks-a methodological overview

Author

Karbowski, A.

Author_Institution

Res. & Acad. Comput. Network, NASK, Warsaw, Poland

fYear

2002

fDate

25-25 Sept. 2002

Firstpage

222

Lastpage

227

Abstract

The paper reviews current algorithms for distributed, asynchronous control of data networks. Different problem formulations are considered: from the simplest shortest-path approach, without quality of service (QoS) constraints, via total flow cost minimization for given traffic quality equations, until dynamic flow control with influencing users´ transmission rates through internal prices. These different formulations are presented in a unified way and compared from the possible application areas point of view.

Keywords

Internet; directed graphs; distributed algorithms; minimisation; quality of service; telecommunication network routing; telecommunication traffic; Internet; decentralized traffic control; directed graph; distributed asynchronous data network control; dynamic flow control; network optimization; prices; quality of service; shortest-path approach; total flow cost minimization; traffic quality equations; transmission rates; Communication system traffic control; Computer networks; Cost function; Distributed control; Equations; IP networks; Intelligent networks; Quality of service; Routing; Traffic control;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel Computing in Electrical Engineering, 2002. PARELEC '02. Proceedings. International Conference on

Conference_Location

Warsaw, Poland

Print_ISBN

0-7695-1730-7

Type

conf

DOI

10.1109/PCEE.2002.1115247

Filename

1115247