Next: ConclusionUp: No TitlePrevious: GFC2 : Results

Comparison of Switch Schemes

The Table 3gives a comparison of the algorithms.

Table 3: Comparison of the algorithms

Scheme	End of Interval	Feedback	Max. Queue	Requires Per VC for	Sensitivity to
Name	Complexity	Complexity	Length	Source Bottleneck	Queue control
Algorithm A	O(N)	O(1)	Medium	Yes	Yes
Algorithm B	O(N)	O(1)	Medium	Yes	Yes
Algorithm C	O(1)	O(1)	Large	No	No
Algorithm D	O(1)	O(1)	Medium	No	No

The algorithm D is the best of the proposed algorithm since it is of O(1) complexity, does not require per VC accounting and is not sensitive of the queue control function.

Bobby Vandalore
1998-07-22