On Routing and Performance Evaluation of Buffered Sparse Crossbar Concentrators

نویسندگان

  • Rahul Ratan
  • Manish Shukla
چکیده

Title of Thesis: ON ROUTING AND PERFORMANCE EVALUATION OF BUFFERED SPARSE CROSSBAR CONCENTRATORS Degree candidate: Rahul Ratan Degree and year: Master of Science, 2002 Thesis directed by: Professor A. Yavuz Oruç Department of Electrical and Computer Engineering We investigate the routing and performance of sparse crossbar packet concentrators under a buffered network model. The concentration property in packet switching concentrators is defined with respect to packets instead of input/output ports. This allows such concentrators to function as generalized connectors (with some constraints). This altered functionality for a packet concentrator over its circuit switched counterpart translates into differences in performance measures like complexity and delay. A model for constructing sparse crossbar packet switching concentrators with optimal cross point complexity has been introduced in literature. We use this construction to model the performance of a sparse crossbar packet concentrator and relate performance measures to its complexity, connectivity and buffer requirements. In this thesis, we address issues of routing and performance evaluation over such optimal sparse crossbar fabrics, in particular their relation to complexity and buffer requirements. We present an analysis of the packet loss suffered in such concentrators when excess packets are dropped. We go on to analyze the best performance possible when packets are stored and serviced in FIFO order. These results lead us to formulate a routing algorithm which tries to emulate the best case performance on the sparse crossbar. We present theoretical and simulation results for the best case performance and the algorithm. We find that the algorithm is efficient and allows concentration to be done with negligible loss of performance on the sparse crossbar. ON ROUTING AND PERFORMANCE EVALUATION OF BUFFERED SPARSE CROSSBAR CONCENTRATORS by Rahul Ratan Thesis submitted to the Faculty of the Graduate School of the University of Maryland, College Park in partial fulfillment of the requirements for the degree of Master of Science 2002 Advisory Committee: Professor A. Yavuz Oruç, Chair Professor Richard La Professor Charles. B. Silio c © Copyright by Rahul Ratan 2002

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Routing on Input Queued Buffered Sparse-Crossbar Packet Concentrators

In this paper we characterize the features of good packet routing schemes for input queued sparse crossbar based packet concentrators and propose a polling based routing algorithm which achieves near optimal performance. It has been shown by the authors of this paper that the performance of an input queued packet concentrator with different input and output packet rates can be modeled by a GI/D...

متن کامل

Performance Evaluation of Input Queued Buffered Sparse-Crossbar Packet Concentrators

In this paper, we study the performance of packet concentrators with input queueing. A recent concentrator model given by Gündüzhan and Oruç considers packet concentrators with different input and output packet rates and gives a minimum crosspoint complexity construction for buffered sparse crossbar concentrators. We use this model as a basis for the performance evaluation of concentrators whic...

متن کامل

Performance of Input-Queued Sparse-Crossbar Packet Concentrators

Packet concentrators are used in shared-memory and knockout switches to select and route packets into individual outputs. Recently, a switch model was introduced to investigate the intrinsic relationship between the switching complexity and traffic characteristics of packet concentrators. Using this model, it was shown that any bipartite packet concentrator with n inputs, m outputs and peak per...

متن کامل

Structure and Density of Sparse Crossbar

A sparse crossbar (n,m)-concentrator is a bipartite graph with n source and m sink vertices, m ≤ n, in which there exists a matching between every m source vertices and the m sink vertices. In this paper, we investigate the structure, and the density of sparse crossbar (n,m)-concentrators among all 2 bipartite graphs. We establish that the density of sparse crossbar concentrators is bounded fro...

متن کامل

Crosspoint complexity of sparse crossbar concentrators

A sparse crossbar (n,m, c)-concentrator is a bipartite graph with n inputs and m outputs in which any c or fewer inputs can be matched with an equal number of outputs, where c is called its capacity. Sparse crossbar concentrators play a key role in multiplexing signals in communication systems and constructing permutation and generalized connection networks. In this paper we present a number of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002