37th Annual IEEE Conference on Local Computer Networks最新文献

{"title":"An evaluation of fairness among heterogeneous TCP variants over 10Gbps high-speed networks","authors":"Lin Xue, Suman Kumar, Cheng Cui, Seung-Jong Park","doi":"10.1109/LCN.2012.6423645","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423645","url":null,"abstract":"Several high speed TCP variants are adopted by end users and therefore, heterogeneous congestion control has become the characteristic of newly emerging high-speed networks. In contrast to homogeneous TCP flows, fairness among heterogeneous TCP flows now depends on router parameters such as queue management scheme, buffer size, etc. To the best of our knowledge, this is the first evaluation of fairness among heterogeneous TCP variants over 10Gbps high-speed networks. Our evaluation scenarios for heterogeneous TCP flows consist of TCP variants with substantial presence in current Internet; therefore, TCP-SACK, CUBIC and HSTCP compete for bottleneck bandwidth. Experimental results for fairness are presented for different queue management schemes such as Drop-tail, RED, and CHOKe with varying degree of buffer sizes. We observed heterogeneous TCP flows induce more unfairness than homogeneous ones. RED and CHOKe improve fairness for large buffer sizes as compared to Drop-tail, whereas all three show similar fairness behavior for small buffer sizes.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129747126","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":"DYAMAND: DYnamic, Adaptive MAnagement of Networks and Devices","authors":"J. Nelis, Tom Verschueren, D. Verslype, Chris Develder","doi":"10.1109/LCN.2012.6423604","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423604","url":null,"abstract":"Consumer devices increasingly are “smart” and hence offer services that can interwork with and/or be controlled by others. However, the full exploitation of the inherent opportunities this offers, is hurdled by a number of potential limitations. First of all, the interface towards the device might be vendor and even device specific, implying that extra effort is needed to support a specific device. Standardization efforts try to avoid this problem, but within a certain standard ecosystem the level of interoperability can vary (i.e. devices carrying the same standard logo are not necessarily interoperable). Secondly, different application domains (e.g. multimedia vs. energy management) today have their own standards, thus limiting trans-sector innovation because of the additional effort required to integrate devices from traditionally different domains into novel applications. In this paper, we discuss the basic components of current so-called service discovery protocols (SDPs) and present our DYAMAND (DYnamic, Adaptive MAnagement of Networks and Devices) framework. We position this framework as a middleware layer between applications and discoverable/controllable devices, and hence aim to provide the necessary tool to overcome the (intra- and inter-domain) interoperability gaps previously sketched. Thus, we believe it can act as a catalyst enabling transsector innovation.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131302819","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":"Modeling and optimizing transport-support workflows in high-performance networks","authors":"Daqing Yun, C. Wu, P. Brown, Mengxia Zhu","doi":"10.1109/LCN.2012.6423652","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423652","url":null,"abstract":"High-performance networking technologies and services are being rapidly developed and deployed across the nation and around the globe to support the transfer of large data sets generated by next-generation scientific applications for collaborative data processing, analysis, and storage. However, these networking technologies and services have not been fully utilized mainly because their use often requires considerable domain knowledge and many application users are even not aware of their existence. The main goal of our work is to provide end users an integrated solution to discovering system and network resources and composing end-to-end paths for large data transfer. By leveraging the resource discovery capability previously developed in Network-Aware Data Movement Advisor (NADMA), we propose novel profiling and modeling approaches to characterize various types of resources that are available in end systems, edge segments, and backbone networks, taking into consideration a comprehensive set of performance metrics and network parameters in different phases including device deployment, circuit setup, and data transfer. Based on these profiles and models, we formulate a class of transport-support workflow optimization problems where an appropriate set of technologies and services are selected to compose the best transport-support workflow to meet the user's data transfer request in terms of various performance requirements. We conduct wide-area network experiments to validate the cost models and illustrate the efficacy of the proposed workflow-based transport solution.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121943108","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":"Decoupling non-stationary and stationary components in long range network time series in the context of anomaly detection","authors":"Cyriac James, H. Murthy","doi":"10.1109/LCN.2012.6423689","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423689","url":null,"abstract":"Network traffic characterisation and modeling using time series models is an area which has been extensively studied in the past. Coarse-grained (aggregated traffic) time series analysis using parametric approach, primarily carried out at the backbone network over a long time period (of the order of days to months), show strong deterministic cyclic trends, while the fine-grained (at the packet or flow level) counterpart, done mostly at edge network over small time period (of the order of few minutes), exhibit self-similar behaviour. This paper is an attempt to study the fine-grained time series characteristics of network traffic at an edge network, observed over a long period (of the order of days and weeks), using parametric approach. The analysis is carried out in the context of anomaly detection. Most of the earlier attempts in this direction followed a non-parametric approach, by either using adaptive or non-adaptive (i.e assuming stationarity) mechanisms, whose performance is found to be extremely sensitive towards empirically determined parameters of the model and hence difficult to determine. Also, the model parameters need to be recomputed at regular intervals of time (of the order of few seconds to minutes). To some extent, this make such algorithms less attractive in terms of generality and practical implementation. The first part of the paper discusses the statistical characteristics of such long range network time series. These are found to exhibit structural breaks apart from transient shocks and can be approximated by a stationary AR model, after an absolute first difference transformation (i.e decoupling stationary component from the non-stationary one). In the later part of the paper, the efficacy of the model proposed is evaluated, by conducting extensive trace driven simulations for the detection of low intensity TCP SYN flood Denial of Service (DoS) attacks. Performance is measured in terms of false positives, false alarm time, detection rate and detection delay. Experiments are performed on actual traffic traces collected from one of the edge networks over a period of three months and for various sampling intervals (10s, 60s, 120s). Comparative studies with adaptive and non-adaptive methods are carried out to demonstrate the relevance of the proposed model. It is observed that the proposed method gives better performance with 100% detection accuracy for false positive as low as 0.9%.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122601614","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":"Application-aware adaptive duty cycle-based Medium Access Control for energy efficient wireless data transmissions","authors":"Yang Song, B. Ciubotaru, Gabriel-Miro Muntean","doi":"10.1109/LCN.2012.6423599","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423599","url":null,"abstract":"This paper introduces a novel Medium Access Control (MAC) strategy for energy efficient wireless data transmissions which reduces energy consumption while minimizing the negative impact on network Quality of Service (QoS). This strategy adaptively adjusts the sleeping window of the mobile devices' wireless transceiver. The proposed mechanism - the Slow sTart Exponential and Linear Algorithm (STELA) - consists of three sleeping window adaptation phases, each phase employing a different duty cycle management function. Based on analyzing historic data regarding traffic arrival patterns, traffic modeling is used to estimate future patterns. Consequently, the specific adaptation phases are scheduled and tuned to improve energy efficiency without compromising data delivery performance. Simulation-based testing results show significant energy savings with reduced impact on network QoS achieved when STELA is used, as opposed to other existing MAC layer protocols (IEEE 802.11 and IEEE 802.16) considered in this paper for performance comparisons.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133017084","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":"Timed redirection: HTTP request coalescing to reduce energy use of hybrid web servers","authors":"M. Mostowfi, Ken Christensen, Sanghak Lee, Jungmee Yun","doi":"10.1109/LCN.2012.6423598","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423598","url":null,"abstract":"Network protocols can be designed to enable a reduction in energy use of data servers. We architect a new HTTP timed redirection response for a GET request to be redirected to another server with a given delay. This redirection response can be used in a hybrid web server to coalesce GET requests and allow a server to periodically sleep. In such a hybrid web server, a small low-power ARM-based Assistant receives all incoming HTTP requests and redirects them to a Pentium-class Master server with a delay calculated to allow the Master to sleep in alternating intervals. There is a growing class of applications that are delay tolerant at short time scales for file downloads. Experimental evaluation of timed redirection shows significant savings for the Master server with added delay for some requests which may be acceptable for certain applications.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133105104","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":"Decision centric identification and rank ordering of security metrics","authors":"Moazzam Khan, Mohammad-Ali Omer, J. Copeland","doi":"10.1109/LCN.2012.6423610","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423610","url":null,"abstract":"A network has several attributes which play a role in determining the security of the network and its robustness to external threats. These attributes are related to security through a complex nonlinear function which is generally unknown to the network management personnel. Since the network security is an explicit function of these attributes, the managers do not realize when the value of a certain attribute has become critical to the point of threatening network security. In this paper we take a theoretically rigorous approach to quantifying the effect each of the individual attributes has on the network. By using ideas from probability and decision theory, we can order the significant factors determining network security. This is similar to dimensionality reduction which is commonly employed for model based identification methods. Based on our analysis we can come up with critical coefficients which must be maintained by the administrator if the network is to remain secure to external threats. We show how the mathematical framework leads to the prediction of network's security health, and how real world data can be used to substantiate these claims. Paper concludes by validating our results on a list of compromised machine and determining if our identified metrics played the significant role in the infection.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131783051","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":"An integrated resource allocation scheme for multi-tenant data-center","authors":"G. Mohan, Tho Ngoc Le, D. Divakaran","doi":"10.1109/LCN.2012.6423666","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423666","url":null,"abstract":"The success of multi-tenant data-centers depends on the ability to provide performance guarantees in terms of the resources provisioned to the tenants. As bandwidth is shared in a best-effort way in today's data-centers, traffic generated between a set of VMs affect the traffic between another set of VMs sharing the same physical links. This paper proposes an integrated resource allocation scheme that considers not only server-resources, but also network-resource, to decide the mapping of VMs onto servers. We present a three-phase mechanism that finds the right set of servers for the requested VMs, with an aim of reducing the bandwidth on shared links. This mechanism provisions the required bandwidth for the tenants, besides increasing the number of tenants that can cohabit in a data-center. We demonstrate, using simulations, that the proposed scheme accommodates 10%-23% more requests in comparison to a load-balancing allocator that does not consider bandwidth requirements of VMs.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128163828","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":"Power-aware routing in networks with delay and link utilization constraints","authors":"Gongqi Lin, S. Soh, M. Lazarescu, Kwan-Wu Chin","doi":"10.1109/LCN.2012.6423626","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423626","url":null,"abstract":"This paper addresses the NP-hard problem of switching off bundled links whilst retaining the QoS provided to existing applications. We propose a fast heuristic, called Multiple Paths by Shortest Path First (MSPF), and evaluated its performance against two state-of-the-art techniques: GreenTE, and FGH. MSPF improves the energy saving on average by 5% as compared to GreenTE with only 1% CPU time. While yielding equivalent energy savings, MSPF requires only 0.35% of the running time of FGH. Finally, for Maximum Link Utilization (MLU) below 50% and delay no longer than the network diameter, MSPF reduces the power usage of the GÉANT topology by up to 91%.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125228387","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":"A tale of nine Internet exchange points: Studying path latencies through major regional IXPs","authors":"M. Ahmad, R. Guha","doi":"10.1109/LCN.2012.6423683","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423683","url":null,"abstract":"The Internet ecosystem comprising of thousands of Autonomous Systems (ASes) now include Internet eXchange Points (IXPs) as another critical component in the infrastructure. With the growth of peering worldwide, IXPs are playing an increasing role not only in the topology evolution of the Internet but also inter-domain path routing. In this work, we first motivate the need to monitor popular exchange points based on geographical locations. These major IXPs are responsible for transmitting 43% of the total IXP traffic and hence play a significant role in determining the effects of peering at IXPs on path latencies. Using the most important route performance metric of end to end latency we then propose and implement a measurement framework to carry out an in-depth comparison of paths traversing an IXP with other available alternate paths. We observe the presence of a significant percentage of alternate paths outperforming the default route through an IXP in all major regions. Even though IXPs are set up primarily with economic benefits in mind, we conclude that there is a huge potential for improvement with more efficient routing and better planning at the primary IXPs around the world.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123460645","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}