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

Seeing the Difference in IP Traffic: Wireless Versus Wireline 看到IP流量的差异:无线与有线

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications Pub Date : 2006-12-01 DOI: 10.1109/INFOCOM.2006.292

J. Ridoux, A. Nucci, D. Veitch

{"title":"Seeing the Difference in IP Traffic: Wireless Versus Wireline","authors":"J. Ridoux, A. Nucci, D. Veitch","doi":"10.1109/INFOCOM.2006.292","DOIUrl":"https://doi.org/10.1109/INFOCOM.2006.292","url":null,"abstract":"With the explosive growth of the Internet over the last 10 years, a lot of work has been dedicated to understanding the underlying mechanisms of wired IP traffic. Recently, the rapid deployment of large-scale wireless infrastructures in various environments and the interesting mixture of traffic carried coupled with the large diversity of devices accessing the medium (Cell-phones, Laptops, PDAs) have triggered the attention and curiosity of the research community. This paper analyzes in depth the properties of several large traces of packet data collected between the wireless access point and the IP cloud from an operational wireless service provider. We determine unambiguously the influence of network variables such as the arrival patterns of packet and flows, flow durations and flow interactions, on the aggregate statistics of TCP traffic. In doing so, we highlight the main differences and similarities between wireless and wired IP traffic, and between the two directions (from wireless devices to IP cloud and vice-versa), and show how they can be distinguished. The resulting insights provide a foundation for models of such traffic, necessary for improved resource allocation schemes as well as for the effectiveness of future services and applications.","PeriodicalId":163725,"journal":{"name":"Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123239132","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}

引用次数: 31

Provisioning Quality Controlled Medium Access in UltraWideBand-Operated WPANs 在超宽带操作的广域网中提供质量控制的介质访问

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications Pub Date : 2006-12-01 DOI: 10.1109/INFOCOM.2006.151

Chunyu Hu, Hwangnam Kim, J. Hou, Dennis Chi, S. Nandagopalan

{"title":"Provisioning Quality Controlled Medium Access in UltraWideBand-Operated WPANs","authors":"Chunyu Hu, Hwangnam Kim, J. Hou, Dennis Chi, S. Nandagopalan","doi":"10.1109/INFOCOM.2006.151","DOIUrl":"https://doi.org/10.1109/INFOCOM.2006.151","url":null,"abstract":"Quality of service (QoS) provisioning is one of the most important criteria in newly emerging UWB-operated WPANs, as they are expected to support a wide variety of applica- tions from time-constrained, multimedia streaming to throughput- hungry, content transfer applications. As such, the Enhanced Distributed Coordinated Access (EDCA) mechanism has been adopted by MultiBand OFDM Alliance in its UWB MAC proposal. In this paper, we conduct a rigorous, comprehensive, theoretical analysis and show that with the currently recommended parame- ter setting, EDCA cannot provide adequate QoS. In particular, without responding to the system dynamics (e.g., taking into account of the number of active class-i stations), EDCA cannot allocate bandwidth in a deterministic proportional manner and the system bandwidth is under-utilized. After identifying the deficiency of EDCA, we propose, in compliance with the EDCA-incorporated UWB MAC protocol proposed in (15) (20), a framework, along with a set of theoretically grounded methods for controlling medium access with determin- istic QoS for UWB networks. We show that in this framework, 1) real-time traffic is guaranteed of deterministic bandwidth via a contention-based reservation access method; 2) best-effort traffic is provided with deterministic proportional QoS; and moreover, 3) the bandwidth utilization is maximized. We have also validated and evaluated the QoS provisioning capability and practicality of the proposed MAC framework both via simulation and empirically by leveraging the MADWifi (Multiband Atheros Driver for WiFi) Linux driver for Wireless LAN devices with the Atheros chipset.","PeriodicalId":163725,"journal":{"name":"Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114891458","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}

引用次数: 37

Cooperative Data-Optical InterNetworking: Distributed Multi-Layer Optimization 协同数据光互联网络:分布式多层优化

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications Pub Date : 2006-12-01 DOI: 10.1109/INFOCOM.2006.165

A. Elwalid, D. Mitra, Qiong Wang

{"title":"Cooperative Data-Optical InterNetworking: Distributed Multi-Layer Optimization","authors":"A. Elwalid, D. Mitra, Qiong Wang","doi":"10.1109/INFOCOM.2006.165","DOIUrl":"https://doi.org/10.1109/INFOCOM.2006.165","url":null,"abstract":"We present a novel approach for joint optical network provisioning and IP traffic engineering, in which the IP and optical networks collaboratively optimize a combined objective of network performance and lightpath provisioning cost. We develop a framework for distributed multi-layer optimization. Our framework is built upon the IP-over-Optical (IPO) overlay model, where each network domain has a limited view of the other. Our formulation allows the two domains to communicate and coordinate their decisions through minimal information exchange. Our solution is based on a novel application of Generalized Bender’s Decomposition, which divides a difficult global optimization problem into tractable sub-problems, each solved by a different domain. The procedure is iterative and converges to the global optimum. We present case studies to demonstrate the efficiency and applicability of our approach in various networking scenarios. Our work builds a foundation for “multi-layer” grooming, which extends traditional grooming in the optical domain to data networks. The data networks are active participants in the grooming process with intelligent homing of data traffic to optical gateways.","PeriodicalId":163725,"journal":{"name":"Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121547838","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}

引用次数: 7

Fault-Tolerance in Sensor Networks: A New Evaluation Metric 传感器网络容错性:一种新的评价指标

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications Pub Date : 2006-12-01 DOI: 10.1109/INFOCOM.2006.270

Arunabha Sen, B. Shen, Ling Zhou, Bin Hao

{"title":"Fault-Tolerance in Sensor Networks: A New Evaluation Metric","authors":"Arunabha Sen, B. Shen, Ling Zhou, Bin Hao","doi":"10.1109/INFOCOM.2006.270","DOIUrl":"https://doi.org/10.1109/INFOCOM.2006.270","url":null,"abstract":"A new metric for measuring the fault-tolerance capability of a multihop wireless sensor network is introduced in this paper. Most of the studies on fault-tolerance in sensor networks use connectivity as the metric of fault-tolerance. If the underlying network is k-connected, it can tolerate up to k − 1 failures. In measuring fault tolerance in terms of connectivity, no assumption regarding the locations of the failed sensor nodes is made they may be very close to each other or very far from each other. In other words, the connectivity metric fails to capture any notion of locality of faults. However, in sensor networks, it is highly likely that the faults will be localized. This is particularly true in military applications, where an enemy bomb may inflict massive but localized damage to the sensor network. To capture the notion of locality in fault-tolerance, we introduce the notion of region-based connectivity. The region-based connectivity of a network may be informally defined to be the minimum number of nodes within a region whose failure will disconnect the network. Obviously, the notion of region-based connectivity is tied to the notion of a region. A region may be defined in several different ways and they are discussed in detail in the paper. The attractive feature of the region-based connectivity as the fault-tolerance metric is that it can achieve the same level of fault-tolerance as the traditional metric connectivity, but requires much lower transmission power for the sensor nodes. We provide both analytical as well as extensive simulation results to support our claim.","PeriodicalId":163725,"journal":{"name":"Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131093818","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}

引用次数: 80

Optimal Power, Throughput and Routing for Wireless Link Arrays 无线链路阵列的最佳功率、吞吐量和路由

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications Pub Date : 2006-12-01 DOI: 10.1109/INFOCOM.2006.201

F. Baccelli, N. Bambos, Carri W. Chan

引用次数: 21

Accelerating Simulation of Large-Scale IP Networks: A Network Invariant Preserving Approach 大规模IP网络加速仿真:一种网络不变性保持方法

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications Pub Date : 2006-12-01 DOI: 10.1109/INFOCOM.2006.185

Hwangnam Kim, Hyuk Lim, J. Hou

{"title":"Accelerating Simulation of Large-Scale IP Networks: A Network Invariant Preserving Approach","authors":"Hwangnam Kim, Hyuk Lim, J. Hou","doi":"10.1109/INFOCOM.2006.185","DOIUrl":"https://doi.org/10.1109/INFOCOM.2006.185","url":null,"abstract":"In this paper, we propose a simulation framework, TranSim, that reduces the rate at which packet-events are generated, in order to accelerate large-scale simulation of IP networks with TCP/UDP traffic. Conceptually, we transform an IP network into an alternate network that generates a smaller number of packet events, carry out simulation in the “transformed” network, and then extrapolate simulation results for the original network from those obtained in the “transformed” network. We formally prove that if the network invariant — the bandwidthdelay product — is preserved, the network dynamics, such as the queue dynamics and the packet dropping probability at each link, and TCP dynamics, such as the congestion window, RTTs, and rate dynamics, remain unchanged in the process of network transformation. We have implemented TranSim in ns-2, and conducted an empirical study to evaluate it against packet level simulation, with respect to the capability of capturing transient, packet level network dynamics, the reduction in the execution time and the memory usage, and the discrepancy in the system throughput. The simulation results indicate maximally two orders of magnitude improvement in the execution time and the performance improvement becomes more prominent as the network size increases (in terms of the number of nodes, the number of flows, the complexity of topology, and link capacity) or as the degree of downsizing increases. The memory usage incurred in TranSim is comparable to that in packet level simulation. The error discrepancy between TranSim and packet level simulation, on the other hand, is between 1-10 % in a wide variety of network topologies, inclusive of randomly generated topologies, and traffic loads with various AQM strategies.","PeriodicalId":163725,"journal":{"name":"Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications","volume":"250 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116162105","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}

引用次数: 10

How to Construct a Correct and Scalable iBGP Configuration 如何构建正确且可扩展的iBGP配置

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications Pub Date : 2006-12-01 DOI: 10.1109/INFOCOM.2006.122

Mythili Vutukuru, Paul Valiant, Swastik Kopparty, H. Balakrishnan

{"title":"How to Construct a Correct and Scalable iBGP Configuration","authors":"Mythili Vutukuru, Paul Valiant, Swastik Kopparty, H. Balakrishnan","doi":"10.1109/INFOCOM.2006.122","DOIUrl":"https://doi.org/10.1109/INFOCOM.2006.122","url":null,"abstract":"The Border Gateway Protocol (BGP), the current inter domain routing protocol in the Internet, has two modes of operation: eBGP (External BGP), used to exchange routing information between autonomous systems, and iBGP (Internal BGP), used to propagate that information within an autonomous system (AS). This paper focuses on the construction of an iBGP session configuration that guarantees two correctness properties—loop-free forwarding paths and complete visibility to all eBGP-learned best routes— while attempting to minimize the number of iBGP sessions (for scalability) and ensuring that the constructed configuration guarantees the two correctness properties even in the face of link failures and IGP path changes. Our algorithm constructs an iBGP configuration based on route reflectors [2], a commonly used way to control the number of iBGP sessions. The algorithm, BGPSep, uses the notion of a graph separator, a (small) set of nodes that partition a graph into connected components of roughly equal sizes, recursively applies this idea to the connected components, and produces a route reflector hierarchy and the associated iBGP sessions. We prove that BGPSep guarantees the desired correctness properties, and evaluate an implementation of the BGPSep algorithm on several real-world and simulated network topologies. Across these topologies, we find that the number of iBGP sessions with BGPSep is a factor of 2.5 to 5× smaller than with a “full mesh” iBGP, while guaranteeing the desired correctness properties.","PeriodicalId":163725,"journal":{"name":"Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130347809","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}

引用次数: 50

Minimum User-Perceived Interference Routing in Service Composition 服务组合中最小用户感知干扰路由

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications Pub Date : 2006-12-01 DOI: 10.1109/INFOCOM.2006.206

Li Xiao, K. Nahrstedt

{"title":"Minimum User-Perceived Interference Routing in Service Composition","authors":"Li Xiao, K. Nahrstedt","doi":"10.1109/INFOCOM.2006.206","DOIUrl":"https://doi.org/10.1109/INFOCOM.2006.206","url":null,"abstract":"Service Composition is a promising technology for providing on-demand composed services in dynamic and loosely coupled peer-to-peer (P2P) networks. Because of system dynamics, such as the peer leaving from the system, end users may perceive interference from service disruptions. How to minimize the userperceived interference and provide Quality of Service guarantees to the composite services thus becomes important and challenging. In this paper, we take a novel approach to study the problem of minimum interference service composition with QoS guarantees. First, we propose a general analytic framework to model the interference and its intensity to the end users due to system dynamics. Based on this framework, the minimum interference routing problem is formulated. Then, we present an optimal solution to the problem through dynamic programming and investigate some optimization simplifications in special cases. We further propose a heuristic measure for fast interference calculation and design efficient routing algorithms by exploiting the local path recovery and reliable service paths. Our analysis and extensive simulations demonstrate that our model and algorithms can achieve much better performance than the traditional methods in finding service paths, with respect to decreasing the interference to end users, especially in the scenarios of stringent QoS requirement, highly dynamic networks, or the type of impatient users.","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-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130647774","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}

引用次数: 7

MMSN: Multi-Frequency Media Access Control for Wireless Sensor Networks 无线传感器网络的多频媒体访问控制

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications Pub Date : 2006-12-01 DOI: 10.1109/INFOCOM.2006.250

Gang Zhou, Chengdu Huang, Ting Yan, T. He, J. Stankovic, T. Abdelzaher

{"title":"MMSN: Multi-Frequency Media Access Control for Wireless Sensor Networks","authors":"Gang Zhou, Chengdu Huang, Ting Yan, T. He, J. Stankovic, T. Abdelzaher","doi":"10.1109/INFOCOM.2006.250","DOIUrl":"https://doi.org/10.1109/INFOCOM.2006.250","url":null,"abstract":"Multi-frequency media access control has been well understood in general wireless ad hoc networks, while in wireless sensor networks, researchers still focus on single frequency solutions. In wireless sensor networks, each device is typically equipped with a single radio transceiver and applications adopt much smaller packet sizes compared to those in general wireless ad hoc networks. Hence, the multi-frequency MAC protocols proposed for general wireless ad hoc networks are not suitable for wireless sensor network applications, which we further demonstrate through our simulation experiments. In this paper, we propose MMSN, which takes advantage of multi-frequency availability while, at the same time, takes into account the restrictions in wireless sensor networks. In MMSN, four frequency assignment options are provided to meet different application requirements. A scalable media access is designed with efficient broadcast support. Also, an optimal non-uniform backoff algorithm is derived and its lightweight approximation is implemented in MMSN, which significantly reduces congestion in the time synchronized media access design. Through extensive experiments, MMSN exhibits prominent ability to utilize parallel transmission among neighboring nodes. It also achieves increased energy efficiency when multiple physical frequencies are available.","PeriodicalId":163725,"journal":{"name":"Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131178028","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}

引用次数: 419

Two Level State Machine Architecture for Content Inspection Engines 内容检测引擎的两级状态机体系结构

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications Pub Date : 2006-12-01 DOI: 10.1109/INFOCOM.2006.281

M. Yazdani, W. Fraczak, Feliks J. Welfeld, I. Lambadaris

{"title":"Two Level State Machine Architecture for Content Inspection Engines","authors":"M. Yazdani, W. Fraczak, Feliks J. Welfeld, I. Lambadaris","doi":"10.1109/INFOCOM.2006.281","DOIUrl":"https://doi.org/10.1109/INFOCOM.2006.281","url":null,"abstract":"Content inspection technology is promising to address the growing demands of network security and contentaware networking. The component of a network device responsible for content inspection is called Content Inspection Engine (CIE). In content inspection processing, both headers and payload of packets are parsed to determine their content and classify them based on administrative policies. Due to the inclusion of complex payload processing in content inspection, a large amount of processing is required for each data packet, making content inspection a primary bottleneck in high performance routers that support gigabit link capacities. Therefore, there is a need for solutions that can inspect packets quickly with reasonable amount of storage requirements. We describe an architecture based on high performance state machines which provides an efficient solution to this problem by processing multiple characters per state transition. In this architecture the CIE is implemented on a Two-Level State Machine (TLSM). The TLSM implementation exploits the dependencies of policy rules to compress the policy and reduce memory requirements. Using TCAM units in the TLSM for performing fast multiple-character matching operations, makes a wire-speed content inspection possible. We also propose to use a new criterion called worstcase throughput as an appropriate metric for speed evaluation of CIEs. It is shown that this criterion can be efficiently calculated by applying existing algorithms for the Minimum Weight to Time Ratio problem, to a graph-based model of the functionality of CIEs.","PeriodicalId":163725,"journal":{"name":"Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124188795","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}

引用次数: 3