Dynamic allocation of shared network resources between...

Electrical computers and digital processing systems: multicomput – Computer-to-computer data routing

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C709S226000, C709S229000, C709S235000, C709S242000

Reexamination Certificate

active

09527584

ABSTRACT:
Resources of a shared physical network element of a communications network are dynamically allocated between connection-oriented traffic and connectionless traffic. For each shared physical network element of the network, a resource requirement of the connection-oriented traffic is determined; and a respective traffic metric to be used for routing connectionless traffic is dynamically adjusted based on the determined resource requirement of the connection-oriented traffic. As a result, resources of the shared physical network element can be efficiently utilized, and congestion of connectionless traffic being routed through the shared physical network element is avoided.

REFERENCES:
patent: 6363053 (2002-03-01), Schuster et al.
patent: 6363319 (2002-03-01), Hsu
patent: 6473404 (2002-10-01), Kaplan et al.
RFC2702: Requirements for Traffic Engineering Over MPLS (D. Awduche; J. Malcolm; J. Agogbua; M. O'Dell; and J. McManus—Sep. 1999.

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

Dynamic allocation of shared network resources between... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Dynamic allocation of shared network resources between..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dynamic allocation of shared network resources between... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3864387

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