Multiplex communications – Network configuration determination
Reexamination Certificate
2006-04-25
2006-04-25
Chin, Wellington (Department: 2664)
Multiplex communications
Network configuration determination
C370S351000
Reexamination Certificate
active
07035227
ABSTRACT:
A method is described for distance vector routing of on-demand traffic between routers within an ad-hoc network maintaining multiple loop-free paths to destinations. Each router maintains routing table entries only for destinations associated with data flows through the router which reduce the amount of storage space and bandwidth required for routing table maintenance. Diffusing computations are utilized for establishing and maintaining the routes within the network. The sending of unnecessary flood searches and search-to-infinity problems are avoided, while the protocol decreases the vulnerability of the network to various service attacks along with router failures, fading, and drop outs.
REFERENCES:
patent: 4825206 (1989-04-01), Brice et al.
patent: 5027350 (1991-06-01), Marshall
patent: 5488608 (1996-01-01), Flammer, III
patent: 5530963 (1996-06-01), Moore et al.
patent: 5608721 (1997-03-01), Natarajan et al.
patent: 5881243 (1999-03-01), Zaumen et al.
patent: 6118760 (2000-09-01), Zaumen et al.
patent: 6535498 (2003-03-01), Larsson et al.
Gafni Eli M. et al.; “Distributed Algorithms for Generating Loop-Free Routes in Networks With Frequently Changing Topology,” IEEE Transactions on Communications, vol. COM-29, No. 1, pp. 11-18, Jan., 1981.
Garcia-Luna-Aceves, J.J.; “Loop-Free Routing Using Diffusing Computations,” IEEE/ACM Transactions on Networking, vol. 1, No. 1, pp. 130-141, Feb., 1993.
Huitema, C.; “Routing in the Internet,” Chapter 6, pp. 145-148, Prentice Hall PTR, (1995).
Jaffe, Jeffrey M. and Moss, Franklin H.; “A Responsive Distributed Routing Algorithm for Computer Networks,” IEEE Transactions on Communications, vol. COM-30, No. 7, pp. 1758-1762, Jul., 1982.
Johnson, D.B. and Maltz, D.A.; “Dynamic Source Routing in Ad-Hoc Wireless Networks,” Mobile Computing, eds. Imielinski, Tomasz and Korth, Hank, Kluwer Academic Publishers, (1996).
Ju, J. and Li, V.O.K.; “An Optimal Topology-Transparent Method In Multihop Packet Radio Networks,” IEEE/ACM Transactions Networking, vol. 6, No. 3, pp. 298-306, Jun., 1998.
Moy, J.; “OSPF Version Two,” Network Working Group, Proteon, Inc., Request for Comments: 1247, pp. 1 thru 136, Jul., 1991.
Park, V.D. and Corson, M.S.; “A Highly Adaptive Distributed Routing Algorithm for Mibile Wireless Networks,” Proceedings IEEE Infocom'97, Kobe, Japan, pp. 1 thru 9, Apr., 1997.
Perkins, C.E. et al.; “Ad Hoc On-Demand Distance Vector (AODV) Routing,” Internet Draft, Mobile Ad Hoc Networking Group, Nokia Research Center, University of California-Santa Barbara, University of Cincinnati, pp. 1 thru 29, Nov. 9, 2001.
Shepard, T.; “A Channel Access Scheme for Large Dense Packet Radio Networks,” Proceedings ACM SIGCOMM '96 , pp. 1-12, Aug., 1996.
Zhu, C. and Corson, S.; “A Five-Phase Reservation Protocol (FPRP) for Mobile Ad-Hoc Networks,” Proceedings IEEE Infocom '98, pp. 1-10, (1998).
Garcia-Luna-Aceves Jose J.
Raju Jyoti
Chin Wellington
Khoo F. Lin
O'Banion John P.
The Regents of the University of California
LandOfFree
On-demand loop-free multipath routing (ROAM) does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with On-demand loop-free multipath routing (ROAM), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On-demand loop-free multipath routing (ROAM) will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3545522