Multiplex communications – Pathfinding or routing – Switching a message which includes an address header
Reexamination Certificate
2006-07-26
2010-02-09
Sheikh, Ayaz R (Department: 2419)
Multiplex communications
Pathfinding or routing
Switching a message which includes an address header
Reexamination Certificate
active
07660320
ABSTRACT:
A communication network comprising a plurality of network nodes is provided, wherein the network nodes are logically arranged to form a plurality of concentric rings, all rings except the outermost ring being with high probability fully constructed; the number of nodes on each fully constructed ring being dD, wherein d denotes the base of an integer having D digits, D≧1, and wherein D also denotes the ring number, D starting with the value 1 for the innermost ring; each node being identified by an identification number unique in the network, said identification number having D digits, D≧1, and D denoting the ring number on which the node is located, and the value of each digit being between 0 and d−1; and each node of a given fully constructed ring is allowed to route data packets to one node in the next inner ring, to d nodes in the next outer ring, if the next outer ring is fully constructed, and to at least d nodes on the same ring. The invention further regards a method of locating and securing data of a desired resource in such communication network and a method of locating and securing data of a desired resource in such communication network.
REFERENCES:
International Search Report, dated Oct. 19, 2006, corresponding to PCT/EP2006/007582.
Mislove, et al., “Providing Administrative Control and Autonomy in Structured Peer-to-Peer Overlays,” 2004, pp. 1-6, Rice University, Houston, TX, XP-002389577.
Stoica, et al., “Chord: A Scalable Peer-to-Peer Lookup Protocol for Internet Applications,” IEEE/ACM Transactions on Networking, vol. 11, No. 1, Feb. 2003, pp. 17-32, XP001144289.
Datta, et al., “On de Bruijn routing in distributed hash tables: There and back again,” Proceedings of the Fourth International Conference on Peer-to-Peer Computing, Aug. 25, 2004, pp. 159-166, XP010724979.
Liu, “Optimal Routing in the De Bruijn Networks,” IEEE, Proceedings of the International Conference on Distributed Computing Systems, May 28 to Jun. 1, 1990, pp. 537-544, XP010019300.
Bhandari, “Optimal Physical Diversity Algorithms and Survivable Networks,” IEEE, Computers and Communications, Jul. 1, 1997, pp. 433-441, XP010241387.
Stoica, et al., “Chord: A Scalable Peer-to-Peer Lookup Protocol for Internet Applications,” SIGCOMM Comput. Commun. Rev., 31(4) pp. 1-12, 2001.
N.G de Bruijn: A Combinatorial problem, In Nederl. Adad. Wetensh. Proc. 49, pp. 768-764, 1946 (On Order).
English translation of International Preliminary Examination Report fo corresponding PCT application No. PCT/EP2006/007582, dated Jan. 29, 2008.
N.G. de Bruijn (Communicated by Prof. W. Van Der Woude): A Combinatorial problem, In Nederl. Adad. Wetensh. Proc. 49, pp. 758-764.
Simeonov Plamen L.
Wepiwe Giscard
Christie Parker & Hale LLP
Sheikh Ayaz R
Sloms Nicholas
Technische Universitat Berlin
LandOfFree
Communication network, a method of routing data packets in... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Communication network, a method of routing data packets in..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Communication network, a method of routing data packets in... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4187822