Xiaomin Chen, M. Chamania, A. Jukan, A. Drummond, N. Fonseca
{"title":"On the Benefits of Multipath Routing for Distributed Data-Intensive Applications with High Bandwidth Requirements and Multidomain Reach","authors":"Xiaomin Chen, M. Chamania, A. Jukan, A. Drummond, N. Fonseca","doi":"10.1109/CNSR.2009.26","DOIUrl":"https://doi.org/10.1109/CNSR.2009.26","url":null,"abstract":"We investigate and quantify the benefits of multipath routing in a wide-area distributed environment which includes inter-domain routing issues. In this context, we discuss two possible multipath routing schemes and focus on the viable solution for distributed data-intensive applications with high bandwidth and delay requirements. The network topology aggregation is extended for end-to-end multipath computation. An ILP-based algorithm and a heuristic algorithm are proposed with multiple constraints, including bandwidth, delay and memory size. Numerical and simulation results show that the proposed multipath routing algorithms are feasible, and especially well-suited for emerging applications with extremely high bandwidth requirements.","PeriodicalId":103090,"journal":{"name":"2009 Seventh Annual Communication Networks and Services Research Conference","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124706757","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 Management and Bandwidth Allocation in a Cognitive Wireless Mesh Network","authors":"M. Haidar, Mehdi Msakni, Z. Dziong","doi":"10.1109/CNSR.2009.67","DOIUrl":"https://doi.org/10.1109/CNSR.2009.67","url":null,"abstract":"In this paper, we consider a cognitive wireless mesh network where mesh nodes on an unlicensed spectrum make opportunistic access to a licensed spectrum. Since the spectrum of interest is licensed to a Primary User (PU) or network, power management and bandwidth allocation at the mesh nodes should be carefully picked out such that the interference tolerated at the PU does not exceed a predefined threshold value. Our interest is to maximize the spectrum utilization of the cognitive radio network by serving the most possible mesh nodes while appropriately protecting the PU from harmful interference. The problem is formulated as a Non-Linear Integer Program (NLIP). However, due to the complexity of the problem, a lower complexity heuristic algorithm is proposed. Results provide how many and which cognitive mesh nodes have been served, their final transmitted power level, and the spectrum utilization.","PeriodicalId":103090,"journal":{"name":"2009 Seventh Annual Communication Networks and Services Research Conference","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121349200","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 Sample of Consumer Wi-Fi Use & Security in the UK","authors":"Stuart Cunningham, V. Grout, B. Ghita","doi":"10.1109/CNSR.2009.66","DOIUrl":"https://doi.org/10.1109/CNSR.2009.66","url":null,"abstract":"Wireless networking technologies permit a great deal of convenience for mobile users. However, as is often the case, increased levels of technological freedom means there is more potential for abuse and misuse of these services. In this work we find the uptake of wireless networking technology has risen rapidly in recent years and the perceived awareness of security issues has also been heightened. We undertake a number of practical investigations in various communities to determine exactly how many and how accessible Access Points (APs) are in the metropolitan environment. This paper presents comparisons between previous and new independent studies carried out by two research teams in different areas of England and Wales, in the United Kingdom (UK).","PeriodicalId":103090,"journal":{"name":"2009 Seventh Annual Communication Networks and Services Research Conference","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126667487","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}
Wei Lu, Mahbod Tavallaee, Goaletsa Rammidi, A. Ghorbani
{"title":"BotCop: An Online Botnet Traffic Classifier","authors":"Wei Lu, Mahbod Tavallaee, Goaletsa Rammidi, A. Ghorbani","doi":"10.1109/CNSR.2009.21","DOIUrl":"https://doi.org/10.1109/CNSR.2009.21","url":null,"abstract":"A botnet is a network of compromised computers infected with malicious code that can be controlled remotely under a common command and control (C&C) channel. As one the most serious security threats to the Internet, a botnet cannot only be implemented with existing network applications (e.g. IRC, HTTP, or Peer-to-Peer) but also can be constructed by unknown or creative applications, thus making the botnet detection a challenging problem. In this paper, we propose a new online botnet traffic classification system, called BotCop, in which the network traffic are fully classified into different application communities by using payload signatures and a novel decision tree model, and then on each obtained application community, the temporal-frequent characteristic of flows is studied and analyzed to differentiate the malicious communication traffic created by bots from normal traffic generated by human beings. We evaluate our approach with about 30 million flows collected over one day on a large-scale WiFi ISP network and results show that the proposed approach successfully detects an IRC botnet from about 30 million flows with a high detection rate and a low false alarm rate.","PeriodicalId":103090,"journal":{"name":"2009 Seventh Annual Communication Networks and Services Research Conference","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127011521","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":"Workload Characterization of a Large Systems Conference Web Server","authors":"Aniket Mahanti, C. Williamson, Leanne Wu","doi":"10.1109/CNSR.2009.19","DOIUrl":"https://doi.org/10.1109/CNSR.2009.19","url":null,"abstract":"This paper presents a workload characterization study of the WWW2007 conference Web site. We use both server-sideband client-side measurement to collect data for our analysis. The collected datasets contain approximately 10 million requests from about130,000 unique visitors generating 215 GB of traffic volume during a 1-year period. Our analysis focuses on usage behaviour, client errors, client network properties,bandwidth, and robot activity of the site.In addition to the workload characterization study itself,our work also offers a comparative discussion of different approaches to Web data analysis, and some insights for future organizers of large systems conferences with a significant Web presence.","PeriodicalId":103090,"journal":{"name":"2009 Seventh Annual Communication Networks and Services Research Conference","volume":"53 18","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134063133","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":"Competitive FIFO Buffer Management for Weighted Packets","authors":"Fei Li","doi":"10.1109/CNSR.2009.28","DOIUrl":"https://doi.org/10.1109/CNSR.2009.28","url":null,"abstract":"Motivated by providing differentiated services on the Internet, we consider efficient online algorithms for buffer management in network switches. We study a FIFO buffering model, in which unit-length packets arrive in an online manner and each packet is associated with a value (weight) representing its priority. The order of the packets being sent should comply with the order of their arriving time. The buffer size is finite. At most one packet can be sent in each time step. Our objective is to maximize weighted throughput, defined by the total value of the packets sent. In this paper, we design competitive online FIFO buffering algorithms, where competitive ratios are used to measure online algorithms' performance against the worst-case scenarios. We first provide an online algorithm with a constant competitive ratio 2. Then, we study the experimental performance of our algorithm on real Internet packet traces and compare it with all other known FIFO online competitive algorithms. We conclude that for the same instance, the algorithms' experimental performances could be different from their competitive ratios; other factors such as packet flow characteristics and buffer sizes affect the outcome. Our algorithm outperforms other online algorithms when the buffer resource is limited.","PeriodicalId":103090,"journal":{"name":"2009 Seventh Annual Communication Networks and Services Research Conference","volume":"59 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133419270","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":"Characteristics of Internet Latency and Their Impact on Distance Prediction Accuracy","authors":"Chang-you Xing, Ming Chen","doi":"10.1109/CNSR.2009.35","DOIUrl":"https://doi.org/10.1109/CNSR.2009.35","url":null,"abstract":"Network distance prediction based on Network Coordinate (NC) system provides an efficient mechanism to obtain network distance (latency) information with limited times of measurements. In this paper, the mathematic principle of metric space embedding in NC system is analyzed, and the basic rule of designing embedding space model is proposed, which is minimizing both embedding transformation complexity and distortion. Then based on different performance metrics, the performance of a typical NC system is evaluated, and analysis results show that it is far from satisfying application requirements. We ascribe the main causes of such results are Internet hierarchical structure and network distances quasi-metric space feature, the latter of which is then studied in detail. Finally the practicability of increasing network distance prediction accuracy using hierarchical model and space repair technique is discussed.","PeriodicalId":103090,"journal":{"name":"2009 Seventh Annual Communication Networks and Services Research Conference","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116290773","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 Practical Survey of H.264 Capabilities","authors":"C. Mazataud, B. Bing","doi":"10.1109/CNSR.2009.15","DOIUrl":"https://doi.org/10.1109/CNSR.2009.15","url":null,"abstract":"H.264 is excellent for transmitting rich interactive media over narrow and broadband networks, and can be easily integrated into existing and future networks. Video compression efficiency is improved by at least a factor of two over the MPEG-2 standard. H.264 provides bit-rate adaptivity and scalability, which addresses the needs of different applications when transmitted over heterogeneous networks. This is also necessary for applications where the receiving device is not capable of displaying full resolution or full quality video images. This paper provides new insights into the key features of the H.264 based on actual experiments. It also illustrates how the strengths of different capabilities can be combined in a complementary fashion. Among the key attributes of H.264 that were tested include profile type, CABAC and CAVLC, RDO, and FMO error concealment.","PeriodicalId":103090,"journal":{"name":"2009 Seventh Annual Communication Networks and Services Research Conference","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122846999","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}
MohammadReza EffatParvar, N. Yazdani, Farshad Lahooti, M. EffatParvar
{"title":"Link Stability Approach and Scalability Method on ODMRP in Ad Hoc Networks","authors":"MohammadReza EffatParvar, N. Yazdani, Farshad Lahooti, M. EffatParvar","doi":"10.1109/CNSR.2009.71","DOIUrl":"https://doi.org/10.1109/CNSR.2009.71","url":null,"abstract":"An ad hoc network is a dynamically reconfigurable wireless network with no fixed wired infrastructure. The primary concerns in ad hoc networks are bandwidth limitation and unpredictable dynamic topology. The On-Demand Multicast Routing Protocol (ODMRP) was designed for multicast routing in ad hoc networks. In this paper, we propose a cluster-based on demand multicast routing protocol(SC-ODMRP) to the lack of extension of flat multicast routing protocols in large scale ad hoc networks. Simulation results show that using clustering base ODMRP improves network performance in terms of end-to-end delay and control packets. Also we propose a link stability approach to design a stable multicast algorithm. By this approach data delivery will be increase, and overhead will be decrease.","PeriodicalId":103090,"journal":{"name":"2009 Seventh Annual Communication Networks and Services Research Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128768702","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 Novel DWDM-PON Utilizing Downstream IRZ Signal for Upstream Data Re-modulation with High Extinction Ratio","authors":"Jinnan Zhang, X. Yuan, X. Ren, Yongqing Huang, Yang'an Zhang, Minglun Zhang","doi":"10.1109/CNSR.2009.76","DOIUrl":"https://doi.org/10.1109/CNSR.2009.76","url":null,"abstract":"We propose and demonstrate a novel re-modulation scheme using inverse-return-to-zero (IRZ) signal for downstream data and differential phase shift keying (DPSK) signal for upstream data with high extinction-ratio(ER) in both directions. A 20-km-range colorless dense wavelength-division-multiplexing passive optical network (DWDM-PON) without dispersion compensation was demonstrated within 1-dB penalty for both 10-Gbit/s downstream and 10-Gbit/s upstream signals. The impact of the relative delay between the upstream signal and the downstream signal was investigated.","PeriodicalId":103090,"journal":{"name":"2009 Seventh Annual Communication Networks and Services Research Conference","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125334884","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}