Multiplex communications – Pathfinding or routing – Switching a message which includes an address header
Reexamination Certificate
2011-06-07
2011-06-07
Sheikh, Ayaz R (Department: 2476)
Multiplex communications
Pathfinding or routing
Switching a message which includes an address header
C370S389000, C370S327000, C370S279000, C370S235000
Reexamination Certificate
active
07957385
ABSTRACT:
Methods and apparatus for routing a packet in a network are described. The network has a topology characterized by a hierarchical structure of nodes including n layers. L represents a layer in the structure and is an integer with L=0 representing a lowest layer and L=n−1 representing a highest layer. The method includes receiving at least a packet header of a packet at a first node and based on the packet header, determining whether to transmit the packet to a second node in either layer L, layer L+1, or layer L−1. The packet can be transmitted to the second node as soon as the packet is received at the first node without waiting to receive the entire packet and without copying the packet prior to transmission from the first node.
REFERENCES:
patent: 5471580 (1995-11-01), Fujiwara et al.
patent: 5509123 (1996-04-01), Dobbins et al.
patent: 5606551 (1997-02-01), Kartalopoulos
patent: 6212184 (2001-04-01), Venkatachary et al.
patent: 6389031 (2002-05-01), Chao et al.
patent: 6597661 (2003-07-01), Bonn
patent: 6853635 (2005-02-01), Beshai
patent: 7002958 (2006-02-01), Basturk et al.
patent: 7027453 (2006-04-01), Lui et al.
patent: 7089240 (2006-08-01), Basso et al.
patent: 7212531 (2007-05-01), Kopelman et al.
patent: 7394809 (2008-07-01), Kumar et al.
patent: 7412557 (2008-08-01), Di Benedetto et al.
patent: 7426214 (2008-09-01), Reed
patent: 7433871 (2008-10-01), Deforche et al.
patent: 2002/0174207 (2002-11-01), Battou
patent: 2003/0009474 (2003-01-01), Hyland et al.
patent: 2007/0245044 (2007-10-01), Douady et al.
patent: 2007/0263535 (2007-11-01), Shabtay
patent: 2008/0273474 (2008-11-01), Yanagihara
patent: 2009/0049114 (2009-02-01), Faraj
patent: 2010/0076856 (2010-03-01), Mullins
patent: 2010/0157788 (2010-06-01), Ellis et al.
patent: 2010/0246437 (2010-09-01), Henry et al.
patent: 2010/0250784 (2010-09-01), Henry et al.
patent: 1 587 282 (2005-10-01), None
patent: WO2004/040846 (2004-05-01), None
patent: WO2004/046963 (2004-06-01), None
Mokhtar A. Aboelaze , “MLH : A hierarchical hypercube network,” Networks (journal), 1996, vol. 28, No. 3, pp. 157-165.
Dhritiman Banerjee, et al., “The Multidimentional Torus: Analysis of Average Hop Distance and Application as a Multihop Lightwave Network,” IEEE International Conference on Communications, 1994. ICC 94. vol. 3, pp. 1675-1680, May 1-5, 1994.
Brian Bourgon, et al., “A Self-Stabilizing Shortest Path Algorithm in a DAG,” IEEE, 0-7803-2492-7/95, 1995, pp. 341-345.
Lee-Juan Fan, et al., “Routing Alforithms on the Bus-Based Hypercube Network,” IEEE Transactions on Parallel and Distributed Systems, vol. 16, No. 4, Apr. 2005, pp. 335-348.
M.M. Hafizur Rahman, et al., “Modified Hierarchical 3D-Torus Network,” IEICE Transactions On Information and Systems, vol. E88-D No. 2, Feb. 2005, pp. 177-185.
“Hop count,” from Wikipedia [online] Retrieved from the Internet: <URL: http://en.wikipedia.org/wiki/Hop—count>, [retrieved on Oct. 1, 2007]. 1 page.
“Network topology,” from Wikipedia [online]. Retrieved from the Internet: <URL: http://en.wikipedia.org/wiki/Network—topology>, [retrieved on Mar. 31, 2008]. 11 pages.
Bouabdallah et al, “Embedding Complete Binary Trees into Star Networks”, 1994, The 19th International Symposium on Mathematical Foundations of Computer Science, 1994, p. 266-275.
Non-Final Office Action from U.S. Appl. No. 12/412,253, dated Oct. 1, 2010, 20 pages.
Cohen et al., “Framework for Multicast in Hierarchical Networks” INFOCOM 2000, Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies, Proceedings, IEEE, Tel Aviv, Israel, Mar. 26-30, 2000, pp. 1673-1682.
International Search Report from International Application No. PCT/CA2010/000416 mailed Jun. 22, 2010, 13 pages.
International Search Report from International Application No. PCT/CA2010/000415 mailed Jun. 15, 2010, 11 pages.
International Search Report from International Application No. PCT/CA2010/000414 mailed Jun. 21, 2010, 10 pages.
Lamehamedi et al., “Simulation of Dynamic Data Replication Strategies in Data Grids”, Parallel and Distributed Processing Symposium, 2003, Proceedings, International, Apr. 22-26, 2003, pp. 100-109.
Liebeherr et al., “A Scalable Control Topology for Multicast Communications”, INFOCOM 1998, Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies, Proceedings, IEEE, San Francisco, CA USA, Mar. 29, 1998-Apr. 2, 1998, pp. 1197-1204.
Henry Ronald Michael
Merryfield Veronica Frances
Fish & Richardson P.C.
Lee Andrew C
Sheikh Ayaz R
TeraScale Supercomputing Inc.
LandOfFree
Method and apparatus for packet routing does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method and apparatus for packet routing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for packet routing will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2727410