Multiplex communications – Data flow congestion prevention or control – Flow control of data transmission through a network
Reexamination Certificate
2003-02-20
2008-10-07
Orgad, Edan (Department: 2619)
Multiplex communications
Data flow congestion prevention or control
Flow control of data transmission through a network
C370S251000
Reexamination Certificate
active
07433316
ABSTRACT:
Described herein is a method for creating route summaries in an auxiliary network for a peer-to-peer (P2P) overlay network for routing a data packet. The method comprises dividing a d-dimensional Cartesian space of nodes in the P2P overlay network into multiple virtual grids that form the auxiliary network, numbering each virtual grid, summarizing default overlay network zones of the P2P overlay network corresponding to each of the virtual grids that form the auxiliary network, receiving a data packet, and routing the data packet to a packet destination using one of the P2P overlay network and the auxiliary network.
REFERENCES:
patent: 6473405 (2002-10-01), Ricciulli
patent: 6512768 (2003-01-01), Thomas
patent: 6985928 (2006-01-01), Zhang et al.
patent: 7136927 (2006-11-01), Traversat et al.
patent: 2003/0063568 (2003-04-01), Teig et al.
patent: 2004/0042403 (2004-03-01), Xu et al.
patent: 2004/0064512 (2004-04-01), Arora et al.
patent: 2004/0064556 (2004-04-01), Zhang et al.
patent: 2004/0064693 (2004-04-01), Pabla et al.
Ratnasamy et al., “A Scalable Content Addressable”, 2001, ACM, pp. 161-172.
Karlsson Magnus
Mahalingam Mallik
Xu Zhichen
Hewlett--Packard Development Company, L.P.
Orgad Edan
Park Jung
LandOfFree
Summarizing nodes in route propagation in auxiliary network... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Summarizing nodes in route propagation in auxiliary network..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Summarizing nodes in route propagation in auxiliary network... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3995902