Abstract
ExCCC network is an extension of Exchanged Hypercube(EH) network by replacing each node with a cycle. Based on the proposed ExCCC, we can construct a new data center network structure named ExCCC-DCN and this network model is a highly scalable, cost-effective and energy-efficient data center network structure. The unicast routing algorithm for ExCCC networks is to find the shortest path between a source and destination pairs by designing a procedure named circle representation(CR). This paper will focus on the multicast routing algorithm of ExCCC network, and consider using the idea of solving the minimum spanning tree to design multicast routing algorithm.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
