{"title":"Priority-based dynamic access policies to WAN from LAN/MAN","authors":"Yong-Hee Jeon, Y. Viniotis","doi":"10.1109/LCN.1991.208067","DOIUrl":null,"url":null,"abstract":"The authors consider the integration problem of LAN/MAN traffic to WAN by ATM/SONET multiplexing. They propose separate buffers for voice and data to efficiently control the throughput of each traffic type. Transmission bandwidth is dynamically and adaptively shared between voice and data to guarantee grade of service (GOS) requirements for each traffic type. The authors propose two algorithms for access policies; the (N/sub 1/,N/sub 2/) scheme and its adaptive variation. Their algorithms do not require the knowledge of arrival statistics. In the fact scheme, they can play with the tradeoff between delay and cell loss probability of each traffic type. In the second scheme, for most of the time and under normal network conditions, voice traffic has higher priority. Data traffic has higher priority when the number of data cells queued reaches a certain threshold. They show how the network performance is affected by several system parameters.<<ETX>>","PeriodicalId":163373,"journal":{"name":"[1991] Proceedings 16th Conference on Local Computer Networks","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1991] Proceedings 16th Conference on Local Computer Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LCN.1991.208067","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
The authors consider the integration problem of LAN/MAN traffic to WAN by ATM/SONET multiplexing. They propose separate buffers for voice and data to efficiently control the throughput of each traffic type. Transmission bandwidth is dynamically and adaptively shared between voice and data to guarantee grade of service (GOS) requirements for each traffic type. The authors propose two algorithms for access policies; the (N/sub 1/,N/sub 2/) scheme and its adaptive variation. Their algorithms do not require the knowledge of arrival statistics. In the fact scheme, they can play with the tradeoff between delay and cell loss probability of each traffic type. In the second scheme, for most of the time and under normal network conditions, voice traffic has higher priority. Data traffic has higher priority when the number of data cells queued reaches a certain threshold. They show how the network performance is affected by several system parameters.<>