The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

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

På svenska

Author

Summary, in English

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.

Publishing year

2005

Language

English

Pages

939-948

Publication/Series

Performance Challenges for Efficient Next Generation Networks, Vols 6A-6C

Volume

6A-6C

Document type

Conference paper

Publisher

Beijing University of Posts and Telecommunications

Topic

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

Conference name

19th International Teletraffic Congress (ITC 19)

Conference date

2005-08-29 - 2005-09-02

Conference place

Beijing, China

Status

Published