Forwarding packets to a directed acyclic graph destination...

Multiplex communications – Data flow congestion prevention or control – Flow control of data transmission through a network

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C370S252000

Reexamination Certificate

active

07924722

ABSTRACT:
Each network node having at least one destination-oriented link toward a directed acyclic graph (DAG) destination can receive a corresponding set of path performance metrics via the destination-oriented link. The set of path performance metrics, initiated by the DAG destination outputting initial link metrics on each of its source-connecting links, identifies aggregate link metrics for a corresponding path to the DAG destination via the corresponding destination-oriented link. The network node outputs a corresponding updated set of path performance metrics on each of its source-connecting links based on the received set of path performance metrics and the corresponding link metric for the corresponding source-connecting link. Hence, each network node in the DAG can assess the performance of each connected path to the DAG destination, and forward a data packet via a selected destination-oriented link based on the corresponding path performance metrics and forwarding policies for the forwarded data packet.

REFERENCES:
patent: 5251205 (1993-10-01), Callon et al.
patent: 5519704 (1996-05-01), Farinacci et al.
patent: 5881246 (1999-03-01), Crawley et al.
patent: 6865184 (2005-03-01), Thubert et al.
patent: 7006453 (2006-02-01), Ahmed
patent: 7333827 (2008-02-01), Biddiscombe et al.
patent: 7693064 (2010-04-01), Thubert et al.
patent: 2002/0141346 (2002-10-01), Garcia-Luna-Aceves et al.
patent: 2003/0202465 (2003-10-01), Cain
patent: 2004/0032852 (2004-02-01), Thubert et al.
patent: 2004/0081152 (2004-04-01), Thubert et al.
patent: 2005/0265259 (2005-12-01), Thubert et al.
patent: 2006/0010249 (2006-01-01), Sabesan et al.
patent: 2006/0067247 (2006-03-01), Rajan
patent: 2006/0101157 (2006-05-01), Eardley
patent: 2006/0133328 (2006-06-01), Levendel et al.
patent: 2006/0227724 (2006-10-01), Thubert et al.
patent: 2006/0291404 (2006-12-01), Thubert et al.
patent: 2006/0291485 (2006-12-01), Thubert et al.
patent: 1 324 532 (2003-07-01), None
patent: WO 2005/010214 (2005-02-01), None
U.S. Appl. No. 11/251,760, filed Oct. 18, 2005, Thubert et al.
Baker, “An outsider's view of MANET” <draft-baker-manet-review-01> Network Working Group, Internet Draft, Mar. 17, 2002, pp. 1-39.
Ernst et al., “Network Mobility Support Terminology” >draft-ernst-monet-terminology-01.txt> IETF Internet Draft, Jul. 2002, pp. 1-18.
Kandula et al., “Walking the Tightrope: Responsive Yet Stable Traffic Engineering”, Association for Computing Machinery (ACM), SIGCOMM '05, Aug. 21-26, 2005, Philadelphia, Pennsylvania, ACM 1-59593-009-04/05/08, 12 pages.
Moy, :OSPF Version 2, Network Working Group, Request for Comments: 2328, Apr. 1998, pp. 1-244.
Awduche et al., “RSVP-TE: Extensions to RSVP for LSP Tunnels”, Network Working Group, Request for Comments: 3209, Dec. 2001, pp. 1-61.
Le Roux et al., “Requirements for Inter-Area MPLS Traffic Engineering”, Network Working Group, Request for Comments: 4105, Jun. 2005, pp. 1-22.
Badache et al., “Le routage dans les réseaux mobiles ad hoc”, Ministère De L'Enseignement Supérieur Et De La Recherche Scientifique, Sep. 2000, <http://opera/inrialpes.fr/people/Tayeb.Lemlouma/Papers/AdHocRouting.pdf>, 115 pages.
Perkins et al., “Ad hoc On-Demand Distance Vector (AODV) Routing” <draft-ietf-manet-aodv-13.txt> Mobile Ad Hoc Networking Working Group Internet Draft, Feb. 17, 2003, pp. i-ii and 1-35.
Johnson et al., “The Dynamic Source Routing Protocol” <draft-ietf-manet-dsr-09.txt> IETF MANET Working Group Internet Draft, Apr. 15, 2003, pp. i-v and 1-111.
Garcia-Luna-Aceves et al, “Source Tree Adaptive Routing (STAR) Protocol” <draft-ietf-manet-star-00.txt> IETF MANET Working Group Internet Draft, Oct. 22, 1999, pp. 1-26.
Park et al., “A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks”, Proceedings of IEEE INFOCOM '97, (1997), 9 pages.
Park et al., “A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks”, Proceedings of IEEE INFOCOM '97, (1997) (Powerpoint Presentation by Xin Zhang), 12 pages.
Thubert et al. “Nested Nemo Tree Discovery” <draft-thubert-tree-discovery-01.txt> NEMO Working group Internet Draft, Oct. 11, 2004, pp. 1-17.
Perkins, ed.,Ad Hoc Networking, 2001, Chapter 8—Link Reversal Routing, Addison-Wesley, USA, title pages (2) and pp. 255-298.

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

Forwarding packets to a directed acyclic graph destination... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Forwarding packets to a directed acyclic graph destination..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Forwarding packets to a directed acyclic graph destination... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2648490

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