13TH IEEE International Conference on Network Protocols (ICNP'05)最新文献_第2页

Efficient probabilistic packet marking 有效的概率分组标记

13TH IEEE International Conference on Network Protocols (ICNP'05) Pub Date : 2005-11-06 DOI: 10.1109/ICNP.2005.15

Qunfeng Dong, Suman Banerjee, M. Adler, Kazu Hirata

引用次数: 29

Can coexisting overlays inadvertently step on each other? 共存的重叠是否会在不经意间相互踩到对方?

13TH IEEE International Conference on Network Protocols (ICNP'05) Pub Date : 2005-11-06 DOI: 10.1109/ICNP.2005.9

Ram Keralapura, C. Chuah, N. Taft, G. Iannaccone

{"title":"Can coexisting overlays inadvertently step on each other?","authors":"Ram Keralapura, C. Chuah, N. Taft, G. Iannaccone","doi":"10.1109/ICNP.2005.9","DOIUrl":"https://doi.org/10.1109/ICNP.2005.9","url":null,"abstract":"By allowing end hosts to make routing decisions at the application level, different overlay networks may unintentionally interfere with each other. This paper describes how multiple similar or dissimilar overlay networks making independent routing decisions could experience race conditions, resulting in oscillations in both route selection and network load. We pinpoint the causes for synchronization in terms of partially overlapping routes and periodic path probing processes and derive an analytic formulation for the synchronization probability of two overlays. Our model indicates that the probability of synchronization is non-negligible across a wide range of parameter settings, thus implying that the ill-effects of synchronization should not be ignored. Using the analytical model, we find an upper bound on the duration of traffic oscillations. We validate our model through simulations that are designed to capture the transient routing behavior of both the IP- and overlay-layers. We use our model to study the effects of factors such as path diversity (measured in round trip times) and probing aggressiveness on these race conditions. Finally, we discuss the implications of our study on the design of overlay networks and the choice of their path probing parameters","PeriodicalId":191961,"journal":{"name":"13TH IEEE International Conference on Network Protocols (ICNP'05)","volume":"94 33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129087322","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}

引用次数: 28

Intersection characteristics of end-to-end Internet paths and trees 端到端互联网路径和树的交叉特性

13TH IEEE International Conference on Network Protocols (ICNP'05) Pub Date : 2005-11-06 DOI: 10.1109/ICNP.2005.20

Sevcan Bilir, K. Saraç, T. Korkmaz

{"title":"Intersection characteristics of end-to-end Internet paths and trees","authors":"Sevcan Bilir, K. Saraç, T. Korkmaz","doi":"10.1109/ICNP.2005.20","DOIUrl":"https://doi.org/10.1109/ICNP.2005.20","url":null,"abstract":"This paper focuses on understanding the scale and the distribution of \"state overhead'' (briefly load) that is incurred on the routers by various value-added network services, e.g., IP multicast and IP traceback. This understanding is essential to developing appropriate mechanisms and provisioning resources so that the Internet can support such value-added services in an efficient and scalable manner. We mainly consider the number of end-to-end paths or trees intersecting at a router to represent the amount of state overhead at that router. Hence, we analyze the router-level intersection characteristics of end-to-end Internet paths or trees to approximate the state overhead distribution in the Internet. For the reliability of our analysis, a representative, end-to-end router-level Internet map is essential. Although several maps are available, they are at best insufficient for our analysis. Therefore, in the first part of our work, we exert a measurement study to obtain a large size end-to-end router-level map conforming to our constraints. In the second part, we conduct various experiments using our map and shed some light on the scale and distribution of state overhead of value-added Internet services in both unicast and multicast environments.","PeriodicalId":191961,"journal":{"name":"13TH IEEE International Conference on Network Protocols (ICNP'05)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127434347","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}

引用次数: 25

Shape shifting tries for faster IP route lookup 形状变换尝试更快的IP路由查找

13TH IEEE International Conference on Network Protocols (ICNP'05) Pub Date : 2005-11-06 DOI: 10.1109/ICNP.2005.36

Haoyu Song, J. Turner, J. Lockwood

引用次数: 75

On static and dynamic partitioning behavior of large-scale networks 大型网络的静态和动态分区行为

13TH IEEE International Conference on Network Protocols (ICNP'05) Pub Date : 2005-11-06 DOI: 10.1109/ICNP.2005.27

Derek Leonard, Z. Yao, Xiaoming Wang, D. Loguinov

引用次数: 23

Adaptive sleep scheduling for energy-efficient movement-predicted wireless communication 基于节能运动预测的无线通信自适应睡眠调度

13TH IEEE International Conference on Network Protocols (ICNP'05) Pub Date : 2005-11-06 DOI: 10.1109/ICNP.2005.6

Yu Dong, David K. Y. Yau

{"title":"Adaptive sleep scheduling for energy-efficient movement-predicted wireless communication","authors":"Yu Dong, David K. Y. Yau","doi":"10.1109/ICNP.2005.6","DOIUrl":"https://doi.org/10.1109/ICNP.2005.6","url":null,"abstract":"Energy efficiency in network communication is critical for wirelessly connected small computing devices, which run on limited battery capacity. Under realistic movement scenarios (e.g., a person traveling at airplane, automobile, or biking speed), a mobile sender can track its own movement and postpone communication (subject to application deadline constraints) until it moves close to the communication target. This will save significant energy of sending, which grows superlinearly with the communication distance in, say, the single hop wireless context. However, movement tracking requires the mobile device to be turned on and hence consumes energy. Instead of continuous tracking, the mobile device should sample its movement and be allowed to sleep between the sampling instants (provided that the application also does not have work to do during the sleep). In this paper, we present an adaptive scheduler for determining an effective sampling schedule given changing operating conditions. Our experimental results show that the scheduler can achieve substantial energy savings over a device that is always on. Moreover, the scheduler's adaptivity allows it to outperform fixed sleep periods between tracking, since the \"right\" sleep period depends on dynamic system conditions and cannot be determined a priori.","PeriodicalId":191961,"journal":{"name":"13TH IEEE International Conference on Network Protocols (ICNP'05)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122265333","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}

引用次数: 11

Path vector face routing: geographic routing with local face information 路径矢量面路由:具有本地面信息的地理路由

13TH IEEE International Conference on Network Protocols (ICNP'05) Pub Date : 2005-11-06 DOI: 10.1109/ICNP.2005.32

B. Leong, S. Mitra, B. Liskov

{"title":"Path vector face routing: geographic routing with local face information","authors":"B. Leong, S. Mitra, B. Liskov","doi":"10.1109/ICNP.2005.32","DOIUrl":"https://doi.org/10.1109/ICNP.2005.32","url":null,"abstract":"Existing geographic routing algorithms depend on the planarization of the network connectivity graph for correctness, and the planarization process gives rise to a well-defined notion of \"faces\". In this paper, we demonstrate that we can improve routing performance by storing a small amount of local face information at each node. We present a protocol, path vector exchange (PVEX), that maintains local face information at each node efficiently, and a new geographic routing algorithm, greedy path vector face routing (GPVFR), that achieves better routing performance in terms of both path stretch and hop stretch than existing geographic routing algorithms by exploiting available local face information. Our simulations demonstrate that GPVFR/PVEX achieves significantly reduced path and hop stretch than greedy perimeter stateless routing (GPSR) and somewhat better performance than greedy other adaptive face routing (GOAFR+) over a wide range of network topologies. The cost of this improved performance is a small amount of additional storage, and the bandwidth required for our algorithm is comparable to GPSR and GOAFR+ in quasi-static networks.","PeriodicalId":191961,"journal":{"name":"13TH IEEE International Conference on Network Protocols (ICNP'05)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116997477","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}

引用次数: 183

Z-ring: fast prefix routing via a low maintenance membership protocol Z-ring:通过低维护成员协议的快速前缀路由

13TH IEEE International Conference on Network Protocols (ICNP'05) Pub Date : 2005-11-06 DOI: 10.1109/ICNP.2005.45

Qiao Lian, Wei Chen, Zheng Zhang, Shaomei Wu, Ben Y. Zhao

引用次数: 12

Robust multiclass signaling overload control 鲁棒的多类信令过载控制

13TH IEEE International Conference on Network Protocols (ICNP'05) Pub Date : 2005-11-06 DOI: 10.1109/ICNP.2005.34

S. Kasera, J. Pinheiro, C. Loader, T. LaPorta, M. Karaul, A. Hari

{"title":"Robust multiclass signaling overload control","authors":"S. Kasera, J. Pinheiro, C. Loader, T. LaPorta, M. Karaul, A. Hari","doi":"10.1109/ICNP.2005.34","DOIUrl":"https://doi.org/10.1109/ICNP.2005.34","url":null,"abstract":"We propose multi-class signaling overload control algorithms, for telecommunication switches, that are robust against different input traffic patterns and system upgrades. In order to appropriately measure the system load when several classes of signaling traffic are present, we first introduce the concept of equivalent system load measure that converts the multiple system measures associated with different classes of traffic into a single measure with respect to a pre-defined base class. We use this measure to develop three multi-class overload detection and measurement algorithms. Next, we develop a new algorithm for partitioning the allowable equivalent system load across multiple traffic classes, using a strict priority scheme. Using simulations of call flows from mobile telecommunications standards, we compare different multi-class overload algorithms under a variety of overload conditions. Our simulation results indicate that our algorithm that measures system load using a combination of request acceptance rate and processor occupancy provides highly reactive and robust overload control. Last, for the purpose of making the overload control algorithms more robust, we propose a measurement-based simple regression technique to dynamically estimate key system parameters. We find that estimates derived in this manner converge rapidly to their true values.","PeriodicalId":191961,"journal":{"name":"13TH IEEE International Conference on Network Protocols (ICNP'05)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117010310","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}

引用次数: 9

Does over-provisioning become more or less efficient as networks grow larger? 随着网络规模的扩大，过度配置的效率会提高还是降低?

13TH IEEE International Conference on Network Protocols (ICNP'05) Pub Date : 2005-11-06 DOI: 10.1109/ICNP.2005.12

Yaqing Huang, R. Guérin

引用次数: 24