Pub Date : 2008-04-11DOI: 10.1109/ITNEWS.2008.4488130
F. Cacace, G. Iannello, M. Vellucci, L. Vollero
The enhanced distributed channel access (EDCA) is a component of the new IEEE 802.11e standard [2], which introduces Quality of Service (QoS) support in Wireless LANs (WLANs). This paper proposes a model for the VoIP capacity of an EDCA WLAN. The proposed solution decouples the problem of estimating stations performance and that of evaluating channel congestion. Moreover, it models the dynamics of the sending queues. This translates in a model working under generic load conditions (i.e. VoIP traffic at different bit rates) that captures the impact of all the parameters introduced by EDCA. To validate the model, we derived a simple Admission Control algorithm for VoIP and generic real-time symmetric applications. Experimental analysis and simulations have been used to validate the model and to establish its limitations.
{"title":"Admission control of VoIP calls in EDCA WLANs: Analysis and experimentation","authors":"F. Cacace, G. Iannello, M. Vellucci, L. Vollero","doi":"10.1109/ITNEWS.2008.4488130","DOIUrl":"https://doi.org/10.1109/ITNEWS.2008.4488130","url":null,"abstract":"The enhanced distributed channel access (EDCA) is a component of the new IEEE 802.11e standard [2], which introduces Quality of Service (QoS) support in Wireless LANs (WLANs). This paper proposes a model for the VoIP capacity of an EDCA WLAN. The proposed solution decouples the problem of estimating stations performance and that of evaluating channel congestion. Moreover, it models the dynamics of the sending queues. This translates in a model working under generic load conditions (i.e. VoIP traffic at different bit rates) that captures the impact of all the parameters introduced by EDCA. To validate the model, we derived a simple Admission Control algorithm for VoIP and generic real-time symmetric applications. Experimental analysis and simulations have been used to validate the model and to establish its limitations.","PeriodicalId":255580,"journal":{"name":"2008 4th International Telecommunication Networking Workshop on QoS in Multiservice IP Networks","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121108535","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-04-11DOI: 10.1109/ITNEWS.2008.4488127
S. Urushidani, Yusheng Ji, J. Matsukata, K. Fukuda, S. Abe, M. Koibuchi, M. Nakamura, S. Yamada, K. Shimizu, I. Inoue, T. Mori, A. Osada
This paper describes the QoS control capabilities in the new Japanese academic network, SINET3. SINET3 is a nationwide QoS-aware multi-layer network for more than 700 universities and research institutions and provides a variety of high-quality network services including packet-based QoS services and circuit-based bandwidth-on-demand services. These diversified network services are provided by effectively combining layer-1 switches with layer-2 multiplexing and IP/MPLS routers. This paper first explains how the network accommodates a wide variety of network services such as multilayer and VPN services. It next defines the QoS classes, clarifies QoS control capabilities for packet and circuit-based services, and shows evaluation results for an experimental environment reflecting actual network conditions. The paper focuses on actual implementations over the nationwide network composed of 75 layer-1 switches and 12 IP/MPLS routers.
{"title":"Implementation of QoS control capabilities in SINET3","authors":"S. Urushidani, Yusheng Ji, J. Matsukata, K. Fukuda, S. Abe, M. Koibuchi, M. Nakamura, S. Yamada, K. Shimizu, I. Inoue, T. Mori, A. Osada","doi":"10.1109/ITNEWS.2008.4488127","DOIUrl":"https://doi.org/10.1109/ITNEWS.2008.4488127","url":null,"abstract":"This paper describes the QoS control capabilities in the new Japanese academic network, SINET3. SINET3 is a nationwide QoS-aware multi-layer network for more than 700 universities and research institutions and provides a variety of high-quality network services including packet-based QoS services and circuit-based bandwidth-on-demand services. These diversified network services are provided by effectively combining layer-1 switches with layer-2 multiplexing and IP/MPLS routers. This paper first explains how the network accommodates a wide variety of network services such as multilayer and VPN services. It next defines the QoS classes, clarifies QoS control capabilities for packet and circuit-based services, and shows evaluation results for an experimental environment reflecting actual network conditions. The paper focuses on actual implementations over the nationwide network composed of 75 layer-1 switches and 12 IP/MPLS routers.","PeriodicalId":255580,"journal":{"name":"2008 4th International Telecommunication Networking Workshop on QoS in Multiservice IP Networks","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126803028","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-04-11DOI: 10.1109/ITNEWS.2008.4488121
L. Bracciale, F. Lo Piccolo, D. Luzzi, S. Salsano, G. Bianchi, N. Blefari-Melazzi
this paper, we present a chunk scheduling algorithm for a mesh-based peer-to-peer live streaming system and we evaluate it by simulations over large-scale networks. Literature papers typically design chunk scheduling algorithms by considering the chunk delivery ratio as performance metric. We propose a push-based algorithm, which not only tries to maximize the chunk delivery ratio but it also takes into account and tries to minimize the delivery delay of chunks at the peer nodes. This is an important requirement, when dealing with realtime multimedia flows. Another important contribution of this paper is the design and implementation of a simulator able to evaluate the performance of large scale P2P networks (tens of thousands peers). The importance of this contribution lies in the fact that existing simulators and performance studies handle at most hundreds or few thousands of peers, while real-life P2P streaming systems aim at distributing contents to several hundreds of thousands, if not millions, of users. The performance evaluation study aims at providing a comprehensive view of what performance can be expected for mesh-based peer-to-peer streaming systems, both in terms of chunk delivery ratio and delay, for a large range of the number of users. The individual effect of a variety of system parameters, and especially number of partner nodes in the mesh, constrained link bandwidth, node heterogeneity, and network size, has been analyzed. Our results show that performances of the proposed push-based solution are already quite effective even with severely bandwidth constrained large scale networks.
{"title":"A push-based scheduling algorithm for large scale P2P live streaming","authors":"L. Bracciale, F. Lo Piccolo, D. Luzzi, S. Salsano, G. Bianchi, N. Blefari-Melazzi","doi":"10.1109/ITNEWS.2008.4488121","DOIUrl":"https://doi.org/10.1109/ITNEWS.2008.4488121","url":null,"abstract":"this paper, we present a chunk scheduling algorithm for a mesh-based peer-to-peer live streaming system and we evaluate it by simulations over large-scale networks. Literature papers typically design chunk scheduling algorithms by considering the chunk delivery ratio as performance metric. We propose a push-based algorithm, which not only tries to maximize the chunk delivery ratio but it also takes into account and tries to minimize the delivery delay of chunks at the peer nodes. This is an important requirement, when dealing with realtime multimedia flows. Another important contribution of this paper is the design and implementation of a simulator able to evaluate the performance of large scale P2P networks (tens of thousands peers). The importance of this contribution lies in the fact that existing simulators and performance studies handle at most hundreds or few thousands of peers, while real-life P2P streaming systems aim at distributing contents to several hundreds of thousands, if not millions, of users. The performance evaluation study aims at providing a comprehensive view of what performance can be expected for mesh-based peer-to-peer streaming systems, both in terms of chunk delivery ratio and delay, for a large range of the number of users. The individual effect of a variety of system parameters, and especially number of partner nodes in the mesh, constrained link bandwidth, node heterogeneity, and network size, has been analyzed. Our results show that performances of the proposed push-based solution are already quite effective even with severely bandwidth constrained large scale networks.","PeriodicalId":255580,"journal":{"name":"2008 4th International Telecommunication Networking Workshop on QoS in Multiservice IP Networks","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114259152","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-04-11DOI: 10.1109/ITNEWS.2008.4488151
D. Pezaros, L. Mathy
The emergence of overlay network applications that rely on application-level decisions for many aspects of their operations (e.g. routing, content replication, etc) creates cross- layer interaction issues with ISP network operations. Indeed, the independent optimisation of a diverse set of objectives using layer-local information can lead to operational instability and sub-optimal resource usage. We argue that an explicit interaction between the application and network layers can provide benefits for each layer. We postulate that such cross-layer interaction must however fulfil two conditions to be pragmatic and acceptable: 1) no explicit information about the structure and operations of each layer must be ex-changed; 2) each layer must be able to independently set its own policies and objectives. Because we limit this interaction to application hosts and their access ISP, the proposed method is also incrementally deployable. We show, through evaluation of simple examples, that explicit cross-layer interaction does indeed bring performance benefits to all parties, for applications ranging from simple client-server to more complex overlay network scenarios.
{"title":"Explicit application-network cross-layer optimisation","authors":"D. Pezaros, L. Mathy","doi":"10.1109/ITNEWS.2008.4488151","DOIUrl":"https://doi.org/10.1109/ITNEWS.2008.4488151","url":null,"abstract":"The emergence of overlay network applications that rely on application-level decisions for many aspects of their operations (e.g. routing, content replication, etc) creates cross- layer interaction issues with ISP network operations. Indeed, the independent optimisation of a diverse set of objectives using layer-local information can lead to operational instability and sub-optimal resource usage. We argue that an explicit interaction between the application and network layers can provide benefits for each layer. We postulate that such cross-layer interaction must however fulfil two conditions to be pragmatic and acceptable: 1) no explicit information about the structure and operations of each layer must be ex-changed; 2) each layer must be able to independently set its own policies and objectives. Because we limit this interaction to application hosts and their access ISP, the proposed method is also incrementally deployable. We show, through evaluation of simple examples, that explicit cross-layer interaction does indeed bring performance benefits to all parties, for applications ranging from simple client-server to more complex overlay network scenarios.","PeriodicalId":255580,"journal":{"name":"2008 4th International Telecommunication Networking Workshop on QoS in Multiservice IP Networks","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125633961","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-04-11DOI: 10.1109/ITNEWS.2008.4488132
Massimo Bernaschi, F. Cacace, G. Iannello, M. Vellucci, L. Vollero
The Control And Provisioning of Wireless Access Points (CAPWAP) protocol is under development within the IETF to enable an Access Controller (AC) to manage a collection of Wireless Termination Points (WTPs). CAPWAP aims at simplifying the deployment and control of large scale, possibly heterogeneous, wireless networks. We present the first open source implementation of the CAPWAP protocol along with early experimental results aiming at the assessment of its reliability and performances. The paper ends describing applications of the CAPWAP protocol to QoS scenarios and discussing benefits and technical issues.
{"title":"OpenCAPWAP: an open-source CAPWAP implementation for management and QoS support","authors":"Massimo Bernaschi, F. Cacace, G. Iannello, M. Vellucci, L. Vollero","doi":"10.1109/ITNEWS.2008.4488132","DOIUrl":"https://doi.org/10.1109/ITNEWS.2008.4488132","url":null,"abstract":"The Control And Provisioning of Wireless Access Points (CAPWAP) protocol is under development within the IETF to enable an Access Controller (AC) to manage a collection of Wireless Termination Points (WTPs). CAPWAP aims at simplifying the deployment and control of large scale, possibly heterogeneous, wireless networks. We present the first open source implementation of the CAPWAP protocol along with early experimental results aiming at the assessment of its reliability and performances. The paper ends describing applications of the CAPWAP protocol to QoS scenarios and discussing benefits and technical issues.","PeriodicalId":255580,"journal":{"name":"2008 4th International Telecommunication Networking Workshop on QoS in Multiservice IP Networks","volume":"43 11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126125406","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-04-11DOI: 10.1109/ITNEWS.2008.4488122
I. Chatzidrossos, V. Fodor
Peer-to-peer applications exploit the users willingness to contribute with their upload transmission capacity, achieving this way a scalable system where the available transmission capacity increases with the number of participating users. Since not all the users can offer upload capacity with high bitrate and reliability, it is of interest to see how these non-contributing users can be supported by a peer-to-peer application. In this paper we investigate how free-riders, that is, non-contributing users can be served in a peer-to-peer streaming system. We consider different policies of dealing with free-riders and discuss how performance parameters such as blocking and disconnection of free-riders are influenced by these policies, the overlay structure and system parameters as overlay size and source upload capacity. The results show that while the multiple-tree structure may affect the performance free-riders receive, the utilization of the transmission resources is still comparable to that of an optimized overlay.
{"title":"On the effect of free-riders in P2P streaming systems","authors":"I. Chatzidrossos, V. Fodor","doi":"10.1109/ITNEWS.2008.4488122","DOIUrl":"https://doi.org/10.1109/ITNEWS.2008.4488122","url":null,"abstract":"Peer-to-peer applications exploit the users willingness to contribute with their upload transmission capacity, achieving this way a scalable system where the available transmission capacity increases with the number of participating users. Since not all the users can offer upload capacity with high bitrate and reliability, it is of interest to see how these non-contributing users can be supported by a peer-to-peer application. In this paper we investigate how free-riders, that is, non-contributing users can be served in a peer-to-peer streaming system. We consider different policies of dealing with free-riders and discuss how performance parameters such as blocking and disconnection of free-riders are influenced by these policies, the overlay structure and system parameters as overlay size and source upload capacity. The results show that while the multiple-tree structure may affect the performance free-riders receive, the utilization of the transmission resources is still comparable to that of an optimized overlay.","PeriodicalId":255580,"journal":{"name":"2008 4th International Telecommunication Networking Workshop on QoS in Multiservice IP Networks","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124491135","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-04-11DOI: 10.1109/ITNEWS.2008.4488136
Andrea Bianco, J. Finochietto, C. Piglione
In this paper we study the problem of receiver allocation in WDM single-hop optical networks under dynamically changing traffic. Instead of focusing only on performance optimization, we wish to take into account both network performance and reconfiguration cost reduction. We first formalize the receiver allocation problem as a multi-criteria ILP. Then, we define Pareto-optimal solutions to solve the problem. The number and characteristics of Pareto-optimal solutions is studied to assess the problem significance. Finally, we propose different reconfiguration schemes that may guide the choice of network administrators among efficient solutions for the re-allocation problem.
{"title":"Cost and performance trade-offs in reconfiguration strategies for WDM networks","authors":"Andrea Bianco, J. Finochietto, C. Piglione","doi":"10.1109/ITNEWS.2008.4488136","DOIUrl":"https://doi.org/10.1109/ITNEWS.2008.4488136","url":null,"abstract":"In this paper we study the problem of receiver allocation in WDM single-hop optical networks under dynamically changing traffic. Instead of focusing only on performance optimization, we wish to take into account both network performance and reconfiguration cost reduction. We first formalize the receiver allocation problem as a multi-criteria ILP. Then, we define Pareto-optimal solutions to solve the problem. The number and characteristics of Pareto-optimal solutions is studied to assess the problem significance. Finally, we propose different reconfiguration schemes that may guide the choice of network administrators among efficient solutions for the re-allocation problem.","PeriodicalId":255580,"journal":{"name":"2008 4th International Telecommunication Networking Workshop on QoS in Multiservice IP Networks","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126470168","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-04-11DOI: 10.1109/ITNEWS.2008.4488155
R. Bolla, R. Bruschi
Recent technological advances provide an excellent opportunity to achieve truly effective results in the field of open Internet devices based on PC COTS Hardware, also known as Open Routers. In this environment, new interesting research topics, like parallel computing optimization, are related to the rapid migration of CPU architectures to the multi-core paradigm. Thus, with this idea, this contribution focuses on the packet forwarding performance in SMP Linux kernels, trying to identify and to characterize its architectural bottlenecks. Starting from this analysis, we propose an innovative architecture to optimize the forwarding performance when multi-processor or multi-core systems are used.
{"title":"An effective forwarding architecture for SMP Linux routers","authors":"R. Bolla, R. Bruschi","doi":"10.1109/ITNEWS.2008.4488155","DOIUrl":"https://doi.org/10.1109/ITNEWS.2008.4488155","url":null,"abstract":"Recent technological advances provide an excellent opportunity to achieve truly effective results in the field of open Internet devices based on PC COTS Hardware, also known as Open Routers. In this environment, new interesting research topics, like parallel computing optimization, are related to the rapid migration of CPU architectures to the multi-core paradigm. Thus, with this idea, this contribution focuses on the packet forwarding performance in SMP Linux kernels, trying to identify and to characterize its architectural bottlenecks. Starting from this analysis, we propose an innovative architecture to optimize the forwarding performance when multi-processor or multi-core systems are used.","PeriodicalId":255580,"journal":{"name":"2008 4th International Telecommunication Networking Workshop on QoS in Multiservice IP Networks","volume":"362 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133631125","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-04-11DOI: 10.1109/ITNEWS.2008.4488125
D. D. Sorte, M. Femminella, G. Reali, L. Rosati
In this work, carried out in the framework of the IST Project EDCINE, we deal with the network distribution of Digital Cinema contents, through a Content Delivery Network, towards theatres. One of the main criticalities of the system is the very large size of the contents to be transferred while respecting the maximum download time requirements. From the operator perspective, this criticality translates into the objective of optimizing the usage of network resources while complying with QoS constraints. The goal of this paper is first to present the network architecture and procedures relevant to the distribution service, and to specifically analyse the problem of service request routing (4-7 routing), whose objective is to select a set of servers to satisfy a content request efficiently. In particular, we focus on the definition of the mathematical model of the problem of minimising the network operational cost of the content distribution. Since some known professional, optimisation tools are not able to find the global optimum even in very simple configurations, we propose a heuristic approach based on the min-plus convolution. Preliminary numerical results show that such an algorithm outperforms the selected professional tools, while maintaining an affordable computation time.
{"title":"Definition and performance evaluation of a request routing algorithm to distribute digital cinema contents","authors":"D. D. Sorte, M. Femminella, G. Reali, L. Rosati","doi":"10.1109/ITNEWS.2008.4488125","DOIUrl":"https://doi.org/10.1109/ITNEWS.2008.4488125","url":null,"abstract":"In this work, carried out in the framework of the IST Project EDCINE, we deal with the network distribution of Digital Cinema contents, through a Content Delivery Network, towards theatres. One of the main criticalities of the system is the very large size of the contents to be transferred while respecting the maximum download time requirements. From the operator perspective, this criticality translates into the objective of optimizing the usage of network resources while complying with QoS constraints. The goal of this paper is first to present the network architecture and procedures relevant to the distribution service, and to specifically analyse the problem of service request routing (4-7 routing), whose objective is to select a set of servers to satisfy a content request efficiently. In particular, we focus on the definition of the mathematical model of the problem of minimising the network operational cost of the content distribution. Since some known professional, optimisation tools are not able to find the global optimum even in very simple configurations, we propose a heuristic approach based on the min-plus convolution. Preliminary numerical results show that such an algorithm outperforms the selected professional tools, while maintaining an affordable computation time.","PeriodicalId":255580,"journal":{"name":"2008 4th International Telecommunication Networking Workshop on QoS in Multiservice IP Networks","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127968591","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-04-11DOI: 10.1109/ITNEWS.2008.4488146
Hyungwoo Choi, Young-Min Kim, Hong-shik Park
If we can assign an end-to-end delay requirement of each class optimally to each link, the whole network can be better utilized. In this paper, we propose a new delay management scheme based on resource manager. It manages path table and link table which has a status of each link in order to guarantee an end-to-end delay effectively without an explicit and a static resource reservation in multi-domain networks. Resource manager manages a target delay in a level of path and distributes a target delay to each link dynamically in order to adapt to network situation. In our scheme we adopt the ADRR (Absolute Delay guaranteed Deficit Round Robin) scheduler which is a DRR version of deterministic QoS guaranteeing scheduling algorithm. Also, we verify our proposed delay management scheme by performing a simulation.
{"title":"Dynamic path-based end-to-end delay management scheme in multi-domain networks","authors":"Hyungwoo Choi, Young-Min Kim, Hong-shik Park","doi":"10.1109/ITNEWS.2008.4488146","DOIUrl":"https://doi.org/10.1109/ITNEWS.2008.4488146","url":null,"abstract":"If we can assign an end-to-end delay requirement of each class optimally to each link, the whole network can be better utilized. In this paper, we propose a new delay management scheme based on resource manager. It manages path table and link table which has a status of each link in order to guarantee an end-to-end delay effectively without an explicit and a static resource reservation in multi-domain networks. Resource manager manages a target delay in a level of path and distributes a target delay to each link dynamically in order to adapt to network situation. In our scheme we adopt the ADRR (Absolute Delay guaranteed Deficit Round Robin) scheduler which is a DRR version of deterministic QoS guaranteeing scheduling algorithm. Also, we verify our proposed delay management scheme by performing a simulation.","PeriodicalId":255580,"journal":{"name":"2008 4th International Telecommunication Networking Workshop on QoS in Multiservice IP Networks","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127838438","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：