Multicast support in an MPLS (multiprotocol label switching) network has yet to be defined. An MPLS network consists of label switching devices such as ATM. This document discusses both dense-mode and sparse-mode IP multicast within the context of an MPLS network. Unlike unicast routing, dense-mode multicast routing trees are established in a data-driven manner and it is not possible to topologically aggregate such trees, which are rooted at different sources. In sparse-mode multicast, source-specific trees may coexist with a core/shared tree, and it is not possible to assign a common label to traffic from different sources on a branch of the shared tree. This leads us to suggest a per-source traffic-driven label allocation scheme for supporting all three types of multicast (dense mode, shared tree, source tree) routing trees in an MPLS network.
{"title":"IP multicast support in MPLS","authors":"A. Acharya, F. Griffoul, F. Ansari","doi":"10.1109/ATM.1999.786859","DOIUrl":"https://doi.org/10.1109/ATM.1999.786859","url":null,"abstract":"Multicast support in an MPLS (multiprotocol label switching) network has yet to be defined. An MPLS network consists of label switching devices such as ATM. This document discusses both dense-mode and sparse-mode IP multicast within the context of an MPLS network. Unlike unicast routing, dense-mode multicast routing trees are established in a data-driven manner and it is not possible to topologically aggregate such trees, which are rooted at different sources. In sparse-mode multicast, source-specific trees may coexist with a core/shared tree, and it is not possible to assign a common label to traffic from different sources on a branch of the shared tree. This leads us to suggest a per-source traffic-driven label allocation scheme for supporting all three types of multicast (dense mode, shared tree, source tree) routing trees in an MPLS network.","PeriodicalId":266412,"journal":{"name":"IEEE ATM Workshop '99 Proceedings (Cat. No. 99TH8462)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1999-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126720446","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}
A number of algorithms of the ER (explicit rate) switch for ABR service in ATM networks has been proposed. The main objectives of these algorithms are to avoid cell loss and to utilise the unused bandwidth, which is used by ABR traffic, left over by CBR and VBR traffic. In this paper, we have shown some significant limitations of some proposed algorithms when operated in large scale ATM networks where the number of switches is large. They may operate inefficiently; fail to utilise the unused bandwidth even in a simple scenario. We conclude that it is necessary to have additional mechanisms to co-operate with the proposed algorithms.
{"title":"Throughput performance of the ER switch algorithms in large scale ATM networks","authors":"S. Kamolphiwong","doi":"10.1109/ATM.1999.786864","DOIUrl":"https://doi.org/10.1109/ATM.1999.786864","url":null,"abstract":"A number of algorithms of the ER (explicit rate) switch for ABR service in ATM networks has been proposed. The main objectives of these algorithms are to avoid cell loss and to utilise the unused bandwidth, which is used by ABR traffic, left over by CBR and VBR traffic. In this paper, we have shown some significant limitations of some proposed algorithms when operated in large scale ATM networks where the number of switches is large. They may operate inefficiently; fail to utilise the unused bandwidth even in a simple scenario. We conclude that it is necessary to have additional mechanisms to co-operate with the proposed algorithms.","PeriodicalId":266412,"journal":{"name":"IEEE ATM Workshop '99 Proceedings (Cat. No. 99TH8462)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1999-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128900266","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}
N. Ciulli, S. Giordano, A. Casaca, P. Silva, M. Dunmore, N. Race
Providing new services on the Internet to quality of service demanding applications has raised a number of problems and related models of solution. Within the framework of the ACTS PETERPAN project, the IP-level QoS provision mechanisms have been overlaid on the ATM technology according to a network concept, in which two kinds of new ATM-attached IP nodes (known as hybrid edge device and hybrid core device) are implemented. This paper discusses the hybrid edge device (HED).
{"title":"The hybrid edge device concept and implementation in the PETERPAN network architecture: a proposal for IP QoS provisioning on ATM networks","authors":"N. Ciulli, S. Giordano, A. Casaca, P. Silva, M. Dunmore, N. Race","doi":"10.1109/ATM.1999.786778","DOIUrl":"https://doi.org/10.1109/ATM.1999.786778","url":null,"abstract":"Providing new services on the Internet to quality of service demanding applications has raised a number of problems and related models of solution. Within the framework of the ACTS PETERPAN project, the IP-level QoS provision mechanisms have been overlaid on the ATM technology according to a network concept, in which two kinds of new ATM-attached IP nodes (known as hybrid edge device and hybrid core device) are implemented. This paper discusses the hybrid edge device (HED).","PeriodicalId":266412,"journal":{"name":"IEEE ATM Workshop '99 Proceedings (Cat. No. 99TH8462)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1999-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125136897","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}
In this paper we study the call admission control (CAC) and routing issue for ATM networks which carry integrated CBR/VBR and ABR traffic. The integration of CBR/VBR and ABR traffic is assumed to be based on the max-min fairness criterion. The CAC and routing task is formulated as a Markov decision problem (MDP) where the objective is to maximize the revenue from carried calls. The MDP is solved by the policy iteration procedure, after applying the standard link independence assumption. The numerical results show that the MDP routing method yields higher revenue than the least loaded path routing method.
{"title":"Call admission control and routing for integrated CBR/VBR and ABR services: a Markov decision approach","authors":"E. Nordstrom, J. Carlstrom","doi":"10.1109/ATM.1999.786781","DOIUrl":"https://doi.org/10.1109/ATM.1999.786781","url":null,"abstract":"In this paper we study the call admission control (CAC) and routing issue for ATM networks which carry integrated CBR/VBR and ABR traffic. The integration of CBR/VBR and ABR traffic is assumed to be based on the max-min fairness criterion. The CAC and routing task is formulated as a Markov decision problem (MDP) where the objective is to maximize the revenue from carried calls. The MDP is solved by the policy iteration procedure, after applying the standard link independence assumption. The numerical results show that the MDP routing method yields higher revenue than the least loaded path routing method.","PeriodicalId":266412,"journal":{"name":"IEEE ATM Workshop '99 Proceedings (Cat. No. 99TH8462)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1999-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126744537","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}
This paper proposes a new failure-resistant ATM transport method for real-time applications (FRAT-RA). This method can prevent not only cell loss but also cell delay variation (CDV) even when a network failure occurs. First, a general overview of the existing fault-resistant method is briefly described and its problems for real-time applications are discussed. Next, the proposed FRAT-RA method is described in detail. Finally, evaluation results on the CDV of FRAT-RA and its QoS improvement are presented. The results show that failure-resistant and high-quality transmission of real-time signals can be achieved with FRAT-RA.
{"title":"A failure-resistant ATM transport method for the transmission of high-quality real-time signals","authors":"Y. Kanayama, K. Fujihara, T. Tsuboi","doi":"10.1109/ATM.1999.786868","DOIUrl":"https://doi.org/10.1109/ATM.1999.786868","url":null,"abstract":"This paper proposes a new failure-resistant ATM transport method for real-time applications (FRAT-RA). This method can prevent not only cell loss but also cell delay variation (CDV) even when a network failure occurs. First, a general overview of the existing fault-resistant method is briefly described and its problems for real-time applications are discussed. Next, the proposed FRAT-RA method is described in detail. Finally, evaluation results on the CDV of FRAT-RA and its QoS improvement are presented. The results show that failure-resistant and high-quality transmission of real-time signals can be achieved with FRAT-RA.","PeriodicalId":266412,"journal":{"name":"IEEE ATM Workshop '99 Proceedings (Cat. No. 99TH8462)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1999-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129444104","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}
In this paper we introduce a new error control system for wireless asynchronous transfer mode (WATM) networks. The new system is based on using a new scheme to reduce the ATM cell header size before applying the multiple error correcting Bose-Chaudhuri-Hocqenghem (BCH) code instead of the usual header error control (HEC) for the wireless portion of the transmission. This new scheme implies dividing the ATM cell header into segments, then comparing all segments with the first one to generate reduced length codes to represent the compared segments. The result of applying the new technique for the wireless portion of the network is a reduced header length which has an advantage in reducing delay while maintaining the required cell loss probability limit. The newly suggested system is also an automatic system with respect to the level of BCH encoding. When the bit error rate (BER) is high, the system increases its error correction capability and vice versa. Realistic multi-path fading error patterns were analytically approximated and applied to evaluate the system performance. The results show that the new system achieves an encoding delay which is considerably less than the encoding delay of a fixed BCH system with 3 error correction capability and an original HEC system, while maintaining the required limit of cell loss.
{"title":"New automatic error control system with ATM cell header reduction for wireless ATM networks","authors":"M. Al-Khatib, M. Bayoumi","doi":"10.1109/ATM.1999.786862","DOIUrl":"https://doi.org/10.1109/ATM.1999.786862","url":null,"abstract":"In this paper we introduce a new error control system for wireless asynchronous transfer mode (WATM) networks. The new system is based on using a new scheme to reduce the ATM cell header size before applying the multiple error correcting Bose-Chaudhuri-Hocqenghem (BCH) code instead of the usual header error control (HEC) for the wireless portion of the transmission. This new scheme implies dividing the ATM cell header into segments, then comparing all segments with the first one to generate reduced length codes to represent the compared segments. The result of applying the new technique for the wireless portion of the network is a reduced header length which has an advantage in reducing delay while maintaining the required cell loss probability limit. The newly suggested system is also an automatic system with respect to the level of BCH encoding. When the bit error rate (BER) is high, the system increases its error correction capability and vice versa. Realistic multi-path fading error patterns were analytically approximated and applied to evaluate the system performance. The results show that the new system achieves an encoding delay which is considerably less than the encoding delay of a fixed BCH system with 3 error correction capability and an original HEC system, while maintaining the required limit of cell loss.","PeriodicalId":266412,"journal":{"name":"IEEE ATM Workshop '99 Proceedings (Cat. No. 99TH8462)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1999-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115711107","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}
This paper proposes a message-based signaling middleware for the B-ISDN control plane. This middleware differs significantly from other RPC-based proposals, such as CORBA and Java, in the systematic use of specific signaling mechanisms rather than a general-purpose protocol, such as RPC or GIOP. Multimedia applications require access to the services of a middleware layer through the use of functions defined in API. In this work, we introduce the contents of the API, the services provided by our middleware proposal and we give an overview of the associated information model.
{"title":"A signaling based middleware for multimedia control plane","authors":"P. Martins, C. Rigault","doi":"10.1109/ATM.1999.786893","DOIUrl":"https://doi.org/10.1109/ATM.1999.786893","url":null,"abstract":"This paper proposes a message-based signaling middleware for the B-ISDN control plane. This middleware differs significantly from other RPC-based proposals, such as CORBA and Java, in the systematic use of specific signaling mechanisms rather than a general-purpose protocol, such as RPC or GIOP. Multimedia applications require access to the services of a middleware layer through the use of functions defined in API. In this work, we introduce the contents of the API, the services provided by our middleware proposal and we give an overview of the associated information model.","PeriodicalId":266412,"journal":{"name":"IEEE ATM Workshop '99 Proceedings (Cat. No. 99TH8462)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1999-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124540318","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}
In this paper, the efficiency of transferring non-real-time data over wireless ATM (WATM) networks is studied. Such services are sensitive to bit error as well as cell loss. The loss of a single cell due to congestion or a link error will result in the retransmission of the entire data frame by the end user. In this paper, we propose an intelligent cell checking policy (ICCP) with the existent congestion control algorithm to enhance the throughput of wireless ATM networks.
{"title":"An intelligent cell checking policy for promoting data transfer performance in wireless ATM networks","authors":"Shiann-Tsong Sheu, Ming-Kai Hsueh, Jenhui Chen","doi":"10.1109/ATM.1999.786863","DOIUrl":"https://doi.org/10.1109/ATM.1999.786863","url":null,"abstract":"In this paper, the efficiency of transferring non-real-time data over wireless ATM (WATM) networks is studied. Such services are sensitive to bit error as well as cell loss. The loss of a single cell due to congestion or a link error will result in the retransmission of the entire data frame by the end user. In this paper, we propose an intelligent cell checking policy (ICCP) with the existent congestion control algorithm to enhance the throughput of wireless ATM networks.","PeriodicalId":266412,"journal":{"name":"IEEE ATM Workshop '99 Proceedings (Cat. No. 99TH8462)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1999-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125500153","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}
R. Fan, Alexander Ishii, A. Itoh, M. Kobayashi, Brian L. Mark, T. Miura, Gopalakrishnan Ramamurthy, Q. Ren, S. Shibuya, H. Shimonishi, K. Yamada
In wide-area broadband networks, the intelligence and advanced functionality should reside at the network edge. The switches within the core of the network must be able to switch traffic at high speeds, but do not require the ability to perform sophisticated processing. In this paper, we describe the design of ARC-LITE, an edge switch-routing node that provides ATM/IP processing and advanced quality-of-service features. We explain why ARC-LITE is a revolutionary advance in switch-router technology and how it can be used to enhance the performance and functionality of ATM networks.
{"title":"ARC-LITE: an integrated quality-of-service ATM/IP switching-routing engine","authors":"R. Fan, Alexander Ishii, A. Itoh, M. Kobayashi, Brian L. Mark, T. Miura, Gopalakrishnan Ramamurthy, Q. Ren, S. Shibuya, H. Shimonishi, K. Yamada","doi":"10.1109/ATM.1999.786852","DOIUrl":"https://doi.org/10.1109/ATM.1999.786852","url":null,"abstract":"In wide-area broadband networks, the intelligence and advanced functionality should reside at the network edge. The switches within the core of the network must be able to switch traffic at high speeds, but do not require the ability to perform sophisticated processing. In this paper, we describe the design of ARC-LITE, an edge switch-routing node that provides ATM/IP processing and advanced quality-of-service features. We explain why ARC-LITE is a revolutionary advance in switch-router technology and how it can be used to enhance the performance and functionality of ATM networks.","PeriodicalId":266412,"journal":{"name":"IEEE ATM Workshop '99 Proceedings (Cat. No. 99TH8462)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1999-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129594651","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}
This paper investigates bandwidth management in AAL2 networks. In particular, the bandwidth management that uses UBR VC and judges admission of AAL2 connections to a VP is investigated.
{"title":"Bandwidth management for AAL2 in UBR VCs","authors":"H. Saito","doi":"10.1109/ATM.1999.786784","DOIUrl":"https://doi.org/10.1109/ATM.1999.786784","url":null,"abstract":"This paper investigates bandwidth management in AAL2 networks. In particular, the bandwidth management that uses UBR VC and judges admission of AAL2 connections to a VP is investigated.","PeriodicalId":266412,"journal":{"name":"IEEE ATM Workshop '99 Proceedings (Cat. No. 99TH8462)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1999-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122812011","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
扫码关注我们
求助内容：
应助结果提醒方式：