Network load-aware content distribution in overlay networks
Computer Communications
Optimal node-selection algorithm for parallel download in overlay content-distribution networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
A new family of interconnection networks, called Generalized Hypercube-Connected-Cycle (GHCC), is proposed. The topology is defined with two integer parameters l and m such that the total number of nodes N = lm^l, degree of each node is m+1. The diameter is \lfloor {5l\over 2}\rfloor -2, when l \geq 4, m \neq 1 and \lfloor {5l\over 2}\rfloor -1, when l \leq 3, m \neq 1. The topology offers a design flexibility in the sense that out of the three design parameters, network size, degree and diameter, any two can be chosen independently. The network graph is node symmetric, (m+1)-connected and also it provides a simple routing scheme. Implementation of the ASCEND and DESCEND classes of algorithms on this topology has also been described.