Proceedings. Eleventh International Conference on Computer Communications and Networks最新文献_第8页

Effect of algorithms that improve fairness of TCP congestion avoidance on performance of slow links and long thin networks 提高TCP拥塞避免公平性的算法对慢链路和长瘦网络性能的影响

Proceedings. Eleventh International Conference on Computer Communications and Networks Pub Date : 2002-12-10 DOI: 10.1109/ICCCN.2002.1043044

V. Obanaik, L. Jacob, A. Ananda

{"title":"Effect of algorithms that improve fairness of TCP congestion avoidance on performance of slow links and long thin networks","authors":"V. Obanaik, L. Jacob, A. Ananda","doi":"10.1109/ICCCN.2002.1043044","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043044","url":null,"abstract":"The bias of TCP's congestion avoidance mechanism against connections with long round trip times (RTT) is a known fact. Many alternative congestion avoidance policies have been proposed to improve the fairness. Though the proposed policies attempt to address and resolve the fairness issue, we show that they tend to be harmful to connections that traverse either slow links, like 56 Kbps modem links, or long thin networks (LTN), like cellular links. We specifically consider a very common scenario where the last-hop link connecting the end user (i.e., client) may be a slow link or LTN. In this case, the TCP sender (i.e., server) is usually unaware of the network path, and when it is equipped with such policies, it increases probing into the network in a quest for the non-existent bandwidth. We conduct simulation studies to evaluate the impact of the proposed policies on connections that traverse either slow links or LTNs. We notice that the proposed policies cause increased buffer overflows at the last-hop router, thereby degrading the performance of the connection. We study the impact of increased buffer sizes at the last-hop router and also the effect of advertising a limited receive window. We show that the impact of the policies, on connections traversing slow links or LTNs, can be reduced by selectively disabling the policies.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122219959","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}

引用次数: 1

Efficient implementations of bounded shortest multicast algorithm 有界最短组播算法的有效实现

Proceedings. Eleventh International Conference on Computer Communications and Networks Pub Date : 2002-12-10 DOI: 10.1109/ICCCN.2002.1043084

G. Feng, Kia Mao, N. Pissinou

引用次数: 4

An intelligent geographic load balance scheme for mobile cellular networks 一种用于移动蜂窝网络的智能地理负载均衡方案

Proceedings. Eleventh International Conference on Computer Communications and Networks Pub Date : 2002-12-10 DOI: 10.1109/ICCCN.2002.1043090

L. Du, J. Bigham, L. Cuthbert

引用次数: 8

Adaptive scheduling in DOCSIS-based CATV networks 基于docsis的有线电视网络自适应调度

Proceedings. Eleventh International Conference on Computer Communications and Networks Pub Date : 2002-12-10 DOI: 10.1109/ICCCN.2002.1043122

L. H. Ju, W. Liao

引用次数: 8

Architecture of proxy partial caching using HTTP for supporting interactive video and cache consistency 使用HTTP的代理部分缓存体系结构，以支持交互式视频和缓存一致性

Proceedings. Eleventh International Conference on Computer Communications and Networks Pub Date : 2002-12-10 DOI: 10.1109/ICCCN.2002.1043069

Wei-Kuo Liao, Pang-Hsin Shih

{"title":"Architecture of proxy partial caching using HTTP for supporting interactive video and cache consistency","authors":"Wei-Kuo Liao, Pang-Hsin Shih","doi":"10.1109/ICCCN.2002.1043069","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043069","url":null,"abstract":"Proxy partial caching, e.g. segment-based proxy caching or proxy prefix caching, partitions the object into nonoverlapping pieces. The proxy cache then treats each piece as an individual file when performing caching and replacing. Upon receipt of request to the object, the proxy cache delivers the cached portion to the client immediately to mask the start-up delay. However, two architectural challenges are confronted when implementing this technique in the web proxy software, e.g., Squid cache. The first challenge is related to caching video streams. Although not until recently, HTTP is recognized as an efficient method to support interactive video. Many fundamental issues are still required to be solved. To this end, we propose an approach of segment-based video streams retrieval and caching via HTTP byte-range requests to further mask the possible startup delay, enhance the interactive function \"pause\", and simplify the web proxy cache design. Proxy partial caching introduces the second architectural challenge called dirty-initial-segments problem, i.e. cached portion in the proxy cache is inconsistent with the original in the server. If this happens, the cached portion already delivered to the client cannot be concatenated with the latter portion from the server. To relieve this problem, we propose a novel algorithm called validating upon partial replacement, which synchronizes the operations of proactive consistency validation, partition and replacement performed upon an object. We show that our proposed algorithm bears the merit of controllable chance to disturb users, easily embedding into the existing web proxy cache software with minimum modification, and improving the cache performance.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116785984","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}

引用次数: 8

Enhancing TCP performance in networks with small buffers 提高TCP在小缓冲区网络中的性能

Proceedings. Eleventh International Conference on Computer Communications and Networks Pub Date : 2002-12-10 DOI: 10.1109/ICCCN.2002.1043043

Ashu Razdan, A. Nandan, Ren Wang, M. Sanadidi, M. Gerla

{"title":"Enhancing TCP performance in networks with small buffers","authors":"Ashu Razdan, A. Nandan, Ren Wang, M. Sanadidi, M. Gerla","doi":"10.1109/ICCCN.2002.1043043","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043043","url":null,"abstract":"TCP performance can be significantly affected when the buffer capacity at routers is small. This is possible when either many flows share the network or the bandwidth-delay product is large (e.g. satellite links). The behavior of various versions of TCP with respect to buffer capacity issues has not been studied in much detail. We investigate the behavior and performance of different TCP variants under small buffer capacity conditions. We recognize TCP pacing as a potential solution. However, instead of using TCP's sending rate as the dictating metric, we make use of the bandwidth-share estimate (BSE), maintained by TCP Westwood, to set the pacing interval. We call this newly proposed protocol paced-Westwood. We also show the need to scale BSE further to mitigate the effects of positive feedback in BSE. For this, we propose a further enhancement that we call /spl alpha/-paced Westwood that uses a scaling parameter /spl alpha/ to enforce convergence of BSE and the pacing interval. The proposed /spl alpha/-paced Westwood uses its BSE to space the packet bursts during the slow-start phase, resulting in a superior throughput in the troublesome low buffer capacity cases. With the help of simulations, we show that our enhanced TCP Westwood outperforms both unpaced as well as paced TCP NewReno under low buffer capacity networks.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130808136","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}

引用次数: 18

NeuRon/spl trade/ netform: a self-organizing wireless sensor network 神经元/spl贸易/网络:一种自组织无线传感器网络

Proceedings. Eleventh International Conference on Computer Communications and Networks Pub Date : 2002-12-10 DOI: 10.1109/ICCCN.2002.1043092

L. Hester, Yan Huang, O. Andric, A. Allen, Priscilla Chen

{"title":"NeuRon/spl trade/ netform: a self-organizing wireless sensor network","authors":"L. Hester, Yan Huang, O. Andric, A. Allen, Priscilla Chen","doi":"10.1109/ICCCN.2002.1043092","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043092","url":null,"abstract":"This paper introduces the neuRFon/spl trade/ Netform, a self-organizing wireless network for low data rate, low-power fixed sensor nodes. The protocol utilizes a logical backbone architecture through which data communications between all the network nodes are supported by hierarchical routing. We present algorithms that underpin the self-organizing features. The first algorithm constructs the optimal backbone as new nodes are introduced. The second algorithm dictates how the nodes exchange essential information for maintaining the optimal routing backbone as the network evolves. The third algorithm enables the network to recover automatically from node/link failures. The neuRFon/spl trade/ Netform is designed to work in conjunction with a low duty cycle MAC protocol, described in this paper, in order to support long battery life for wireless sensors. To illustrate the performance of the neuRFon/spl trade/ system, we present simulation results showing network formation time, data packet delivery response time, and communication duty cycles of sensor nodes for a neuRFon/sup TM/ system with 64 nodes.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128243294","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}

引用次数: 21

Bandwidth scheduling for multi-channel packet cable telephony 多通道分组有线电话的带宽调度

Proceedings. Eleventh International Conference on Computer Communications and Networks Pub Date : 2002-12-10 DOI: 10.1109/ICCCN.2002.1043121

Nir Naaman, R. Rom

{"title":"Bandwidth scheduling for multi-channel packet cable telephony","authors":"Nir Naaman, R. Rom","doi":"10.1109/ICCCN.2002.1043121","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043121","url":null,"abstract":"Cable networks have evolved from offering broadcast services to providing high rate two-way data services. In the next step, cable operators intend to use voice over IP (VoIP) to provide cable telephony services. In a cable network the users are connected to the headend through a cable modem. The headend is responsible for allocating upstream bandwidth to the various cable modems. Each cable modem has access to several upstream channels but can use only one upstream channel at any given time. The headend can direct a modem to switch from one upstream channel to another. We consider the problem of scheduling packet telephony calls in a cable network. We show that the scheduling problem is NP-hard even in the case where all the calls have the same characteristics. We then suggest several approximation algorithms for the problem and investigate their performance. We address the problem of maintaining the tolerated jitter when switching a modem from one channel to another and explore the effect of the tolerated jitter on the performance of the scheduling algorithms. We show that the ability to switch channels considerably improves the performance of the scheduling algorithms.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128965982","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}

引用次数: 3

Power consumption and throughput in mobile ad hoc networks using directional antennas 使用定向天线的移动自组织网络的功耗和吞吐量

Proceedings. Eleventh International Conference on Computer Communications and Networks Pub Date : 2002-12-10 DOI: 10.1109/ICCCN.2002.1043137

A. Nasipuri, Kai Li, Uma Reddy Sappidi

引用次数: 120

Layered range multicast for video on demand 视频点播分层范围多播

Proceedings. Eleventh International Conference on Computer Communications and Networks Pub Date : 2002-12-10 DOI: 10.1109/ICCCN.2002.1043068

D. Tran, K. Hua, T. Do

引用次数: 11