• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 102,059
Next 10 →

Implementation of High Performance Buffer Manager for an Advance Input-Queued Switch Fabric

by Jung-hee Lee, Bhum-cheol Lee, Gab Joong Jeong, Gab Joong Jeong, Gab Joong Jeong, Gab Joong Jeong , 2002
"... In this paper, we describe the implementation of high performance buffer manager that is used in an advanced input-queued switch fabric. It provides the architecture of buffer manager and illustrates the design of ingress and egress buffer for the highspeed switch fabric, which uses a multi-gigabit ..."
Abstract - Add to MetaCart
In this paper, we describe the implementation of high performance buffer manager that is used in an advanced input-queued switch fabric. It provides the architecture of buffer manager and illustrates the design of ingress and egress buffer for the highspeed switch fabric, which uses a multi

Multicast Scheduling for Input-Queued Switches

by Balaji Prabhakar, Nick McKeown, Ritesh Ahuja - IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS
"... This paper presents the design of the scheduler for an M × N input-queued multicast switch. It is assumed that: (i) Each input maintains a single queue for arriving multicast cells, and (ii) Only the cell at the head of line (HOL) can be observed and scheduled at one time. The scheduler is ..."
Abstract - Cited by 58 (2 self) - Add to MetaCart
This paper presents the design of the scheduler for an M × N input-queued multicast switch. It is assumed that: (i) Each input maintains a single queue for arriving multicast cells, and (ii) Only the cell at the head of line (HOL) can be observed and scheduled at one time. The scheduler

Fair Scheduling in Input-Queued Switches

by Hongwei Ma, Jingguo Ge, Hualin Qian
"... Abstract-- Input-queued switch architecture has become attractive in the context of high performance networking because the switching fabric and the buffer need not run at a multiple (speedup) of the external link’s rate. With the expanding of network applications, the networks should provide QoS gu ..."
Abstract - Add to MetaCart
Abstract-- Input-queued switch architecture has become attractive in the context of high performance networking because the switching fabric and the buffer need not run at a multiple (speedup) of the external link’s rate. With the expanding of network applications, the networks should provide Qo

input-queued

by Andrew Brzezinski, Eytan Modiano
"... weighted matching for scheduling the ..."
Abstract - Add to MetaCart
weighted matching for scheduling the

Packet Scheduling in Input-Queued Cell-Based Switches

by M. Ajmone Marsan , A. Bianco, P. Giaccone, E. Leonardi, F. Neri - IEEE INFOCOM 2001 , 2001
"... Input-queued switch architectures play a major role in the design of high performance switches and routers for packet networks. These architectures must be controlled by a scheduling algorithm, which solves contentions in the transfer of data units from inputs to outputs. Several scheduling algorith ..."
Abstract - Cited by 20 (2 self) - Add to MetaCart
Input-queued switch architectures play a major role in the design of high performance switches and routers for packet networks. These architectures must be controlled by a scheduling algorithm, which solves contentions in the transfer of data units from inputs to outputs. Several scheduling

Deficit Round Robin Scheduling for Input-Queued Switches

by Xiao Zhang, Laxmi N. Bhuyan - IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS , 2003
"... In this paper, we address the problem of fair scheduling of packets in Internet routers with input-queued switches. The goal is to ensure that packets leave the router in proportion to their reservation under heavy traffic. First, we examine the problem when fair queuing is applied only at output li ..."
Abstract - Cited by 16 (1 self) - Add to MetaCart
In this paper, we address the problem of fair scheduling of packets in Internet routers with input-queued switches. The goal is to ensure that packets leave the router in proportion to their reservation under heavy traffic. First, we examine the problem when fair queuing is applied only at output

Scheduling Input-Queued Switches

by Shadow Departure Time, Jinhui Li, Nirwan Ansari
"... A new scheduling algorithm for input-queued cell switches, referred to as shadow departure time algorithm (SDTA), is introduced. Simulations demonstrate that the SDTA's cell delay distribution is more desirable than those of the GS-OCF and GS-LQF algorithms in terms of cell overdue probability. ..."
Abstract - Add to MetaCart
A new scheduling algorithm for input-queued cell switches, referred to as shadow departure time algorithm (SDTA), is introduced. Simulations demonstrate that the SDTA's cell delay distribution is more desirable than those of the GS-OCF and GS-LQF algorithms in terms of cell overdue probability.

Input-Queued ATM Switch

by Arvind Santhanam, Abhay Kar
"... 1 Introduction Asynchronous Transfer Mode (ATM) has been standardized as the multiplexing and switching technique for Broadband Integrated Services Digital Network (B-ISDN). The ability to provide guaranteed bandwidth within an acceptable cell transfer delay bound is critical to multimedia applicati ..."
Abstract - Add to MetaCart
for improving the performance of input and output buffered switch architectures for ATM applications. The internal bandwidth of a switch fabric can be expanded, enabling it to transmit k cells, by replicating the crossbar or more typically the Banyan part of the Batcher-Banyan switch k times [1]. With enough

Packet-Mode Policies for Input-Queued Switches

by Dan Guez, Alex Kesselman, Adi Rosén , 2004
"... This paper considers the problem of packet-mode scheduling of input queued switches. Packets have variable lengths, and are divided into cells of unit length. Each packet arrives to the switch with a given deadline by which it must traverse the switch. A packet successfully passes the switch if the ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
This paper considers the problem of packet-mode scheduling of input queued switches. Packets have variable lengths, and are divided into cells of unit length. Each packet arrives to the switch with a given deadline by which it must traverse the switch. A packet successfully passes the switch

SCHEDULING IN INPUT-QUEUED CELL-BASED PACKET SWITCHES

by M. Ajmone Marsan, A. Bianco, P. Giaccone, E. Leonardi, F. Neri
"... Input queuing switch architectures must be controlled by a scheduling algorithm, which solves contentions in the trans-fer of data units from inputs to outputs. Several scheduling algorithms were proposed in the literature for switches op-erating on fixed-size data units. In this paper we consider t ..."
Abstract - Add to MetaCart
Input queuing switch architectures must be controlled by a scheduling algorithm, which solves contentions in the trans-fer of data units from inputs to outputs. Several scheduling algorithms were proposed in the literature for switches op-erating on fixed-size data units. In this paper we consider
Next 10 →
Results 1 - 10 of 102,059
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University