Search

The performance of a shared-buffer switching element with a threshold priority mechanism is evaluated. The evaluation uses a discrete-time, finite-state Markov chain model of the switch with its source traffic and the steady state probabilities are approximated. Then, the loss probabilities are used to solve the dimensioning problem of the buffer capacity and threshold level such that each cell type has maximum cell loss probabilities.

Data communication in wavelength-division multiplexed (WDM) networks occurs via a source-destination pair. A lightpath is created between two nodes in the network and data hops through these nodes. However, only a limited number of lightpaths may be created such that a sequence of lightpaths known as a multi hop path needs to be structured. The most logical and efficient route through this path may be calculated using an algorithm for permutation routing based on shuffle network topology.

Computer network switches are tasked to provide the necessary bandwidth to different applications in asynchronous transfer mode networks. These applications are not used continuously such that there are times when the bandwidth allocations are used up and times when they are just left idle. Among the different applications, data applications usually has the lowest priority and receives the left-over bandwidth from other applications. An improved available bit rate framework proposes a use-it-or-lose-it policy based on an open-loop control for allocating bandwidth.