Routing in Communications Networks

Alternate routing schemes in packet and circuit switched communications networks provide efficiency. Diverse routing provides for increased reliability. We will survey common routing schemes and describe a memoryless, distributed and diverse routing control which relies on the construction of acyclic subgraph in which all accept k nodes are k-connected to the destination node. An efficient algorithm for finding this subgraph will be presented.