{"title":"Constrained shortest path first algorithm for lambda-switched mesh optical networks with logical overlay OCh/SP rings","authors":"F. Poppe, H. de Neve, G. Petit","doi":"10.1109/HPSR.2001.923622","DOIUrl":"https://doi.org/10.1109/HPSR.2001.923622","url":null,"abstract":"We describe a constrained shortest path first (CSPF) routing algorithm for lambda-switched optical networks with logical overlay OCh/SP rings. Speed is definitely a requirement if the algorithm is to be used for lambda-switching, but several features of the network architecture complicate the routing problem. The algorithm we present in this paper meets the requirement of being fast. Moreover, the routing of a lightpath is based on a limited amount of link state information, which can be disseminated by a lightweight routing protocol. Our numerical results show that the performance of the algorithm does not improve significantly if the routing decisions are based on more detailed information about the configuration of the network.","PeriodicalId":308964,"journal":{"name":"2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134524750","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":"Cache replacement schemes for data-driven label switching networks","authors":"Namgi Kim, Sungkee Jean, Jinsoo Kim, Hyun-ho Yoon","doi":"10.1109/HPSR.2001.923636","DOIUrl":"https://doi.org/10.1109/HPSR.2001.923636","url":null,"abstract":"The traffic on the Internet has been growing exponentially for some time. This growth is beginning to put stress on the current-day routers. On the other hand, switching technology, such as ATM, offers much higher performance than IP routing, but it is not the global internetwork protocol. As a result, the label-switching network which combines IP routing with switching technology has emerged. In the data-driven label switching, flow classification and cache table management are needed. Flow classification classifies packets into switching and nonswitching ones and cache table management maintains the cache table that contains information for flow classification and label switching. More specifically, cache table management affects the performance of the label-switching network considerably as well as the flow classification. This is because the bigger cache table makes it possible for more traffic to be sent by switching and maintains lower setup cost. However, the size of the cache table is restricted by router resources. Therefore, for efficient cache table management, studies on the cache replacement scheme are needed. This scheme must consider the characteristics of the real Internet traffic generated by the user. We evaluate basic cache replacement schemes: first in first out (FIFO), least flow count (LRC) and least recently used (LRU). Then we propose and evaluate weighted priority LRU and L2A schemes. The proposed schemes exhibit a better performance than those basic schemes.","PeriodicalId":308964,"journal":{"name":"2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133137420","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":"Multifractal study of Internet traffic","authors":"Z. Gal, G. Terdik, E. Iglói","doi":"10.1109/HPSR.2001.923631","DOIUrl":"https://doi.org/10.1109/HPSR.2001.923631","url":null,"abstract":"The self-similar/multifractal nature of Internet traffic has been observed by several measurements and statistical studies. It has not been decided yet whether the traces are following either self-similar or multifractal flows. In this paper we analyzed Internet data traffic, both the classical Bellcore-data and data measured at our MAN by a local protocol analyzer. A new multifractal stochastic model was applied and showed its relevance in these cases.","PeriodicalId":308964,"journal":{"name":"2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127807256","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 bandwidth constrained QoS routing algorithm","authors":"L. Yao, M. Doroslovački, D. McDysan","doi":"10.1109/HPSR.2001.923665","DOIUrl":"https://doi.org/10.1109/HPSR.2001.923665","url":null,"abstract":"Most previous work on bandwidth-constrained QoS routing looks for one feasible path that meets a certain bandwidth requirement. Even if multiple paths exist in the network and the combination of these paths satisfies the bandwidth requirement of the QoS request, the inability to find a single path with the required bandwidth results in rejection of the QoS request by these algorithms. In this paper, we propose a new bandwidth constrained QoS routing algorithm that breaks the flow into smaller sub-flows and seeks multi-paths when there is no a single feasible path in the network. The performance of this algorithm is predictable since it always accepts the QoS request as long as there is enough resource between the source node and the destination node. Moreover the finer granularity of the sub-flows improves the network utilization.","PeriodicalId":308964,"journal":{"name":"2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)","volume":"2012 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127403476","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 of all-optical shared memory architecture packet switch networks using channel grouping under bursty traffic","authors":"M. Shell, J. Hughes","doi":"10.1109/HPSR.2001.923633","DOIUrl":"https://doi.org/10.1109/HPSR.2001.923633","url":null,"abstract":"This work develops an exact logical operation model to predict the performance of the all-optical shared memory architecture (OSMA) class of packet switches, under random or bursty traffic. The model also provides a means to obtain a reasonable approximation of OSMA switch element performance within certain types of networks, including the Banyan family.","PeriodicalId":308964,"journal":{"name":"2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126168289","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 platform-independent API for quality of service management","authors":"G. Stattenberger, T. Braun, M. Brunner","doi":"10.1109/HPSR.2001.923642","DOIUrl":"https://doi.org/10.1109/HPSR.2001.923642","url":null,"abstract":"The differentiated services approach to QoS in the Internet poses new challenges on the configuration and service provisioning side. The approach relies on an entity often referred to as a bandwidth broker. It configures the network elements so that guaranteed networking services are provided to customers. However, the DiffServ capable routers have a large variety of hardware configurations and different configuration interfaces (e.g. SNMP, CORBA, CLI). Therefore, we propose a QoS management API which is used by bandwidth broker implementations in order to configure the underlying routers. In our prototype we implemented a proprietary configuration interface to our Linux-based DiffServ router implementation.","PeriodicalId":308964,"journal":{"name":"2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126543406","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":"Service differentiation extensions for elastic and real-time traffic in 802.11 wireless LAN","authors":"A. Banchs, X. Pérez, M. Radimirsch, H. Stuttgen","doi":"10.1109/HPSR.2001.923640","DOIUrl":"https://doi.org/10.1109/HPSR.2001.923640","url":null,"abstract":"QoS in wireless networks has a special relevance due to the scarce bandwidth available in such networks. This contribution addresses this issue by extending the MAC protocol of the IEEE 802.11 wireless LAN standard. The extension is divided in two steps. In the first step, real-time traffic is distinguished from elastic traffic by a priority scheduling approach in order to meet the delay requirements of, for example, voice communication. In the second step, service differentiation is introduced for elastic traffic, based on a relative differentiation model. In this model, a high priority service always receives a higher throughput than a low priority one. The proposed architecture has been validated via simulation. Results for real-time traffic show that the proposed approach leads to sufficiently low delays if admission control is properly applied. Elastic traffic achieves the desired differentiation in all simulated scenarios.","PeriodicalId":308964,"journal":{"name":"2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130456902","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":"Effective bandwidth for traffic engineering","authors":"R. Kunz, S. Nielson, M. Clement, Q. Snell","doi":"10.1109/HPSR.2001.923616","DOIUrl":"https://doi.org/10.1109/HPSR.2001.923616","url":null,"abstract":"In today's Internet, demand is increasing for guarantees of speed and efficiency. Current routers are very limited in the type and quantity of observed data they can provide, making it difficult for providers to maximize utilization without the risk of degraded throughput. This research uses statistical data currents provided by router vendors to estimate the impact of changes in network configuration on the probability of link overflow. This allows service providers to calculate in advance, the effect of grooming on a network, eliminating the conservative trial-and-error approach normally used. These predictions are made using large deviation theory, which focuses on the tails of the distribution, giving a better estimate than average and peak values.","PeriodicalId":308964,"journal":{"name":"2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128316595","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":"Administrative weight allocation for PNNI routing algorithms","authors":"R. Izmailov, B. Sengupta, A. Iwata","doi":"10.1109/HPSR.2001.923659","DOIUrl":"https://doi.org/10.1109/HPSR.2001.923659","url":null,"abstract":"The paper addresses the issue of assigning administrative weights used by routing algorithms in private network-network interface (PNNI) networks. We consider two versions of the problem: with and without the knowledge of the traffic matrix. For both versions, we propose methods capable of improving the routing performance of PNNI routing algorithms. Depending on the network and traffic patterns, the call blocking probabilities could be reduced by about 50% or more. The methods are verified by analysis and simulations.","PeriodicalId":308964,"journal":{"name":"2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128422469","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":"Pricing for the multi-service networks","authors":"Xinjie Chang, D. Petr","doi":"10.1109/HPSR.2001.923613","DOIUrl":"https://doi.org/10.1109/HPSR.2001.923613","url":null,"abstract":"Congestion control is one of the key issues to be addressed for the emerging multi-service networks. However, without an appropriate mechanism to encourage end users to use the network properly, over-utilization and congestion are unavoidable. It has been widely accepted that pricing is a proper tool to manage congestion. However, how to charge for the traffic and at what price is still under study. This paper gives a review of the state of the art of the developments on various pricing policies and different charging and billing schemes that have been proposed for ATM and Internet differentiated services. Architecture and implementation issues are also discussed. Finally, some future trends are identified.","PeriodicalId":308964,"journal":{"name":"2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128679357","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}