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

Tracking targets with quality in wireless sensor networks 无线传感器网络中有质量目标跟踪

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

Guanghui He, J. Hou

{"title":"Tracking targets with quality in wireless sensor networks","authors":"Guanghui He, J. Hou","doi":"10.1109/ICNP.2005.42","DOIUrl":"https://doi.org/10.1109/ICNP.2005.42","url":null,"abstract":"Tracking of moving targets has attracted more and more attention due to its importance in utilizing sensor networks for surveillance. In this paper, we consider the issue of how to track mobile targets with certain level of quality of monitoring (QoM), while conserving power. We address the target tracking problem by taking into account of both the coverage and the QoM. In particular, QoM ensures that the probability of reporting inaccurate monitoring information (such as false alarm or target miss) should be as small as possible, even in the presence of noises and signal attenuation. We also analytically whether or not the detection/observation made by a single sensor suffices to tracking the target in a reasonably populated sensor network. Our finding gives a confirmative answer and challenges the long-held paradigm that high tracking quality (low tracking error) necessarily requires high power consumption. To rigorously analyze the impact of target movement on QoM, we derive both lower and upper bounds on the number of sensors (called duty sensors) required to keep track of a moving target. Based on the analysis, we have devised a cooperative, relay-area-based scheme that determines which sensor should become the next duty sensor when the target is moving. The simulation study indicates that the number of duty sensor required in the proposed scheme is, in the worst case, approximately 1.2 times larger than the lower bound. It also indicates that a trade-off exists among QoM, the number of duty sensors required, and the load balance","PeriodicalId":191961,"journal":{"name":"13TH IEEE International Conference on Network Protocols (ICNP'05)","volume":"2016 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":"127280968","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}

引用次数: 53

Stable egress route selection for interdomain traffic engineering: model and analysis 域间流量工程稳定出口路由选择:模型与分析

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

Hao Wang, Haiyong Xie, Y. Yang, A. Silberschatz, Erran L. Li, Y. Liu

引用次数: 23

Trading precision for stability in congestion control with probabilistic packet marking 用概率分组标记交换拥塞控制中的精度与稳定性

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

J. Shapiro, C. Hollot, D. Towsley

{"title":"Trading precision for stability in congestion control with probabilistic packet marking","authors":"J. Shapiro, C. Hollot, D. Towsley","doi":"10.1109/ICNP.2005.43","DOIUrl":"https://doi.org/10.1109/ICNP.2005.43","url":null,"abstract":"In pricing-based congestion control protocols it is common to assume that the rate of congestion feedback from the network is limited to a single bit per packet. To obtain a precise estimate of available bandwidth (as summarized by the congestion price) under the single-bit constraint, a session must consider feedback contained in a number of recently received packets. As more packets are considered, however, the estimate includes increasingly older information about the network state. We study this tradeoff between the quality and timeliness of feedback using control-theoretic approach, modeling the 'memory' incorporated into the price estimate as additional feedback delay. We show through analysis that obtaining arbitrary precision in the estimated price causes control instability, making it more difficult for a session to track its targeted optimal rate. Through continuous-time simulation of our model and packet-level simulations, we find that crude estimates of congestion price based on very few packets can yield good performance while allowing the session to operate far away from the boundary of instability. We also investigate the impact of estimation bias on protocol performance, showing that protocols use a form of integral control can compensate for biased price estimates.","PeriodicalId":191961,"journal":{"name":"13TH IEEE International Conference on Network Protocols (ICNP'05)","volume":"76 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":"122427233","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

Incentives to promote availability in peer-to-peer anonymity systems 促进点对点匿名系统可用性的激励措施

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

Daniel R. Figueiredo, J. Shapiro, D. Towsley

引用次数: 54

Simple robotic routing in ad hoc networks 自组织网络中的简单机器人路由

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

Daejoong Kim, N. Maxemchuk

引用次数: 15

A family of collusion resistant protocols for instantiating security 一组用于实例化安全性的抗合谋协议

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

S. Kulkarni, Bruhadeshwar Bezawada

引用次数: 4

TCP connection game: a study on the selfish behavior of TCP users TCP连接博弈:TCP用户自私行为的研究

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

Honggang Zhang, D. Towsley, W. Gong

引用次数: 30

Measuring the shared fate of IGP engineering and interdomain traffic 衡量IGP工程和域间流量的共享命运

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

S. Agarwal, A. Nucci, S. Bhattacharyya

{"title":"Measuring the shared fate of IGP engineering and interdomain traffic","authors":"S. Agarwal, A. Nucci, S. Bhattacharyya","doi":"10.1109/ICNP.2005.22","DOIUrl":"https://doi.org/10.1109/ICNP.2005.22","url":null,"abstract":"Typically, each autonomous system (AS) tunes its local IS-IS or OSPF metrics without any coordination with other ASes. Such local optimizations can lead to sub-optimal end-to-end network performance, as suggested by the performance enhancements achieved by some overlay routing projects. We study the interaction of local IGP engineering in an ISP network with interdomain routing policies. Specifically, (a) how does hot-potato routing (the BGP policy of choosing the closest egress) influence the selection of IGP link metrics? and (b) how does traffic to neighboring ASes shift due to changes in the local AS's IGP link metrics? In our measurement study, we find that the hot-potato routing policy interacts significantly with IGP engineering -ignoring this interaction resulted in metrics sub-optimal by as much as 20% of link utilization. Further, the impact on neighboring ASes depends on peering locations and policies, and as much as 25% of traffic to a neighboring AS can shift the exit point. Such interdomain shifts can be detrimental to the performance of neighboring ASes. We rely on the actual measured network topology, IGP metrics, traffic matrix and delay bounds. Even though our results are specific to a single ISP, they show significant interaction between local IGP engineering and interdomain routing policies, and thus motivate further work on global network optimization and coordination among ISPs.","PeriodicalId":191961,"journal":{"name":"13TH IEEE International Conference on Network Protocols (ICNP'05)","volume":"86 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":"114202401","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}

引用次数: 36

Analyzing the yield of ExScal, a large-scale wireless sensor network experiment 大型无线传感器网络实验exscale的成品率分析

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

S. Bapat, V. Kulathumani, A. Arora

引用次数: 66

Modeling and verification of IPSec and VPN security policies IPSec和VPN安全策略的建模和验证

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

H. Hamed, E. Al-Shaer, W. Marrero

{"title":"Modeling and verification of IPSec and VPN security policies","authors":"H. Hamed, E. Al-Shaer, W. Marrero","doi":"10.1109/ICNP.2005.25","DOIUrl":"https://doi.org/10.1109/ICNP.2005.25","url":null,"abstract":"IPSec has become the defacto standard protocol for secure Internet communications, providing traffic integrity, confidentiality and authentication. Although IPSec supports a rich set of protection modes and operations, its policy configuration remains a complex and error-prone task. The complex semantics of IP Sec policies that allow for triggering multiple rule actions with different security modes/operations coordinated between different IPSec gateways in the network increases significantly the potential of policy misconfiguration and thereby insecure transmission. Successful deployment of IPSec requires thorough and automated analysis of the policy configuration consistency for IPSec devices across the entire network. In this paper, we present a generic model that captures various filtering policy semantics using Boolean expressions. We use this model to derive a canonical representation for IPSec policies using ordered binary decision diagrams. Based on this representation, we develop a comprehensive framework to classify and identify conflicts that could exist in a single IPSec device (intra-policy conflicts) or between different IPSec devices (inter-policy conflicts) in enterprise networks. Our testing and evaluation study on different network environments demonstrates the effectiveness and efficiency of our approach.","PeriodicalId":191961,"journal":{"name":"13TH IEEE International Conference on Network Protocols (ICNP'05)","volume":"51 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":"121425550","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}

引用次数: 154