Multiplex communications – Network configuration determination
Reexamination Certificate
2004-12-07
2009-12-22
Cho, Hong (Department: 2419)
Multiplex communications
Network configuration determination
C370S351000, C709S220000
Reexamination Certificate
active
07636325
ABSTRACT:
Nodes in a network are operable to provide an information service. A set of the nodes having a highest workload are identified by routing a list of workloads for the nodes through the network to a final destination. Each node receiving the list determines whether to include a workload of a respective node in the list.
REFERENCES:
patent: 5539883 (1996-07-01), Allon et al.
patent: 6389448 (2002-05-01), Primak et al.
patent: 6691165 (2004-02-01), Bruch et al.
patent: 6820262 (2004-11-01), Tellez et al.
patent: 6965930 (2005-11-01), Arrowood et al.
patent: 7197573 (2007-03-01), Jacobson et al.
patent: 7296268 (2007-11-01), Darling et al.
patent: 7353538 (2008-04-01), Sample
patent: 7389510 (2008-06-01), Forrester
patent: 2002/0059451 (2002-05-01), Haviv
patent: 2002/0107962 (2002-08-01), Richter et al.
patent: 2002/0178261 (2002-11-01), Chang
patent: 2003/0110291 (2003-06-01), Chen
patent: 2004/0143842 (2004-07-01), Joshi
patent: 2005/0047420 (2005-03-01), Tanabe et al.
patent: 2005/0268102 (2005-12-01), Downey
patent: WO2004/086720 (2004-10-01), None
Andrezejak, A. et al., “Scalabe, Efficient Range Queries for Grid Information Services”, HP Labs Technical Report HPL-2002-209, Jul. 2002.
Balazinska, M. et al, “Twine: A Scalabe Peer-to-Peer Architecture for Intentional Resource Discovery”, Lecture Notes in Computer Science, 2002.
Czajkowski, K. et al., “Grid Information Services for Distributed Resource Sharing”, Proc. 10th IEEE International Symposium on High Performance Distributed Computing, 2001.
Ganesan, P. et al., “One Torus to Rule Them All: Multi-Dimensional Quereis in P2P Systems”, Stanford University; 2004.
Iamnitchi, A. et al., “A Peer-to-Peer Approach to Resource Location in Grid Environments”, Univ. of Chicago Technical Report TR-2002-06.
Oppenheimer, D. et al. “Scalable Wide-Area Resource Discovery”, Univ. Of California, Berkely, San Diego; downloaded 2004. http://www.cs.berkely.edu/˜davidopp/sword/; downloaded 2004.
Banerjee Sujata
Basu Sujoy
Lee Sung-Ju
Sharma Puneet
Cho Hong
Hewlett--Packard Development Company, L.P.
Scheibel Robert C
LandOfFree
Determining highest workloads for nodes in an overlay 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 Determining highest workloads for nodes in an overlay network, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Determining highest workloads for nodes in an overlay network will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4147396