Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications最新文献_第10页

Energy-Efficient Interference-Based Routing for Multi-Hop Wireless Networks 基于多跳无线网络的高能效干扰路由

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications Pub Date : 2006-04-23 DOI: 10.1109/INFOCOM.2006.199

Sungoh Kwon, N. Shroff

引用次数: 62

Tunnel Vector: A New Routing Algorithm with Scalability 隧道向量:一种新的可扩展性路由算法

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications Pub Date : 2006-04-23 DOI: 10.1109/INFOCOM.2006.53

Cheng-Jia Lai, R. Muntz

{"title":"Tunnel Vector: A New Routing Algorithm with Scalability","authors":"Cheng-Jia Lai, R. Muntz","doi":"10.1109/INFOCOM.2006.53","DOIUrl":"https://doi.org/10.1109/INFOCOM.2006.53","url":null,"abstract":"Routing algorithms such as Distance Vector and Link States have the routing table size as Omega (n), where n is the number of destination identifiers, thus providing only limited scalability for large networks when n is high. As the distributed hash table (DHT) techniques are extraordinarily scalable with n, our work aims at adapting a DHT approach to the design of a network- layer routing algorithm so that the average routing table size can be significantly reduced to O (log n) without losing much routing efficiency. Nonetheless, this scheme requires a major breakthrough to address some fundamental challenges. Specifically, unlike a DHT, a network-layer routing algorithm must (1) exchange its control messages without an underlying network, (2) handle link insertion/deletion and link-cost updates, and (3) provide routing efficiency. Thus, we are motivated to propose a new network-layer routing algorithm, Tunnel Vector (TV), using DHT-like multilevel routing without an underlying network. TV exchanges its control messages only via physical links and is self-configurable in response to linkage updates. In TV, the routing path of a packet is near optimal while the routing table size is O(log n) per node, with high probability. Thus, TV is suitable for routing in a very large network.","PeriodicalId":163725,"journal":{"name":"Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131404729","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

VADD: Vehicle-Assisted Data Delivery in Vehicular Ad Hoc Networks VADD:车辆自组织网络中的车辆辅助数据传输

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications Pub Date : 2006-04-23 DOI: 10.1109/TVT.2007.901869

J. Zhao, G. Cao

引用次数: 1340

Sketch Guided Sampling - Using On-Line Estimates of Flow Size for Adaptive Data Collection 草图引导抽样-使用在线估计流量大小自适应数据收集

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications Pub Date : 2006-04-23 DOI: 10.1109/INFOCOM.2006.326

Abhishek Kumar, Jun Xu

{"title":"Sketch Guided Sampling - Using On-Line Estimates of Flow Size for Adaptive Data Collection","authors":"Abhishek Kumar, Jun Xu","doi":"10.1109/INFOCOM.2006.326","DOIUrl":"https://doi.org/10.1109/INFOCOM.2006.326","url":null,"abstract":"Monitoring the traffic in high-speed networks is a data intensive problem. Uniform packet sampling is the most popular technique for reducing the amount of data the network monitoring hardware/software has to process. However, uniform sampling captures far less information than can be potentially obtained with the same overall sampling rate. This is because uni- form sampling (unnecessarily) draws the vast majority of samples from large flows, and very few from small and medium flows. This information loss on small and medium flows significantly affects the accuracy of the estimation of various network statistics. In this work, we develop a new packet sampling methodol- ogy called \"sketch-guided sampling\" (SGS), which offers better statistics than obtainable from uniform sampling, given the same number of raw samples gathered. Its main idea is to make the probability with which an incoming packet is sampled a decreasing sampling function f of the size of the flow the packet belongs to. This way our scheme is able to significantly increase the packet sampling rate of the small and medium flows at slight expense of the large flows, resulting in much more accurate estimations of various network statistics. However, the exact sizes of all flows are available only if we keep per-flow information for every flow, which is prohibitively expensive for high-speed links. Our SGS scheme solves this problem by using a small (lossy) synopsis data structure called counting sketch to encode the approximate sizes of all flows. Our evaluation on real-world Internet traffic traces shows that our sampling theory based the approximate flow size estimates from the counting sketch works almost as well as if we know the exact sizes of the flows.","PeriodicalId":163725,"journal":{"name":"Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116948638","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}

引用次数: 112

Dynamic Lightpath Scheduling in Next-Generation WDM Optical Networks 下一代WDM光网络中的动态光路调度

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications Pub Date : 2006-04-23 DOI: 10.1109/INFOCOM.2006.31

Lu Shen, A. Todimala, B. Ramamurthy, Xi Yang

{"title":"Dynamic Lightpath Scheduling in Next-Generation WDM Optical Networks","authors":"Lu Shen, A. Todimala, B. Ramamurthy, Xi Yang","doi":"10.1109/INFOCOM.2006.31","DOIUrl":"https://doi.org/10.1109/INFOCOM.2006.31","url":null,"abstract":"Lightpath scheduling is an important capability in next-generation wavelength-division multiplexing (WDM) optical networks to reserve resources in advance for a specified time period while provisioning end-to-end lightpaths. In this study, we propose an approach to support dynamic lightpath scheduling in such networks. To minimize blocking probability in a network that accommodates dynamic scheduled lightpath demands (D- SLDs), resource allocation should be optimized in a dynamic manner. However, for the network users who desire deterministic services, resources must be reserved in advance and guaranteed for future use. These two objectives may be mutually incompatible. Therefore, we propose a two-phase dynamic lightpath scheduling approach to tackle this issue. The first phase is the deterministic lightpath scheduling phase. When a lightpath request arrives, the network control plane schedules a path with guaranteed resources so that the user can get a quick response with the deterministic lightpath schedule. The second phase is the lightpath re-optimization phase, in which the network control plane re-provisions some already scheduled lightpaths. Experimental results show that our proposed two-phase dynamic lightpath scheduling approach can greatly reduce WDM network blocking.","PeriodicalId":163725,"journal":{"name":"Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123737685","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}

引用次数: 12

Self-Learning Collision Avoidance for Wireless Networks 无线网络的自学习避碰

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications Pub Date : 2006-04-23 DOI: 10.1109/INFOCOM.2006.315

Chun-cheng Chen, Eunsoo Seo, Hwangnam Kim, Haiyun Luo

{"title":"Self-Learning Collision Avoidance for Wireless Networks","authors":"Chun-cheng Chen, Eunsoo Seo, Hwangnam Kim, Haiyun Luo","doi":"10.1109/INFOCOM.2006.315","DOIUrl":"https://doi.org/10.1109/INFOCOM.2006.315","url":null,"abstract":"The limited number of orthogonal channels and the autonomous installations of hotspots and home wireless networks often leave neighboring 802.11 basic service sets (BSS’s) operating on the same or overlapping channels, therefore interfering with each other. However, the 802.11 MAC does not work well in resolving inter-BSS interferences due to the well-known hidden/exposed receiver problem, which has been haunting in the research community for more than a decade. In this paper we propose SELECT, an effective and efficient self-learning collision avoidance strategy to address the open hidden/exposed receiver problem in wireless networks. SELECT is based on the observation that carrier sense with received signal strength (RSS) measurements at the sender and the receiver are strongly correlated. A SELECT-enabled sender exploits such correlation using automated on-line learning algorithm, and makes informed judgment of the channel availability at the intended receiver. SELECT achieves collision avoidance at packetlevel time granularity, involves zero communication overhead, requires no hardware support beyond what is available in offthe-shelf 802.11 devices, and easily integrates with the 802.11 DCF. Our evaluation in both analysis and simulations show that SELECT addresses the hidden/exposed receiver problem well. In typical hidden/exposed receiver scenarios SELECT improves the throughput by up to 140% and channel access success ratio by up to 302%, while almost completely eliminating contention-induced data packet drops.","PeriodicalId":163725,"journal":{"name":"Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122831522","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}

引用次数: 29

SI-WF2Q: WF2Q Approximation with Small Constant Execution Overhead SI-WF2Q:具有小常数执行开销的WF2Q近似

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications Pub Date : 2006-04-23 DOI: 10.1109/INFOCOM.2006.268

M. Karsten

引用次数: 11

Reverse Hashing for High-Speed Network Monitoring: Algorithms, Evaluation, and Applications 高速网络监控的反向哈希:算法，评估和应用

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications Pub Date : 2006-04-23 DOI: 10.1109/INFOCOM.2006.203

R. Schweller, Zhichun Li, Yan Chen, Yan Gao, A. Gupta, Yin Zhang, P. Dinda, M. Kao, G. Memik

{"title":"Reverse Hashing for High-Speed Network Monitoring: Algorithms, Evaluation, and Applications","authors":"R. Schweller, Zhichun Li, Yan Chen, Yan Gao, A. Gupta, Yin Zhang, P. Dinda, M. Kao, G. Memik","doi":"10.1109/INFOCOM.2006.203","DOIUrl":"https://doi.org/10.1109/INFOCOM.2006.203","url":null,"abstract":"A key function for network traffic monitoring and analysis is the ability to perform aggregate queries over multiple data streams. Change detection is an important primitive which can be extended to construct many aggregate queries. The recently proposed sketches (Krishnamurthy, 2003) are among the very few that can detect heavy changes online for high speed links, and thus support various aggregate queries in both temporal and spatial domains. However, it does not preserve the keys (e.g., source IP address) of flows, making it difficult to reconstruct the desired set of anomalous keys. In an earlier abstract we proposed a framework for a reversible sketch data structure that offers hope for efficient extraction of keys (Schweller, 2004). However, this scheme is only able to detect a single heavy change key and places restrictions on the statistical properties of the key space. To address these challenges, we propose an efficient reverse hashing scheme to infer the keys of culprit flows from reversible sketches. There are two phases. The first operates online, recording the packet stream in a compact representation with negligible extra memory and few extra memory accesses. Our prototype single FPGA board implementation can achieve a throughput of over 16 Gbps for 40-byte-packet streams (the worst case). The second phase identifies heavy changes and their keys from the representation in nearly real time. We evaluate our scheme using traces from large edge routers with OC-12 or higher links. Both the analytical and experimental results show that we are able to achieve online traffic monitoring and accurate change/intrusion detection over massive data streams on high speed links, all in a manner that scales to large key space size. To the best of our knowledge, our system is the first to achieve these properties simultaneously.","PeriodicalId":163725,"journal":{"name":"Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129172521","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}

引用次数: 38

IEEE 802.11e: The Problem of the Virtual Collision Management Within EDCA IEEE 802.11e: EDCA中的虚拟碰撞管理问题

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications Pub Date : 2006-04-23 DOI: 10.1109/INFOCOM.2006.77

Mohamad El Masri

引用次数: 9

Hierarchical Broadcast Ring Architecture for High-Speed Ethernet Networks 高速以太网的分层广播环结构

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications Pub Date : 2006-04-23 DOI: 10.1109/INFOCOM.2006.24

Ho-deok Jang, Hyong S. Kim

{"title":"Hierarchical Broadcast Ring Architecture for High-Speed Ethernet Networks","authors":"Ho-deok Jang, Hyong S. Kim","doi":"10.1109/INFOCOM.2006.24","DOIUrl":"https://doi.org/10.1109/INFOCOM.2006.24","url":null,"abstract":"Recently, Ethernet technology has received a lot of attention for large area networks as well as local area networks (LANs) due to its economical advantage. However, the Ethernet technology has scalability issues when it is applied to large area networks. In this paper, we present hierarchical broadcast ring architecture that provides scalability to high-speed Ethernet networks. The proposed Ethernet switch-based network architecture adopts mechanisms of IP router-based networks. The logical ring topology of the architecture provides the broadcast service without a broadcast storm problem. A shortest path link-state routing is used for data forwarding for high link utilization. Furthermore, the hierarchical proxy ARP (Address Resolution Protocol) scheme and an aggregation scheme of IP addresses are proposed to reduce the number of broadcast frames and the forwarding table size. As a result, the hierarchical broadcast ring architecture can support millions of hosts with a high-speed Ethernet network. The proposed architecture maintains the simple and efficient management and operation of the Ethernet network for large area networks.","PeriodicalId":163725,"journal":{"name":"Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121346883","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}

引用次数: 5