Network capacity optimization for latency-sensitive traffic in multiservice IP networks
In this paper, we address the problem of capacity assignment for latency-sensitive traffic in multi-service IP networks. The capacity assignment (CA) problem is formulated as an optimization problem with nonlinear constraints, where the total link capacity shares allocated to the given service are m...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| مؤلفون آخرون: | , |
| التنسيق: | conferenceObject |
| منشور في: |
2005
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | http://hdl.handle.net/10725/8173 http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php https://itc-conference.org/_Resources/Persistent/f224e4ccf717f33a4fd26ad590d52b011854da54/sharafeddine05.pdf |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| الملخص: | In this paper, we address the problem of capacity assignment for latency-sensitive traffic in multi-service IP networks. The capacity assignment (CA) problem is formulated as an optimization problem with nonlinear constraints, where the total link capacity shares allocated to the given service are minimized subject to performance constraints in terms of endto-end delay requirements. We introduce a new extension to traditional CA problems by setting a statistical bound on the maximum end-to-end delay experienced by all packets associated with the given latency-sensitive service. For a sample IP network scenario with VoIP traffic, we show that only 3% of additional capacity as compared to the classical approach is required to keep the probability of exceeding the maximum end-to-end delay threshold below 0.1% |
|---|