N. Mitrou, K. Kontovasilis, Hans Kröner, Villy Back Iversen
This paper gives a brief description and the main results of work done within the RACE 1022 project on bandwidth allocation and Connection Admission Control in ATM-based networks. Additionally, and before presenting these two main issues, some important facets of statistical multiplexing are highlighted. The key question which is answered by a bandwidth allocation algorithm is “how much bandwidth is required by a group of connections (e.g., within a VP), with certain traffic characteristics, in a certain multiplexing environment”. Answers to this question are given for specific traffic classes and mixing conditions. The advantages and the limitations of the proposed strategies are indicated. In cases where the proposed bandwidth allocation strategies fail to fulfil the specified objectives (e.g., in highly heterogeneous traffic mixes), sophisticated CAC algorithms are required. In particular, the hierarchically organised CAC strategy implemented within the RACE 1022 ATD Technology Testbed will be described in detail. This CAC scheme is based on a simple real-time processing algorithm which provides a quick acceptance decision. This decision will be refined by a precise but numerically complex background algorithm. Simulation studies confirm the potential of this concept.
{"title":"Statistical multiplexing, bandwidth allocation strategies and connection admission control in ATM networks","authors":"N. Mitrou, K. Kontovasilis, Hans Kröner, Villy Back Iversen","doi":"10.1002/ett.4460050208","DOIUrl":"https://doi.org/10.1002/ett.4460050208","url":null,"abstract":"This paper gives a brief description and the main results of work done within the RACE 1022 project on bandwidth allocation and Connection Admission Control in ATM-based networks. Additionally, and before presenting these two main issues, some important facets of statistical multiplexing are highlighted. The key question which is answered by a bandwidth allocation algorithm is “how much bandwidth is required by a group of connections (e.g., within a VP), with certain traffic characteristics, in a certain multiplexing environment”. Answers to this question are given for specific traffic classes and mixing conditions. The advantages and the limitations of the proposed strategies are indicated. In cases where the proposed bandwidth allocation strategies fail to fulfil the specified objectives (e.g., in highly heterogeneous traffic mixes), sophisticated CAC algorithms are required. In particular, the hierarchically organised CAC strategy implemented within the RACE 1022 ATD Technology Testbed will be described in detail. This CAC scheme is based on a simple real-time processing algorithm which provides a quick acceptance decision. This decision will be refined by a precise but numerically complex background algorithm. Simulation studies confirm the potential of this concept.","PeriodicalId":50473,"journal":{"name":"European Transactions on Telecommunications","volume":"2017 1","pages":"161-176"},"PeriodicalIF":0.0,"publicationDate":"2010-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86784919","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 results of a simulation analysis concerning the loss characteristics in ATM-switching systems are presented. The basic model used for the simulation is able to cover a wide range of ATM-traffic mixes and switching architectures. Due to special simulator techniques (parallel simulation) the model can be applied within a reasonable range of load and loss probability figures. A new set of global and connection-related performance parameters has been defined in order to evaluate the distribution of loss cases over time. The obtained results show that bursty traffic influences directly the global and connection-related loss characteristics. The burstiness of traffic mixes results in the accumulation of losses so that losses appear in bursts with long lossfree intervals between the bursts. It is also shown that the service-related loss probability depends on the load parameters of the service.
{"title":"Simulation analysis of loss characteristics in ATM switching systems by R1022","authors":"R. Habermann","doi":"10.1002/ett.4460050209","DOIUrl":"https://doi.org/10.1002/ett.4460050209","url":null,"abstract":"In this paper the results of a simulation analysis concerning the loss characteristics in ATM-switching systems are presented. The basic model used for the simulation is able to cover a wide range of ATM-traffic mixes and switching architectures. Due to special simulator techniques (parallel simulation) the model can be applied within a reasonable range of load and loss probability figures. A new set of global and connection-related performance parameters has been defined in order to evaluate the distribution of loss cases over time. The obtained results show that bursty traffic influences directly the global and connection-related loss characteristics. The burstiness of traffic mixes results in the accumulation of losses so that losses appear in bursts with long lossfree intervals between the bursts. It is also shown that the service-related loss probability depends on the load parameters of the service.","PeriodicalId":50473,"journal":{"name":"European Transactions on Telecommunications","volume":"100 1","pages":"177-186"},"PeriodicalIF":0.0,"publicationDate":"2010-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83868549","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 Usage Parameter Control (UPC) functions are compared with respect to their ability to detect violation of the negotiated traffic contract. The traffic contract parameters in this study are the peak cell rate and the maximum cell delay variation (CDV). In order to take cell delay variation into account, tolerances must be introduced in the UPC functions. This simulation study investigates how this affects their ability to detect contract violation. None of the window mechanisms studied have been found capable of detecting all types of contract violation.
{"title":"Evaluation of UPC functions for peak cell rate enforcement","authors":"Hilde Hemmer","doi":"10.1002/ett.4460050207","DOIUrl":"https://doi.org/10.1002/ett.4460050207","url":null,"abstract":"A number of Usage Parameter Control (UPC) functions are compared with respect to their ability to detect violation of the negotiated traffic contract. The traffic contract parameters in this study are the peak cell rate and the maximum cell delay variation (CDV). In order to take cell delay variation into account, tolerances must be introduced in the UPC functions. This simulation study investigates how this affects their ability to detect contract violation. None of the window mechanisms studied have been found capable of detecting all types of contract violation.","PeriodicalId":50473,"journal":{"name":"European Transactions on Telecommunications","volume":"10 1","pages":"155-160"},"PeriodicalIF":0.0,"publicationDate":"2010-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78655662","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}
The issue of optimal load balancing has been raised in several important engineering fields such as the file management in a data base, the job control in a multiple processor system or the flow assignment in a packet switched data network. By modeling the subsystems as multiple GI/G/1 queues and applying known approximations and decomposition methods, the system mean response time is expressed as a function of the load allocation. To find the optimal load balancing, the convexity property is first studied with respect to the type of the arrival process of the system. We give then an efficient algorithm which finds for the convex case the global and for the non-convex case a local minimum. Some important properties of the multiple Gl/G/1 queueing system are revealed with several numerical examples.
{"title":"An algorithm for optimal load balancing in a multiple GI/G/1 queueing system","authors":"Zhigang Zhang, H. Hartmann, Hucang He, Zhe Bai","doi":"10.1002/ett.4460050218","DOIUrl":"https://doi.org/10.1002/ett.4460050218","url":null,"abstract":"The issue of optimal load balancing has been raised in several important engineering fields such as the file management in a data base, the job control in a multiple processor system or the flow assignment in a packet switched data network. By modeling the subsystems as multiple GI/G/1 queues and applying known approximations and decomposition methods, the system mean response time is expressed as a function of the load allocation. To find the optimal load balancing, the convexity property is first studied with respect to the type of the arrival process of the system. We give then an efficient algorithm which finds for the convex case the global and for the non-convex case a local minimum. Some important properties of the multiple Gl/G/1 queueing system are revealed with several numerical examples.","PeriodicalId":50473,"journal":{"name":"European Transactions on Telecommunications","volume":"65 1","pages":"277-284"},"PeriodicalIF":0.0,"publicationDate":"2010-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73490337","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}
M. Bonatti, A. Gaivoronski, P. Lemonche, P. Polese
The paper summarizes some results obtained within RACE Project R10044 in the period 1988–1992. Traffic Engineering Studies have been carried out by R1044 with the objective and within the scope of supporting identification, selection and evaluation of network evolution strategies towards IBC; in particular, to establish which kind of traffic assumptions should be considered within Reference Demand Scenarios and how these traffic assumptions can be obtained. In its first part, the paper summarizes discussions on the main challenges to be faced by Traffic Engineering to contribute to the definition of evolution strategies towards IBC (to which requirements should Traffic Engineering respond?; which traffic considerations are required?; which “weight” they “should” have?; which problems should Traffic Engineering experts solve to allow strategic planning considerations?; more details, and discussion on other strategic planning challenges, can be found in the so called R1044 book, published by North Holland [1, 2, 3]). In particular the first part summarizes discussions on: the need of simple conservative engineering rules based upon ergodic approximations; their use to conceive a network architecture which can accommodate decoupling among Service and Network Evolutions; their role in establishing Reference Demand Scenarios, namely real differences in the “nature” of the demand requiring different strategical decisions. In the second part the paper provides information on the results obtained in order to solve some problems introduced in the first part; in particular this part introduces the conservative ergodic approximations developed to support an engineering of the first statistical multiplexer stage over time, robust against unexpected traffic evolutions. Finally, in the third part, the paper describes a simple computer tool developed (intentionally no more than an “electronic sheet”) and applied in RACE Project R1044 to produce simple reference demand scenarios.
{"title":"Summary of some traffic engineering studies carried out within RACE project R1044","authors":"M. Bonatti, A. Gaivoronski, P. Lemonche, P. Polese","doi":"10.1002/ett.4460050212","DOIUrl":"https://doi.org/10.1002/ett.4460050212","url":null,"abstract":"The paper summarizes some results obtained within RACE Project R10044 in the period 1988–1992. Traffic Engineering Studies have been carried out by R1044 with the objective and within the scope of supporting identification, selection and evaluation of network evolution strategies towards IBC; in particular, to establish which kind of traffic assumptions should be considered within Reference Demand Scenarios and how these traffic assumptions can be obtained. In its first part, the paper summarizes discussions on the main challenges to be faced by Traffic Engineering to contribute to the definition of evolution strategies towards IBC (to which requirements should Traffic Engineering respond?; which traffic considerations are required?; which “weight” they “should” have?; which problems should Traffic Engineering experts solve to allow strategic planning considerations?; more details, and discussion on other strategic planning challenges, can be found in the so called R1044 book, published by North Holland [1, 2, 3]). In particular the first part summarizes discussions on: the need of simple conservative engineering rules based upon ergodic approximations; their use to conceive a network architecture which can accommodate decoupling among Service and Network Evolutions; their role in establishing Reference Demand Scenarios, namely real differences in the “nature” of the demand requiring different strategical decisions. In the second part the paper provides information on the results obtained in order to solve some problems introduced in the first part; in particular this part introduces the conservative ergodic approximations developed to support an engineering of the first statistical multiplexer stage over time, robust against unexpected traffic evolutions. Finally, in the third part, the paper describes a simple computer tool developed (intentionally no more than an “electronic sheet”) and applied in RACE Project R1044 to produce simple reference demand scenarios.","PeriodicalId":50473,"journal":{"name":"European Transactions on Telecommunications","volume":"237 1","pages":"207-218"},"PeriodicalIF":0.0,"publicationDate":"2010-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73957678","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}
J. Cosmas, G. Petit, R. Lehnert, C. Blondia, Kimon P. Kontovassilis, O. Casals, T. Theimer
This paper describes the main statistical features of voice, data and video sources, defines a set of selection criteria for selecting source models for these sources, describes a number of relevant source models for representing these sources and recommends the best source models based on the results of the parameterisation of these models from measured data.
{"title":"A review of voice, data and video traffic models for ATM","authors":"J. Cosmas, G. Petit, R. Lehnert, C. Blondia, Kimon P. Kontovassilis, O. Casals, T. Theimer","doi":"10.1002/ett.4460050206","DOIUrl":"https://doi.org/10.1002/ett.4460050206","url":null,"abstract":"This paper describes the main statistical features of voice, data and video sources, defines a set of selection criteria for selecting source models for these sources, describes a number of relevant source models for representing these sources and recommends the best source models based on the results of the parameterisation of these models from measured data.","PeriodicalId":50473,"journal":{"name":"European Transactions on Telecommunications","volume":"21 1","pages":"139-154"},"PeriodicalIF":0.0,"publicationDate":"2010-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75302410","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}
Channel assignment problems are NP-complete optimization problems occurring during design of cellular radio systems. So far, these problems have been treated by sequential graph coloring algorithms [1, 2] and by heuristic techniques [3, 4]. On the other hand, genetic algorithms (GAs) were successfully applied to other NP-complete problems. In this paper, a strategy for using genetic algorithms to solve channel assignment problems is presented.
{"title":"A genetic algorithm for channel assignment problems","authors":"Monica Cuppini","doi":"10.1002/ett.4460050219","DOIUrl":"https://doi.org/10.1002/ett.4460050219","url":null,"abstract":"Channel assignment problems are NP-complete optimization problems occurring during design of cellular radio systems. So far, these problems have been treated by sequential graph coloring algorithms [1, 2] and by heuristic techniques [3, 4]. On the other hand, genetic algorithms (GAs) were successfully applied to other NP-complete problems. In this paper, a strategy for using genetic algorithms to solve channel assignment problems is presented.","PeriodicalId":50473,"journal":{"name":"European Transactions on Telecommunications","volume":"10 1","pages":"285-294"},"PeriodicalIF":0.0,"publicationDate":"2010-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89386161","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 studies the impact of femto-cell underlay deployment that share radio frequency resources with urban macro-cells. Due to the random and uncoordinated deployment, femto-cells potentially cause destructive interference to macro-cells and vice versa. On the other hand, femto-cells promise to substantially enhance the spectral efficiency due to an increased reuse of radio resources. The performance of systems with femto base station (FBS) deployment is compared to a system where all users, including indoor users, are served by the macro base station (MBS). In addition, the impact of closed-access and open-access femto-cell operation is examined. It is demonstrated that significant throughput gains can be achieved through such FBS deployment, regardless of whether closed-access or open-access is considered. Results clearly indicate that the benefits of FBS deployment by far outweigh their impact on the macro-cell capacity.
{"title":"Throughput enhancement through femto-cell deployment","authors":"Zubin Bharucha, H. Haas, A. Saul, G. Auer","doi":"10.1002/ett.1428","DOIUrl":"https://doi.org/10.1002/ett.1428","url":null,"abstract":"This paper studies the impact of femto-cell underlay deployment that share radio frequency resources with urban macro-cells. Due to the random and uncoordinated deployment, femto-cells potentially cause destructive interference to macro-cells and vice versa. On the other hand, femto-cells promise to substantially enhance the spectral efficiency due to an increased reuse of radio resources. The performance of systems with femto base station (FBS) deployment is compared to a system where all users, including indoor users, are served by the macro base station (MBS). In addition, the impact of closed-access and open-access femto-cell operation is examined. It is demonstrated that significant throughput gains can be achieved through such FBS deployment, regardless of whether closed-access or open-access is considered. Results clearly indicate that the benefits of FBS deployment by far outweigh their impact on the macro-cell capacity.","PeriodicalId":50473,"journal":{"name":"European Transactions on Telecommunications","volume":"90 1","pages":"469-477"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80809452","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
扫码关注我们
求助内容：
应助结果提醒方式：