{"title":"Route fragility: a novel metric for route selection in mobile ad hoc networks","authors":"Omesh Tickoo, S. Raghunath, S. Kalyanaraman","doi":"10.1109/ICON.2003.1266246","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266246","url":null,"abstract":"A key factor deciding the performance of a muting protocol in mobile ad hoc networks is the manner in which it adapts to mute changes caused by mobility. Exploiting the intuition that a less dynamic mute lasts longer, we propose a new metric, the Route FragiI&v Coeficient (RFC), to compare mutes. RFC estimates the rate at which a given mute expands or contracts. Expansion refers to adjacent nodes moving apart, while contraction refers to their moving closer. RFC combines the individual link contraction or expansion behavior to pmsent a unified picture of the mute dynamics. We demonstrate that lower the value of RFC, more static (less fragile) the mute. We then use this metric as a basis for route selection so that route discovery yields mutes that last longer and hence increase throughput while reducing contml overhead. We pmvide a simple distributed mechanism to compute RFC, so that a Route-Request W Q ) packet contains the metric for the path it travened, when it reaches the destination. The Dynamic Source Routing Protocol (DSR). is enhanced with the proposed metric in the NS-2 simulation environment. Simulation msults am provided to demonstrate improvement in thmugbput and reduction in routing pmtocol overhead with increased mobility.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128635883","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":"Adaptive ingress admission control for differentiated services","authors":"Hannan Xiao, K. Chua","doi":"10.1109/ICON.2003.1266242","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266242","url":null,"abstract":"Abstrncr . Admission eontml is a critical element for supporting Quality-of-Service in networks. We pmpase and evaluate the performance of an adaptive inadmission contml scheme that is suitable for use in a Differentiated Services Internet backbone. The pmposed scheme impmves upon the admission cuotml scheme by measur. ing the maximal arrival rate envelope at an ingress node and adding an adaptive adjustment scheme that dynamically adjusts the perceived network capacity io correlation with the rate at which a speeilied end4o-end delay bound is violated. Simulalion results are presented to show that the pmposed adaptive ingress admission mntml scheme is more effective than the egress admission mntml scheme.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130112353","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":"Performance analysis of dynamic resource allocation with finite buffers in cellular networks","authors":"Wei-Yeh Chen, Jean-Lien C. Wu, Haw-Yun Shin","doi":"10.1109/ICON.2003.1266263","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266263","url":null,"abstract":"SUMMARY In this paper, we analyzed the performance of dynamic resource allocation with channel de-allocation and buffering in cellular networks. Buffers are applied for data traffic to reduce the packet loss probability while channel de-allocation is exploited to reduce the voice blocking probability. The results show that while buffering data traffic can reduce the packet loss probability, it has negative impact on the voice performance even if channel de-allocation is exploited. Although the voice blocking probability can be reduced with large slot capacity, the improvement decreases as the slot capacity increases. On the contrary, the packet loss probability increases as the slot capacity increases. In addition to the mean value analysis, the delay distribution and the 95% delay of data packets are provided.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125686473","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":"Explicit rate adjustment: an efficient congestion control protocol for layered multicast","authors":"S. Puangpronpitag, R. Boyle, K. Djemame","doi":"10.1109/ICON.2003.1266187","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266187","url":null,"abstract":"In this paper, we introduce explicit rate adjustment (ERA), a new multi-rate multicast congestion control (MR-MCC) algorithm. Via ERA, the receiver explicitly adjusts its reception rate according to the network conditions using the TCP throughput equation and packet-pair probe. The design goals are responsiveness, efficiency in network utilization, scalability and fairness (including inter-protocol fairness, intra-protocol fairness, intra-session fairness and TCP-friendliness) as well as simple implementation. We have built ERA into a network simulator (ns2) and demonstrate via simulations that the goals are reached.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128890402","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":"TCMCA: a source-based distributed topology control algorithm for mission critical applications in mobile ad-hoc networks","authors":"G. Srivastava, P. Boustead, J. Chicharo, C. Ware","doi":"10.1109/ICON.2003.1266184","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266184","url":null,"abstract":"Topology control in a wireless ad-hoc network allows better spatial reuse of the wireless channel and network resources. The existing topology control algorithms tend to optimise network power usage by keeping the topology connected but do not take the network application requirements into account. Mission critical applications which require explicit end-to-end bandwidth and delay guarantees may not find enough resources in the network with the existing network topology. We have devised a topology control algorithm for mission critical applications (TCMCA) in wireless ad-hoc networks, which adapts the network topology to improve the available resources for a set of mission critical applications (high priority services) in a network. TCMCA is a source based algorithm where topology control decisions are made on distributed network knowledge. The performance of TCMCA is evaluated for a static wireless network and compared against algorithms such as connect, LINT and full power transmissions. We demonstrate that TCMCA shows better support for mission critical services for varying number of mission critical applications in the network.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132423290","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":"Efficient dynamic probabilistic packet marking for IP traceback","authors":"Jenshiuh Liu, Zhi-Jian Lee, Yeh-Ching Chung","doi":"10.1109/ICON.2003.1266236","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266236","url":null,"abstract":"Recently, Denial-of-service @OS) attack bas become a pressing problem due to lack of efficient method to locate the real attackers and easy to execute with readily available soume codes on the Internet. lkaceback is a subtle scheme to tackle the DOS attacks. The probabilistic packet marking VPM) is a new way for practical IP traceback. Although the PPM enables a victim to pinpoint the attacker's origin to within 2. 5 equally possible sites, it have been shown that PPM suffers f\" uncertainty noder attack with spoofed packets. In this work, we present a new approach, called dynamic probabilistic packet marking@PPM), to further improve effectiveness of PPM. Instead of using a fixed marking probability, we propose to deduce how far a packet has traveled and then choose the marking probability as an inverse function of hop count traveled. The DPPM may mmove uncertainty completely and enable victims to precisely pinpointattacking origin under DOS attacks. Our proposed DPPM can he applied to DDoS attacks with a very limited uncertainty.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132333858","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":"Probabilistic modeling in support of preemptive congestion control","authors":"Jason Rouse","doi":"10.1109/ICON.2003.1266186","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266186","url":null,"abstract":"Congestion control schemes seek to perform a number of functions on the Internet. Beyond the fair sharing of network resources, one of these functions is to increase average link utilization by determining the dynamic operating characteristics of network links and tailoring a congestion event response to those characteristics. One of the drawbacks of current congestion control models is their a posteriori operation based on observed measurements. This paper describes a framework for a high resolution, probabilistic model capable of short-term admission control and transmission plan production for both TCP and UDP traffic flows. A transmission plan has the opportunity of operating in a future time frame, rather than in the reactive mode of current systems. Probabilistic modeling also introduces the possibility of smoothing characteristically bursty traffic using distributed, globally optimum control. Since bursty traffic on a heavily loaded link can lead to unwanted phase effects, reduced throughput, and recurrent drops, being able to smooth these traffic patterns could effectively benefit both link utilization and network stability.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121511176","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":"Optimal dynamic replica placement in content delivery networks","authors":"N. Bartolini, F. L. Presti, C. Petrioli","doi":"10.1109/ICON.2003.1266178","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266178","url":null,"abstract":"Content delivery networks (CDN) design entails the placement of server replicas to bring the content close to the users, together with an efficient and content aware request routing. In this paper we address the problem of dynamic replica placement to account for users demand variability while optimizing the costs paid by a CDN provider and the overall performance of the distributed replica servers architecture. We formulate the dynamic replica placement problem as a semi Markov decision process accounting for the traffic conditions, the users level of satisfaction, as well as the costs paid to install, maintain or remove a replica from a site. The proposed model applies to general network topologies and considers realistic constraints on network and servers capacity. The optimal strategy derived by means of the decision model provides the ground for designing a centralized heuristic and is used as a benchmark for the heuristic evaluation. Simulation results show that the proposed heuristic has a behavior close to that of the optimal strategy and achieves very good performance in terms of low average distance from a user to the serving replica, low average number of replicas and high probability of being able to serve a request.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"582 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114048493","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":"Design of a pro-active queue management","authors":"Seungwan Ryu, Jung-Sook Bae","doi":"10.1109/ICON.2003.1266218","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266218","url":null,"abstract":"In this paper, we introduce and analyze a feedback control model of TCP/AQM dynamics. Then, we propose the pro-active queue management (PAQM) mechanism, which can provide proactive congestion avoidance and control using an adaptive congestion indicator and a control function for wide range of traffic environments. The PAQM stabilizes the queue length around a desired level while giving smooth and low packet loss rates independent of the traffic load level under a wide range of traffic environments. The PAQM outperforms other AQM algorithms such as random early detection (RED) [S. Floyd and V. Jacobson, August 1993] and PI-controller [C. V. Hollot et al., April 2001].","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122449765","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 middleware for pervasive IPv6 mobile computing","authors":"N. Montavont, Thomas Noël","doi":"10.1109/ICON.2003.1266237","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266237","url":null,"abstract":"A gmwing number of wireless technologies are recently deployed to interconnect Mobile IpV6 nodes. We propose a new framework, called MIMA (Multiple Interfaces Management Architecture), to allow a mobile node to optimize the use of several interfaces. The MIMA framework includes three main modules: an Extraction module whicb dumps and gathen capacity information of the nnderlying interfaces, an Interfaces Selector, whicb spmad the flows on the interfaces and the Profiles Manager, whicb manages different default behaviors on the interfaces and keeps applications profile. The MIMA b e w o r k enhances the Mobile IpV6 [61 features by implementing the Fast Handover [3], by performing temporary redimtion and by allowing a mobile node to perform vertical handover. Index TennsPervasive Networking, Heterogeneous Interfaces Management, Mobile IPVL","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122618329","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}