Pub Date : 1998-06-22DOI: 10.1109/ICATM.1998.688199
A.E. Garcia, K. Hackbarth
NETrix is a strategic planning tool which considers a specific client broadband service classification scheme where each service is modelled by a set of values from a service attribute model and the service occupation by corresponding parameter values for each client class. NETrix uses the mean value and its variance of the digital signal stream of the corresponding service for the source traffic description and calculates the total node traffic as the sum of all corresponding source traffic. Nodes are classified by a heuristic algorithm based on the total node traffic and the geographical distance allowing the level of some nodes to be predetermined. This results in a two level network composed of concentrators in the access layer and switching units in the backbone one. The node traffic of each service class is then distributed over this network topology with a corresponding traffic distribution model. This model considers two parameters, geographical distance and traffic volume in the nodes, where the values of the parameter are assigned individually for each service class. As a result of this distribution, NETrix gets the traffic flow over all access and backbone links by considering a star structure for the access network and a full meshed structure for the backbone one. NETrix provides a set of additional procedures to analyse the obtained results in each planning step with a corresponding numerical and graphical representation.
{"title":"NETrix: a procedure for the calculation of the network structure and traffic matrix in ATM networks","authors":"A.E. Garcia, K. Hackbarth","doi":"10.1109/ICATM.1998.688199","DOIUrl":"https://doi.org/10.1109/ICATM.1998.688199","url":null,"abstract":"NETrix is a strategic planning tool which considers a specific client broadband service classification scheme where each service is modelled by a set of values from a service attribute model and the service occupation by corresponding parameter values for each client class. NETrix uses the mean value and its variance of the digital signal stream of the corresponding service for the source traffic description and calculates the total node traffic as the sum of all corresponding source traffic. Nodes are classified by a heuristic algorithm based on the total node traffic and the geographical distance allowing the level of some nodes to be predetermined. This results in a two level network composed of concentrators in the access layer and switching units in the backbone one. The node traffic of each service class is then distributed over this network topology with a corresponding traffic distribution model. This model considers two parameters, geographical distance and traffic volume in the nodes, where the values of the parameter are assigned individually for each service class. As a result of this distribution, NETrix gets the traffic flow over all access and backbone links by considering a star structure for the access network and a full meshed structure for the backbone one. NETrix provides a set of additional procedures to analyse the obtained results in each planning step with a corresponding numerical and graphical representation.","PeriodicalId":257298,"journal":{"name":"1998 1st IEEE International Conference on ATM. ICATM'98","volume":"91 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120870760","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 : 1998-06-22DOI: 10.1109/ICATM.1998.688188
R. Addie
Gaussian traffic models for high speed communication networks have received an increasing amount of attention. There are some puzzling and counter-intuitive features to deal with, such as negative traffic. However, on the plus side, the central limit theorem can be invoked to argue that traffic will become closer to Gaussian as more and more of it is aggregated together. The Gaussian model has a number of interesting implications for connection admission control and network architecture, which are discussed in this paper. Finally, there is an important distinction between continuous time and discrete time models which we need to make. It appears that the continuous time Gaussian models currently under study are significantly different from the discrete time models discussed in this paper.
{"title":"On the applicability and utility of Gaussian models for broadband traffic","authors":"R. Addie","doi":"10.1109/ICATM.1998.688188","DOIUrl":"https://doi.org/10.1109/ICATM.1998.688188","url":null,"abstract":"Gaussian traffic models for high speed communication networks have received an increasing amount of attention. There are some puzzling and counter-intuitive features to deal with, such as negative traffic. However, on the plus side, the central limit theorem can be invoked to argue that traffic will become closer to Gaussian as more and more of it is aggregated together. The Gaussian model has a number of interesting implications for connection admission control and network architecture, which are discussed in this paper. Finally, there is an important distinction between continuous time and discrete time models which we need to make. It appears that the continuous time Gaussian models currently under study are significantly different from the discrete time models discussed in this paper.","PeriodicalId":257298,"journal":{"name":"1998 1st IEEE International Conference on ATM. ICATM'98","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127491770","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 : 1998-06-22DOI: 10.1109/ICATM.1998.688216
J.-O. Kim, Hs Choi, I. Kim, J. Lee, H.J. Kim
Internetworking with IP networks is not only required for the acceptance of ATM, it is also key to the success of ATM in the next century. Some groups in IETF, ITU-T and the ATM Forum are working on such tasks. They have developed many useful solutions. In this paper, we present a way to accommodate IP services in ATM access networks, excluding additional equipment such as IP routers and avoiding functional addition and modification of ATM backbone network elements. In particular, we introduce accommodation of IP services in a centralized access node system (CANS) that is a multi-service access switch. CANS adopts RFC 1577 classical IP and ARP over ATM as a solution for providing IP services. However, it requires that routers be used between different logical IP subnets (LISs). To overcome this limitation of classical IPOA, we propose an enhanced IPOA mechanism that is an extension of classical IPOA. The proposed mechanism not only is compatible with the classical version, but also provides direct communication capability.
与IP网络的互联不仅是ATM接受的需要，也是下个世纪ATM成功的关键。IETF、ITU-T和ATM论坛的一些小组正在研究这类任务。他们提出了许多有用的解决办法。在本文中，我们提出了一种在ATM接入网中容纳IP业务的方法，该方法不包括IP路由器等额外设备，并避免了ATM骨干网元素的功能添加和修改。特别地，我们在一个多业务接入交换机的集中式接入节点系统(can)中引入了IP服务的容纳。can协议采用RFC 1577经典IP协议和ARP over ATM协议提供IP服务。但是，它要求在不同的逻辑IP子网(LISs)之间使用路由器。为了克服经典IPOA的这一局限性，我们提出了一种增强的IPOA机制，即经典IPOA的扩展。该机制不仅与经典版本兼容，而且提供了直接通信的能力。
{"title":"A way to accommodate IP services in ATM access networks","authors":"J.-O. Kim, Hs Choi, I. Kim, J. Lee, H.J. Kim","doi":"10.1109/ICATM.1998.688216","DOIUrl":"https://doi.org/10.1109/ICATM.1998.688216","url":null,"abstract":"Internetworking with IP networks is not only required for the acceptance of ATM, it is also key to the success of ATM in the next century. Some groups in IETF, ITU-T and the ATM Forum are working on such tasks. They have developed many useful solutions. In this paper, we present a way to accommodate IP services in ATM access networks, excluding additional equipment such as IP routers and avoiding functional addition and modification of ATM backbone network elements. In particular, we introduce accommodation of IP services in a centralized access node system (CANS) that is a multi-service access switch. CANS adopts RFC 1577 classical IP and ARP over ATM as a solution for providing IP services. However, it requires that routers be used between different logical IP subnets (LISs). To overcome this limitation of classical IPOA, we propose an enhanced IPOA mechanism that is an extension of classical IPOA. The proposed mechanism not only is compatible with the classical version, but also provides direct communication capability.","PeriodicalId":257298,"journal":{"name":"1998 1st IEEE International Conference on ATM. ICATM'98","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125055760","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 : 1998-06-22DOI: 10.1109/ICATM.1998.688175
C. Lizzi, J. Montiel, E. Gressier-Soudan
We present a real-time communication service suitable for distributed systems built over ATM networks. This service offers end-to-end quality of service guarantees, and supports end-to-end priority inheritance. Prioritized handling of user messages is performed in each communication layer crossed, including the ATM level. Our service relies on a specific real-time ATM adaptation layer (AAL), that grants to preempt the transmission of a low priority message by a higher priority one. A transport service, in charge of admission control, resource reservation and connection setup is also presented. The real-time transport (RT-transport) service is implemented in the Chorus distributed operating system, as servers running in the microkernel address space. A real-rime interprocess communication (IPC) service runs over the RT-transport service. It offers location transparency to distributed communicating processes, and is designed to deal with deadline scheduling requirements. Our communication architecture allows communication user rates up to 130 Mbps over 155 Mbps ATM links. The end-to-end transfer delay is less than 400 /spl mu/s.
{"title":"A real-time communication service for ATM-based distributed systems","authors":"C. Lizzi, J. Montiel, E. Gressier-Soudan","doi":"10.1109/ICATM.1998.688175","DOIUrl":"https://doi.org/10.1109/ICATM.1998.688175","url":null,"abstract":"We present a real-time communication service suitable for distributed systems built over ATM networks. This service offers end-to-end quality of service guarantees, and supports end-to-end priority inheritance. Prioritized handling of user messages is performed in each communication layer crossed, including the ATM level. Our service relies on a specific real-time ATM adaptation layer (AAL), that grants to preempt the transmission of a low priority message by a higher priority one. A transport service, in charge of admission control, resource reservation and connection setup is also presented. The real-time transport (RT-transport) service is implemented in the Chorus distributed operating system, as servers running in the microkernel address space. A real-rime interprocess communication (IPC) service runs over the RT-transport service. It offers location transparency to distributed communicating processes, and is designed to deal with deadline scheduling requirements. Our communication architecture allows communication user rates up to 130 Mbps over 155 Mbps ATM links. The end-to-end transfer delay is less than 400 /spl mu/s.","PeriodicalId":257298,"journal":{"name":"1998 1st IEEE International Conference on ATM. ICATM'98","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122964752","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 : 1998-06-22DOI: 10.1109/ICATM.1998.688212
M. Bavant, M. Delattre, O. Gibuergues
ATM is a widespread technology and most of the traffic it carries is from legacy LANs or generated by LAN-oriented software such as TCP/IP. Hence the importance of ATM Forum's LAN emulation protocol (LANE) and multi-protocol over ATM (MPOA) to allow bridging and routing of this traffic over an ATM network. In this article we focus on routing LAN flows among several emulated LANs. A novel technique is investigated whereby routing of incoming LANE-encapsulated frames is performed within an ATM switch by ATM/AAL-level mechanisms based on a dynamic, on-the-fly, IP-aware translation scheme and VC-merge features.
{"title":"IP switch over ATM LAN emulation (IP-Express/sup TM/)","authors":"M. Bavant, M. Delattre, O. Gibuergues","doi":"10.1109/ICATM.1998.688212","DOIUrl":"https://doi.org/10.1109/ICATM.1998.688212","url":null,"abstract":"ATM is a widespread technology and most of the traffic it carries is from legacy LANs or generated by LAN-oriented software such as TCP/IP. Hence the importance of ATM Forum's LAN emulation protocol (LANE) and multi-protocol over ATM (MPOA) to allow bridging and routing of this traffic over an ATM network. In this article we focus on routing LAN flows among several emulated LANs. A novel technique is investigated whereby routing of incoming LANE-encapsulated frames is performed within an ATM switch by ATM/AAL-level mechanisms based on a dynamic, on-the-fly, IP-aware translation scheme and VC-merge features.","PeriodicalId":257298,"journal":{"name":"1998 1st IEEE International Conference on ATM. ICATM'98","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121530803","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 : 1998-06-22DOI: 10.1109/ICATM.1998.688194
F. Nait-Abdesselam, N. Agoulmine, A. Kasiolas
Multimedia communications have evolved rapidly during the last few years and they now require communication services with guaranteed quality of service (QoS). For the type of these new distributed multimedia applications, it is crucial to monitor continuously the current QoS parameters of a connection to ensure that they comply with the pre-arranged negotiated values. The method proposed in this paper suggests the use of QoS monitoring agents in the ATM switches as well as in the end systems, in a way that allows automatic recovery, if possible, from all the QoS violations. The recovery will be achieved by redistributing the levels of QoS that should be supported immediately by a component to meet the end-to-end requirements. An initial architecture is proposed as well as the communication protocol between the agents and future directions are given.
{"title":"Agents based approach for QoS adaptation in distributed multimedia applications over ATM networks","authors":"F. Nait-Abdesselam, N. Agoulmine, A. Kasiolas","doi":"10.1109/ICATM.1998.688194","DOIUrl":"https://doi.org/10.1109/ICATM.1998.688194","url":null,"abstract":"Multimedia communications have evolved rapidly during the last few years and they now require communication services with guaranteed quality of service (QoS). For the type of these new distributed multimedia applications, it is crucial to monitor continuously the current QoS parameters of a connection to ensure that they comply with the pre-arranged negotiated values. The method proposed in this paper suggests the use of QoS monitoring agents in the ATM switches as well as in the end systems, in a way that allows automatic recovery, if possible, from all the QoS violations. The recovery will be achieved by redistributing the levels of QoS that should be supported immediately by a component to meet the end-to-end requirements. An initial architecture is proposed as well as the communication protocol between the agents and future directions are given.","PeriodicalId":257298,"journal":{"name":"1998 1st IEEE International Conference on ATM. ICATM'98","volume":"219 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114744144","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 : 1998-06-22DOI: 10.1109/ICATM.1998.688158
K. Ben Younes, K. Begain
The paper presents a new concept for transmitting video services using the ABR service category of ATM networks. The scalable video on demand transmission is assumed to have two different quality levels. The source tries to transmit with the better quality unless there is a congestion in the network. In the case of congestion, the source switches to the lower quality level until the congestion situation is over. The ATM switches are assumed to apply the recently proposed binary rate marking (Stop&Go) ABR algorithm which is a simplified version of the relative rate marking mechanism. The video transmission with ABR connections have to share the output links with different types of higher priority background traffic with different levels of burstiness. The paper presents transient and time-averaged results on the quality of scalable video transmission over ABR connections and gives a discussion on the subjective quality of transmitted video carried using this technique.
{"title":"Scalable video on demand on ABR in ATM networks","authors":"K. Ben Younes, K. Begain","doi":"10.1109/ICATM.1998.688158","DOIUrl":"https://doi.org/10.1109/ICATM.1998.688158","url":null,"abstract":"The paper presents a new concept for transmitting video services using the ABR service category of ATM networks. The scalable video on demand transmission is assumed to have two different quality levels. The source tries to transmit with the better quality unless there is a congestion in the network. In the case of congestion, the source switches to the lower quality level until the congestion situation is over. The ATM switches are assumed to apply the recently proposed binary rate marking (Stop&Go) ABR algorithm which is a simplified version of the relative rate marking mechanism. The video transmission with ABR connections have to share the output links with different types of higher priority background traffic with different levels of burstiness. The paper presents transient and time-averaged results on the quality of scalable video transmission over ABR connections and gives a discussion on the subjective quality of transmitted video carried using this technique.","PeriodicalId":257298,"journal":{"name":"1998 1st IEEE International Conference on ATM. ICATM'98","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127961671","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 : 1998-06-22DOI: 10.1109/ICATM.1998.688187
L. Guijarro, V. Pla, J. Vidal, J. Martínez
To evaluate the provision of data service support in ATM networks, complex interactions between different protocol layers have to be considered. These interactions are originated by concurrent operation of flow control mechanisms at several layers. In this paper, we propose a new modelling approach for performance evaluation of these kinds of system. The proposal is based on a modular and object-oriented SDL description. Using this approach, a generic ATM network model is described. Finally, a simulation model is built to illustrate its use. The study case shows a comparison between ABR and UBR supporting bursty data traffic carried over TCP. Our conclusion is that detailed modelling of all the relevant mechanisms operating at several layers is necessary to significantly evaluate the performance of data service support in ATM networks.
{"title":"Multi-layer simulation approach for evaluation of data service support in ATM networks","authors":"L. Guijarro, V. Pla, J. Vidal, J. Martínez","doi":"10.1109/ICATM.1998.688187","DOIUrl":"https://doi.org/10.1109/ICATM.1998.688187","url":null,"abstract":"To evaluate the provision of data service support in ATM networks, complex interactions between different protocol layers have to be considered. These interactions are originated by concurrent operation of flow control mechanisms at several layers. In this paper, we propose a new modelling approach for performance evaluation of these kinds of system. The proposal is based on a modular and object-oriented SDL description. Using this approach, a generic ATM network model is described. Finally, a simulation model is built to illustrate its use. The study case shows a comparison between ABR and UBR supporting bursty data traffic carried over TCP. Our conclusion is that detailed modelling of all the relevant mechanisms operating at several layers is necessary to significantly evaluate the performance of data service support in ATM networks.","PeriodicalId":257298,"journal":{"name":"1998 1st IEEE International Conference on ATM. ICATM'98","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114595242","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 : 1998-06-22DOI: 10.1109/ICATM.1998.688196
E.C. Foudriat, K. Maly, M. Hou
The paper describes the design of a simulator capable of investigating a number of ATM flow-control algorithms. The event driven simulator contains a minimum number of component types-queues, connections and routes. The first two are the only participants generating events. The major data elements are packets which logically can contain any number of cells but the simulator provides for packet transport which is statistically similar to that occurring in individual cell transport through a network. The simulator code is written in C++. Two of its mechanisms, overloaded data structures and dynamic assignment of code using pointers to functions allow the simulator to contain any number of flow control algorithms and to select the algorithm to be used. Because of the unique character of the basic simulator components, relational database structures are used for case input and run output. Run output post processing is necessary because network flow-control problems are usually related to particular components when selecting the flow control algorithm and/or parameters to best meet a system's needs. Simulator run time is excellent, with a 7 queue, 5 connection network taking 2-3 second clock time for a 0.5 second run time. Scaling to a component count by an order of magnitude should be very feasible. To demonstrate the simulator's versatility, we provide a comparison of three very different flow control schemes. The first uses fair-share assignment for individual connections at each queue. The second, a threshold queue algorithm does not control individual connections, only the bulk queue load. The third scheme is an adaptive rate-based algorithm. It uses no control at the queue-only measure transport delay at the receiver.
{"title":"A simulator for and results of comparing ABR flow controls for ATM","authors":"E.C. Foudriat, K. Maly, M. Hou","doi":"10.1109/ICATM.1998.688196","DOIUrl":"https://doi.org/10.1109/ICATM.1998.688196","url":null,"abstract":"The paper describes the design of a simulator capable of investigating a number of ATM flow-control algorithms. The event driven simulator contains a minimum number of component types-queues, connections and routes. The first two are the only participants generating events. The major data elements are packets which logically can contain any number of cells but the simulator provides for packet transport which is statistically similar to that occurring in individual cell transport through a network. The simulator code is written in C++. Two of its mechanisms, overloaded data structures and dynamic assignment of code using pointers to functions allow the simulator to contain any number of flow control algorithms and to select the algorithm to be used. Because of the unique character of the basic simulator components, relational database structures are used for case input and run output. Run output post processing is necessary because network flow-control problems are usually related to particular components when selecting the flow control algorithm and/or parameters to best meet a system's needs. Simulator run time is excellent, with a 7 queue, 5 connection network taking 2-3 second clock time for a 0.5 second run time. Scaling to a component count by an order of magnitude should be very feasible. To demonstrate the simulator's versatility, we provide a comparison of three very different flow control schemes. The first uses fair-share assignment for individual connections at each queue. The second, a threshold queue algorithm does not control individual connections, only the bulk queue load. The third scheme is an adaptive rate-based algorithm. It uses no control at the queue-only measure transport delay at the receiver.","PeriodicalId":257298,"journal":{"name":"1998 1st IEEE International Conference on ATM. ICATM'98","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116933777","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 : 1998-06-22DOI: 10.1109/ICATM.1998.688160
A. Ibrahim
We tackle the problem of characterizing variable bit rate MPEG sources in order to allow for efficient video multiplexing in asynchronous transfer mode (ATM) networks. We show that the gamma distribution is a good tool for modeling the aggregate traffic of homogeneous as well as heterogeneous VBR MPEG sources. Therefore, we propose the use of simple and intuitive video descriptors based on the gamma modeling of the sources: the mean rate and variance. We show that the proposed descriptors allow for the implementation of an efficient connection admission control (CAC) function that agrees well with simulation results. We also show how this video characterization may be used in conjunction with rate shaping algorithms (variance control) to provide an even more efficient CAC.
{"title":"Efficient connection admission control for real-time video multiplexing","authors":"A. Ibrahim","doi":"10.1109/ICATM.1998.688160","DOIUrl":"https://doi.org/10.1109/ICATM.1998.688160","url":null,"abstract":"We tackle the problem of characterizing variable bit rate MPEG sources in order to allow for efficient video multiplexing in asynchronous transfer mode (ATM) networks. We show that the gamma distribution is a good tool for modeling the aggregate traffic of homogeneous as well as heterogeneous VBR MPEG sources. Therefore, we propose the use of simple and intuitive video descriptors based on the gamma modeling of the sources: the mean rate and variance. We show that the proposed descriptors allow for the implementation of an efficient connection admission control (CAC) function that agrees well with simulation results. We also show how this video characterization may be used in conjunction with rate shaping algorithms (variance control) to provide an even more efficient CAC.","PeriodicalId":257298,"journal":{"name":"1998 1st IEEE International Conference on ATM. ICATM'98","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116938409","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
扫码关注我们
求助内容：
应助结果提醒方式：