Multiplex communications – Network configuration determination – Using a particular learning algorithm or technique
Reexamination Certificate
2011-08-30
2011-08-30
Mattis, Jason E (Department: 2461)
Multiplex communications
Network configuration determination
Using a particular learning algorithm or technique
C370S236200, C370S400000
Reexamination Certificate
active
08009591
ABSTRACT:
In one embodiment, a method includes receiving on a first communication link at a local router all routing information at a certain level of detail for each router of multiple routers communicating in a first flooding domain. A measure of distance is determined from a particular router in the first flooding domain to the local router. It is determined whether the measure of distance exceeds a threshold. If the measure of distance exceeds the threshold, then summary routing information with less than the certain level of detail is determined for the particular router. Also, certain routing information is sent over a different second communication link at the local router. The certain routing information includes the summary information for the particular router, and all routing information at the certain level of detail for a subset of routers communicating in the first flooding domain, which subset excludes the particular router.
REFERENCES:
patent: 6023724 (2000-02-01), Bhatia et al.
patent: 6046985 (2000-04-01), Aldred et al.
patent: 6314105 (2001-11-01), Luong
patent: 6473431 (2002-10-01), Perlman et al.
patent: 6519231 (2003-02-01), Ding et al.
patent: 6654359 (2003-11-01), La Porta et al.
patent: 6678241 (2004-01-01), Gai et al.
patent: 6690653 (2004-02-01), Anbiah et al.
patent: 6704301 (2004-03-01), Chari et al.
patent: 6711152 (2004-03-01), Kalmanek et al.
patent: 6721290 (2004-04-01), Kondylis et al.
patent: 6721344 (2004-04-01), Nakao et al.
patent: 6744775 (2004-06-01), Beshai et al.
patent: 6826621 (2004-11-01), Kephart et al.
patent: 6865151 (2005-03-01), Saunders
patent: 6961310 (2005-11-01), Cain
patent: 6963575 (2005-11-01), Sistanizadeh et al.
patent: 7002949 (2006-02-01), Garcia-Luna-Aceves et al.
patent: 7184421 (2007-02-01), Liu et al.
patent: 7190696 (2007-03-01), Manur et al.
patent: 7286479 (2007-10-01), Bragg
patent: 7444153 (2008-10-01), Yokota
patent: 7533166 (2009-05-01), Beyda
patent: 7609672 (2009-10-01), Retana et al.
patent: 7609838 (2009-10-01), Westhoff et al.
patent: 2001/0024443 (2001-09-01), Alriksson et al.
patent: 2002/0075807 (2002-06-01), Troxel et al.
patent: 2002/0082035 (2002-06-01), Aihara et al.
patent: 2002/0101821 (2002-08-01), Feldmann et al.
patent: 2002/0112060 (2002-08-01), Kato
patent: 2003/0026268 (2003-02-01), Navas
patent: 2003/0037168 (2003-02-01), Brabson et al.
patent: 2003/0095554 (2003-05-01), Shimizu
patent: 2003/0112799 (2003-06-01), Chandra et al.
patent: 2003/0174653 (2003-09-01), Basu et al.
patent: 2003/0218988 (2003-11-01), Han et al.
patent: 2003/0223379 (2003-12-01), Yang et al.
patent: 2004/0081152 (2004-04-01), Thubert et al.
patent: 2004/0081154 (2004-04-01), Kouvelas
patent: 2004/0085912 (2004-05-01), Xu et al.
patent: 2004/0085928 (2004-05-01), Chari et al.
patent: 2004/0162819 (2004-08-01), Omae et al.
patent: 2004/0196843 (2004-10-01), Zinin
patent: 2004/0208175 (2004-10-01), McCabe
patent: 2005/0030921 (2005-02-01), Yau
patent: 2005/0047353 (2005-03-01), Hares
patent: 2005/0074019 (2005-04-01), Handforth et al.
patent: 2005/0089015 (2005-04-01), Tsuge et al.
patent: 2005/0220077 (2005-10-01), Vereecke et al.
patent: 2005/0221752 (2005-10-01), Jamieson et al.
patent: 2006/0140111 (2006-06-01), Vasseur et al.
patent: 2006/0159082 (2006-07-01), Cook et al.
patent: 2006/0159095 (2006-07-01), Cook et al.
patent: 2006/0165009 (2006-07-01), Nguyen et al.
patent: 2006/0198321 (2006-09-01), Nadeau et al.
patent: 2007/0019593 (2007-01-01), Sarkar
patent: 2007/0053295 (2007-03-01), Cleveland et al.
patent: 2007/0091795 (2007-04-01), Bonaventure et al.
patent: 2007/0165532 (2007-07-01), Retana et al.
patent: 2007/0214283 (2007-09-01), Metke et al.
patent: 2008/0002640 (2008-01-01), Westphal
patent: 2008/0056157 (2008-03-01), Retana et al.
patent: 2008/0062947 (2008-03-01), Retana et al.
patent: 2009/0086663 (2009-04-01), Ho et al.
patent: 2010/0008231 (2010-01-01), Retana et al.
patent: 2010/0098090 (2010-04-01), Westhoff et al.
patent: 1489870 (2004-04-01), None
patent: 101390321 (2009-03-01), None
patent: 101523813 (2009-09-01), None
patent: 1974486 (2009-03-01), None
patent: 2070260 (2009-06-01), None
patent: WO 2007/117727 (2007-10-01), None
patent: WO 2008/027668 (2008-03-01), None
patent: WO 2008/033618 (2008-03-01), None
patent: WO 2008/067041 (2008-06-01), None
J. Moy,“Open Shortest Path First (OSPF) Version 2,” Request for Comments (RFC) 2328, Apr. 1998,185pp,Internet Engineering Task Force (IETF), Internet, ietf.org.
“NovaRoam: Dynamic Routing for Mobile Networks,” 2000, novaroam.com/downloads/wp—tora.pdf, Nova Engineering, Inc., Cincinnati, Ohio, USA.
C. Small, “Radio Shortest Path First (RSPF) Specification, IV. Link state propagation,” 2000, 9pp, rspf.sourceforge.net/rspfspec4.html,Internet.
Park and Corson, “Temporally-Ordered Routing Algorithm (TORA) Version 1 Functional Specification,” Jul. 20, 2001, 22pp, ietf.org,draft-ietf-manet-tora-spec-04,IETF, Internet-Draft.
Kennicott and Fisk,“Dynamic Allocation of Nodes on a large Space-shared Cluster,”2001,23pp,cacr.caltech.edu/cluster2001/program/talks/kennicott.pdf, CalTech,Pasadena,CA,US.
Kaya et al., “SQS: An Experimental Scalable Network Structure for Efficient Querying of Micro Sensors,”2003, 12pp,cse.yeditepe.edu.tr/tnl/wisent/htmls/pubs/sqs.pdf,Istanbl.
Karp and Kung,“GPSR:Greedy Perimeter Stateless Routing for Wireless Networks,” 2000,12pp,eecs.harvard.edu
etworking/papers/karp-kung-gpsr-500.pdf, Harvard, Cambridge, MA,US.
Curran,“SWARM: cooperative Reinforcement Learning for Routing in Ad-hoc Networks,”2003,84pp, cs.tcd.ie/publications/tech-reports/reports.03/TCD-CS-2003-6.pdf,TrinityCol,Dublin.
Corson,Park,Impett,“Temporlaly-Ordered Routing Algorithm,” 2006,2pp, www.isr.umd.edu/ISR/accomplishments/037—Routing, Univeristy of Maryland, Inst.SystemsRes.,Baltimore, MD,US.
International Search Report for International Application No. PCT/US07/60289 mailed Apr. 18, 2008 (3 pages).
International Preliminary Report on Patentability issued Jul. 22, 2008 (1 page) and Written Opinion mailed Apr. 18, 2008 (5 pages) for International Application No. PCT/US07/60289.
International Preliminary Report on Patentability issued Mar. 3, 2009 (1page) Written Opinion mailed Feb. 4, 2008 (6 pages) for International Application No. PCT/US07/073940.
International Search Report for International Application No. PCT/US07/073940 mailed Feb. 4, 2008 (1 page).
Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration (1 page), International Search Report (2 pages), and Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration (3 pages) for International Application No. PCT/US07/74890 mailed Jan. 30, 2008.
International Search Report for International Application No. PCT/US07/80857 mailed Mar. 21, 2008 (1 page).
International Preliminary Report on Patentability issued Jun. 3, 2009 (1 page) and Written Opinion of the International Searching Authority mailed Mar. 21, 2008 (4 pages) for International Application No. PCT/US07/80857.
USPTO Mar. 18, 2003 Notice of Allowance from U.S. Appl. No. 11/862,713.
State Intellectual Property Office of the People's Republic of China, Application No. 200780033858.6, Date of Issue Feb. 24, 2011, The First Office Action, 12 pages.
PRC Apr. 8, 2011 SIPO First Office Action for Application No. 2007800032937 [English Translation only available—mailed from foreign associate Jun. 16, 2011]; 9 pages.
Chandra Madhavi
Cook David Anthony
Retana Alvaro
White Russell
Yang Yi
Cisco Technology Inc.
Mattis Jason E
Patent Capital Group
LandOfFree
Automatic overlapping areas that flood routing information does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Automatic overlapping areas that flood routing information, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Automatic overlapping areas that flood routing information will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2746753