{"title":"A framework of a survivable optical Internet using short leap shared protection (SLSP)","authors":"P. Ho, H. Mouftah","doi":"10.1109/HPSR.2001.923597","DOIUrl":"https://doi.org/10.1109/HPSR.2001.923597","url":null,"abstract":"Survivability and continuity of service to the end users during the occurrence of faults have evolved to be critical issues in the aspect of control and management of the next-generation Internet. The ordinary path-based and link-based shared protection schemes can only provide a limited spectrum of protection services with coarse protection granularity, which will not be able to satisfy the versatile requirements of multimedia applications on the Internet in the foreseeable future. We propose a framework, short leap shared protection (SLSP), for service-guaranteed end-to-end shared protection for the optical Internet. We describe the algorithm for implementing this idea in detail and show that SLSP enhances the 1:N and M:N shared protection schemes in terms of scalability, flexibility and class of service.","PeriodicalId":308964,"journal":{"name":"2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)","volume":"9 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":"124219457","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":"QLP: a joint buffer management and scheduling scheme for input queued switches","authors":"Dequan Liu, N. Ansari, E. Hou","doi":"10.1109/HPSR.2001.923625","DOIUrl":"https://doi.org/10.1109/HPSR.2001.923625","url":null,"abstract":"We propose the queue length proportional (QLP) assignment algorithm for input queued switches that considers buffer management and scheduling mechanism inclusively to obtain an optimal assignment of both bandwidth and buffer space according to the real traffic load. The bandwidth assignment is implemented by considering both bandwidth and backlogged queue lengths, so that it is possible to obtain a high throughput as well as a low cell loss ratio at the same time. QLP is shown to be able to maximize overall throughputs and improve buffer utilization as compared to those which treat buffer management and scheduling as separate functions.","PeriodicalId":308964,"journal":{"name":"2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)","volume":"22 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":"126048210","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}
G. Van Hoey, S. Van den Bosch, P. de La Vallee-Poussin, H. de Neve, G. Petit
{"title":"Capacity planning strategies for voice-over-IP traffic in the core network","authors":"G. Van Hoey, S. Van den Bosch, P. de La Vallee-Poussin, H. de Neve, G. Petit","doi":"10.1109/HPSR.2001.923614","DOIUrl":"https://doi.org/10.1109/HPSR.2001.923614","url":null,"abstract":"This paper examines different strategies for capacity planning within a core IP network that is used to transport real-time voice traffic. First, a \"trunking\" scenario is studied, in which traffic pipes are established between each pair of PSTN gateways, either along shortest paths or traffic-engineered paths. Secondly, a capacity provisioning approach is put forward, that supports the worst-case voice traffic load on each IP link. Simulations show that traffic engineering offers a substantial reduction of the maximum link load in the network. Moreover, it is shown that when the worst-case provisioning approach is followed, admission control and adaptations to the traffic matrix are not needed, at the cost of provisioning a higher amount of network resources.","PeriodicalId":308964,"journal":{"name":"2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)","volume":"21 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":"127232496","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 a memory architecture for fast packet buffers","authors":"Sundar Iyer, Ramana Rao Kompella, N. McKeown","doi":"10.1109/HPSR.2001.923663","DOIUrl":"https://doi.org/10.1109/HPSR.2001.923663","url":null,"abstract":"An packet switches contain packet buffers to hold packets during times of congestion. The capacity of a high performance router is often dictated by the speed of its packet buffers. This is particularly true for a shared memory switch where the memory needs to operate at N times the line rate, where N is the number of ports in the system. Even input queued switches must be able to buffer packets at the rate at which they arrive. Therefore, as the link rates increase memory bandwidth requirements grow. With today's DRAM technology and for an OC192c (10 Gb/s) link, it is barely possible to write packets to (read packets from) memory at the rate at which they arrive (depart). As link rates increase, the problem will get harder. There are several techniques for building faster packet buffers, based on ideas from computer architecture such as memory interleaving and banking. While not directly applicable to packet switches, they form the basis of several techniques in use today. We consider one particular packet buffer architecture consisting of large, slow, low cost, DRAMs coupled with a small, fast SRAM \"buffer\". We describe and analyze a memory management algorithm (ECQF-MMA) for replenishing the cache and find a bound on the size of the SRAM.","PeriodicalId":308964,"journal":{"name":"2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)","volume":"313 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120866758","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}
N. Sreenath, N. Krishna Mohan Reddy, G. Mohan, C. Siva Ram Murthy
{"title":"Virtual source based multicast routing in WDM networks with sparse light splitting","authors":"N. Sreenath, N. Krishna Mohan Reddy, G. Mohan, C. Siva Ram Murthy","doi":"10.1109/HPSR.2001.923620","DOIUrl":"https://doi.org/10.1109/HPSR.2001.923620","url":null,"abstract":"Wavelength-division multiplexed (WDM) networks using wavelength-routing are considered to be potential candidates for the next generation wide-area backbone networks. This paper concerns with the problem of multicast routing in WDM networks. A node in the network may have both wavelength conversion and splitting capabilities which is called as virtual source. It is assumed that virtual sources are limited in number and are distributed evenly in the network. This paper proposes a new approach, which makes use of these special capable virtual sources to construct a multicast tree.","PeriodicalId":308964,"journal":{"name":"2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)","volume":"22 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":"127953618","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}
C. Casetti, R. Lo Cigno, M. Mellia, M. Munafò, Z. Zsóka
{"title":"Routing algorithms evaluation for elastic traffic","authors":"C. Casetti, R. Lo Cigno, M. Mellia, M. Munafò, Z. Zsóka","doi":"10.1109/HPSR.2001.923650","DOIUrl":"https://doi.org/10.1109/HPSR.2001.923650","url":null,"abstract":"An innovative simulation technique for the performance of routing algorithms in presence of elastic traffic is proposed in this paper. Traditional simulation tools for the evaluation of routing strategies are based on the generation of calls whose length is determined when the connection enters the network. But the real duration of connections in the Internet depends on the amount of information to be transferred and the (time varying) congestion level of the network. The performance method proposed here takes into account the nature of Internet traffic, while maintaining the efficiency of call based event-driven simulations. Results show that conclusions based on traditional methods can be very far from those obtained with the more accurate method proposed here.","PeriodicalId":308964,"journal":{"name":"2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)","volume":"71 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":"127588176","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}
B. Khan, D. Talmage, S. Mountcastle, A. Battou, S. Marsh
{"title":"Introducing PRouST: the PNNI routing and simulation toolkit","authors":"B. Khan, D. Talmage, S. Mountcastle, A. Battou, S. Marsh","doi":"10.1109/HPSR.2001.923657","DOIUrl":"https://doi.org/10.1109/HPSR.2001.923657","url":null,"abstract":"Despite the increased availability of affordable ATM hardware, the scientific research community has often found it difficult to engage in much needed basic research in the areas of ATM protocol design and network performance optimization. We believe that one major cause for this has been the absence of affordable, publicly available source-level implementations of the ATM switch protocol stack. The PNNI routing and simulation toolkit (PRouST) attempts to remedy this. PRouST is a freely distributed, extensible environment for research and development in ATM switch signaling and routing. PRouST includes a complete source-level release of the ATM switch PNNI protocol stack, conformant to version 1.0 of the ATM Forum specification. It is our hope that PRouST will serve as the starting point for bold new initiatives in research and development for ATM technologies. We describe the design of PRouST and the features it supports.","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":"114927922","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 probabilistic priority scheduling discipline for high speed networks","authors":"Yuming Jiang, C. Tham, Chi-chung Ko","doi":"10.1109/HPSR.2001.923593","DOIUrl":"https://doi.org/10.1109/HPSR.2001.923593","url":null,"abstract":"In high speed networks, the strict priority (SP) scheduling discipline is perhaps the most common and simplest method to schedule packets from different classes of applications, each with diverse performance requirements. With this discipline, however, packets at higher priority levels can starve packets at lower priority levels. To resolve this starvation problem, we propose to assign a parameter to each priority queue in the SP discipline. The assigned parameter determines the probability with which its corresponding queue is served when the queue is polled by the server. We thus form a new packet scheduling discipline, referred to as the probabilistic priority (PP) discipline. By properly setting the assigned parameters, service differentiation as well as fairness among traffic classes can be achieved in PP. In addition, the PP discipline can be easily reduced to the ordinary SP discipline or to the reverse SP discipline.","PeriodicalId":308964,"journal":{"name":"2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)","volume":"23 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":"130737578","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":"The architecture design for a terabit IP switch router","authors":"J. Yang, N. Uzan, S. Papavassiliou","doi":"10.1109/HPSR.2001.923661","DOIUrl":"https://doi.org/10.1109/HPSR.2001.923661","url":null,"abstract":"We propose an architecture for scalable, high capacity IP switch routers in which we apply fixed-length packet switching technology to support high speed IP forwarding. The proposed IP switch router consists of routing controllers, routing modules and a switch plane. The architectures of routing modules and switch plane whose aggregate capacity can be as large as ten terabit are proposed. The throughput of the IP switch router is guaranteed by a fixed-length packet switch plane which is able to emulate the ideal output queueing (OQ) switch in terms of throughput and average internal queueing delay. The performance of the switch plane is presented and the link list operations of routing modules are investigated.","PeriodicalId":308964,"journal":{"name":"2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)","volume":"69 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":"116557038","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":"Routing in wavelength routed optical networks","authors":"Y. Aneja","doi":"10.1109/HPSR.2001.923623","DOIUrl":"https://doi.org/10.1109/HPSR.2001.923623","url":null,"abstract":"We consider the routing problem that arises in the design of a virtual logical topology over a wavelength division multiplexed all optical network (AON). The logical topology is created by setting up lightpaths-end-to-end optical channels-created over the AON by suitable optical switching and routing. These lightpaths form the directed arcs of the logical topology. The combined problem of setting up lightpaths and routing of traffic over these lightpaths, in an optimal manner, is called the virtual topology design problem. The problem of designing such a topology and routing traffic over this topology with the objective of minimizing the network congestion while restricting the average propagation delay between source-destination pairs, and the degree of the logical topology, has been considered by Ramaswamy and Sivarajan (1996), and formulated as a large mixed linear integer program (MILP). For a given logical topology, the problem of optimal routing of traffic becomes a large linear program. We show that, by exploiting the special structure of this linear program, the routing problem can be managed and solved much more efficiently.","PeriodicalId":308964,"journal":{"name":"2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)","volume":"18 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":"128161085","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}