{"title":"Packet transfer scheduling scheme with throughput compensated considering wireless conditions","authors":"Yohei Fukui, Norio Yamagaki, H. Tode, K. Murakami","doi":"10.1109/ICCCN.2003.1284143","DOIUrl":"https://doi.org/10.1109/ICCCN.2003.1284143","url":null,"abstract":"With the rapid diffusion of mobile terminals in recent years, the number of the Internet access from mobile terminals has been drastically increasing. In this environment, the condition of channels changes greatly due to moving terminal locations, and transmission errors frequently occur as a result. Retransmitting the dropped packet can usually correct the errors. However, when burst errors occur, retransmission repeats and the throughput of the whole base station degrades. Since the throughput per terminal depends on the channel condition, the throughput between terminals differs each other. This paper aims at improving the throughput at base stations and the throughput unfairness per terminal, and proposes a new packet transfer scheduling scheme with throughput compensated considering radio conditions. Our proposed method consists of two mechanisms. One is a throughput control mechanism which compensates the throughput to each terminal. The other is a transmitting control mechanism which inspects fine channels where little error occurs. Cooperating these two mechanisms, if a channel condition is good, packets belonging to this channel is prioritized for the purpose of higher transmission efficiency. Meanwhile, the proposed test protocol data unit (PDU), one of our proposals, is sent to a bad channel to confirm if the channel is restored or not. After confirming the restoration, the degraded throughput is compensated. The use of the test PDU controls the channel properly without wasting radio link bandwidth and can achieve the fairness between each terminal. Computer simulations have evaluated the performance of our proposed method. Our proposed method is verified its efficiency with the results showing the improvement of the throughput at base stations and unfairness per mobile terminal.","PeriodicalId":168378,"journal":{"name":"Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125194353","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}
{"title":"Peer-to-peer approach for global deployment of voice over IP service","authors":"Wei Yu","doi":"10.1109/ICCCN.2003.1284157","DOIUrl":"https://doi.org/10.1109/ICCCN.2003.1284157","url":null,"abstract":"IP communication service over Internet has become most interesting research topic in recent years, as the next generation Internet applications are requiring the integration of voice, video and data in the single IP infrastructure. In this study, we focus on designing a scalable voice over IP routing architecture from the network control plan consideration, aiming at dealing with issues related to the global deployment of voice over IP service. Particularly, our technologies include: 1) Peer-to-Peer based call routing architecture. Peer-to-Peer approach can fully supports the variable network topology to satisfy the transition period of global voice over IP deployment in the next several years. We study the routing request forwarding protocol and routing update protocol with designing an efficient multipath routing algorithms to achieve better QoS (Quality of Service) performance. 2) Efficient voice gateway allocation schemes. When the call routing fails in the IP overlay, the call setup can automatically reroute to the PSTN (public switched telephone network) and fault tolerant service can be easily extended. We study how to support differentiated service to satisfy different user requirements. We conduct extensive performance evaluations on different architecture and algorithms. The evaluation results show that the load aware routing scheme can achieve much better performance than static selection scheme in terms of average call routing message delay. The experiment results also demonstrate that the weight based gateway allocation scheme can efficiently support call requests with different QoS requirements.","PeriodicalId":168378,"journal":{"name":"Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712)","volume":"333 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115980151","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}
{"title":"An aggressive distributed admission control policy for streaming media","authors":"Zhonghang Xia, I. Yen, Peng Li","doi":"10.1109/ICCCN.2003.1284160","DOIUrl":"https://doi.org/10.1109/ICCCN.2003.1284160","url":null,"abstract":"Prefix caching has significant benefits in media delivery systems in terms of reduced startup latency and network traffic. However, with the conventional admission control model, prefix caching may incur some performance penalty. When the media server is heavily loaded and has to deny the client request finally, forwarding a large number of initial frames from proxy to clients can result in dramatic waste of critical network resource. An ideal solution to this problem is to let proxy servers perform the admission control on behalf of the media servers. In this paper, we present a distributed admission control policy. We consider an aggressive disk bandwidth allocation scheme where an agent may, with a certain probability, admit a new request when the current bandwidth used at the agent has reached its limit. We formulate the problem as a min-max optimization problem and provide a MINMAX algorithm to find the solutions. The effectiveness of our algorithm is demonstrated through simulation studies.","PeriodicalId":168378,"journal":{"name":"Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712)","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134181100","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}
{"title":"Reactive model correction with application to admission control of VPN services","authors":"C. Lambiri, D. Ionescu","doi":"10.1109/ICCCN.2003.1284225","DOIUrl":"https://doi.org/10.1109/ICCCN.2003.1284225","url":null,"abstract":"This paper introduces a VPN service centric point of view on the admission control problem. Considering a VPN service that can carry traffic from several classes of service (COS), it is desirable, in order to simplify the service management, to have all of traffic between two end points of the service, regardless of the class of service that it belongs to, follow the same path. In this case, the service traffic requirements are solved together. Thus, this represents a generalization of the connection admission control problem to multi class of service requests. It is known that real network traffic exhibits deterministic temporal characteristics, and as such, it is nonstationary. Therefore an admission control system that operates under nonstationary conditions is highly desirable. Our approach to this problem is to use a model correction technique, which allows us to update dynamically the traffic model. The technique is based on a loss estimator for aggregated traffic, in which the unknown is one of the traffic model parameters, usually either the variance or the Hurst parameter, while the loss itself is obtained by direct measurement This approach is feasible for high speed links, where loss data can be obtained within a short time period, even for relatively low loss targets.","PeriodicalId":168378,"journal":{"name":"Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712)","volume":"125 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127407367","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}
{"title":"3GPP streaming over GPRS Rel '97","authors":"Miikka Lundan, I. Curcio","doi":"10.1109/ICCCN.2003.1284156","DOIUrl":"https://doi.org/10.1109/ICCCN.2003.1284156","url":null,"abstract":"Mobile streaming is thought to be mainly a 3G service offered with guaranteed bit rates, error rates and delay bounds. In this paper we analyze the feasibility of streaming services in a 2.5G environment. GPRS Rel. '97 allows enough bandwidth for streaming, but it cannot guarantee bit rates or delays. We study different QoS parameter configurations to find optimal values for streaming over GPRS Rel. '97. Its error protection is good enough, if the correct QoS profile is chosen. GPRS cell reselections cause additional problems for streaming, since several seconds of data can be lost Results show that despite all the limitations, streaming is possible in a GPRS environment and this service can be started even before the deployment of 3G networks.","PeriodicalId":168378,"journal":{"name":"Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114575594","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}
{"title":"Vision, future and applications of the global telecom industries in the 21st century","authors":"David Farber","doi":"10.1109/ICCCN.2003.1284141","DOIUrl":"https://doi.org/10.1109/ICCCN.2003.1284141","url":null,"abstract":"","PeriodicalId":168378,"journal":{"name":"Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124114727","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}
{"title":"VoIP network failure detection and user notification","authors":"M. Karol, P. Krishnan, J. J. Li","doi":"10.1109/ICCCN.2003.1284217","DOIUrl":"https://doi.org/10.1109/ICCCN.2003.1284217","url":null,"abstract":"The impact of network failures can be minimized if users are promptly notified by appropriately designed applications. Specifically, for voice-over-IP (VoIP) networks, an RTP/RTCP-based detection method can be used to rapidly distinguish between network congestion and network failures. Users and network managers can exploit this information in various ways, such as rapid network recovery or seeking alternatives at the application layer. In this paper, we present the main ideas behind these proposals, some analytical/simulation results, insights from a Linux-based implementation and experimental results.","PeriodicalId":168378,"journal":{"name":"Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712)","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128396890","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}
{"title":"Multicast TCP via concast merged acknowledgments","authors":"Billy Mullins, J. Griffioen, K. Calvert","doi":"10.1109/ICCCN.2003.1284186","DOIUrl":"https://doi.org/10.1109/ICCCN.2003.1284186","url":null,"abstract":"One of the challenges in reliable multicast is approximating or replicating TCP's congestion control algorithm. This has led to various proposals to adapt TCP itself for use over multicast. The drawback of these multicast TCP services is that they place significant processing load on the sender and they fail to deal with the problem of ACK implosion. This paper shows how concast, a network-layer aggregation service, can be used in conjunction with a standard (unmodified) TCP implementation to support reliable multicast while avoiding ACK implosion and offloading ACK processing. Our prototype implementation shows that, even for relatively small groups, distributing the ACK processing and reducing ACK losses translates into significant improvements in end-to-end transmission rates.","PeriodicalId":168378,"journal":{"name":"Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129980823","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}
{"title":"Fair scheduling for downlink realtime data distribution","authors":"Chi Kuo, Jing-Fu Chang","doi":"10.1109/ICCCN.2003.1284144","DOIUrl":"https://doi.org/10.1109/ICCCN.2003.1284144","url":null,"abstract":"Information dissemination on downlink channels has been widely perceived to be a dominant application in future wireless mobile communications. Data distribution on the downlink is subject to the influence of location dependent channel errors. To timely deliver data to a mobile recipient through a good-conditioned channel in the spirit of fairness has become a very important issue. This paper has proposed a scheduling algorithm to address this problem. Extensive simulation experiments have been conducted to prove the feasibility of our proposal.","PeriodicalId":168378,"journal":{"name":"Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131341070","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}
{"title":"Effect of TCP on self-similarity of network traffic","authors":"N. Wisitpongphan, J. Peha","doi":"10.1109/ICCCN.2003.1284196","DOIUrl":"https://doi.org/10.1109/ICCCN.2003.1284196","url":null,"abstract":"It is now well known that Internet traffic exhibits self-similarity, which cannot be described by traditional Markovian models such as the Poisson process. In this work, we simulate a simple network with a full implementation of TCP-Reno. We also assume Poisson arrivals at the application layer specifically to determine whether TCP can cause self-similarity even when input traffic does not exhibit long-range dependence. Our study shows that, at some loads TCP can induce the appearance of self-similarity. In particular, when load is low and loss is rare, traffic looks Poisson. When load is high and the network is overloaded, TCP congestion control can smooth out the burstiness of the aggregate stream so that traffic at the bottleneck tends to Poisson. However, when load is intermediate and the network is prone to occasional bouts of congestion, as is typical of many networks, traffic can become self-similar. Moreover, factors such as round trip time and number of streams passing through the bottleneck can cause the network to become congested at different loads, and consequently affect the range of load over which self-similarity can be observed. The impact of one self-similar TCP stream has also been observed. In particular, our study show that if one or more streams passing through the bottleneck is self-similar and the aggregate flow does not exceed the capacity, traffic observed at the bottleneck will also be self-similar.","PeriodicalId":168378,"journal":{"name":"Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126772267","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}