Optimal decentralized algorithms for traffic engineering in the Internet

Bernardo Movsichoff, Constantino Lagoa

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper, we develop algorithms for decentralized traffic engineering when several classes of services are to be provided. More precisely, given an utility function of a very general form, we provide a large class of distributed control laws which converge to the maximum of the utility function subject to the network constraints and service requirements. Each ingress node adapts its sending rates and distributes the traffic among the multiple available paths independently and with minimum feedback from the network. These laws allow not only for best effort traffic (only type of traffic in today's Internet) but also assured service traffic where a given target rate has to be achieved in average.

Original languageEnglish (US)
Title of host publicationIFAC Proceedings Volumes (IFAC-PapersOnline)
EditorsGabriel Ferrate, Eduardo F. Camacho, Luis Basanez, Juan. A. de la Puente
PublisherIFAC Secretariat
Pages389-394
Number of pages6
Edition1
ISBN (Print)9783902661746
DOIs
StatePublished - 2002
Event15th World Congress of the International Federation of Automatic Control, 2002 - Barcelona, Spain
Duration: Jul 21 2002Jul 26 2002

Publication series

NameIFAC Proceedings Volumes (IFAC-PapersOnline)
Number1
Volume15
ISSN (Print)1474-6670

Other

Other15th World Congress of the International Federation of Automatic Control, 2002
Country/TerritorySpain
CityBarcelona
Period7/21/027/26/02

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering

Fingerprint

Dive into the research topics of 'Optimal decentralized algorithms for traffic engineering in the Internet'. Together they form a unique fingerprint.

Cite this