Capacity assignment in multiservice packet networks with soft maximum waiting time guarantees
We address the problem of capacity assignment in packet networks with soft maximum waiting time guarantees. We present a multi-level framework for designing and analyzing capacity assignment methods in multiservice networks. Moreover, we propose a novel capacity assignment method that provides a tra...
Saved in:
| Main Author: | |
|---|---|
| Format: | article |
| Published: |
2011
|
| Online Access: | http://hdl.handle.net/10725/3240 http://dx.doi.org/10.1016/j.jnca.2010.09.004 http://www.sciencedirect.com/science/article/pii/S1084804510001669 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1864513460244578304 |
|---|---|
| author | Sharafeddine, Sanaa |
| author_facet | Sharafeddine, Sanaa |
| author_role | author |
| dc.creator.none.fl_str_mv | Sharafeddine, Sanaa |
| dc.date.none.fl_str_mv | 2011 2016-03-02T13:36:06Z 2016-03-02T13:36:06Z 2016-03-02 |
| dc.identifier.none.fl_str_mv | 1084-8045 http://hdl.handle.net/10725/3240 http://dx.doi.org/10.1016/j.jnca.2010.09.004 Sharafeddine, S. (2011). Capacity assignment in multiservice packet networks with soft maximum waiting time guarantees. Journal of Network and Computer Applications, 34(1), 62-72. http://www.sciencedirect.com/science/article/pii/S1084804510001669 |
| dc.language.none.fl_str_mv | en |
| dc.relation.none.fl_str_mv | Journal of Network and Computer Applications |
| dc.rights.*.fl_str_mv | info:eu-repo/semantics/openAccess |
| dc.title.none.fl_str_mv | Capacity assignment in multiservice packet networks with soft maximum waiting time guarantees |
| dc.type.none.fl_str_mv | Article info:eu-repo/semantics/publishedVersion info:eu-repo/semantics/article |
| description | We address the problem of capacity assignment in packet networks with soft maximum waiting time guarantees. We present a multi-level framework for designing and analyzing capacity assignment methods in multiservice networks. Moreover, we propose a novel capacity assignment method that provides a tradeoff between capacity requirements and quality for the voice traffic class. The proposed method aims at providing slightly softened quality guarantees with some controlled tolerance to service degradation in order to notably reduce the amount of required capacity. In order to demonstrate the key characteristics of the proposed method, derivations, analysis, and results are presented over multiple levels of detail starting at the buffer level and extending to the node level, the path level, and finally the network level. At the path and network levels, the problem of capacity assignment with soft maximum waiting time guarantees is formulated as an optimization problem in order to obtain minimized values of the link capacities. Numerical calculation results are presented based on example scenarios at the different levels in order to demonstrate the effectiveness of the proposed method compared to other approaches. Moreover, Monte Carlo simulation results are presented whenever necessary in order to validate assumptions and further support observations. |
| eu_rights_str_mv | openAccess |
| format | article |
| id | LAURepo_f5e8f215d101eabdb2dfe147102edd42 |
| identifier_str_mv | 1084-8045 Sharafeddine, S. (2011). Capacity assignment in multiservice packet networks with soft maximum waiting time guarantees. Journal of Network and Computer Applications, 34(1), 62-72. |
| language_invalid_str_mv | en |
| network_acronym_str | LAURepo |
| network_name_str | Lebanese American University repository |
| oai_identifier_str | oai:laur.lau.edu.lb:10725/3240 |
| publishDate | 2011 |
| repository.mail.fl_str_mv | |
| repository.name.fl_str_mv | |
| repository_id_str | |
| spelling | Capacity assignment in multiservice packet networks with soft maximum waiting time guaranteesSharafeddine, SanaaWe address the problem of capacity assignment in packet networks with soft maximum waiting time guarantees. We present a multi-level framework for designing and analyzing capacity assignment methods in multiservice networks. Moreover, we propose a novel capacity assignment method that provides a tradeoff between capacity requirements and quality for the voice traffic class. The proposed method aims at providing slightly softened quality guarantees with some controlled tolerance to service degradation in order to notably reduce the amount of required capacity. In order to demonstrate the key characteristics of the proposed method, derivations, analysis, and results are presented over multiple levels of detail starting at the buffer level and extending to the node level, the path level, and finally the network level. At the path and network levels, the problem of capacity assignment with soft maximum waiting time guarantees is formulated as an optimization problem in order to obtain minimized values of the link capacities. Numerical calculation results are presented based on example scenarios at the different levels in order to demonstrate the effectiveness of the proposed method compared to other approaches. Moreover, Monte Carlo simulation results are presented whenever necessary in order to validate assumptions and further support observations.PublishedN/A2016-03-02T13:36:06Z2016-03-02T13:36:06Z20112016-03-02Articleinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/article1084-8045http://hdl.handle.net/10725/3240http://dx.doi.org/10.1016/j.jnca.2010.09.004Sharafeddine, S. (2011). Capacity assignment in multiservice packet networks with soft maximum waiting time guarantees. Journal of Network and Computer Applications, 34(1), 62-72.http://www.sciencedirect.com/science/article/pii/S1084804510001669enJournal of Network and Computer Applicationsinfo:eu-repo/semantics/openAccessoai:laur.lau.edu.lb:10725/32402019-05-06T10:19:35Z |
| spellingShingle | Capacity assignment in multiservice packet networks with soft maximum waiting time guarantees Sharafeddine, Sanaa |
| status_str | publishedVersion |
| title | Capacity assignment in multiservice packet networks with soft maximum waiting time guarantees |
| title_full | Capacity assignment in multiservice packet networks with soft maximum waiting time guarantees |
| title_fullStr | Capacity assignment in multiservice packet networks with soft maximum waiting time guarantees |
| title_full_unstemmed | Capacity assignment in multiservice packet networks with soft maximum waiting time guarantees |
| title_short | Capacity assignment in multiservice packet networks with soft maximum waiting time guarantees |
| title_sort | Capacity assignment in multiservice packet networks with soft maximum waiting time guarantees |
| url | http://hdl.handle.net/10725/3240 http://dx.doi.org/10.1016/j.jnca.2010.09.004 http://www.sciencedirect.com/science/article/pii/S1084804510001669 |