scholarly journals Interval routing & Layered Cross Product: Compact routing schemes for butterflies, mesh of trees and fat trees

1998 ◽  
pp. 1029-1039 ◽  
Author(s):  
Tiziana Calamoneri ◽  
Miriam Di Ianni
Keyword(s):  
Cross Product ◽  
Compact Routing ◽  
Routing Schemes ◽  
Interval Routing ◽  
Mesh Of Trees

On the Hardness of Devising Interval Routing Schemes

1997 ◽  
Vol 07 (01) ◽  
pp. 39-47 ◽  
Author(s):  
Michele Flammini
Keyword(s):  
Time Complexity ◽  
Compact Routing ◽  
Routing Schemes ◽  
Np Completeness ◽  
Routing Scheme ◽  
Np Complete ◽  
Interval Routing ◽  
General Networks

The k-Interval Routing Scheme (k-IRS) is a compact routing scheme on general networks. It has been studied extensively and recently been implemented on the latest generation of the INMOS transputer router chips. In this paper we investigate the time complexity of devising a minimal space k-IRS and we prove that the problem of deciding whether there exists a 2-IRS for any network G is NP-complete. This is the first hardness result for k-IRS where k is constant and the graph underlying the network is unweighted. Moreover, the NP-completeness holds also for linear and strict 2-IRS.

scholarly journals Ordered interval routing schemes

2009 ◽  
Vol 7 (4) ◽  
pp. 363-376
Author(s):  
Mustaq Ahmed
Keyword(s):  
Routing Schemes ◽  
Interval Routing

Interval routing schemes

1995 ◽  
pp. 279-290 ◽  
Author(s):  
Michele Flammini ◽  
Giorgio Gambosi ◽  
Sandro Salomone
Keyword(s):  
Routing Schemes ◽  
Interval Routing
Sign in / Sign up

Export Citation Format

Share Document