Javascript verkar inte påslaget? - Vissa delar av Lunds universitets webbplats fungerar inte optimalt utan javascript, kontrollera din webbläsares inställningar.
Du är här

Linear programming relaxations and a heuristic for the buffer sharing model - Discounted case

Publiceringsår: 2005
Språk: Engelska
Sidor: 939-948
Publikation/Tidskrift/Serie: Performance Challenges for Efficient Next Generation Networks, Vols 6A-6C
Volym: 6A-6C
Dokumenttyp: Konferensbidrag
Förlag: Beijing University of Posts and Telecommunications


We investigate a model for buffer management of multi-class traffic into a finite shared buffer. A hierarchy of increasingly stronger linear programming relaxations for this model is proposed. The number of hierarchies equals the number of job classes. Each relaxation in the hierarchy is constructed by projecting the original achievable performance region into a polytope with fewer variables and fewer constraints. Based on the first order LP relaxation, we propose a heuristic buffer management policy which can be obtained efficiently and is applicable to a wide range of reward functions including weighted sum of throughputs and weighted sum of buffer utilization. According to our simulations, the proposed heuristic performs close to optimum in all traffic conditions when the objective is to maximize the weighted sum of throughputs.


  • Communication Systems
  • Electrical Engineering, Electronic Engineering, Information Engineering


19th International Teletraffic Congress (ITC 19)

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