Post-graduate theses
Current Record: 4626 of 6695
|
Identifier |
uch.csd.msc//2002sapountzis |
Title |
Πλέγματα μεταγωγής Benes με εσωτερικό Backpressure πολυπλοκότητας Ο(Ν) |
Alternative Title |
Benes switching fabrics with O(N)-complexity internal backpressure |
Author
|
Σαπουντζής, Γεώργιος
|
Thesis advisor
|
Κατεβαίνης, Μανόλης
|
Abstract |
Multistage buffered switching fabrics are the most efficient method for scaling packet switches to very large numbers of ports. The Benes network is the lowest-cost switching fabric known to yield operation free of internal blocking. Backpressure inside a switching fabric can limit the use of expensive off-chip buffer memory to just virtual-output queues (VOQ) in front of the input stage. This paper extends the known backpressure architectures to the Benes network. To achieve this, we had to successfully combine per-flow backpressure, multipath routing (inverse multiplexing), and cell resequencing. We, also, present a flow merging scheme that is needed to bring the cost of backpressure down to O(N) per switching element. We prove freedom from deadlock for a wide class of multipath cell distribution algorithms. Using a cell-time-accurate simulator, we evaluated various cell distribution and resequencing methods, we found that delay under bursty traffic is only 25 to 50 percent higher than ideal output queueing, and we showed that the delay of well-behaved flows remains unaffected by the presence of congested traffic to oversubscribed output ports. Using simplified models of the Benes fabric, we show that cell distribution does not result in throughput limitations, and identify the points of the fabric where contention is resolved.
|
Language |
Greek |
Issue date |
2002-12-05 |
Date available |
2002-12-05 |
Collection
|
School/Department--School of Sciences and Engineering--Department of Computer Science--Post-graduate theses
|
|
Type of Work--Post-graduate theses
|
Permanent Link |
https://elocus.lib.uoc.gr//dlib/d/b/f/metadata-dlib-2002sapountzis.tkl
|
Views |
488 |