{"title":"将基于逐跳信用的无线流量控制扩展到源,以获得稳定的最佳努力流量","authors":"R. Schoenen, H. Yanikomeroglu","doi":"10.1109/ATNAC.2011.6096653","DOIUrl":null,"url":null,"abstract":"Data traffic is expected to grow faster than capacity in future wireless networks. Therefore it will become unavoidable to deal with congestion. Bottlenecks are located on the wireless links because back-haul and Internet are overprovisioned. Traffic routed towards the user terminal (UT) in down-link direction keeps coming in through a big pipe until it reaches the base station (BS). The following wireless links can only carry a limited data rate due to congestion. In a multi-hop situation buffers before the bottlenecks ramp up and become unstable, leading to packet loss. While real-time traffic is safe due to call admission control (CAC), highest static priority and over-provisioning, best effort data traffic experiences congestion and therefore packet losses. A wireless flow control based on a credit-based hop-by-hop concept can solve this problem by avoiding any buffer overflow completely. This paper proposes extending the closed flow control loops to the source, either by a genuine credit-based flow control or by TCP rate control with deep packet inspection and ACK modification. This paper analyses the queueing behavior with stochastic Petri nets models. Markov state analysis provides numeric performance results. The example scenario consists of two wireless relayed hops and a wired back-haul with different control approaches for the hop between source and bottleneck.","PeriodicalId":210916,"journal":{"name":"2011 Australasian Telecommunication Networks and Applications Conference (ATNAC)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Wireless hop-by-hop credit-based flow control extended to source for stable best effort traffic\",\"authors\":\"R. Schoenen, H. Yanikomeroglu\",\"doi\":\"10.1109/ATNAC.2011.6096653\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Data traffic is expected to grow faster than capacity in future wireless networks. Therefore it will become unavoidable to deal with congestion. Bottlenecks are located on the wireless links because back-haul and Internet are overprovisioned. Traffic routed towards the user terminal (UT) in down-link direction keeps coming in through a big pipe until it reaches the base station (BS). The following wireless links can only carry a limited data rate due to congestion. In a multi-hop situation buffers before the bottlenecks ramp up and become unstable, leading to packet loss. While real-time traffic is safe due to call admission control (CAC), highest static priority and over-provisioning, best effort data traffic experiences congestion and therefore packet losses. A wireless flow control based on a credit-based hop-by-hop concept can solve this problem by avoiding any buffer overflow completely. This paper proposes extending the closed flow control loops to the source, either by a genuine credit-based flow control or by TCP rate control with deep packet inspection and ACK modification. This paper analyses the queueing behavior with stochastic Petri nets models. Markov state analysis provides numeric performance results. The example scenario consists of two wireless relayed hops and a wired back-haul with different control approaches for the hop between source and bottleneck.\",\"PeriodicalId\":210916,\"journal\":{\"name\":\"2011 Australasian Telecommunication Networks and Applications Conference (ATNAC)\",\"volume\":\"41 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-12-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 Australasian Telecommunication Networks and Applications Conference (ATNAC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ATNAC.2011.6096653\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 Australasian Telecommunication Networks and Applications Conference (ATNAC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ATNAC.2011.6096653","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Wireless hop-by-hop credit-based flow control extended to source for stable best effort traffic
Data traffic is expected to grow faster than capacity in future wireless networks. Therefore it will become unavoidable to deal with congestion. Bottlenecks are located on the wireless links because back-haul and Internet are overprovisioned. Traffic routed towards the user terminal (UT) in down-link direction keeps coming in through a big pipe until it reaches the base station (BS). The following wireless links can only carry a limited data rate due to congestion. In a multi-hop situation buffers before the bottlenecks ramp up and become unstable, leading to packet loss. While real-time traffic is safe due to call admission control (CAC), highest static priority and over-provisioning, best effort data traffic experiences congestion and therefore packet losses. A wireless flow control based on a credit-based hop-by-hop concept can solve this problem by avoiding any buffer overflow completely. This paper proposes extending the closed flow control loops to the source, either by a genuine credit-based flow control or by TCP rate control with deep packet inspection and ACK modification. This paper analyses the queueing behavior with stochastic Petri nets models. Markov state analysis provides numeric performance results. The example scenario consists of two wireless relayed hops and a wired back-haul with different control approaches for the hop between source and bottleneck.