11th IEEE International Conference on Network Protocols, 2003. Proceedings.最新文献

Non-uniform information dissemination for sensor networks 传感器网络的非均匀信息传播

11th IEEE International Conference on Network Protocols, 2003. Proceedings. Pub Date : 2003-11-04 DOI: 10.1109/ICNP.2003.1249779

S. Tilak, A. Murphy, W. Heinzelman, N. Abu-Ghazaleh

引用次数: 59

On the cost-quality tradeoff in topology-aware overlay path probing 拓扑感知覆盖路径探测的成本-质量权衡

11th IEEE International Conference on Network Protocols, 2003. Proceedings. Pub Date : 2003-11-04 DOI: 10.1109/ICNP.2003.1249777

Chiping Tang, P. McKinley

{"title":"On the cost-quality tradeoff in topology-aware overlay path probing","authors":"Chiping Tang, P. McKinley","doi":"10.1109/ICNP.2003.1249777","DOIUrl":"https://doi.org/10.1109/ICNP.2003.1249777","url":null,"abstract":"Path probing is essential to maintaining an efficient overlay network topology. However, the cost of a full-scale probing is as high as O(n/sup 2/), which is prohibitive in large-scale overlay networks. Several methods have been proposed to reduce probing overhead, although at a cost in terms of probing completeness. In this paper, an orthogonal solution is proposed that trades probing overhead for estimation accuracy in sparse networks such as the Internet. The proposed solution uses network-level path composition information (for example, as provided by a topology server) to infer path quality without full-scale probing. The inference metrics include latency, loss rate and available bandwidth. This approach is used to design several probing algorithms, which are evaluated through analysis and simulation. The results show that the proposed method can significantly reduce probing overhead while providing hounded quality estimations for all n /spl times/ (n - 1) overlay paths. The solution is well suited to medium-scale overlay networks in the Internet. In other environments, it can be combined with extant probing algorithms to further improve performance.","PeriodicalId":179873,"journal":{"name":"11th IEEE International Conference on Network Protocols, 2003. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2003-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125840375","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}

引用次数: 56

Resilient peer-to-peer streaming 弹性点对点流

11th IEEE International Conference on Network Protocols, 2003. Proceedings. Pub Date : 2003-11-04 DOI: 10.1109/ICNP.2003.1249753

V. Padmanabhan, Helen J. Wang, P. Chou

引用次数: 508

Mobile distributed information retrieval for highly-partitioned networks 面向高分区网络的移动分布式信息检索

11th IEEE International Conference on Network Protocols, 2003. Proceedings. Pub Date : 2003-11-04 DOI: 10.1109/ICNP.2003.1249755

K. M. Hanna, B. Levine, R. Manmatha

引用次数: 26

A file-centric model for peer-to-peer file sharing systems 点对点文件共享系统的以文件为中心的模型

11th IEEE International Conference on Network Protocols, 2003. Proceedings. Pub Date : 2003-11-04 DOI: 10.1109/ICNP.2003.1249754

L. Zou, M. Ammar

引用次数: 20

Network time synchronization using clock offset optimization 使用时钟偏移优化的网络时间同步

11th IEEE International Conference on Network Protocols, 2003. Proceedings. Pub Date : 2003-11-04 DOI: 10.1109/ICNP.2003.1249772

Omer Gurewitz, I. Cidon, M. Sidi

{"title":"Network time synchronization using clock offset optimization","authors":"Omer Gurewitz, I. Cidon, M. Sidi","doi":"10.1109/ICNP.2003.1249772","DOIUrl":"https://doi.org/10.1109/ICNP.2003.1249772","url":null,"abstract":"Time synchronization is critical in distributed environments. A variety of network protocols, middleware and business applications rely on proper time synchronization across the computational infrastructure and depend on the clock accuracy. The ''network time protocol\" (NTP) is the current widely accepted standard for synchronizing clocks over the Internet. NTP uses a hierarchical scheme in order to synchronize the clocks in the network. In this paper we present a novel non-hierarchical peer-to-peer approach for tune synchronization termed CTP - classless time protocol. This approach exploits convex optimization theory in order to evaluate the impact of each clock offset on the overall objective function. We define the clock offset problem as an optimization problem and derive its optimal solution. Based on the solution we develop a distributed protocol that can be implemented over a communication network and prove its convergence to the optimal clock offsets. For compatibility, the CTP may use the exact format and number of messages used by NTP. We also present methodology and numerical results for evaluating and comparing the accuracy of time synchronization schemes. We show that the CTP substantially outperforms hierarchical schemes such as NTP in the sense of clock accuracy with respect to a universal clock, without increasing complexity.","PeriodicalId":179873,"journal":{"name":"11th IEEE International Conference on Network Protocols, 2003. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2003-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130155525","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

RR-TCP: a reordering-robust TCP with DSACK RR-TCP:一种支持DSACK的重排序鲁棒TCP

11th IEEE International Conference on Network Protocols, 2003. Proceedings. Pub Date : 2003-11-04 DOI: 10.1109/ICNP.2003.1249760

Ming Zhang, B. Karp, S. Floyd, L. Peterson

{"title":"RR-TCP: a reordering-robust TCP with DSACK","authors":"Ming Zhang, B. Karp, S. Floyd, L. Peterson","doi":"10.1109/ICNP.2003.1249760","DOIUrl":"https://doi.org/10.1109/ICNP.2003.1249760","url":null,"abstract":"TCP performs poorly on paths that reorder packets significantly, where it misinterprets out-of-order delivery as packet loss. The sender responds with a fast retransmit though no actual loss has occurred. These repeated false fast retransmits keep the sender's window small, and severely degrade the throughput it attains. Requiring nearly in-order delivery needlessly restricts and complicates Internet routing systems and routers. Such beneficial systems as multi-path routing and parallel packet switches are difficult to deploy in a way that preserves ordering. Toward a more reordering-tolerant Internet architecture, we present enhancements to TCP that improve the protocol's robustness to reordered and delayed packets. We extend the sender to detect and recover from false fast retransmits using DSACK information, and to avoid false fast retransmits proactively, by adaptively varying dupthresh. Our algorithm is the first that adaptively balances increasing dupthresh, to avoid false fast retransmits, and limiting the growth of dupthresh, to avoid unnecessary timeouts. Finally, we demonstrate that TCP's RTO estimator tolerates delayed packets poorly, and present enhancements to it that ensure it is sufficiently conservative, without using timestamps or additional TCP header hits. Our simulations show that these enhancements significantly improve TCP's performance over paths that reorder or delay packets.","PeriodicalId":179873,"journal":{"name":"11th IEEE International Conference on Network Protocols, 2003. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2003-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134004924","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}

引用次数: 235

The impact of false sharing on shared congestion management 虚假共享对共享拥塞管理的影响

11th IEEE International Conference on Network Protocols, 2003. Proceedings. Pub Date : 2003-11-04 DOI: 10.1109/ICNP.2003.1249759

Aditya Akella, S. Seshan, H. Balakrishnan

{"title":"The impact of false sharing on shared congestion management","authors":"Aditya Akella, S. Seshan, H. Balakrishnan","doi":"10.1109/ICNP.2003.1249759","DOIUrl":"https://doi.org/10.1109/ICNP.2003.1249759","url":null,"abstract":"Several recent proposals for sharing congestion information across concurrent flows between end-systems overlook an important problem: two or more flows sharing congestion state may in fact not share the same bottleneck. In this paper, we categorize the origins of this false sharing into two distinct cases: (i) networks with QoS enhancements such as differentiated services, where a flow classifier segregates flows into different queues, and (ii) networks with path diversity where different flows to the same destination address are routed differently. We evaluate the impact of false sharing on flow performance and investigate how false sharing can be detected by a sender. We discuss how a sender must respond upon detecting false sharing. Our results show that persistent overload can be avoided with window-based congestion control even for extreme false sharing, but higher bandwidth flows run at a slower rate. We find that delay and reordering statistics can be used to develop robust detectors of false sharing and are superior to those based on loss patterns. We also find that it is markedly easier to detect and react to false sharing than it is to start by isolating flows and merge their congestion state afterward.","PeriodicalId":179873,"journal":{"name":"11th IEEE International Conference on Network Protocols, 2003. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2003-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130466577","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}

引用次数: 30

The temporal and topological characteristics of BGP path changes BGP路径的时间和拓扑特征发生变化

11th IEEE International Conference on Network Protocols, 2003. Proceedings. Pub Date : 2003-11-04 DOI: 10.1109/ICNP.2003.1249770

Di-Fa Chang, R. Govindan, J. Heidemann

{"title":"The temporal and topological characteristics of BGP path changes","authors":"Di-Fa Chang, R. Govindan, J. Heidemann","doi":"10.1109/ICNP.2003.1249770","DOIUrl":"https://doi.org/10.1109/ICNP.2003.1249770","url":null,"abstract":"BGP has been deployed in Internet for more than a decade. However, the events that cause BGP topological changes are not well understood. Although large traces of routing updates seen in BGP operation are collected by RIPE RlS and University of Oregon RouteViews, previous work examines this data set as individual routing updates. This paper describes methods that group routing updates into events. Since one event (a policy change or peering failure) results in many update messages, we cluster updates both temporally and topologically (based on the path vector information). We propose a new approach to analyzing the update traces, classifying the topological impact of muting events, and approximating the distance to the autonomous system originating the event. Our analysis provides some insight into routing behavior: First, at least 45% path changes are caused by events on transit peerings. Second, a significant number (23-37%) of path changes are transient, in that routing updates indicate temporary path changes, but they ultimately converge on a path that is identical from the previously stable path. These observations suggest that a content provider cannot guarantee end-to-end routing stability based solely on its relationship with its immediate ISP, and that better detection of transient changes may improve routing stability.","PeriodicalId":179873,"journal":{"name":"11th IEEE International Conference on Network Protocols, 2003. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2003-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131175348","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}

引用次数: 111

Characterizing overlay multicast networks 覆盖组播网络的特征

11th IEEE International Conference on Network Protocols, 2003. Proceedings. Pub Date : 2003-11-04 DOI: 10.1109/ICNP.2003.1249757

S. Fahmy, Minseok Kwon

{"title":"Characterizing overlay multicast networks","authors":"S. Fahmy, Minseok Kwon","doi":"10.1109/ICNP.2003.1249757","DOIUrl":"https://doi.org/10.1109/ICNP.2003.1249757","url":null,"abstract":"Overlay networks among cooperating hosts have recently emerged as a viable solution to several challenging problems, including multicasting, routing, content distribution, and peer-to-peer services. Application-level overlays, however, incur a performance penalty over router level solutions. This paper characterizes this performance penalty for overlay multicast trees via experimental data, simulations, and theoretical models. Experimental data and simulations illustrate that (i) the average delay and the number of hops between parent and child hosts in overlay trees generally decrease, and (ii) the degree of hosts generally decreases, as the level of the host in the overlay tree increases. Overlay multicast routing strategies, together with power-law and small-world Internet topology characteristics, are causes of the observed phenomena. We compare three overlay multicast protocols with respect to latency, bandwidth, router degrees, and host degrees. We also quantify the overlay tree cost. Results reveal that L(n)/U(n) /spl prop/ n/sub 0.9/ for small n, where L(n) is the total number of hops in all overlay links, U(n) is the average number of hops on the source to receiver unicast paths, and n is the number of members in the overlay multicast session.","PeriodicalId":179873,"journal":{"name":"11th IEEE International Conference on Network Protocols, 2003. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2003-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132558706","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}

引用次数: 32