The forwarding index of communication networks
From MaRDI portal
Publication:3030727
DOI10.1109/TIT.1987.1057290zbMath0626.94019WikidataQ56030330 ScholiaQ56030330MaRDI QIDQ3030727
Burton Simon, Martin I. Reiman, Edward G. jun. Coffman, Fan R. K. Chung
Publication date: 1987
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
communication networkroutingundirected graphforwarding indexcube networksgeneralized de Bruijn networks
Extremal problems in graph theory (05C35) Communication networks in operations research (90B18) Deterministic network models in operations research (90B10)
Related Items (41)
Counterexamples to the uniform shortest path routing conjecture for vertex-transitive graphs ⋮ On the problem of determining which \((n, k)\)-star graphs are Cayley graphs ⋮ The forwarding indices of augmented cubes ⋮ On quasi-Cayley graphs ⋮ Large fault-tolerant interconnection networks ⋮ Spectral bounds for the betweenness of a graph ⋮ Edge-foreward index of star graphs and other Cayley graphs ⋮ The forwarding index of directed networks ⋮ On the edge-forwarding indices of Frobenius graphs ⋮ Bisecting de Bruijn and Kautz graphs ⋮ Balancing Traffic Load Using One-Turn Rectilinear Routing ⋮ On Canonical Concurrent Flows, Crossing Number and Graph Expansion ⋮ Expanding and forwarding parameters of product graphs ⋮ A survey on Knödel graphs. ⋮ Echo: a peer-to-peer clustering framework for improving communication in DHTs ⋮ A parameter linked with \(G\)-factors and the binding number ⋮ Grid spanners with low forwarding index for energy efficient networks ⋮ Distance eigenvalues and forwarding indices of circulants ⋮ Recursive cubes of rings as models for interconnection networks ⋮ Stirling networks: A versatile combinatorial topology for multiprocessor systems ⋮ The forwarding index of communication networks with given connectivity ⋮ Forwarding indices of \(k\)-connected graphs ⋮ Metaheuristics for computing the forwarding index of a graph* ⋮ Constructing integral uniform flows in symmetric networks with application to the edge-forwarding index problem ⋮ Virtual network embedding in the cycle ⋮ Forwarding indices of folded \(n\)-cubes ⋮ Low-congested interval routing schemes for hypercubelike networks ⋮ The forwarding indices of wrapped butterfly networks ⋮ Cube-connected circulants: bisection width, Wiener and forwarding indices ⋮ Forwarding and optical indices of a graph ⋮ Forwarding index of cube-connected cycles ⋮ On the restricted forwarding index problem in communication networks ⋮ Expanding and forwarding ⋮ The forwarding diameter of graphs ⋮ Average distances and distance domination numbers ⋮ On forwarding indices of networks ⋮ Graphs and Algorithms in Communication Networks on Seven League Boots ⋮ Unnamed Item ⋮ Cayley graphs as classifiers for data mining: the influence of asymmetries ⋮ Symmetric routings of the hypercube ⋮ Static and dynamic low-congested interval routing schemes
This page was built for publication: The forwarding index of communication networks
