2008 International Conference on High Performance Switching and Routing

15-17 May 2008

Filter Results

Displaying Results 1 - 25 of 53
  • 2008 international conference on high performance switching and routing (HPSR 2008)

    Publication Year: 2008, Page(s): i
    Request permission for commercial reuse | PDF file iconPDF (26 KB)
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2008, Page(s): ii
    Request permission for commercial reuse | PDF file iconPDF (38 KB)
    Freely Available from IEEE
  • Welcome to the 2008 international conference on high performance switching and routing (HPSR’2008)!

    Publication Year: 2008, Page(s): iii
    Request permission for commercial reuse | PDF file iconPDF (52 KB) | HTML iconHTML
    Freely Available from IEEE
  • Message from the Technical Program Committee Chairs

    Publication Year: 2008, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (40 KB) | HTML iconHTML
    Freely Available from IEEE
  • Technical Program Committee

    Publication Year: 2008, Page(s):v - ix
    Request permission for commercial reuse | PDF file iconPDF (50 KB)
    Freely Available from IEEE
  • list-reviewer

    Publication Year: 2008, Page(s):x - xii
    Request permission for commercial reuse | PDF file iconPDF (40 KB)
    Freely Available from IEEE
  • An improved TCAM-based IP lookup engine

    Publication Year: 2008, Page(s):1 - 5
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1551 KB) | HTML iconHTML

    IP lookup is a key task in packet processing to guarantee the high performance of the IP routers. It has been proposed to use TCAMs to implement IP-lookup accelerators for IP forwarding. In the paper, a new TCAM-based IP-lookup scheme MSMB-LPT is proposed and studied. It is shown that MSMB-LPT scheme significantly improve the performance of the state-of-art MSMB-PT scheme in terms of speedup and p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Flow control in Output Buffered Switch with Input Groups

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

    We have recently proposed a novel architecture called Output Buffered Switch with Input Groups (OBIG) together with a scheduler called Parallel Wrapped Wave Front Arbiter with Fast Scheduler (PWWFA-FS) for building large, fast switches. In this paper we continue this work and tackle the issue of flow control. We show how on/off and credit flow control schemes can be applied in OBIG; we further int... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Internal congestion control in a cluster-based router

    Publication Year: 2008, Page(s):13 - 20
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3328 KB) | HTML iconHTML

    Congestion is a problem in any distributed system. In this paper, we present and evaluate a congestion control scheme to manage congestion internal to a cluster-based router. Our results show that it is possible to improve the overall forwarding rate of the router by reducing the injection rate of traffic to the internal network when the router is under heavy load. Our control algorithm is based o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards unified self-congestion probing for bandwidth measurement

    Publication Year: 2008, Page(s):21 - 26
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3329 KB) | HTML iconHTML

    The self-congestion probing, which estimates bandwidth by controlling a temporal congestion of a probing stream, is the most popular approach in bandwidth measurement. Self-congestion tools are easy to implement, fast to converge and are robust to network dynamics with reasonably good accuracy; however, the current tools only exploit parts of the congestion signals, though the probing stream exper... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constructions and analysis of crosstalk-free optical queues

    Publication Year: 2008, Page(s):27 - 32
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2337 KB) | HTML iconHTML

    There are several recent advances in the constructions of conflict-free optical queues using optical switches and fiber delay lines (SDL). Many of these conflict-free optical queues are constructed by 2 times 2 switches and thus suffer from the notorious crosstalk problem. To alleviate the crosstalk problem, it is suggested in the literature that one should avoid routing two packets to the same 2 ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel distributed lightpath control and management for survivable optical mesh networks

    Publication Year: 2008, Page(s):33 - 38
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1991 KB) | HTML iconHTML

    This paper presents a novel distributed protocol for online provisioning in survivable mesh-based wavelength-division multiplexed (WDM) networks. This protocol examines each of the k link disjoint shortest paths as a candidate working path and as a candidate shared protection path at the same time, in parallel which gives the destination node the ability to apply an intelligent adaptive routing an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Preemption scheme for providing Rate Fairness in optical burst switching networks

    Publication Year: 2008, Page(s):39 - 44
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2115 KB) | HTML iconHTML

    Fairness in OBS networks is becoming a significant issue due to the network high loss characteristic. We propose a rate fairness preemption (RFP) scheme that can provide rate fairness in OBS networks. The RFP scheme adaptively allocates a fair amount of bandwidth to all connections and uses the preemption technique to provide this fairness. We present the analytical burst loss model for RFP implem... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Proactive routing under conversion cascading constraint in optical burst switching networks

    Publication Year: 2008, Page(s):45 - 50
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1943 KB) | HTML iconHTML

    The negative impact of cascaded wavelength conversions has been largely ignored in optical burst switching performance evaluations. When optical bursts are transmitted all optically from source to destination, each wavelength conversion performed along the lightpath causes some signal-to-noise deterioration. If the distortion of the signal quality becomes significant enough, the receiver would not... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Routers with coding and performance simulation

    Publication Year: 2008, Page(s):51 - 56
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3225 KB) | HTML iconHTML

    Although coding over P2P is effective in some ways, coding at routers can bring us more significant benefits. Unfortunately, routers in todaypsilas network are mostly not capable of network coding. We propose a novel scheme to equip routers with coding functionalities. To do this, we design a routing protocol based on network coding and regulate the coding functionalities at routers. Simulation re... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed PC based routers: Bottleneck analysis and architecture proposal

    Publication Year: 2008, Page(s):57 - 62
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2718 KB) | HTML iconHTML

    Recent research in the different functional areas of modern routers have made proposals that can greatly increase the efficiency of these machines. Most of these proposals can be implemented quickly and often efficiently in software. We wish to use personal computers as forwarders in a network to utilize the advances made by researchers. We therefore examine the ability of a personal computer to a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A distributed and scalable MPLS architecture for next generation routers

    Publication Year: 2008, Page(s):63 - 68
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2975 KB) | HTML iconHTML

    In order to deal with the growing traffic on the Internet while minimizing the router management cost, the next generation routers are gradually replacing the current core routers, which are no longer scalable. They are built with enhanced memory capacity and computing resources, distributed across a very high speed switching fabric. However, the current routing software products, particularly tho... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Routing schemes for network recovery under link and node failures

    Publication Year: 2008, Page(s):69 - 73
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (7240 KB) | HTML iconHTML

    Routing schemes combined with link-state detection mechanisms can be used to recover connection paths or network connectivity under the cases of link and node failures. Some schemes have large computation and state-update overhead as re-routing is performed throughout the network. Moreover, as soon as new routes are found, some link may become congested with flows under recovery. This congestion m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New architectures for optical packet switching using QD-SOAs for multi-wavelength buffering

    Publication Year: 2008, Page(s):74 - 79
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (6824 KB) | HTML iconHTML

    We present two architectures for implementing optical buffers. Both use multi-wavelength selective elements like quantum dot semiconductor optical amplifiers (QD-SOAs) as multi-wavelength converters and fixed-length delay lines that are combined to form both an output queuing and a parallel buffer switch design. The output queuing buffer design requires less active devices (QD-SOA) when implementi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Availability-aware routing in optical networks with primary-backup sharing

    Publication Year: 2008, Page(s):80 - 85
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1631 KB) | HTML iconHTML

    This paper creates a novel availability model for backup resources, based on which we propose a novel availability-aware routing algorithm while the backup resources are allowed to be shared by the incoming requests after computing the availability of the backup resources. For primary-backup sharing, we introduces a comparison of the requested availabilities of every connection being covered by th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A construction of shared optical buffer queue with switched delay lines

    Publication Year: 2008, Page(s):86 - 91
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1181 KB) | HTML iconHTML

    In this paper, we focus on the feedback construction of FIFO shared optical buffer queue from bufferless switch and fiber delay lines. The construction consists of an (M+2)times(M+2) crossbar switch and M fiber delay lines with delay d1, d2, ... , dM which are connected from M outputs of the switch fabric to M inputs. We show that, when setting di = min(... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Ultra-fast all-optical packet-switched routing with a hybrid header address correlation Scheme

    Publication Year: 2008, Page(s):92 - 97
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4803 KB) | HTML iconHTML

    The paper presents a new node architecture for an all-optical packet router employing multiple pulse position modulation (PPM) routing table with a hybrid packet header correlation scheme. Most existing routing tables within a node contain a large number of entries, thus resulting in a long packet header address correlation time before delivering the incoming packet to its destination. In the prop... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Emulating output queueing with the Central-stage Buffered Clos packet switching network

    Publication Year: 2008, Page(s):98 - 103
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4762 KB) | HTML iconHTML

    Clos packet switching networks are the next step in scaling current Crossbar switches to large number of ports. The novel central-stage buffered Clos-network (CBC network) has the merit of fully memory-sharing among all inputs and outputs and was proved to emulate an FCFS-OQ switch with the central module count (i.e. m) about four times of the input modules count (i.e. n). This leads to high hardw... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Matching the speed gap between SRAM and DRAM

    Publication Year: 2008, Page(s):104 - 109
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3403 KB) | HTML iconHTML

    With the constantly increasing Internet traffic, buffers are becoming major bottlenecks for todaypsilas high-end routers. In particular, router buffers are required to have both high speed and large capacities, which are hard to build with current single memory technology, such as SRAM or DRAM. A general approach is to make a combination of the SRAM and DRAM and exploit advantages from both. The m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On joint sequence design for feedback-based two-stage switch architecture

    Publication Year: 2008, Page(s):110 - 115
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2983 KB) | HTML iconHTML

    An N times N feedback-based two-stage switch is configured using a pre-determined and periodic joint sequence of N joint configurations. The joint sequence used is characterized by both in-order packet delivery and staggered symmetry properties. In this paper, we focus on designing optimal joint sequences. We first divide all possible joint sequences into four classes, with staggered symmetry prop... View full abstract»

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