|
The article discusses about how to apply the concepts of the switch scheduling problem in the context of high-speed network switches. ... There are many known algorithms that solve this problem, but they are slow (and as so, they cannot be applied to a high-speed context) and may, besides, cause starvation.
There are a great number of aspects that should be taken into account when scheduling a switch. Of these aspects, some of the most important are throughput, for the bandwidth to be used completely, fairness, to avoid starvation and allow progress to be made, latency, to avoid the time between packet receiving and sending that slows down the link capacity, cost, the amount of signal wires needed to communicate scheduling information, modularization, that is how the topology of the switches affects the network, and scalability, that is the capacity of use the same schedule for different large numbers of ports in a switch.
Approximate Word count = 588 Approximate Pages = 2.4 (250 words per page double spaced)
|
|