2011 IEEE Nineteenth IEEE International Workshop on Quality of Service最新文献

{"title":"Measuring the effectiveness of infrastructure-level detection of large-scale botnets","authors":"Y. Zeng, Guanhua Yan, S. Eidenbenz, K. Shin","doi":"10.1109/IWQOS.2011.5931312","DOIUrl":"https://doi.org/10.1109/IWQOS.2011.5931312","url":null,"abstract":"Botnets are one of the most serious security threats to the Internet and its end users. In recent years, utilizing P2P as a Command and Control (C&C) protocol has become popular due to its decentralized nature that can help hide the botmaster's identity. Most bot detection approaches targeting P2P botnets either rely on behavior monitoring or traffic flow and packet analysis, requiring fine-grained information collected locally. This requirement limits the scale of detection. In this paper, we consider detection of P2P botnets at a high-level — the infrastructure level — by exploiting their structural properties from a graph analysis perspective. Using three different P2P overlay structures, we measure the effectiveness of detecting each structure at various locations (the Autonomous System (AS), the Point of Presence (PoP), and the router rendezvous) in the Internet infrastructure.","PeriodicalId":127279,"journal":{"name":"2011 IEEE Nineteenth IEEE International Workshop on Quality of Service","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114241806","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":"TCAM-based DFA deflation: A novel approach to fast and scalable regular expression matching","authors":"Kunyang Peng, Qunfeng Dong, Min Chen","doi":"10.1109/IWQOS.2011.5931323","DOIUrl":"https://doi.org/10.1109/IWQOS.2011.5931323","url":null,"abstract":"Regular expression matching is the foundation of many network functions including intrusion detection, worm detection, traffic analysis and so on, where known patterns such as worm fingerprints are characterized using regular expressions and searched in network traffic for pattern match. As the quantity and diversity of known patterns keep increasing, regular expression pattern sets have rapidly grown in both size and complexity, while having to be matched in network traffic at accelerating wire speeds. Fast and scalable regular expression matching, therefore, is fundamental to the development of practical network systems.","PeriodicalId":127279,"journal":{"name":"2011 IEEE Nineteenth IEEE International Workshop on Quality of Service","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123900699","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":"Mitigating interference in a network measurement service","authors":"S. Gangam, S. Fahmy","doi":"10.1109/IWQOS.2011.5931347","DOIUrl":"https://doi.org/10.1109/IWQOS.2011.5931347","url":null,"abstract":"Shared measurement services offer key advantages over conventional ad-hoc techniques for network monitoring. A measurement service may receive measurement requests concurrently from different applications and network administrators. These measurement requests are often served by injecting active network measurement traffic between two hosts. Two active measurements are said to interfere when the probe packets of one measurement tool are viewed as network traffic by the other. This may lead to faulty measurement readings. In this paper, we model the measurement interference problem, and show how to schedule measurement tasks to reduce interference and hence increase measurement accuracy. We propose twelve computationally tractable algorithms that decrease the total completion time (makespan) of measurement tasks, while avoiding interference. Our evaluation shows that the algorithm we refer to as Largest Area First, Busiest Node First — Earliest Interval Schedule (LAFBNF-EIS) has a mean makespan of about 5% more than the theoretical lower bound over our set of measurement workloads.1","PeriodicalId":127279,"journal":{"name":"2011 IEEE Nineteenth IEEE International Workshop on Quality of Service","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132038990","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":"Peer-assisted online games with social reciprocity","authors":"Zhi Wang, Chuan Wu, Lifeng Sun, Shiqiang Yang","doi":"10.1109/IWQOS.2011.5931316","DOIUrl":"https://doi.org/10.1109/IWQOS.2011.5931316","url":null,"abstract":"Online games and social networks are cross-pollinating rapidly in today's Internet: Online social network sites are deploying more and more games in their systems, while online game providers are leveraging social networks to power their games. An intriguing development as it is, the operational challenge in the previous game persists, i.e., the large server operational cost remains a non-negligible obstacle for deploying high-quality multi-player games. Peer-to-peer based game network design could be a rescue, only if the game players' mutual resource contribution has been fully incentivized and efficiently scheduled. Exploring the unique advantage of social network based games (social games), we advocate to utilize social reciprocities among peers with social relationships for efficient contribution incentivization and scheduling, so as to power a high-quality online game with low server cost. In this paper, social reciprocity is exploited with two give-and-take ratios at each peer: (1) peer contribution ratio (PCR), which evaluates the reciprocity level between a pair of social friends, and (2) system contribution ratio (SCR), which records the give-and-take level of the player to and from the entire network. We design efficient peer-to-peer mechanisms for game state distribution using the two ratios, where each player optimally decides which other players to seek relay help from and help in relaying game states, respectively, based on combined evaluations of their social relationship and historical reciprocity levels. Our design achieves effective incentives for resource contribution, load balancing among relay peers, as well as efficient social-aware resource scheduling. We also discuss practical implementation concerns and implement our design in a prototype online social game. Our extensive evaluations based on experiments on PlanetLab verify that high-quality large-scale social games can be achieved with conservative server costs.","PeriodicalId":127279,"journal":{"name":"2011 IEEE Nineteenth IEEE International Workshop on Quality of Service","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114620063","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":"Identity attack and anonymity protection for P2P-VoD systems","authors":"Mengwei Lu, P. Lee, John C.S. Lui","doi":"10.1109/IWQOS.2011.5931313","DOIUrl":"https://doi.org/10.1109/IWQOS.2011.5931313","url":null,"abstract":"As P2P multimedia streaming service is becoming more popular, it is important for P2P-VoD content providers to protect their servers identity. In this paper, we first show that it is possible to launch an “identity attack”: exposing and identifying servers of peer-to-peer video-on-demand (P2P-VoD) systems. The conventional wisdom of the P2P-VoD providers is that identity attack is very difficult because peers cannot distinguish between regular peers and servers in the P2P streaming process. We are the first to show that it is otherwise, and present an efficient and systematic methodology to perform P2P-VoD servers detection. Furthermore, we present an analytical framework to quantify the probability that an endhost is indeed a P2P-VoD server. In the second part of this paper, we present a novel architecture that can hide the identity and provide anonymity protection for servers in P2P-VoD systems. To quantify the protective capability of this architecture, we use the “fundamental matrix theory” to show the high complexity of discovering all protective nodes so as to disrupt the P2P-VoD service. We not only validate the model via extensive simulation, but also implement this protective architecture on PlanetLab and carry out measurements to reveal its robustness against identity attack.","PeriodicalId":127279,"journal":{"name":"2011 IEEE Nineteenth IEEE International Workshop on Quality of Service","volume":"121 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114745203","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":"Minimizing energy cost for Internet-scale datacenters with dynamic traffic","authors":"Dan Xu, Xin Liu, Bin Fan","doi":"10.1109/IWQOS.2011.5931322","DOIUrl":"https://doi.org/10.1109/IWQOS.2011.5931322","url":null,"abstract":"In this paper, our goal is to achieve an optimal tradeoff between energy efficiency and service performance over a set of distributed IDCs with dynamic demand. In particular, we consider the outage probability as the QoS metric, where outage is defined as service demand exceeding the capacity of an IDC. Our goal is thus to minimize total energy cost over all IDCs, subject to the outage probability constraint. We achieve the goal by dynamically adjusting server capacity and performing load shifting in different time scales. We propose three different load-shifting and joint capacity allocation schemes with different complexity and performance. Our schemes leverage both stochastic multiplexing gain and electricity-price diversity.","PeriodicalId":127279,"journal":{"name":"2011 IEEE Nineteenth IEEE International Workshop on Quality of Service","volume":"353 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116322054","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":"Detecting shared congestion paths based on PCA","authors":"Lidong Yu, Chang-you Xing, Huali Bai, Ming Chen, Mingwei Xu","doi":"10.1109/IWQOS.2011.5931338","DOIUrl":"https://doi.org/10.1109/IWQOS.2011.5931338","url":null,"abstract":"Most existing techniques detecting shared congestion paths are based on pair-wise comparison of paths with a common source or destination point. It is difficult to extend them to cluster paths with different sources and destinations. In this paper, we propose a scalable approach to cluster shared congestion paths based on PCA. This algorithm maps the delay measurement data of each path into a point in a new, low-dimensional space based on the factor loading matrix in PCA, which reflect correlation between paths. In this new space, points are close to each other if the corresponding paths share congestion. Then, the clustering analysis is applied to these points so as to identify shared congestion paths accurately. This algorithm is evaluated by NS2 simulations. The results show us that this algorithm has high accuracy.","PeriodicalId":127279,"journal":{"name":"2011 IEEE Nineteenth IEEE International Workshop on Quality of Service","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123506887","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 application-level solution for the TCP-incast problem in data center networks","authors":"Maxim Podlesny, C. Williamson","doi":"10.1109/IWQOS.2011.5931333","DOIUrl":"https://doi.org/10.1109/IWQOS.2011.5931333","url":null,"abstract":"Data centers have become very popular for storing large volumes of data. In particular, companies like Amazon, Google, and Yahoo! routinely use data centers for storage, Web search, and large-scale computations. The main characteristics of a data center network are high-speed links, low propagation delays, and limited-size switch buffers. In addition, the data for a given client application are usually striped (spread) over many servers, for increased reliability and performance (i.e., parallelism). Recent research efforts have resulted in several architectures of data centers [1].","PeriodicalId":127279,"journal":{"name":"2011 IEEE Nineteenth IEEE International Workshop on Quality of Service","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127882963","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":"Utilizing elevator for wireless sensor data collection in high-rise structure monitoring","authors":"Feng Wang, Jiangchuan Liu, Dan Wang","doi":"10.1109/IWQOS.2011.5931350","DOIUrl":"https://doi.org/10.1109/IWQOS.2011.5931350","url":null,"abstract":"Recently wireless sensor networks have been widely suggested for Structural Health Monitoring. In such applications, diverse sensor nodes are deployed in a building structure, collecting ambient data such as temperature and strain from various locations and reporting them to a central base station for processing and diagnosing. For today's high-rise structures (e.g., the Guangzhou New TV Tower, a project that we have participated in, peaks at 600m above ground), the extensive vertical dimension creates enormous challenges toward sensor data collection, beyond those addressed in state-of-the-art motelike systems. For example, with a straightforward base station placement, a huge amount of data will accumulate as being relayed to the base station. As such, the sensor nodes close to the base station would quickly run out of energy for relaying the traffic. The accumulated traffic would also saturate the wireless medium, introducing significant interferences and collisions. The extensive height of these building structures, however, make elevators an indispensable component. This motivates us to develop EleSense, a novel high-rise structure monitoring framework that explores using elevators. In EleSense, an elevator is attached with the base station and collects data when it moves across different floors to serve passengers, which can effectively reduce the traffic accumulation and the collection delay. To maximally exploit the benefit, we take a unique angle with the cross-layer design. We present an abstraction of the high-rise structure monitoring problem that exploits elevators, and model it as a joint optimization across link scheduling, packet routing and end-to-end delivery. We propose a centralized algorithm to solve it optimally. We further propose a distributed implementation to accommodate the hardware capability of a sensor node and address other practical issues. We evaluate EleSense through ns-2 simulations and with real configurations from the Guangzhou New TV Tower. The results show that EleSense has a throughput gain of 30.4% to 200.6% over the case without elevators. We also observe a gain of 40.5% to 127.5% over a straightforward 802.11 MAC scheme without the cross-layer optimization. Moreover, EleSense can significantly reduce the communication costs while maintaining excellent fairness with reliable data delivering.","PeriodicalId":127279,"journal":{"name":"2011 IEEE Nineteenth IEEE International Workshop on Quality of Service","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131934660","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":"Multi-channel reliability and spectrum usage in real homes: Empirical studies for home-area sensor networks","authors":"M. Sha, Gregory Hackmann, Chenyang Lu","doi":"10.1109/IWQOS.2011.5931349","DOIUrl":"https://doi.org/10.1109/IWQOS.2011.5931349","url":null,"abstract":"Home area networks (HANs) consisting of wireless sensors have emerged as the enabling technology for important applications such as smart energy. These applications impose unique QoS constraints, requiring low data rates but high network reliability in the face of unpredictable wireless environments. This paper presents two in-depth empirical studies on wireless channels in real homes, providing key design guidelines for meeting the QoS constraints of HAN applications. The spectrum study analyzes spectrum usage in the 2.4 GHz band where HANs based on the IEEE 802.15.4 standard must coexist with existing wireless devices. We characterize the ambient wireless environment in six apartments through passive spectrum analysis across the entire 2.4 GHz band over seven days in each apartment. We find that the wireless conditions in these residential environments are much more complex and varied than in a typical office environment. Moreover, while 802.11 signals play a significant role in spectrum usage, there also exists non-negligible noise from non-802.11 devices. The multichannel link study measures the reliability of different 802.15.4 channels through active probing with motes in ten apartments. We find that there is not always a persistently reliable channel over 24 hours, and that link reliability does not exhibit cyclic behavior at daily or weekly timescales. Nevertheless, reliability can be maintained through infrequent channel hopping, suggesting dynamic channel hopping as a key tool for meeting the QoS requirements of HAN applications. Our empirical studies provide important guidelines and insights in designing HANs for residential environments.","PeriodicalId":127279,"journal":{"name":"2011 IEEE Nineteenth IEEE International Workshop on Quality of Service","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123102035","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}