{"title":"Performance of a Priority-Weighted Round Robin Mechanism for Differentiated Service Networks","authors":"Helen Yu-Zhang, P. Harrison","doi":"10.1109/ICCCN.2007.4317983","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317983","url":null,"abstract":"Strict priority queueing and weighted round robin are two common scheduling schemes for differentiation of services in telecommunication networks. A combination of these is the priority weighted round robin (PWRR) scheme, which serves three classes of traffic with distinct quality requirements, namely expedited forwarding (EF), assured forwarding (AF) and best effort forwarding (BF). The response time of the AF class is analysed under a worst case scenario and an expression for its mean value is obtained using a queueing model. Numerical results are validated by simulation and implications on service level agreements are discussed.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125654367","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":"Analysis of Discrete Time Queueing Networks under Buffer Threshold Scheme","authors":"I. Awan, L. Guan, X. Wang","doi":"10.1109/ICCCN.2007.4317996","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317996","url":null,"abstract":"This paper presents a framework for the performance analysis of queueing networks under active queue management scheme. The analysis is based on a queue-by-queue decomposition technique where each queue is modelled as a GGeo/GGeo/1/{N1, N2} queue with single server, R (R = 2) distinct traffic classes, N1 as the buffer threshold and N2 as full buffer capacity under first-come-first-serve (FCFS) service rule. Two classes of traffic represent the arrival of the single class Internet traffic before and after the threshold N1, respectively. The use of queue thresholds is a well known technique for network traffic congestion control. The external traffic is modelled using the Generalised Geometric (GGeo) distribution which can capture the bursty property of network traffic. The analytical solution is obtained using the Maximum Entropy (ME) principle. The forms of the state probabilities and blocking probabilities are analytically established at equilibrium via appropriate mean value constraints. Initial numerical results demonstrate the credibility of the proposed analytical solution.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130762509","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":"Error-Correcting Codes Based on Quasigroups","authors":"D. Gligoroski, S. Markovski, L. Kocarev","doi":"10.1109/ICCCN.2007.4317814","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317814","url":null,"abstract":"Error-correcting codes based on quasigroup transformations are proposed. For the proposed codes, similar to recursive convolutional codes, the correlation exists between any two bits of a codeword, which can have infinite length, theoretically. However, in contrast to convolutional codes, the proposed codes are nonlinear and almost random: for codewords with large enough length, the distribution of the letters, pair of letters, triple of letters, and so on, is uniform. Simulation results of bit-error probability for several codes in binary symmetric channels are presented.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130789514","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 New Network Layer for Mobile Ad Hoc Wireless Networks Based on Assignment Router Identity Protocol","authors":"Chaorong Peng, Chang Wen Chen","doi":"10.1109/ICCCN.2007.4317913","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317913","url":null,"abstract":"Customers have complained that malicious nodes are mounting increasingly sophisticated attacking operations in mobile ad hoc networks (MANETs). It is obvious that the IP-based MANETs are vulnerable to attacks and therefore are insecure. In this paper, we design a novel assignment router identity protocol (ARIP) to establish a new layer of network architecture and to take full advantage of Dynamic Hybrid Multi Routing Protocol that we have recently developed for MANETs [2]. A new Identity in the flexible namespace of ARIP enhances the limit in forming prevention line in the security of MANET. A complete architecture is then derived as an instantiation of router identity routing protocol (RIRP) model whose architecture satisfies the condition of ARIP model in order to use this new Identify for routers/hosts. All applications in RIRP deal with this new Identity instead of the vulnerable IP addresses and therefore provide the security embedded seamlessly into the overall network architecture. The proposed RIRP have been implemented on the simulator Glomosim. Simulation results show that RIRP has some great impact on routing performance comparing with DHMRP.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125437102","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":"Medium Access Control for Body Sensor Networks","authors":"Huaming Li, Jindong Tan","doi":"10.1109/ICCCN.2007.4317821","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317821","url":null,"abstract":"H-MAC, a novel time division multiple access (TDMA) MAC protocol, aims to improve body sensor networks (BSNs) energy efficiency by exploiting heartbeat rhythm information to perform time synchronization. Heartbeat rhythm is inherent in every human body and observable in various biosignals. Biosensors in a BSN can extract the heartbeat rhythm from their own sensory data by detecting waveform peaks. Following the rhythm, biosensors can achieve time synchronization without having to turn on their radio to receive periodic timing information from a central controller, so that energy cost for time synchronization can be completely eliminated and the lifetime of network can be prolonged. An active synchronization recovery scheme is also developed, in which two resynchronization approaches can be triggered by detected abrupt peak interval changes. The algorithms are verified using real world data from MIT-BIH multi-parameter database MIMIC.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"58 1-2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121331015","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 Proactive Test Based Differentiation Technique to Mitigate Low Rate DoS Attacks","authors":"Amey Shevtekar, N. Ansari","doi":"10.1109/ICCCN.2007.4317889","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317889","url":null,"abstract":"Low rate DoS attacks are emerging threats to the TCP traffic, and the VoIP traffic in the Internet. They are hard to detect as they intelligently send attack traffic inside the network to evade current router based congestion control mechanisms. We propose a practical attack model in which botnets that can pose a serious threat to the Internet are considered. Under this model, an attacker can scatter bots across the Internet to launch the low rate DoS attack, thus essentially orchestrating the low rate DoS attack that uses random and continuous IP address spoofing, but with valid legitimate IP addresses. It is difficult to detect and mitigate such an attack. We propose a low rate DoS attack detection algorithm, which relies on the core characteristic of the low rate DoS attack in introducing high rate traffic for short periods, and then uses a proactive test based differentiation technique to filter the attack packets. The proactive test was originally proposed to defend DDoS attacks and low rate DoS attacks which tend to ignore the normal operation of network protocols, but it is tailored here to differentiate the legitimate traffic from the low rate DoS attack traffic instigated by botnets. It leverages on the conformity of legitimate flows, which obey the network protocols. It mainly differentiates legitimate connections by checking their responses to the proactive tests which include puzzles for distinguishing botnets from human users. We finally evaluate and demonstrate the performance of the proposed low rate DoS attack detection and mitigation algorithm on the real Internet traces.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116090353","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":"Enhanced Synchronized Medium Access Control Protocol for Wireless Ad Hoc Networks","authors":"Xiaojun Cao, Shenbo Liu, Lei Pan, Hongyi Wu","doi":"10.1109/ICCCN.2007.4317832","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317832","url":null,"abstract":"An enhanced synchronized medium access protocol, named ES-MAC, for wireless ad hoc networks is proposed in this paper. ES-MAC employs a binary-countdown scheme to resolve contentions between wireless stations. Multiple contention periods and hidden station elimination periods are adopted to increase the throughput and channel utilization of the system. Our simulation and analysis show that ES-MAC can achieve a promising performance in terms of throughput, fairness and channel utilization. With channel utilization as high as 96%, ES-MAC can also be employed as an alternative MAC protocol in wireless access network.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123806069","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":"Travel-light: A Model for the Dynamic Assembly of Mega Machines","authors":"Li Gao, Jingyuan Zhang, Danyang Zhang","doi":"10.1109/ICCCN.2007.4317798","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317798","url":null,"abstract":"This paper proposes a new ubiquitous computing architecture named Travel-light, in which service computers form a computing infrastructure that allows a small mobile device such as a PDA or a smart phone to organize as many service computers as needed to form a mega machine. The mega machine will be powerful and able to provide a user with a familiar computing environment regardless of the users location. The paper presents the architecture, protocols, and implementation approaches of the mega machine based on the Travel-light architecture. The initial evaluation on the implementation is satisfactory. The proposed architecture enables users to perform presentations away from home with a PDA, to work in a familiar computing environment even on a visiting site, and to collaborate through a communal computer.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125063805","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 Bio-Inspired Robust Routing Protocol for Mobile Ad Hoc Networks","authors":"K. Leibnitz, N. Wakamiya, M. Murata","doi":"10.1109/ICCCN.2007.4317839","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317839","url":null,"abstract":"In this paper, we discuss robustness issues of a biologically inspired routing protocol for mobile ad hoc networks and the influence it has on the quality of service (QoS) in the system. Contrary to fixed network structures, ad hoc networks are susceptible to frequent topology changes due to the mobility and churn of the participating nodes. Our goal is therefore to provide fast recovery from connectivity failures, as well as a fast reaction to path changes due to node mobility or churn.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122724744","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":"Layered Clustering Communication Protocol for Wireless Sensor Networks","authors":"Yong Wang, B. Ramamurthy","doi":"10.1109/ICCCN.2007.4317923","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317923","url":null,"abstract":"In this paper, we propose a layered clustering hierarchy (LCH) communication protocol for wireless sensor networks (WSNs). The design of LCH has two goals: scalability and energy-efficiency. In LCH, the sensor nodes are organized as a layered clustering structure. Each layer runs a distributed clustering protocol. By randomizing the rotation of cluster heads in each layer, the energy load is distributed evenly across sensors in the network. Our simulations show that LCH is effective in densely deployed sensor networks. On average, 70% of live sensor nodes are involved directly in the clustering communication hierarchy. Moreover, the simulations also show that the energy load and dead nodes are distributed evenly over the network. As studies prove that the performance of LCH depends mainly on the distributed clustering protocol, the location of cluster heads and cluster size are two critical factors in the design of LCH.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127926955","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}