2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)

29-31 May 2001

Filter Results

Displaying Results 1 - 25 of 81
  • 2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)

    Publication Year: 2001
    Request permission for commercial reuse | PDF file iconPDF (573 KB)
    Freely Available from IEEE
  • Index

    Publication Year: 2001, Page(s):415 - 416
    Request permission for commercial reuse | PDF file iconPDF (304 KB)
    Freely Available from IEEE
  • Use of FEC coding for real-time transport on ATM networks

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

    The use of forward error-control (FEC) coding has emerged as a promising approach for real-time transport over ATM networks for cell-loss recovery. The use of an FEC-based transport protocol over networks with bandwidth constraints, however, is not obvious since FEC coding introduces an overhead which can possibly cause additional cell losses which, furthermore, tend to occur in bursts. In this wo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast incremental CRC updates for IP over ATM networks

    Publication Year: 2001, Page(s):48 - 52
    Cited by:  Papers (9)  |  Patents (53)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (96 KB) | HTML iconHTML

    In response to the increasing network speeds, many operations in IP routers and similar devices are being made more efficient. With the advances in other areas of packet processing, the verification and regeneration of cyclic redundancy check (CRC) codes of the data link layer is likely to become a bottleneck in the near future. In this paper, we present a mechanism to defer CRC verification witho... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • TSFD: two stage frame dropping for scalable video transmission over data networks

    Publication Year: 2001, Page(s):43 - 47
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (228 KB) | HTML iconHTML

    Scalable video transmission is used to adjust the rate of video depending on the level of network congestion. Previous studies on scalable video transmission of MPEG over ATM ABR service required major changes in the network protocols and did not provide methods to determine the ABR connection parameters. We propose a new scalable video transmission scheme which does not require major changes in n... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The architecture design for a terabit IP switch router

    Publication Year: 2001, Page(s):358 - 362
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (200 KB) | HTML iconHTML

    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 thro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The preplanned weighted restoration scheme

    Publication Year: 2001, Page(s):36 - 41
    Cited by:  Papers (7)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (144 KB) | HTML iconHTML

    One of the expected benefits of wavelength division multiplexing (WDM) is the possibility to provide an optical layer (OL) with built-in capabilities to survive network component faults, e.g., fiber cut. Several schemes exist to design a reliable OL. These schemes are generally divided into protection and restoration techniques. Protection schemes reserve in advance a dedicated backup path and a w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel IP packet forwarding for tomorrow's IP routers

    Publication Year: 2001, Page(s):353 - 357
    Cited by:  Papers (6)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (164 KB) | HTML iconHTML

    The invention and evolution of the dense wavelength division multiplexing (DWDM) technology has brought a breakthrough to high-speed networks, and it has put a lot of pressure on research in the area of IP router to catch up. Besides, with up-coming quality of service (QoS) requirements raised by a wide range of communication-intensive, real-time multimedia applications, the next-generation IP rou... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hamiltonian cycle protection: a novel approach to mesh WDM optical network protection

    Publication Year: 2001, Page(s):31 - 35
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (128 KB) | HTML iconHTML

    Designing a protection scheme for a mesh WDM network is a challenging task. Extending the concept of the SONET self-healing ring in the mesh topology by using multiple rings to cover a mesh is inefficient in network resource usage. Mesh-based schemes can yield an optimal solution in network resource usage, but entails complicated switch reconfigurations when network element fails. In addition, mes... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Administrative weight allocation for PNNI routing algorithms

    Publication Year: 2001, Page(s):347 - 352
    Cited by:  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (228 KB) | HTML iconHTML

    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, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An improved fair traffic shaping algorithm for high speed packet switches

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

    This paper presents an improved fair traffic shaping algorithm for high speed packet switches. This algorithm introduces a resorting process to resolve the contention of multiple cells which are all eligible for transmission in the traffic shaper. By using the resorting process based on the each connection's rate, we can give better fairness and flexibility in the bandwidth assignment for connecti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Channel protection in WDM mesh networks

    Publication Year: 2001, Page(s):26 - 30
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (320 KB) | HTML iconHTML

    With the increased transmission capacity in WDM networks a single failure in the network (like a fiber cut or equipment failure) may result in enormous data loss. Therefore, resilience from a component or optical link failure is essential to provide uninterrupted communication between any two nodes in the network. Several techniques exist to provide reliable services in the occurrence of failures.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the convergence of path vector routing protocols

    Publication Year: 2001, Page(s):292 - 296
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (100 KB) | HTML iconHTML

    This work is motivated by previously reported experimental results on the delayed convergence of the border gateway protocol (BGP), which is the standard for inter-domain routing in the Internet. BGP is a path vector protocol. We investigate the convergence properties of path vector protocols and, in particular, their alleged effectiveness in dealing with the count-to-infinity problem that plagues... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A probabilistic priority scheduling discipline for high speed networks

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

    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... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • QLP: a joint buffer management and scheduling scheme for input queued switches

    Publication Year: 2001, Page(s):164 - 168
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1920 KB) | HTML iconHTML

    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 ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A bandwidth constrained QoS routing algorithm

    Publication Year: 2001, Page(s):380 - 384
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (116 KB) | HTML iconHTML

    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 pape... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Study of the TCP/UDP fairness issue for the assured forwarding per hop behavior in differentiated services networks

    Publication Year: 2001, Page(s):190 - 196
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (300 KB) | HTML iconHTML

    The IETF Differentiated Services Working Group has standardized the assured forwarding (AF) per hop behavior (PHB). Studies of the AF PHB showed that there are a number of factors that affect fair bandwidth distribution for traffic flows with equal target rates. These factors cause unfair distribution of excess bandwidth in an over provisioned network as well as unfair degradation in an under prov... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algorithm for traffic grooming in optical networks to minimize the number of transceivers

    Publication Year: 2001, Page(s):218 - 221
    Cited by:  Papers (62)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (72 KB) | HTML iconHTML

    We study the problem of traffic grooming to reduce the number of transceivers in optical networks. We show that this problem is equivalent to a certain traffic maximization problem. We give an intuitive interpretation of this equivalence and use this interpretation to derive a greedy algorithm for transceiver minimization. We discuss implementation issues and present computational results comparin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An improved PIM-SM tree recovery algorithm

    Publication Year: 2001, Page(s):342 - 346
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (112 KB) | HTML iconHTML

    Multicast tree recovery in protocol independent multicast-sparse mode (PIM-SM) networks is initiated by state changes in the underlying unicast routing protocol. A substantial part of the subsequent data loss can be attributed to the non-reductive events, e.g. link addition. We propose and evaluate an improvement to the standard PIM-SM recovery procedure, showing that the data loss can be signific... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Forwarding the balance between absolute and relative: a new differentiated services model for adaptive traffic

    Publication Year: 2001, Page(s):250 - 254
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2452 KB) | HTML iconHTML

    Most applications can adapt their coding techniques and sending rates according to the network congestion and the resource needed can be provided at the beginning of the transmission. So the traditional DiffServ model is too rigid to them. In this paper, we are seeking a balance between the relative DiffServ and the absolute DiffServ and propose a new Diffserv model, a relative differentiated serv... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Congestion avoidance using adaptive random marking

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

    Recent work on congestion control in TCP/IP networks combines improved end-user transmission mechanisms with active queue management schemes. In this paper we propose MARS (Marking based on Adaptive Random Scheme), an adaptive early packet marking active queue management mechanism. Unlike previous proposals, MARS adapts the marking probability to drive the average queue length towards a target siz... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On scheduling real-time traffic under controlled load service in an integrated services Internet

    Publication Year: 2001, Page(s):11 - 15
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (72 KB) | HTML iconHTML

    The controlled load service defined within the IETF's Integrated Services architecture for QoS in the Internet requires source points to regulate the traffic while the network provides a soft guarantee on performance. Packets sent in violation of the traffic are marked so that the network may give them lower priority. We have defined the requirements of a scheduler serving packets belonging to the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A framework of a survivable optical Internet using short leap shared protection (SLSP)

    Publication Year: 2001, Page(s):21 - 25
    Cited by:  Papers (8)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (220 KB) | HTML iconHTML

    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 versa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Heterogeneity-aware shortest path routing: flow holding time, user demand and network state

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

    We investigate possible performance improvements by exploring heterogeneity of traffic characteristics when designing a shortest path routing scheme. First we focus on the effect of the maintenance of the link metrics for connections with different holding times. We found that by using a differentiated routing scheme with respect to connection holding times, one can enhance network performance for... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fully desynchronized round-robin matching scheduler for a VOQ packet switch architecture

    Publication Year: 2001, Page(s):407 - 411
    Cited by:  Papers (48)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1780 KB) | HTML iconHTML

    Virtual output queuing (VOQ) is a practical and high-performance packet switch architecture. There are many simple iterative arbitration algorithms proposed for the VOQ architecture. We investigate in this paper the performance of various such algorithms and based on the analysis of pointer desynchronization effect, we propose a group of new arbitration algorithms, called SRR (static round robin m... View full abstract»

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