The Experts below are selected from a list of 5244 Experts worldwide ranked by ideXlab platform
Michael Lang - One of the best experts on this subject based on the ideXlab platform.
-
Random Regular Graph and Generalized De Bruijn Graph with $k$ -Shortest Path Routing
IEEE Transactions on Parallel and Distributed Systems, 2018Co-Authors: Peyman Faizian, Atiqul Mollah, Xin Yuan, Scott Pakin, Zaid Salamah A. Alzaid, Michael LangAbstract:The Random regular graph (RRG) has recently been proposed as an interconnect topology for future large scale data centers and HPC clusters. An RRG is a special case of directed regular graph (DRG) where each link is unidirectional and all nodes have the same number of incoming and outgoing links. In this work, we establish bounds for DRGs on diameter, average $k$ -Shortest Path length, and a load balancing property with $k$ -Shortest Path Routing, and use these bounds to evaluate RRGs. The results indicate that an RRG with $k$ -Shortest Path Routing is not ideal in terms of diameter and load balancing. We further consider the Generalized De Bruijn Graph (GDBG), a deterministic DRG, and prove that for most network configurations, a GDBG is near optimal in terms of diameter, average $k$ -Shortest Path length, and load balancing with a $k$ -Shortest Path Routing scheme. Finally, we use modeling and simulation to exploit the strengths and weaknesses of RRGs for different traffic conditions by comparing RRGs with GDBGs.
-
random regular graph and generalized de bruijn graph with k Shortest Path Routing
International Parallel and Distributed Processing Symposium, 2016Co-Authors: Peyman Faizian, Atiqul Mollah, Xin Yuan, Scott Pakin, Michael LangAbstract:Random regular graph (RRG) has recently beenproposed as an interconnect topology for future large scaledata centers and HPC clusters. While various studies havebeen performed, this topology is still not well understood. RRGis a special case of directed regular graph (DRG) where eachlink is unidirectional and all nodes have the same number ofincoming and outgoing links. In this work, we establish boundsfor DRG on diameter, average k-Shortest Path length, and aload balancing property with k-Shortest Path Routing, and usethese bounds to evaluate RRG. The results indicate that RRGwith k-Shortest Path Routing is not ideal in terms of diameterand load balancing. We further consider the Generalized DeBruijn Graph (GDBG), a deterministic DRG, and prove thatfor most network configurations, GDBG is near optimal interms of diameter, average k-Shortest Path length, and loadbalancing with a k-Shortest Path Routing scheme. Finally, weexplore the strengths and weaknesses of RRG for differenttraffic conditions by comparing RRG with GDBG.
-
IPDPS - Random Regular Graph and Generalized De Bruijn Graph with k-Shortest Path Routing
2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2016Co-Authors: Peyman Faizian, Atiqul Mollah, Xin Yuan, Scott Pakin, Michael LangAbstract:Random regular graph (RRG) has recently beenproposed as an interconnect topology for future large scaledata centers and HPC clusters. While various studies havebeen performed, this topology is still not well understood. RRGis a special case of directed regular graph (DRG) where eachlink is unidirectional and all nodes have the same number ofincoming and outgoing links. In this work, we establish boundsfor DRG on diameter, average k-Shortest Path length, and aload balancing property with k-Shortest Path Routing, and usethese bounds to evaluate RRG. The results indicate that RRGwith k-Shortest Path Routing is not ideal in terms of diameterand load balancing. We further consider the Generalized DeBruijn Graph (GDBG), a deterministic DRG, and prove thatfor most network configurations, GDBG is near optimal interms of diameter, average k-Shortest Path length, and loadbalancing with a k-Shortest Path Routing scheme. Finally, weexplore the strengths and weaknesses of RRG for differenttraffic conditions by comparing RRG with GDBG.
Morgan Chopin - One of the best experts on this subject based on the ideXlab platform.
-
Toward Scalable Algorithms for the Unsplittable Shortest Path Routing Problem
2020Co-Authors: Amal Benhamiche, Morgan ChopinAbstract:In this paper, we consider the Delay Constrained Unsplittable Shortest Path Routing problem which arises in the field of traffic engineering for IP networks. This problem consists, given a directed graph and a set of commodities, to compute a set of Routing Paths and the associated administrative weights such that each commodity is routed along the unique Shortest Path between its origin and its destination, according to these weights. We present a compact MILP formulation for the problem, extending the work in [5] along with some valid inequalities to strengthen its linear relaxation. This formulation is used as the bulding block of an iterative approach that we develop to tackle large scale instances. We further propose a dynamic programming algorithm based on a tree decomposition of the graph. To the best of our knowledge, this is the first exact combinatorial algorithm for the problem. Finally, we assess the efficiency of our approaches through a set of experiments on state-of-the-art instances.
-
Toward Scalable Algorithms for the Unsplittable Shortest Path Routing Problem
arXiv: Data Structures and Algorithms, 2020Co-Authors: Amal Benhamiche, Morgan ChopinAbstract:In this paper, we consider the Delay Constrained Unsplittable Shortest Path Routing problem which arises in the field of traffic engineering for IP networks. This problem consists, given a directed graph and a set of commodities, to compute a set of Routing Paths and the associated administrative weights such that each commodity is routed along the unique Shortest Path between its origin and its destination, according to these weights. We present a compact MILP formulation for the problem, extending the work in (A. Bley, 2010) along with some valid inequalities to strengthen its linear relaxation. This formulation is used as the bulding block of an iterative approach that we develop to tackle large scale instances. We further propose a dynamic programming algorithm based on a tree decomposition of the graph. To the best of our knowledge, this is the first exact combinatorial algorithm for the problem. Finally, we assess the efficiency of our approaches through a set of experiments on state-of-the-art instances.
Yuanyuan Zeng - One of the best experts on this subject based on the ideXlab platform.
-
Joint bandwidth guaranteed scheduling and Shortest Path Routing algorithms in multi-channel wireless mesh networks
2010 2nd International Conference on Future Computer and Communication, 2010Co-Authors: Kai Xiang, Yuanyuan Zeng, Tong WangAbstract:The bandwidth problem is one of the most serious problems for multi-hop wireless mesh networks (WMNs) due to the influence of link interference. In this paper, we study joint problem of interference-aware bandwidth guaranteed scheduling and Shortest Path Routing in IEEE 802.11-based multi-channel wireless mesh networks with dynamic traffic. We present distributed bandwidth guaranteed TDMA scheduling for given flow requests, and we propose a bandwidth guaranteed Shortest Path Routing algorithm based on k-Shortest Path approach and admission control. The simulation results show our algorithm achieves good performance, and it can effectively provide bandwidth guaranteed Path for connection request comparing with minimal hop-count Routing algorithm.
-
An Efficient Scheme for Solving Bandwidth Guaranteed Scheduling and Shortest Path Routing Problem in Wireless Mesh Networks
2007Co-Authors: Ziming Zeng, Yuanyuan ZengAbstract:Summary The bandwidth problem is one of the most serious problems for multi-hop wireless mesh networks (WMNs) due to the influence of link interference. In this paper, we study joint problem of interference-aware bandwidth guaranteed scheduling and Shortest Path Routing in IEEE 802.11-based multi-channel wireless mesh networks with dynamic traffic. We present distributed bandwidth guaranteed TDMA scheduling for given flow requests. And we propose a bandwidth guaranteed Shortest Path Routing algorithm based on k-Shortest Path approach with admission control. The simulation results show our algorithm achieves good performance, and it can effectively provide bandwidth guaranteed Path for connection request comparing with minimal hop-count Routing algorithm.
-
Bandwidth Guaranteed Shortest Path Routing in Wireless Mesh Networks
2006 First International Conference on Communications and Networking in China, 2006Co-Authors: Yuanyuan Zeng, Ziming Zeng, Hao WangAbstract:The bandwidth problem is one of the most serious problems for wireless mesh networks due to the influence of interference. In this paper, we present a distributed interference-aware bandwidth guaranteed Shortest Path Routing protocol in IEEE 802.11-based multichannel wireless mesh networks with admission control. We design an interference-free distributed TDMA schedule to guarantee enough link flow. The simulation results show our protocol achieves good performance that it can effectively provide bandwidth guaranteed Path for connection request comparing with minimal hop-count Routing protocol.
Peyman Faizian - One of the best experts on this subject based on the ideXlab platform.
-
Random Regular Graph and Generalized De Bruijn Graph with $k$ -Shortest Path Routing
IEEE Transactions on Parallel and Distributed Systems, 2018Co-Authors: Peyman Faizian, Atiqul Mollah, Xin Yuan, Scott Pakin, Zaid Salamah A. Alzaid, Michael LangAbstract:The Random regular graph (RRG) has recently been proposed as an interconnect topology for future large scale data centers and HPC clusters. An RRG is a special case of directed regular graph (DRG) where each link is unidirectional and all nodes have the same number of incoming and outgoing links. In this work, we establish bounds for DRGs on diameter, average $k$ -Shortest Path length, and a load balancing property with $k$ -Shortest Path Routing, and use these bounds to evaluate RRGs. The results indicate that an RRG with $k$ -Shortest Path Routing is not ideal in terms of diameter and load balancing. We further consider the Generalized De Bruijn Graph (GDBG), a deterministic DRG, and prove that for most network configurations, a GDBG is near optimal in terms of diameter, average $k$ -Shortest Path length, and load balancing with a $k$ -Shortest Path Routing scheme. Finally, we use modeling and simulation to exploit the strengths and weaknesses of RRGs for different traffic conditions by comparing RRGs with GDBGs.
-
random regular graph and generalized de bruijn graph with k Shortest Path Routing
International Parallel and Distributed Processing Symposium, 2016Co-Authors: Peyman Faizian, Atiqul Mollah, Xin Yuan, Scott Pakin, Michael LangAbstract:Random regular graph (RRG) has recently beenproposed as an interconnect topology for future large scaledata centers and HPC clusters. While various studies havebeen performed, this topology is still not well understood. RRGis a special case of directed regular graph (DRG) where eachlink is unidirectional and all nodes have the same number ofincoming and outgoing links. In this work, we establish boundsfor DRG on diameter, average k-Shortest Path length, and aload balancing property with k-Shortest Path Routing, and usethese bounds to evaluate RRG. The results indicate that RRGwith k-Shortest Path Routing is not ideal in terms of diameterand load balancing. We further consider the Generalized DeBruijn Graph (GDBG), a deterministic DRG, and prove thatfor most network configurations, GDBG is near optimal interms of diameter, average k-Shortest Path length, and loadbalancing with a k-Shortest Path Routing scheme. Finally, weexplore the strengths and weaknesses of RRG for differenttraffic conditions by comparing RRG with GDBG.
-
IPDPS - Random Regular Graph and Generalized De Bruijn Graph with k-Shortest Path Routing
2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2016Co-Authors: Peyman Faizian, Atiqul Mollah, Xin Yuan, Scott Pakin, Michael LangAbstract:Random regular graph (RRG) has recently beenproposed as an interconnect topology for future large scaledata centers and HPC clusters. While various studies havebeen performed, this topology is still not well understood. RRGis a special case of directed regular graph (DRG) where eachlink is unidirectional and all nodes have the same number ofincoming and outgoing links. In this work, we establish boundsfor DRG on diameter, average k-Shortest Path length, and aload balancing property with k-Shortest Path Routing, and usethese bounds to evaluate RRG. The results indicate that RRGwith k-Shortest Path Routing is not ideal in terms of diameterand load balancing. We further consider the Generalized DeBruijn Graph (GDBG), a deterministic DRG, and prove thatfor most network configurations, GDBG is near optimal interms of diameter, average k-Shortest Path length, and loadbalancing with a k-Shortest Path Routing scheme. Finally, weexplore the strengths and weaknesses of RRG for differenttraffic conditions by comparing RRG with GDBG.
P. Subbaraj - One of the best experts on this subject based on the ideXlab platform.
-
a nondominated sorting genetic algorithm solution for Shortest Path Routing problem in computer networks
Expert Systems With Applications, 2012Co-Authors: C. Chitra, P. SubbarajAbstract:The Shortest Path Routing problem is a multiobjective nonlinear optimization problem with a set of constraints. This problem has been addressed by considering delay and cost objectives simultaneously and as a weighted sum of both objectives for comparison. Multiobjective evolutionary algorithms can find multiple pareto-optimal solutions in one single run and this ability makes them attractive for solving problems with multiple and conflicting objectives. This paper uses an elitist multiobjective evolutionary algorithm based on the nondominated sorting genetic algorithm (NSGA), for solving the dynamic Shortest Path Routing problem in computer networks. A priority-based encoding scheme is proposed for population initialization. Elitism ensures that the best solution does not deteriorate in the succeeding generations. Results for a sample test network have been presented to demonstrate the capabilities of the proposed approach to generate well-distributed pareto-optimal solutions of dynamic Routing problem in one single run. The results obtained by NSGA are compared with single objective weighting factor method for which genetic algorithm (GA) is applied.
-
A novel multi-objective evolutionary algorithm for Shortest Path Routing problem
International Journal of Communication Networks and Distributed Systems, 2011Co-Authors: C. Chitra, Subbaraj Potti, P. SubbarajAbstract:This paper presents an application of non-dominated sorting genetic algorithm-II (NSGA-II) technique for solving Shortest Path Routing problems in computer networks. The problem is formulated as a non-linear constrained multi-objective optimisation problem. NSGA-II is applied to handle Shortest Path Routing problem as a true multi-objective optimisation problem (MOOP) with competing and non-commensurable objectives. A priority-based encoding scheme is employed for population initialisation. Priorities are assigned to all the edges and NSGA-II is implemented to find the optimal solution. It is noted that this approach can find a diverse set of solutions and is converging near the true Pareto-optimal set. Results for a sample test network have been presented to demonstrate the capabilities of the NSGA-II algorithm to generate well-distributed Pareto-optimal solutions of Shortest Path Routing problem in one single run. The results obtained by NSGA-II are compared with single objective weighting factor method for which genetic algorithm (GA) is applied.
