Computing path information to a destination node in a data...

Details Computing path information to a destination node in a data... Computing path information to a destination node in a data...

2011-06-21

2011-06-21

Sam, Phirin (Department: 2476)

Multiplex communications

Data flow congestion prevention or control

Flow control of data transmission through a network

C370S254000

Reexamination Certificate

active

07965642

ABSTRACT:
Approaches for computing path information to a destination node in a data communications network are described. A data communications network comprises as components nodes and links therebetween and comprising a core subdomain of components and a plurality of non-core subdomains of components and having a common identifier for each non-core subdomain. An apparatus comprises first logic which when executed is operable to receive reachability information for a destination node and an associated identifier; and second logic which when executed is operable to perform a computation of path information for a path in the network to a destination node dependent on a particular identifier of a subdomain associated with the destination node, and to forward data for the destination over the path according to the path information.

REFERENCES:
patent: 7080161 (2006-07-01), Leddy et al.
patent: 7088718 (2006-08-01), Srivastava
patent: 7450495 (2008-11-01), Guerin et al.
patent: 7584298 (2009-09-01), Klinker et al.
patent: 7647426 (2010-01-01), Patel et al.
patent: 2003/0105865 (2003-06-01), McCanne et al.
patent: 2006/0153200 (2006-07-01), Filsfils et al.
patent: 2006/0274645 (2006-12-01), Bradford et al.
patent: 2008/0049622 (2008-02-01), Previdi
patent: 2008/0056151 (2008-03-01), Gazier et al.
patent: 2008/0056264 (2008-03-01), Ong
patent: 2008/0080473 (2008-04-01), Thubert
patent: 2008/0205271 (2008-08-01), Aissaoui et al.
patent: 2008/0267088 (2008-10-01), Dunbar et al.
Johnson, D. The Dynamic Source Routing Protocol. Network Working Group [online], Feb. 2007 [retrieved on Sep. 10, 2008]. Retrieved from the Internet: <URL: http://tools.ietf.org/html/rfc4728>.
Dijkstra's Algorithm. Wikipedia, the free encyclopedia. [retrieved on Sep. 10, 2008]. Retrieved from the Internet: <URL: http://en.wikipedia.org/wiki/Dijkstra's—algorithm>.
Link-State Routing Protocol. Wikipedia, the free encyclopedia. [retrieved on Sep. 10, 2008]. Retrieved from the Internet: <URL: http://en.wikipedia.org/wiki/Link-state—routing—protocol>.

Affiliated with

Also associated with

Rating

Computing path information to a destination node in a data... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Computing path information to a destination node in a data..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing path information to a destination node in a data... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2691754