Meny

Javascript is not activated in your browser. This website needs javascript activated to work properly.
Du är här

Fair routing and related optimization problems - invited talk

Fair routing and related optimization problems
Publiceringsår: 2007
Språk: Engelska
Sidor: Xxxi-xxxii
Dokumenttyp: Konferensbidrag
Förlag: IEEE Computer Society

Sammanfattning

Routing of elastic traffic in the Internet should be fair in terms of bandwidth allocated to individual traffic demands. One fairness principle that can be applied is called max-min fairness (MMF) and requires that the worst bandwidth allocation is maximized and the solution is then extended with maximization of the second worst allocation, the third one, and so on. In this paper we discuss solution algorithms for basic MMF optimization problems related to fair routing in communications networks. Due to lexicographic maximization of ordered quantities, the MMF solution concept cannot be tackled by the standard optimization model, i.e., a mathematical programme. However, one can formulate a sequential lexicographic optimization procedure. The basic procedure is applicable only for convex models, thus it allows to deal with relatively simple routing problems but fails if practical discrete restrictions commonly arising in the communications network context are to be taken into account. Then, however, alternative sequential approaches allowing to solve non-convex MMF problems can be used.

Disputation

Nyckelord

  • Technology and Engineering
  • to be added

Övriga

15th International Conference on Advanced Computing and Communications ADCOM 2007
2007-12-18/2007-12-21
Guwahati, India
Published
Yes
  • ISBN: 0-7695-3059-1

Box 117, 221 00 LUND
Telefon 046-222 00 00 (växel)
Telefax 046-222 47 20
lu [at] lu [dot] se

Fakturaadress: Box 188, 221 00 LUND
Organisationsnummer: 202100-3211
Om webbplatsen