Some closed form results for circuit switching in a hypercube network
- First Online:
- Cite this paper as:
- Sharma V., Varvarigos E.. (1996) Some closed form results for circuit switching in a hypercube network. In: Bougé L., Fraigniaud P., Mignotte A., Robert Y. (eds) Euro-Par'96 Parallel Processing. Euro-Par 1996. Lecture Notes in Computer Science, vol 1124. Springer, Berlin, Heidelberg
We consider circuit switching in a hypercube network where each session has to establish a dedicated connection (or circuit) to a destination node for a random length of time. We first obtain an expression for the steady-state probability that a session successfully establishes a circuit, and then obtain analytic expressions for various delay parameters, such as the time between the arrival of a session and the time it is completed (including input queueing delays). The analytic expressions allow the delay parameters to be calculated without performing costly fixed-point iterations, and show how these parameters depend on the session arrival rate and the hypercube dimension.
Unable to display preview. Download preview PDF.