Cross-layer topology design for network coding based wireless multicasting

This paper considers wireless multicast networks where network coding (NC) is applied to improve network throughput. A novel joint topology and cross-layer design is proposed to miximize the network throughput subject to various quality-of-service constraints, such as: wireless multicast rate, wireless link capacity, energy supply and network lifetime. Specifically, a heuristic NC-based link-controlled routing tree algorithm is developed to reduce the number of required intermediate nodes. The proposed algorithm facilitates the optimization of the wireless multicast rate, data flow of wireless links, energy supply and lifetime of nodes through a novel cross-layer design. The proposed joint topology and cross-layer design is evaluated and compared against other schemes from the literature. The results show that the proposed scheme can achieve up to 50% increase in the system throughput when compared to a classic approach

Cross-layer topology design for network coding based wireless multicasting

This paper considers wireless multicast networks where network coding (NC) is applied to improve network throughput. A novel joint topology and cross-layer design is proposed to miximize the network throughput subject to various quality-of-service constraints, such as: wireless multicast rate, wireless link capacity, energy supply and network lifetime. Specifically, a heuristic NC-based link-controlled routing tree algorithm is developed to reduce the number of required intermediate nodes. The proposed algorithm facilitates the optimization of the wireless multicast rate, data flow of wireless links, energy supply and lifetime of nodes through a novel cross-layer design. The proposed joint topology and cross-layer design is evaluated and compared against other schemes from the literature. The results show that the proposed scheme can achieve up to 50% increase in the system throughput when compared to a classic approach

A class of hierarchical graphs as topologies for interconnection networks

We study some topological and algorithmic properties of a recently defined hierarchical interconnection network, the hierarchical crossed cube HCC(k,n), which draws upon constructions used within the well-known hypercube and also the crossed cube. In particular, we study: the construction of shortest paths between arbitrary vertices in HCC(k,n); the connectivity of HCC(k,n); and one-to-all broadcasts in parallel machines whose underlying topology is HCC(k,n) (with both one-port and multi-port store-and-forward models of communication). Moreover, (some of) our proofs are applicable not just to hierarchical crossed cubes but to hierarchical interconnection networks formed by replacing crossed cubes with other families of interconnection networks. As such, we provide a generic construction with accompanying generic results relating to some topological and algorithmic properties of a wide range of hierarchical interconnection networks

高性能通信指向のネットワークコーディング

Tohoku University堀口 進課

Topology Design of Network Coding-Based Multicast Networks

Abstract — It is anticipated that a large amount of multicast traffic need to be supported in the future communication networks. Network coding technique proposed recently is promising for establishing multicast connections with significantly lower bandwidth requirement than that of the traditional Steiner treebased multicast connections. How to design multicast network topologies with the consideration of efficiently supporting multicast by network coding technique becomes an important issue now. It is notable, however, that the conventional algorithms for network topology design are mainly unicast-oriented, and they cannot be adopted directly for efficient topology design of network coding-based multicast networks by simply treating each multicast as multiple unicasts. In this paper, we consider for the first time the novel topology design problem of network coding-based multicast networks. Based on the characteristics of multicast and network coding, we first formulate this problem as a mixed-integer nonlinear programming problem, which is NP-hard, and then propose two heuristic algorithms for it. The effectiveness of our heuristics is verified through simulation and the comparison with the exhaustive search method. We demonstrate in this paper that in the topology design of multicast networks, adopting network coding technique to support multicast transmissions can significantly reduce the overall topology cost as compared to the conventional unicast-oriented design and the Steiner tree-based design. Index Terms — Network coding, multicast networks, topology design, heuristic algorithms. I