Method of routing and multiplexing demands in a telecommunicatio

Multiplex communications – Fault recovery – Bypass an inoperative channel

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

370238, 370254, 340827, 39520069, 3952007, 39520071, H04L 1224, H04Q 1104

Patent

active

059462957

ABSTRACT:
A method of routing lower multiplex level demands in a telecommunications network including a plurality of interconnected nodes to form higher multiplex level demand-routes. The method defines an initial lower multiplex level demand-route for each pair of nodes of the network. The initial lower multiplex level demand-route carries all lower multiplex level demands originating or terminating at a node of the pair. The method then splits the demand of each initial lower multiplex level demand-route between an express demand and an overflow demand and routes express demands in higher multiplex level express routes. The method patches the overflow demands into higher multiplex level routes according to a predetermined patching policy.

REFERENCES:
patent: 5515367 (1996-05-01), Cox, Jr. et al.
patent: 5564021 (1996-10-01), Qiu et al.
patent: 5657142 (1997-08-01), Fahim
patent: 5729692 (1998-03-01), Qiu et al.
patent: 5787271 (1998-07-01), Box et al.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Method of routing and multiplexing demands in a telecommunicatio does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method of routing and multiplexing demands in a telecommunicatio, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method of routing and multiplexing demands in a telecommunicatio will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2428048

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.