{"title":"Simple and Accurate Identification of High-Rate Flows by Packet Sampling","authors":"N. Kamiyama, Tatsuya Mori","doi":"10.1109/INFOCOM.2006.324","DOIUrl":"https://doi.org/10.1109/INFOCOM.2006.324","url":null,"abstract":"Unfairness among best-effort flows is a serious problem on the Internet. In particular, UDP flows or unresponsive flows that do not obey the TCP flow control mechanism can consume a large share of the available bandwidth. High-rate flows seriously affect other flows, so it is important to identify them and limit their throughput by selectively dropping their packets. As link transmission capacity increases and the number of active flows increases, however, capturing all packet information becomes more difficult. In this paper, we propose a novel method of identifying high-rate flows by using sampled packets. The proposed method simply identifies flows from which Y packets are sampled without timeout. The identification principle is very simple and the implementation is easy. We derive the identification probability for flows with arbitrary flow rates and obtain an identification curve that clearly demonstrates the accuracy of identification. The characteristics of this method are determined by three parameters: the identification threshold Y , the timeout coefficient K, and the sampling interval N . To match the experimental identification probability to the theoretical one and to simplify the identification mechanism, we should set K to the maximum allowable value. Although increasing Y improves the identification accuracy, both the required memory size and the processing power grow as Y increases. Numerical evaluation using an actual packet trace demonstrated that the proposed method achieves very high identification accuracy with a much simpler mechanism than that of previously proposed methods.","PeriodicalId":163725,"journal":{"name":"Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications","volume":"83 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":"121584755","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":"Wireless Operators in a Shared Spectrum","authors":"M. Félegyházi, J. Hubaux","doi":"10.1109/INFOCOM.2006.150","DOIUrl":"https://doi.org/10.1109/INFOCOM.2006.150","url":null,"abstract":"Cellular networks are notoriously difficult to design and operate; in particular, defining the optimal location of the base stations and fine tuning their configuration parameters is very challenging. For this reason, government agencies (such as the FCC for the US) usually sell or rent, for example by auction, each operator a frequency band for its exclusive usage in a given country or region. Only a small part of the whole spectrum is allocated as a shared spectrum, in which networks function in the same (unlicensed) frequency band.","PeriodicalId":163725,"journal":{"name":"Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications","volume":"98 15","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121016503","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":"Oscillations with TCP-Like Flow Control in Networks of Queues","authors":"M. Andrews, Aleksandrs Slivkins","doi":"10.1109/INFOCOM.2006.105","DOIUrl":"https://doi.org/10.1109/INFOCOM.2006.105","url":null,"abstract":"We consider a set of flows passing through a set of servers. The injection rate into each flow is governed by a flow control that increases the injection rate when all the servers on the flow's path are empty and decreases the injection rate when some server is congested. We show that if each server's congestion is governed by the arriving traffic at the server then the system can *oscillate*. This is in contrast to previous work on flow control where congestion was modeled as a function of the flow injection rates and the system was shown to converge to a steady state that maximizes an overall network utility.","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-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131133750","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":"Maximum Throughput Routing of Traffic in the Hose Model","authors":"M. Kodialam, T. V. Lakshman, S. Sengupta","doi":"10.1109/INFOCOM.2006.91","DOIUrl":"https://doi.org/10.1109/INFOCOM.2006.91","url":null,"abstract":"A computer-implemented method of computing throughput of a data-routing scheme for a network of nodes interconnected by links and having at least one ingress point and at least one egress point. The method includes: deriving a polynomial-size linear program from a combination of a first linear program and a second linear program and solving the polynomial-size linear program. The first linear program has infinite constraints and minimizes maximum-link utilization of a link in a path between the ingress point and the egress point. The second linear program determines whether any constraint of the first linear program is violated.","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-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129678320","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":"Security: Cross Layer Protocol in Wireless Sensor Network","authors":"R. Muraleedharan, L. Osadciw","doi":"10.1109/INFOCOM.2006.89","DOIUrl":"https://doi.org/10.1109/INFOCOM.2006.89","url":null,"abstract":"Application such as health monitoring, disaster relief mission, etc. require secure communication of messages. In this paper, we propose a novel approach of using an evolutionary algorithm with self adapting nature to avoid denial of service (DoS) attack. This approach is best suited for applications where energy and computation power is sparse. Detection of DoS claims and countermeasures taken while maximizing quality of service (QoS) is explained with results.","PeriodicalId":163725,"journal":{"name":"Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications","volume":"31 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":"124910490","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":"General Purpose Fault Injector for CORBA Applications","authors":"Mohammad Alsaeed","doi":"10.1145/1377943.1377954","DOIUrl":"https://doi.org/10.1145/1377943.1377954","url":null,"abstract":"Testing distributed systems and protocols for dependability, fault-tolerance and performance in the real target environment is not usually possible. This is attributed to the cost of setting up a hosting distributed environment and the difficulty of controlling such a dynamic environment. This paper presents a general purpose tool that emulates a distributed networked environment at the application level and gives the user full control over the emulation environment.","PeriodicalId":163725,"journal":{"name":"Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications","volume":"4 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":"125804348","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":"GMPLS-Based Dynamic Provisioning and Traffic Engineering of High-Capacity Ethernet Circuits in Hybrid Optical/Packet Networks","authors":"Xi Yang, Chris Tracy, J. Sobieski, T. Lehman","doi":"10.1109/INFOCOM.2006.34","DOIUrl":"https://doi.org/10.1109/INFOCOM.2006.34","url":null,"abstract":"Rapid progress in deployment of national and regional optical network infrastructures holds the promise to provide abundant, inexpensive bandwidth to scientific communities. The expectation is that this will provide a catalyst for innovation across a range of eScience applications. However, there remains considerable architecture and research work in order to allow such applications to access a common shared high-speed infrastructure efficiently and flexibly. This paper presents an experimental solution currently being designed and tested over the Dynamic resource allocation via GMPLS optical networks (DRAGON) and the Internet2 hybrid optical and packet infrastructure (HOPI). This implementation provides deterministic network services to high-end eScience applications in the form of Ethernet \"circuits\" using GMPLS to dynamically provision user specific VLAN based configurations. This requires addressing several research issues associated with multi-layer networks, interdomain routing, signaling, and multi-constraint path computation. The larger vision is that of a shared infrastructure consisting of multiple network technology layers over which an intelligent control plane can provide for a unified service model. The instantiation described here of Ethernet over WDM provides an ideal platform for both experimental research and, real services, and a migration path to a production infrastructure.","PeriodicalId":163725,"journal":{"name":"Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications","volume":"58 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":"122536847","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":"Enhancing QoS for Delay-Tolerant Multimedia Applications: Resource Utilization and Scheduling from a Service Provider's Perspective","authors":"Saraswathi Krithivasan","doi":"10.1109/INFOCOM.2006.71","DOIUrl":"https://doi.org/10.1109/INFOCOM.2006.71","url":null,"abstract":"Emerging applications such as distance education and corporate training are examples of delay tolerant multimedia applications, where clients request the start of play back at a convenient time specified by (t+di) where t is the current time and di is the delay tolerance acceptable to client i. Such applications typically involve a Closed User Group (CUG) network that exhibits heterogeneous characteristics, where a Content Service Provider (CSP) disseminates multimedia content to geographically dispersed clients. Our research deals with the issue of maximizing rates (quality) at the clients while satisfying their delay tolerance with minimal additional resources. As a first step to this end, we have developed an optimization-based approach to determine the best quality that can be delivered to the clients through judicious placement of resources such as buffers and transcoders. Simulation results demonstrate the usefulness of exploiting client delay tolerance specifications for delivering enhanced Quality of Service (QoS) with little or no additional resources. By maximizing QoS to the clients with given resources, CSPs can (1) maximize the utilization of links (2) provide differentiated services to their clients, and (3) offer upgraded services to some clients (which may have a revenue implication). Our ongoing work deals with scheduling and admission control issues which would maximize profits for the CSP while satisfying the admitted clients' requirements with optimal resource utilization.","PeriodicalId":163725,"journal":{"name":"Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications","volume":"37 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":"128739637","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":"Capacity-Constrained Design of Resilient Multi-Tier Wireless Mesh Networks","authors":"R. Raghuraman, S. Iyer","doi":"10.1109/INFOCOM.2006.84","DOIUrl":"https://doi.org/10.1109/INFOCOM.2006.84","url":null,"abstract":"We investigate the issue of automated design of wireless mesh networks (WMN). The general scenario we envision is that of constructing WMNs with WLAN networks as clients (tier 1) and a mesh network (tier 2) to provide inter-WLAN as well as gateway connectivity. Our main aim in this work is to a) design capacity-constrained WMNs, b) build resilient WMNs with transient demands.","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":"129740252","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":"Ethernet Fabric Routing (UETS/EFR) - A Hierarchical, Scalable and Secure Ultrahigh Speed Switching Architecture","authors":"Jose Morales Barroso, G. Fernandez","doi":"10.1109/INFOCOM.2006.26","DOIUrl":"https://doi.org/10.1109/INFOCOM.2006.26","url":null,"abstract":"In this paper we try to answer a fundamental question: how to build the next generation network without disruption. The TCP/IP protocol stack has performance limits and the transparent bridge paradigm of Ethernets is complex to scale by lack of addressing hierarchy. To provide both full scalability and high performance, a new Ethernet switching architecture named universal Ethernet telecommunications service (UETS) is proposed, capable of performances in the range of terabits per second. It is based on hardware switching of Ethernet frames using topological and hierarchically assigned standard local MAC addresses, technique named Ethernet fabric routing (EFR). The architecture solves Ethernet's scalability and security problems, has low cost/performance ratio and is compatible with existing Ethernet and IP networks, providing a non disruptive migration path to high performance networks and overcoming TCP/IP performance limitations. The objective is to promote a new standard for UETS/EFR architecture, suitable for high performance specialized island networks that may operate together as an overlay network.","PeriodicalId":163725,"journal":{"name":"Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications","volume":"4 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":"126690460","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}