Skip to Main content Skip to Navigation
Reports

A bundle-type algorithm for routing in telecommunication data networks

Abstract : To optimize the quality of service through a telecommunication network, we propose an algorithm based on Lagrangian relaxation. The bundle-type dual algorithm is adapted to the present situation, where the dual function is the sum of a polyhedral function (coming from shortest paths problems) and of a smooth function (coming from the congestion).
Document type :
Reports
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download

https://hal.inria.fr/inria-00110559
Contributor : Rapport de Recherche Inria <>
Submitted on : Thursday, November 9, 2006 - 10:12:04 AM
Last modification on : Friday, June 26, 2020 - 4:56:01 PM
Long-term archiving on: : Thursday, September 23, 2010 - 4:29:26 PM

Identifiers

  • HAL Id : inria-00110559, version 3

Collections

Citation

Claude Lemarechal, Adam Ouorou, Giorgios Petrou. A bundle-type algorithm for routing in telecommunication data networks. [Research Report] RR-6010, INRIA. 2006. ⟨inria-00110559v3⟩

Share

Metrics

Record views

271

Files downloads

607