On modeling link conflict resolution strategies for circuit-switching hypercubes

An analysis is made of the latency time of an interconnection network based on a circuit switching technique for a hypercube multicomputer by using analytical and simulation models. To establish a path from a source to a destination node, some links have to be allocated. Links are serial resources, so when more communication requests request the same link, this contention has to be solved. Two main solution strategies are considered: the hold and the drop. It is shown that the drop strategy permits a higher amount of communication traffic within the network before reaching the network´s saturation. However, such an approach requires a more complex communication router architecture