2009 17th IEEE International Conference on Network Protocols最新文献_第4页

Autonomous deployment of heterogeneous mobile sensors 异构移动传感器的自主部署

2009 17th IEEE International Conference on Network Protocols Pub Date : 2009-11-20 DOI: 10.1109/ICNP.2009.5339698

N. Bartolini, T. Calamoneri, T. L. Porta, A. Massini, S. Silvestri

引用次数: 57

A hash-based scalable IP lookup using Bloom and fingerprint filters 基于散列的可扩展IP查找，使用Bloom和指纹过滤器

2009 17th IEEE International Conference on Network Protocols Pub Date : 2009-11-20 DOI: 10.1109/ICNP.2009.5339676

Heeyeol Yu, R. Mahapatra, L. Bhuyan

{"title":"A hash-based scalable IP lookup using Bloom and fingerprint filters","authors":"Heeyeol Yu, R. Mahapatra, L. Bhuyan","doi":"10.1109/ICNP.2009.5339676","DOIUrl":"https://doi.org/10.1109/ICNP.2009.5339676","url":null,"abstract":"Several challenges in the IP lookup architecture must be addressed for a high-speed forwarding in a large scale routing table: power, memory, and lookup complexity. Hash-based architectures have lookup schemes that are recognized for being both power and memory efficient due to their O(1) lookup, in contrast to other contemporary architectures. In this paper, we propose a novel hash architecture to address these issues by using pipelined Bloom and fingerprint filters for a binary searching in keys. The proposed hash scheme encodes keys' indexes to an on-chip fingerprint table, approximately returns a few indexes in a key query without pointer overhead, and makes a perfect match in an off-chip key table. Due to a memory banking system in pipeline stages, we can achieve O(1) pipelined throughput complexity of insertion, deletion, and query operations. For the IP lookup, a Lulea bitmap with our hash scheme supports a prefix lookup without inflating the numbers of prefixes and next-hops, so that our scalable hash-based scheme can achieve the worst case O(1) IP lookup. The simulation with large scale routing tables shows that our IP lookup scheme offers 4.5 and 50.1 times memory and power efficiencies than other contemporary hash and TCAM schemes, respectively.","PeriodicalId":439867,"journal":{"name":"2009 17th IEEE International Conference on Network Protocols","volume":"38 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128769760","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

Resilient routing of variable traffic with performance guarantees 具有性能保证的可变流量弹性路由

2009 17th IEEE International Conference on Network Protocols Pub Date : 2009-11-01 DOI: 10.1109/ICNP.2009.5339683

M. Kodialam, T. V. Lakshman, S. Sengupta

{"title":"Resilient routing of variable traffic with performance guarantees","authors":"M. Kodialam, T. V. Lakshman, S. Sengupta","doi":"10.1109/ICNP.2009.5339683","DOIUrl":"https://doi.org/10.1109/ICNP.2009.5339683","url":null,"abstract":"Two-phase routing, where traffic is first distributed to intermediate nodes before being routed to the final destination, has been recently proposed [11], [12], [20] for handling widely fluctuating traffic without the need to adapt network routing to changing traffic. Pre-configuring the network in a traffic independent manner using two-phase routing simplifies network operation considerably. In this paper, we extend this routing scheme by providing resiliency against link failures through shared backup path restoration. We view this as important progress towards adding carrier-class reliability to the robustness of the scheme so as to facilitate its future deployment in Internet Service Provider (ISP) networks. In shared backup path restoration, each connection consists of a link-disjoint primary and backup path pair - two backup paths can share bandwidth on their common links if their primary paths are link disjoint. We show that the optimization problem for maximum throughput two-phase routing with shared backup path restoration is NP-hard. Assuming an approximation oracle for a certain disjoint paths problem (called SBPR-DISJOINT-PATHS, which is also NP-hard) involving the dual variables of a path indexed linear programming formulation for the problem, we design a combinatorial algorithm with provable guarantees. We also provide heuristics for finding approximating solutions to the SBPR-DISJOINT-PATHS problem. We evaluate the throughput performance and number of intermediate nodes in two-phase routing for the above and other restoration mechanisms for two-phase routing on actual ISP topologies collected for the Rocketfuel project [18].","PeriodicalId":439867,"journal":{"name":"2009 17th IEEE International Conference on Network Protocols","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128452959","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}

引用次数: 8

End-to-end versus hop-by-hop soft state refresh for multi-hop signaling systems 多跳信令系统的端到端与逐跳软状态刷新

2009 17th IEEE International Conference on Network Protocols Pub Date : 2009-10-01 DOI: 10.1109/ICNP.2009.5339687

Xiaoming Fu, Jianhua He

{"title":"End-to-end versus hop-by-hop soft state refresh for multi-hop signaling systems","authors":"Xiaoming Fu, Jianhua He","doi":"10.1109/ICNP.2009.5339687","DOIUrl":"https://doi.org/10.1109/ICNP.2009.5339687","url":null,"abstract":"To ensure state synchronization of signalling operations, many signaling protocol designs choose to establish “soft” state that expires if it is not refreshed. The approaches of refreshing state in multi-hop signaling system can be classified as either end-to-end (E2E) or hop-by-hop (HbH). Although both state refresh approaches have been widely used in practical signaling protocols, the design tradeoffs between state synchronization and signaling cost have not yet been fully investigated. In this paper, we investigate this issue from the perspectives of state refresh and state removal. We propose simple but effective Markov chain models for both approaches and obtain closed-form solutions which depict the state refresh performance in terms of state consistency and refresh message rate, as well as the state removal performance in terms of state removal delay. Simulations verify the analytical models. It is observed that the HbH approach yields much better state synchronization at the cost of higher signaling cost than the E2E approach. While the state refresh performance can be improved by increasing the values of state refresh and timeout timers, the state removal delay increases largely for both E2E and HbH approaches. The analysis here shed lights on the design of signaling protocols and the configuration of the timers to adapt to changing network conditions.","PeriodicalId":439867,"journal":{"name":"2009 17th IEEE International Conference on Network Protocols","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125379769","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}

引用次数: 2

Message from the general chairs 来自主席的信息

2009 17th IEEE International Conference on Network Protocols Pub Date : 1900-01-01 DOI: 10.1109/RSP.2006.23

H. Schulzrinne, K. Ramakrishnan

引用次数: 0