Bandwidth sharing scheme in DiffServ-aware MPLS networks
This paper proposes a bandwidth sharing scheme for DiffServ-aware MPLS networks based on the Russian Dolls bandwidth allocation model. Three DiffServ traffic class types were used in the DiffServ-aware MPLS network under study, i.e. real time constant bit rate premium, real time variable bit rate as...
Saved in:
Main Authors: | , , |
---|---|
Other Authors: | |
Format: | Conference Paper |
Published: |
2023
|
Subjects: | |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Universiti Tenaga Nasional |
id |
my.uniten.dspace-29836 |
---|---|
record_format |
dspace |
spelling |
my.uniten.dspace-298362024-04-18T09:28:30Z Bandwidth sharing scheme in DiffServ-aware MPLS networks Din N.Md. Hakimie H. Fisal N. 9335429400 16021651800 16021700100 Bandwidth sharing preemption DiffServ Russian doll Triple play Bandwidth Bits Blocking probability Risk assessment Telecommunication networks Video signal processing Band-width allocation Bandwidth sharing Bandwidth sharing preemption Best-Effort traffic DiffServ Diffserv-aware MPLS networks International conferences Malaysia MPLS networks Non-real time Real time Real-time variables Russian doll Simulation studies Triple play Telecommunication systems This paper proposes a bandwidth sharing scheme for DiffServ-aware MPLS networks based on the Russian Dolls bandwidth allocation model. Three DiffServ traffic class types were used in the DiffServ-aware MPLS network under study, i.e. real time constant bit rate premium, real time variable bit rate assured and non-real time best effort traffic. We propose a preemption scheme based on rerouting or resizing of the longest existing flow first. A simulation study using ns-2 was performed for the scheme. An analysis was made to show the significance of borrowing and preemption in the environment. The results show significant improvement in terms of blocking probability when both borrowing and preemption are used. �2007 IEEE. Final 2023-12-28T08:57:51Z 2023-12-28T08:57:51Z 2007 Conference Paper 10.1109/ICTMICC.2007.4448589 2-s2.0-48349121579 https://www.scopus.com/inward/record.uri?eid=2-s2.0-48349121579&doi=10.1109%2fICTMICC.2007.4448589&partnerID=40&md5=24bc968f9f22d19b6b6582282d3eb21e https://irepository.uniten.edu.my/handle/123456789/29836 4448589 782 787 Scopus |
institution |
Universiti Tenaga Nasional |
building |
UNITEN Library |
collection |
Institutional Repository |
continent |
Asia |
country |
Malaysia |
content_provider |
Universiti Tenaga Nasional |
content_source |
UNITEN Institutional Repository |
url_provider |
http://dspace.uniten.edu.my/ |
topic |
Bandwidth sharing preemption DiffServ Russian doll Triple play Bandwidth Bits Blocking probability Risk assessment Telecommunication networks Video signal processing Band-width allocation Bandwidth sharing Bandwidth sharing preemption Best-Effort traffic DiffServ Diffserv-aware MPLS networks International conferences Malaysia MPLS networks Non-real time Real time Real-time variables Russian doll Simulation studies Triple play Telecommunication systems |
spellingShingle |
Bandwidth sharing preemption DiffServ Russian doll Triple play Bandwidth Bits Blocking probability Risk assessment Telecommunication networks Video signal processing Band-width allocation Bandwidth sharing Bandwidth sharing preemption Best-Effort traffic DiffServ Diffserv-aware MPLS networks International conferences Malaysia MPLS networks Non-real time Real time Real-time variables Russian doll Simulation studies Triple play Telecommunication systems Din N.Md. Hakimie H. Fisal N. Bandwidth sharing scheme in DiffServ-aware MPLS networks |
description |
This paper proposes a bandwidth sharing scheme for DiffServ-aware MPLS networks based on the Russian Dolls bandwidth allocation model. Three DiffServ traffic class types were used in the DiffServ-aware MPLS network under study, i.e. real time constant bit rate premium, real time variable bit rate assured and non-real time best effort traffic. We propose a preemption scheme based on rerouting or resizing of the longest existing flow first. A simulation study using ns-2 was performed for the scheme. An analysis was made to show the significance of borrowing and preemption in the environment. The results show significant improvement in terms of blocking probability when both borrowing and preemption are used. �2007 IEEE. |
author2 |
9335429400 |
author_facet |
9335429400 Din N.Md. Hakimie H. Fisal N. |
format |
Conference Paper |
author |
Din N.Md. Hakimie H. Fisal N. |
author_sort |
Din N.Md. |
title |
Bandwidth sharing scheme in DiffServ-aware MPLS networks |
title_short |
Bandwidth sharing scheme in DiffServ-aware MPLS networks |
title_full |
Bandwidth sharing scheme in DiffServ-aware MPLS networks |
title_fullStr |
Bandwidth sharing scheme in DiffServ-aware MPLS networks |
title_full_unstemmed |
Bandwidth sharing scheme in DiffServ-aware MPLS networks |
title_sort |
bandwidth sharing scheme in diffserv-aware mpls networks |
publishDate |
2023 |
_version_ |
1806425733119082496 |