{"title":"Architectures for packet classification caching","authors":"Kang Li, Francis Chang, Damien Berger, W. Feng","doi":"10.1109/ICON.2003.1266176","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266176","url":null,"abstract":"Emerging network applications require packet classification at line speed on multiple header fields. Fast packet classification requires a careful attention to memory resources due to the size and speed limitations in SRAM and DRAM memory used to implement the function. In this paper, we investigate a range of memory architectures that can be used to implement a wide range of packet classification caches. In particular, we examine their performance under real network traces in order to identify features that have the greatest impact. Through experiments, we show that a cache's associativity, replacement policy, and hash function all contribute in varying magnitudes to the cache's overall performance. Specifically, we show that small levels of associativity can result in enormous performance gains, that replacement policies can give modest performance improvements for under-provisioned caches, and that faster, less complex hashes can improve overall cache performance.","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":"116094500","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 weight functions for wavelength-continuous WDM multi-fiber networks","authors":"K. Miliotis, G. Papadimitriou, A. Pomportsis","doi":"10.1109/ICON.2003.1266226","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266226","url":null,"abstract":"AbsmctIn this paper we address the problem of efficient Routing and Wavelength Assignment (RWA) in multi-fiber WDM networks without wavelength translation, under dynamic traffic. We couple Dijkstra’s shortest path algorithm with a suitable weight function which chooses optical paths based both on wavelength availability and multi-fiber segments. We compare our approach with other RWA schemes both for ’ even and uneven WDM multi-fiber networks in terms of blocking probability and overall link utilization.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"250 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":"123588055","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 rerouting technique with minimum traffic disruption for dynamic traffic in WDM networks","authors":"R. Datta, S. Ghose, I. Sengupta","doi":"10.1109/ICON.2003.1266228","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266228","url":null,"abstract":"","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"15 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":"126464324","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":"SIRS: selective intersected rule search for packet classification","authors":"Hidekazu Miyoshi, John S. Thompson","doi":"10.1109/ICON.2003.1266175","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266175","url":null,"abstract":"The key function of packet switches in the Internet, and all other packet switching networks, is packet classification. Techniques proposed for packet classification to date have many important characteristics such as speed, low cost, and flexibility but do not scale well to the needs of very large core network switches. This paper proposes a new scalable classification mechanism by extending an existing scheme, called bitmap intersection. The proposed scheme operates effectively at sizes over 200 times that of classifiers supported by the original scheme without sacrificing classification or update speed. Operation of the new technique was confirmed by computer simulation using 128,000 rules in a classifier and is compared with results reported in the literature. The simulations show that the proposed scheme is superior to both the original bitmap scheme and another existing scheme, pruned tuple space search (a comparable scheme in the literature with the proposed scheme), and can operate at forwarding rates compatible with OC192c transmission rate with reasonable memory consumption. These findings confirm that the scheme scales well for large classifiers and speeds necessary for core routers.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"23 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":"125952505","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-efficient multicasting in ad hoc networks","authors":"J. Ye, W. Wong, K. Chua","doi":"10.1109/ICON.2003.1266256","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266256","url":null,"abstract":"For power-constrained wireless ad hoc networks, a crucial issue in routing and multicasting is to conserve as much power as possible while still achieving good throughput performance. In this paper, we propose a class of power-efficient multicasting algorithms using a new cost function that jointly optimizes power conservation and path efficiency. Simulation results demonstrate significant performance improvement in terms of power efficiency and interference control, while achieving better path efficiency compared with the algorithms using pure power as cost function. Index Terms -Wireless Ad Hoc Networks, Multicasting, Power-Efficient Algorithm.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"78 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":"114869435","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":"Securing mobile IP enabled laptop","authors":"R. Wiangsripanawan, R. Safavi-Naini, W. Susilo","doi":"10.1109/ICON.2003.1266271","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266271","url":null,"abstract":"Abstract Mobile IP Onternet Protocol) enables access to the Internet anywhere with one IP address, hence, providingthe flexibility that is required by today’s growing mobile work force. Deploying Mobile IP introduces newsecurity h a t s that if not carefully addressed can have severe consequences for home organizations. IPSec is acommonly used protection mechanism that is employed in this context. IPSec requires a flexible keymanagement scheme to provide cryptographic keys to communicating entities. A commonly used public keybased key management system is SKIP (Simple Key-Management for Internet Protocols). In this paper weconsider the scenario where a laptop that is enabled with secure Mobile IP connection using SKIP, is stolenand the aim is to protect the private key stored in the laptop. We propose a method of protecting the privatekey in which the secret stored in the laptop cannot be used to determine the private key. We also introduce amethod of ‘disabling’ the stored secret such that even when the laptop is stolen, there is no need for changingthe private key. An important property of our system is that it does not add extra messages to the existingSKIP implementation.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"12 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":"116746654","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":"Transmission control policy for data services over a time-varying wireless channel","authors":"Bang Wang, K. Chua","doi":"10.1109/ICON.2003.1266259","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266259","url":null,"abstract":"In this paper, we study the transmission control prohlem for data services over a time-varying wireless channel. A data user with general arrival statistics needs to decide from time to time whether or not to transmit a packet based on its buffer occupancy and observed channel state. Each decision incurs Some rewarddcosts representing different QoS aspects. Our objective is to find an optimal transmission policy (if it exists) that maximizes the expected average reward per unit time. We discuss the existence of a stationary optimal policy and its structural properties. Simulation results suggest that different balance points can he easily achieved by simply adjusting the reward parameters.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"18 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":"114253277","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":"Simulation studies on dynamic and distributed domain-based mobile IPv6 mobility management","authors":"C. Pyo, Jie Li, H. Kameda","doi":"10.1109/ICON.2003.1266196","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266196","url":null,"abstract":"We address mobility management for the Internet protocol version 6 in mobile networks, namely mobile IPv6 (MIPv6). To correctly transfer IPv6 packets to a mobile node (MN), the MN has to update its binding to the home network while roaming away from its home network. Mobile IP networks suffer high binding update traffic from high rates of handoffs and the long packet delivery delay from the large distance to the home network. In this paper, we introduce a dynamic and distributed mobility management protocol for MIPv 6 to reduce the binding update and packet delivery delay and traffic. We describe the basic protocol operations, and examine the performance improvement of our mobility management against the previous mobile IP mobility management methods. We show that the dynamic and distributed mobility management method outperforms other previous methods, and the dynamic approach provides the optimal mobility solution for MIPv6 and the distributed approach can decentralize the network load.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"20 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":"114262494","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":"Multiresolution analysis of optical burst switching traffic","authors":"J. Aracil, M. Izal, D. Morató, E. Magaña","doi":"10.1109/ICON.2003.1266225","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266225","url":null,"abstract":"In this paper, a multiresolution analysis is conducted in order to study the self-similar features of optical burst switching (OBS) traffic. The scenario consists of an OBS backbone with input traffic from a large number of Internet users that generate Poisson-arriving heavy-tailed bursts. The results show that long-range dependence is preserved at timescales longer than the burst assembly timeout value while the traffic variability at short timescales is increased.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"58 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":"126974626","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}
David Soen-Mun Chan, K. S. Chua, C. Leckie, A. Parhar
{"title":"Visualisation of power-law network topologies","authors":"David Soen-Mun Chan, K. S. Chua, C. Leckie, A. Parhar","doi":"10.1109/ICON.2003.1266169","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266169","url":null,"abstract":"We present a novel graph layout algorithm called ODL for visualising large network topologies. The main contribution of our algorithm is to simplify the layout problem by separating the nodes in the network into multiple hierarchical layers based on the outdegree of each node. Our algorithm is designed to exploit the underlying structure of power-law topologies, which occur in a wide variety of practical network applications. However, the use of our algorithms is not limited to this class of networks. We have demonstrated that our algorithm can generate useful and aesthetically pleasing layouts for a wide variety of networks, including both regular and power-law topologies. In particular, our algorithm achieved substantial performance improvements over existing layout techniques, including a speed-up factor of up to 260 on real-life Internet routing topologies.","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":"129010685","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}