HPSR. 2005 Workshop on High Performance Switching and Routing, 2005.

12-14 May 2005

Filter Results

Displaying Results 1 - 25 of 120
  • 2005 Workshop on High Performance Switching and Routing (IEEE Cat. No.05TH8789)

    Publication Year: 2005
    Request permission for reuse | PDF file iconPDF (49 KB)
    Freely Available from IEEE
  • [Breaker page]

    Publication Year: 2005, Page(s): 0_2
    Request permission for reuse | PDF file iconPDF (11 KB)
    Freely Available from IEEE
  • 2005 Workshop on High Performance Switching and Routing

    Publication Year: 2005, Page(s): i
    Request permission for reuse | PDF file iconPDF (35 KB)
    Freely Available from IEEE
  • Copyright page

    Publication Year: 2005, Page(s): ii
    Request permission for reuse | PDF file iconPDF (84 KB)
    Freely Available from IEEE
  • Welcome message from the general chair and program chair

    Publication Year: 2005, Page(s):iii - iv
    Request permission for reuse | PDF file iconPDF (188 KB) | HTML iconHTML
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2005, Page(s):v - xii
    Request permission for reuse | PDF file iconPDF (826 KB)
    Freely Available from IEEE
  • Building packet buffers using interleaved memories

    Publication Year: 2005, Page(s):1 - 5
    Cited by:  Papers (19)  |  Patents (21)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (969 KB) | HTML iconHTML

    High end routers need to store a large amount of data. Dynamic random access memories (DRAMs) are typically used for this purpose. However, DRAM memory devices don't match the bandwidth requirements, especially in terms of random access speeds. In this paper, we analyze a generalized memory interleaving scheme. This scheme implements a large, fast memory using multiple, slower DRAMs. In the presen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Byte-focal: a practical load balanced switch

    Publication Year: 2005, Page(s):6 - 12
    Cited by:  Papers (27)  |  Patents (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1407 KB) | HTML iconHTML

    Recently, a novel switch architecture, the load balanced (LB) switch proposed by C.S. Chang et al. (2000, 2002) opened a new avenue for designing a large-capacity packet switch. The load balanced switch consists of two stages. First, a load-balancing stage spreads arriving packets equally among all linecards. Then, a forwarding stage transfers packets from the linecards to their final output desti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Load-balancing in Clos-like packet switches with distributed cross-point queues

    Publication Year: 2005, Page(s):13 - 17
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (957 KB) | HTML iconHTML

    Packet switches may be scaled by spreading the traffic across packet switch elements that effectively operate in parallel. This can introduce mis-sequencing of packets within a flow, which is undesirable and degrades network performance. Most solutions require impractical complex central schedulers. We have conceived an architecture and method for load-balancing without mis-sequencing that builds ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Click vs. Linux: two efficient open-source IP network stacks for software routers

    Publication Year: 2005, Page(s):18 - 23
    Cited by:  Papers (19)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1340 KB) | HTML iconHTML

    Software routers based on off-the-shelf hardware and open-source operating systems are gaining more and more momentum. The reasons are manifold: first, personal computer (PC) hardware is broadly available at low cost; second, large-scale production and the huge market spur the manufacturers to closely track the improvements made available by Moore's Law; third, open-source software leaves the free... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • ROSE: a novel link state information update scheme for QoS routing

    Publication Year: 2005, Page(s):24 - 28
    Cited by:  Papers (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (928 KB) | HTML iconHTML

    Distributing the link state information may introduce a significant protocol overhead on network resources. Hence, it is critical to investigate the issue of effectively and efficiently updating link state information. In this paper, by demonstrating that link state update schemes without considering the QoS requirements of connections cannot provide satisfactory solutions to real networks, we int... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Introducing node adaptation capability descriptor in GMPLS multi-region networks

    Publication Year: 2005, Page(s):29 - 33
    Cited by:  Patents (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (973 KB) | HTML iconHTML

    Currently available GMPLS extensions for multi-region networks do not efficiently advertise information about internal node switching capabilities. In this paper we propose a novel OSPF extension called node adaptation capability descriptor (NACD) and a novel provisioning policy which exploits the information flooded by NACD. Results show that the proposed NACD-aware policy determines a significan... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On maximum available bandwidth through disjoint paths

    Publication Year: 2005, Page(s):34 - 38
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (801 KB) | HTML iconHTML

    The use of multiple paths to route data between two end points provides various advantages by efficiently utilizing the underlying network resources. Prior research work has focused on the use of multiple paths with the objective of maximizing the end-to-end QoS such as bandwidth. Another category of work has proposed solutions for computing disjoint paths for fault-tolerance. In this work, we inv... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Replace MPLS with EPFTS to build a SUPANET

    Publication Year: 2005, Page(s):39 - 43
    Cited by:  Papers (6)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1116 KB) | HTML iconHTML

    The context of this paper is the network architecture next to NGI towards future converged backbone network over DWDM. The core technique in this work involves high-speed switching techniques at the physical layer with embedded QoS mechanisms. This paper challenges MPLS as the best candidate for future converged backbone networks with regard to QoS provisioning, in view that it still heavily relie... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Limits on the traffic carrying capacity of all optical networks with ring topology

    Publication Year: 2005, Page(s):44 - 48
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (790 KB) | HTML iconHTML

    This paper presents limits on the traffic earning capacity of a DWDM-based ring network. We develop limits for single-hop traffic, multi-hop traffic, as well as the total traffic carried by the network under the assumption that the incident traffic among all node-pairs is symmetric. We present some interesting results illustrating the total earned traffic by a ring network as a function of availab... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A novel optical storage area network implemented in a metro WDM setting

    Publication Year: 2005, Page(s):49 - 52
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (834 KB) | HTML iconHTML

    This paper presents a review of various optical storage area network (SAN) related technologies. It reviews recent developments in SAN technologies. It also reviews the recent developments in metro wavelength division multiplexing (WDM) networks. The paper proposes metro WDM networks technologies for storage area networking. It presents analysis and simulation results of a proposed architecture of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Crosstalk-free photonic switching networks

    Publication Year: 2005, Page(s):53 - 57
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (776 KB) | HTML iconHTML

    Directional-coupler (DC) based optical switching networks can switch signals at the rate of several terabits per second. However, it suffers from an intrinsic crosstalk problem. Vertically stacking Banyan type network is a very promising structure to serve as the networks of DC-based optical switches. In this paper, we use a contention graph model to find the strictly nonblocking condition and the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optical burst transport network (OBTN) - a novel architecture for efficient transport of optical burst data over lambda grids

    Publication Year: 2005, Page(s):58 - 62
    Cited by:  Papers (8)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1148 KB) | HTML iconHTML

    This paper presents novel network architecture, called optical burst transport network (OBTN), which can efficiently transport burst data over a virtual topology and reduce the port count of optical burst nodes. In OBTN nodes, bursts from attached optical feeder networks, e.g., metro networks, are multiplexed and transported to their egress OBTN node in one of two ways: preferably on direct end-to... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mutual priority: a scheme for effective and efficient distributed schedulers for high-speed cell-based switches

    Publication Year: 2005, Page(s):63 - 67
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1003 KB) | HTML iconHTML

    Distributed scheduling algorithms for cell-based virtual output queuing (VOQ) switches have led to high-performance schedulers. However, existing algorithms suffer from low service guarantees and a need for several iterations to provide high throughput. In this paper, we introduce the mutual priority concept, a new mechanism that addresses these issues. We prove that mutual priority algorithms ach... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • HCF: a starvation-free practical algorithm for maximizing throughput in input-queued switches

    Publication Year: 2005, Page(s):68 - 72
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (963 KB) | HTML iconHTML

    Using virtual output queueing (VOQ), maximum matching scheduling algorithms have been shown to achieve 100% throughput in input-queued switches, but has high complexity such that implementation is infeasible for high-speed systems. Iterative maximal matching algorithms, proposed as an alternative, cannot run for more than a few iterations due to the hardware complexity involved, thus resulting in ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multicast scheduling in buffered crossbar switches with multiple input queues

    Publication Year: 2005, Page(s):73 - 77
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1030 KB) | HTML iconHTML

    We consider the problem of scheduling multicast traffic in a buffered crossbar switch with multiple input queues at each input port. In this paper, we design and investigate a series of combinations of queuing policies and scheduling algorithms and report the simulation result. It is shown that a small number of input queues at each input port can dramatically improve the performance under burst m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • LCCF: a scheduling algorithm for asynchronous optical switches

    Publication Year: 2005, Page(s):78 - 82
    Cited by:  Patents (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (969 KB) | HTML iconHTML

    Using optical technology for packet switch fabrics offers several advantages such as scalability, high bandwidth, lower power consumption, and lower cost. These optical fabrics may work in synchronous or asynchronous fashion. This paper focuses on the asynchronous optical switch scheduling (AOSS) problem. We show that the AOSS problem is NP-complete for switches with more than three ports by formu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A regenerator pool dimensioning method to avoid early blocking

    Publication Year: 2005, Page(s):83 - 87
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (958 KB) | HTML iconHTML

    We propose a method to dimension pools of regenerators which are preconfigured in the network nodes. We aim to minimize the overall number of regenerators in the network, given that a specified number of first connections are not blocked by these regenerators. Furthermore, we propose extensions of the method to minimize the blocking probability after the initial operation phase. The approach uses ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Routing and restoration in networks with hose-model traffic patterns

    Publication Year: 2005, Page(s):88 - 93
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1120 KB) | HTML iconHTML

    In a DiffServ network the service level agreements (SLAs) signed by the service provider and its customers normally specify the ingress and egress aggregate rate of each class, but provide no destination information. Traffic patterns of this kind are similar to the "hose model" which has been extensively studied in the context of VPN (virtual private network). An important issue is to determine ho... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improvements on fault localization in GMPLS-based networks

    Publication Year: 2005, Page(s):94 - 99
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (946 KB) | HTML iconHTML

    With the increasingly urgent need for robust and reliable networks, the issue of protection and restoration in GMPLS-based networks becomes very important. In order to perform protection and restoration fast and effectively, a simple and efficient fault localization scheme, which is the necessary first step to trigger protection and restoration procedures, must be provided. Considerable efforts ha... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.