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

{"title":"CONNET: self-controlled access links for delay and jitter requirements","authors":"M. El-Gendy, K. Shin, H. Fathy","doi":"10.1109/ICNP.2005.11","DOIUrl":"https://doi.org/10.1109/ICNP.2005.11","url":null,"abstract":"Access links are typically the bottleneck between a high bandwidth LAN and a high bandwidth IP network. Without a priori resource provisioning or reservation, this tends to have a serious effect on premium traffic from delay- and jitter-sensitive applications. This paper develops a new reservation-less mechanism for delay and jitter guarantees across \"single FIFO queue\" access links by controlling interfering non-premium traffic. The mechanism, called CONNET (CONtrolled NETwork), uses feedback regulation to create self-controlled network services capable of tracking delay and jitter references. We use a control-theoretic approach in designing the feedback loop based on a \"black-box\" model of the access link in both cases of single and multiple nodes. For robust control, we employ optimal Linear Quadratic Gaussian (LQG) regulator. We evaluate the performance of CONNET using a real testbed implementation showing its superiority to other rate-based schemes (such as CBQ and WFQ) in terms of simplicity, deployability, and accuracy","PeriodicalId":191961,"journal":{"name":"13TH IEEE International Conference on Network Protocols (ICNP'05)","volume":"1 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":"128480889","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}

{"title":"Exploiting dynamic querying like flooding techniques in unstructured peer-to-peer networks","authors":"Hongbo Jiang, Shudong Jin","doi":"10.1109/ICNP.2005.17","DOIUrl":"https://doi.org/10.1109/ICNP.2005.17","url":null,"abstract":"In unstructured peer-to-peer networks, controlled flooding aims at locating an item at the minimum message cost. Dynamic querying is a new controlled flooding technique. While it is implemented in some peer-to-peer networks, little is known about its undesirable behavior and little is known about its general usefulness in unstructured peer-to-peer networks. This paper describes the first evaluation and analysis of such techniques, and proposes novel techniques to improve them. We make three contributions. First, we find the current dynamic querying design is flawed. Although it is advantageous over the expanding ring algorithm in terms of search cost, it is much less attractive in terms of peer perceived latency, and its strict constraints on network connectivity prevent it from being widely adopted. Second, we propose an enhanced flooding technique which requires the search cost close to the minimum, reduces the search latency by more than four times, and loosens the constraints on the network connectivity. Thus, we make such techniques useful for the general unstructured peer-to-peer networks. Third, we show that our proposal requires only minor modifications to the existing search mechanisms and can be incrementally deployed in peer-to-peer networks.","PeriodicalId":191961,"journal":{"name":"13TH IEEE International Conference on Network Protocols (ICNP'05)","volume":"11 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":"115903985","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}

{"title":"Expected convergence properties of BGP","authors":"R. Viswanathan, Krishan K. Sabnani, Robert J. Holt, A. Netravali","doi":"10.1016/j.comnet.2011.02.003","DOIUrl":"https://doi.org/10.1016/j.comnet.2011.02.003","url":null,"abstract":"","PeriodicalId":191961,"journal":{"name":"13TH IEEE International Conference on Network Protocols (ICNP'05)","volume":"10 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":"127551102","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}

{"title":"On the stability of rational, heterogeneous interdomain route selection","authors":"Hao Wang, Haiyong Xie, Y. Yang, A. Silberschatz, Erran L. Li, Y. Liu","doi":"10.1109/ICNP.2005.28","DOIUrl":"https://doi.org/10.1109/ICNP.2005.28","url":null,"abstract":"The recent discovery of instability caused by the interaction of local routing policies of multiple ASes has led to extensive research on the subject. However, previous studies analyze stability under a specific route selection algorithm. In this paper, instead of studying a specific route selection algorithm, we study a general class of route selection algorithms which we call rational route selection algorithms. We present a sufficient condition to guarantee routing convergence in a heterogeneous network where each AS runs any rational route selection algorithm. Applying our general results, we study the potential instability of a network where the preference of an AS depends on not only its egress routes to the destinations but also its inbound traffic patterns (i.e., the distribution of incoming traffic from its neighbors). We show that there exist networks which will have persistent route oscillations even when the ASes strictly follow the constraints imposed by business considerations, and adopt any rational route selection algorithms.","PeriodicalId":191961,"journal":{"name":"13TH IEEE International Conference on Network Protocols (ICNP'05)","volume":"4 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":"127853447","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}

{"title":"Typed abstraction of complex network compositions","authors":"Azer Bestavros, A. Bradley, A. Kfoury, I. Matta","doi":"10.1109/ICNP.2005.44","DOIUrl":"https://doi.org/10.1109/ICNP.2005.44","url":null,"abstract":"The heterogeneity and open nature of network systems make analysis of compositions of components quite challenging, making the design and implementation of robust network services largely inaccessible to the average programmer. We propose the development of a novel type system and practical type spaces which reflect simplified representations of the results and conclusions which can be derived from complex compositional theories in more accessible ways, essentially allowing the system architect or programmer to be exposed only to the inputs and output of compositional analysis without having to be familiar with the ins and outs of its internals. Toward this end, we present the TRAFFIC (typed representation and analysis of flows for interoperability checks) framework, a simple flow-composition and typing language with corresponding type system. We then discuss and demonstrate the expressive power of a type space for TRAFFIC derived from the network calculus, allowing us to reason about and infer such properties as data arrival, transit, and loss rates in large composite network applications","PeriodicalId":191961,"journal":{"name":"13TH IEEE International Conference on Network Protocols (ICNP'05)","volume":"4 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":"126744118","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}

{"title":"Efficient hop ID based routing for sparse ad hoc networks","authors":"Yao Zhao, Bo Li, Qian Zhang, Yan Chen, Wenwu Zhu","doi":"10.1109/ICNP.2005.13","DOIUrl":"https://doi.org/10.1109/ICNP.2005.13","url":null,"abstract":"Routing in mobile ad hoc networks remains as a challenging problem given the limited wireless bandwidth, users' mobility and potentially large scale. Recently, there has been a thrust of research to address these problems, including on-demand routing, geographical routing, virtual coordinates, etc. In this paper, we focus on geographical routing, which was shown to achieve good scalability without flooding, but it usually requires location information and can suffer from the severe dead end problem especially in sparse networks. Specifically, we propose a new hop ID based routing protocol, which does not require any location information, yet achieves comparable performance with the shortest path routing. In addition, we design efficient algorithms for setting up the system and adapt to the node mobility quickly, and can effectively route out of dead ends. The extensive analysis and simulation show that the hop ID based routing achieves efficient routing for mobile ad hoc networks with various density, irregular topologies and obstacles","PeriodicalId":191961,"journal":{"name":"13TH IEEE International Conference on Network Protocols (ICNP'05)","volume":"31 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":"122096988","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}

{"title":"Efficient node admission for short-lived mobile ad hoc networks","authors":"Nitesh Saxena, G. Tsudik, J. Yi","doi":"10.1109/ICNP.2005.14","DOIUrl":"https://doi.org/10.1109/ICNP.2005.14","url":null,"abstract":"Admission control is an essential and fundamental security service in mobile ad hoc networks (MANETs). It is needed to securely cope with dynamic membership and topology and to bootstrap other important security primitives (such as key management) and services (such as secure routing) without the assistance of any centralized trusted authority. An ideal admission protocol must involve minimal interaction among the MANET nodes, since connectivity can be unstable. Also, since MANETs are often composed of weak or resource-limited devices, admission control must be efficient in terms of computation and communication. Most previously proposed admission control protocols are prohibitively expensive and require a lot of interaction among MANET nodes in order to securely reach limited consensus regarding admission and cope with potentially powerful adversaries. While the expense may be justified for long-lived group settings, short-lived MANETs can benefit from much less expensive techniques without sacrificing any security. In this paper, we consider short-lived MANETs and present a secure, efficient and a fully non-interactive admission control protocol for such networks. More specifically, our work is focused on novel applications of non-interactive secret sharing techniques based on bi-variate polynomials, but, unlike other results, the associated costs are very low","PeriodicalId":191961,"journal":{"name":"13TH IEEE International Conference on Network Protocols (ICNP'05)","volume":"14 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":"125039192","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}

{"title":"Optimal routing with multiple traffic matrices tradeoff between average and worst case performance","authors":"Chun Zhang, J. Kurose, D. Towsley, Zihui Ge, Yong Liu","doi":"10.1109/ICNP.2005.30","DOIUrl":"https://doi.org/10.1109/ICNP.2005.30","url":null,"abstract":"In this paper, we consider the problem of finding an \"efficient\" and \"robust\" set of routes in the face of changing/uncertain traffic. The changes/uncertainty in exogenous traffic is characterized by multiple traffic matrices. Our goal is to find a set of routes that result in good average case performance over the set of traffic matrices, while avoiding bad worst case performance for any single traffic matrix. With multiple traffic matrices, previous work aims solely to optimize the average case performance Chun Zhang, et al., (2005), or the worst case performance David Applegate, et al., (2003). For a given set of traffic matrices, different sets of routes offer a different tradeoff between the average case and the worst case performance. In this paper, we quantify the performance of a routing configuration at both network level and link level. We propose a simple metric-a weighted sum of the average case and the worst case performance-to control the tradeoff between these two considerations. Despite of its simple form, this metric is very effective. We prove that optimizing routing using this metric has desirable properties, such as the average case performance being a decreasing, convex and differentiable function to the worst case performance. By extending previous work Chun Zhang, et al., (2005) Bernard Fortz, et al., (2002), we derive methods to find the optimal routes with respect to the proposed metric for two classes of intra-domain routing protocols: MPLS and OSPF/IS-IS. We evaluate our approach with data collected from an operational tier-I ISP. For MPLS, we find that there exists significant tradeoff (e.g., 15%-23% difference) between optimizing solely on the average case performance and solely on the worst case performance. Our approach can identify solutions that can dramatically improve the worst case performance (13%-15%) while only slightly sacrificing the average case performance (2.2%-3%), in comparison to that by optimizing solely on the average case performance. For OSPF/IS-IS, we still find a significant difference between the two optimization objectives, however, a fine-grained tradeoff is difficult to achieve due to the limited control that OSPF/IS-IS provide.","PeriodicalId":191961,"journal":{"name":"13TH IEEE International Conference on Network Protocols (ICNP'05)","volume":"1 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":"133639375","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}

{"title":"The fundamental role of hop distance in IEEE 802.11 multi-hop ad hoc networks","authors":"Yan Gao, D. Chiu, John C.S. Lui","doi":"10.1109/ICNP.2005.41","DOIUrl":"https://doi.org/10.1109/ICNP.2005.41","url":null,"abstract":"In wireless networks, it is well understood what throughput can be achieved by nodes who can hear each other (i.e. nodes within a single cell). The effects of nodes beyond the sensing range (known as hidden nodes) on a sender are complicated and difficult to analyze. Consequently, how to analytically model multi-hop ad-hoc networks, specially networks based on the popular IEEE 802.11 standards remains largely open. In a recent paper, the throughput of a particular wireless network topology (linear network with a given number of hidden nodes) has been derived analytically. In this paper, we unify previous results on single-cell models, and results characterizing different types of hidden node interference and the analysis of C. Ng et al., (2004), to derive a general solution for throughput given a linear network of arbitrary density and transmission distance between source and destination nodes. An important insight from our model is that there is a certain transmission distance, which is less than the maximum transmission distance, that optimizes throughput in such networks. This result is verified using ns-2 simulation with both single as well as multiple flows.","PeriodicalId":191961,"journal":{"name":"13TH IEEE International Conference on Network Protocols (ICNP'05)","volume":"15 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":"133454314","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}

{"title":"MuON: epidemic based mutual anonymity","authors":"Neelesh Bansod, Ashish Malgi, B. Choi, Jean Mayo","doi":"10.1109/ICNP.2005.26","DOIUrl":"https://doi.org/10.1109/ICNP.2005.26","url":null,"abstract":"A mutually anonymous service hides the identity of a client from the service provider and vice-versa. Providing mutual anonymity usually requires a large number of participants. While peer-to-peer (P2P) networks are capable of recruiting a large number of participants, reliable anonymous communication in these architectures, with low bandwidth usage, still needs further investigation. This paper presents MuON, a protocol to achieve mutual anonymity in unstructured P2P networks. MuON leverages epidemic-style data dissemination to deal with the high churn (changes in system membership) characteristic of unstructured P2P networks. The results from our security analysis and simulation show that MuON provides mutual anonymity over unstructured P2P networks while maintaining predictable latencies, high reliability, and low communication overhead","PeriodicalId":191961,"journal":{"name":"13TH IEEE International Conference on Network Protocols (ICNP'05)","volume":"8 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":"117206157","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}