The forwarding index of communication networks
From MaRDI portal
Publication:3030727
DOI10.1109/TIT.1987.1057290zbMath0626.94019WikidataQ56030330 ScholiaQ56030330MaRDI QIDQ3030727
Martin I. Reiman, Burton Simon, Fan R. K. Chung, Edward G. jun. Coffman
Publication date: 1987
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
communication network; routing; undirected graph; forwarding index; cube networks; generalized de Bruijn networks
05C35: Extremal problems in graph theory
90B18: Communication networks in operations research
90B10: Deterministic network models in operations research
Related Items
On Canonical Concurrent Flows, Crossing Number and Graph Expansion, Unnamed Item, Constructing integral uniform flows in symmetric networks with application to the edge-forwarding index problem, A parameter linked with \(G\)-factors and the binding number, Stirling networks: A versatile combinatorial topology for multiprocessor systems, The forwarding index of communication networks with given connectivity, Forwarding indices of \(k\)-connected graphs, The forwarding diameter of graphs, Symmetric routings of the hypercube, On quasi-Cayley graphs, Edge-foreward index of star graphs and other Cayley graphs, Bisecting de Bruijn and Kautz graphs, Expanding and forwarding parameters of product graphs, A survey on Knödel graphs., Static and dynamic low-congested interval routing schemes, Counterexamples to the uniform shortest path routing conjecture for vertex-transitive graphs, Virtual network embedding in the cycle, Forwarding indices of folded \(n\)-cubes, Expanding and forwarding, The forwarding index of directed networks, Metaheuristics for computing the forwarding index of a graph*
