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

Delay analysis of IEEE 802.11 in single-hop networks IEEE 802.11在单跳网络中的时延分析

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

Marcelo M. Carvalho, J. Garcia-Luna-Aceves

引用次数: 273

Ulysses: a robust, low-diameter, low-latency peer-to-peer network Ulysses:一个健壮、低直径、低延迟的点对点网络

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

Abhishek Kumar, S. Merugu, Jun Xu, E. Zegura, Xingxing Yu

引用次数: 91

Planned object duplication strategies in dynamic PRR meshes 动态PRR网格中的计划对象复制策略

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

M. K. Bradshaw, A. Rosenberg, D. Towsley

引用次数: 0

Improving TCP startup performance using active measurements: algorithm and evaluation 使用主动测量改进TCP启动性能:算法和评估

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

Ningning Hu, P. Steenkiste

{"title":"Improving TCP startup performance using active measurements: algorithm and evaluation","authors":"Ningning Hu, P. Steenkiste","doi":"10.1109/ICNP.2003.1249761","DOIUrl":"https://doi.org/10.1109/ICNP.2003.1249761","url":null,"abstract":"TCP slow start exponentially increases the congestion window size to detect the proper congestion window for a network path. This often results in significant packet loss, while breaking off slow start using a limited slow start threshold may lead to an overly conservative congestion window size. This problem is especially severe in high speed networks. In this paper we present a new TCP startup algorithm, called paced start, that incorporates an available bandwidth probing technique into the TCP startup algorithm. Paced start is based on the observation that when we view the TCP startup sequence as a sequence of packet trains, the difference between the data packet spacing and the acknowledgement spacing can yield valuable information about the available bandwidth. Slow start ignores this information, while paced start uses it to quickly estimate the proper congestion window for the path. For most flows. Paced Start transitions into congestion avoidance mode faster than Slow Start, has a significantly lower packet loss rate, and avoids the timeout that is often associated with slow start. This paper describes the paced start algorithm and uses simulation and real system experiments to characterize its properties.","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":"115975458","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}

引用次数: 48

Reliability-aware IBGP route reflection topology design 基于可靠性感知的IBGP路由反射拓扑设计

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

Li Xiao, Jun Wang, K. Nahrstedt

{"title":"Reliability-aware IBGP route reflection topology design","authors":"Li Xiao, Jun Wang, K. Nahrstedt","doi":"10.1109/ICNP.2003.1249769","DOIUrl":"https://doi.org/10.1109/ICNP.2003.1249769","url":null,"abstract":"In the internal border gateway protocol (IBGP), route reflection is widely used as an alternative to full mesh IBGP sessions inside an AS for scalability reason. However, some important issues, such as the impact of route reflection on the reliability of IBGP and the construction of reliable reflection topology with unreliable routers or links, have not been well investigated. This paper addresses the problem of finding reliable route reflection topologies for IBGP networks, which is of great importance to increase the robustness of IBGP operations. We first present a novel reliability model and two new metrics (IBGP expected lifetime and expected session loss) to evaluate the reliability of reflection topologies, and further to investigate the design problem. After studying the solvability conditions under the router capacity constraints, we prove the NP-hardness of the problem, and then design and implement three heuristic solutions using randomization techniques: heuristic selection, greedy search and simulated annealing. Our extensive computational experiments show that the reliability of IBGP reflection network can be significantly improved by our solutions.","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":"126135764","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}

引用次数: 15

Exploiting routing redundancy via structured peer-to-peer overlays 通过结构化点对点覆盖利用路由冗余

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

Ben Y. Zhao, Ling Huang, J. Stribling, A. Joseph, J. Kubiatowicz

引用次数: 66

Power adaptive broadcasting with local information in ad hoc networks 自组织网络中具有本地信息的功率自适应广播

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

Xiaohu Chen, M. Faloutsos, S. Krishnamurthy

引用次数: 55

Optimal resource allocation in overlay multicast 覆盖组播资源的最优分配

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

Yi Cui, Yuan Xue, K. Nahrstedt

{"title":"Optimal resource allocation in overlay multicast","authors":"Yi Cui, Yuan Xue, K. Nahrstedt","doi":"10.1109/ICNP.2003.1249758","DOIUrl":"https://doi.org/10.1109/ICNP.2003.1249758","url":null,"abstract":"The paper targets the problem of optimal resource allocation in overlay multicast, which poses both theoretical and practical challenges. Theoretically, resource allocation among overlay flows is not subject to the network capacity constraint but also the data constraint, mainly due to the dual role of end hosts as both receivers and senders. Practically, existing distributed resource allocation schemes assume the network links to be capable of measuring flow rates, calculating and communicating price signals, none of which actually exists in the Internet today. We address these challenges as follows. First, we formalize the problem using nonlinear optimization theory, which incorporates both network constraint and data constraint. Based on our theoretical framework, we propose a distributed algorithm, which is proved to converge to the optimal point, where the aggregate utility of all receivers is maximized. Second, we propose an end-host-based solution, which relies on the coordination of end hosts to accomplish tasks originally assigned to network links. our solution can be directly deployed without any changes to the existing network infrastructure.","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":"129183533","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}

引用次数: 37

Proceedings. 11th IEEE International Conference on Network Protocols 第11届IEEE网络协议国际会议论文集

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

引用次数: 31

Dynamic clustering for acoustic target tracking in wireless sensor networks 基于动态聚类的无线传感器网络声目标跟踪

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

Wei-Peng Chen, J. Hou, L. Sha

{"title":"Dynamic clustering for acoustic target tracking in wireless sensor networks","authors":"Wei-Peng Chen, J. Hou, L. Sha","doi":"10.1109/ICNP.2003.1249778","DOIUrl":"https://doi.org/10.1109/ICNP.2003.1249778","url":null,"abstract":"In the paper, we devise and evaluate a fully decentralized, light-weight, dynamic clustering algorithm for target tracking. Instead of assuming the same role for all the sensors, we envision a hierarchical sensor network that is composed of (a) a static backbone of sparsely placed high-capability sensors which assume the role of a cluster head (CH) upon triggered by certain signal events; and (b) moderately to densely populated low-end sensors whose function is to provide sensor information to CHs upon request. A cluster is formed and a CH becomes active, when the acoustic signal strength detected by the CH exceeds a pre-determined threshold. The active CH then broadcasts an information solicitation packet, asking sensors in its vicinity to join the cluster and provide their sensing information. We address and devise solution approaches (with the use of Voronoi diagram) to realize dynamic clustering: (I1) how CHs cooperate with one another to ensure that for the most of time only one CH (preferably the CH that is closest to the target) is active; (I2) when the active CH solicits for sensor information, instead of having all the sensors in its vicinity reply, only a sufficient number of sensors respond with non-redundant, essential information to determine the target location; and (I3) both packets with which sensors respond to their CHs and packets that CHs report to subscribers do not incur significant collision. Through both probabilistic analysis and ns-2 simulation, we show with the use of Voronoi diagram, the CH that is usually closest to the target is (implicitly) selected as the leader and that the proposed dynamic clustering algorithm effectively eliminates contention among sensors and renders more accurate estimates of target locations as a result of better quality data collected and less collision incurred.","PeriodicalId":179873,"journal":{"name":"11th IEEE International Conference on Network Protocols, 2003. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130448622","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