Computer Science – Networking and Internet Architecture
Scientific paper
2006-05-08
Computer Science
Networking and Internet Architecture
11 pages, 2 figures. Submitted to the 2006 IEEE Conference on Decision and Control
Scientific paper
In this paper we analyze the average queue backlog in a combined input-output queued switch using a maximal size matching scheduling algorithm. We compare this average backlog to the average backlog achieved by an optimal switch. We model the cell arrival process as independent and identically distributed between time slots and uniformly distributed among input and output ports. For switches with many input and output ports, the backlog associated with maximal size matching with speedup 3 is no more than 10/3 times the backlog associated with an optimal switch. Moreover, this performance ratio rapidly approaches 2 as speedup increases.
Cogill Randy
Lall Sanjay
No associations
LandOfFree
A Delay Analysis of Maximal Matching Switching with Speedup does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Delay Analysis of Maximal Matching Switching with Speedup, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Delay Analysis of Maximal Matching Switching with Speedup will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-463356