Selecting an instance of a resource using network...

Details Selecting an instance of a resource using network... Selecting an instance of a resource using network...

2005-12-30

2011-12-20

Cheng, Joe (Department: 2468)

Electrical computers and digital processing systems: multicomput

Computer-to-computer session/connection establishing

C709S203000, C709S219000, C709S226000

Reexamination Certificate

active

08082348

ABSTRACT:
A client computer requests a resource from an ISP/OSP. The ISP/OSP maintains multiple instances of the resource. In deciding to which instance of the resource to route the client computer, a resource selection server takes network routability information into account. Geographic proximity, resource utilization, network utilization, and/or maintenance of peering agreements may also be taken into account in selecting the instance of the resource.

REFERENCES:
patent: 6785704 (2004-08-01), McCanne
patent: 6823372 (2004-11-01), Kreiner et al.
patent: 7305375 (2007-12-01), Cioccarelli
patent: 2004/0003084 (2004-01-01), Malik et al.
patent: 2004/0136379 (2004-07-01), Liao et al.
patent: 2005/0010653 (2005-01-01), McCanne
patent: 2005/0076079 (2005-04-01), Wiebe et al.
patent: 2005/0201302 (2005-09-01), Gaddis et al.
patent: 2006/0206586 (2006-09-01), Ling et al.
patent: 2008/0049619 (2008-02-01), Twiss
On the geographic location of Internet resources Lakhina, A.; Byers, J.W.; Crovella, M.; Matta, I.; Selected Areas in Communications, IEEE Journal on;vol. 21, Issue 6, Aug. 2003 pp. 934-948 Digital Object Identifier 10.1109/JSAC.2003.814667.
Thomas Zahn, “P2P Networks are Distributed Hash Tables,”Seminar: The Economics of Peer-to-Peer Architectures, available at http://www.hu-berlin.del/˜fis/p2pe/mini—T—zahn.ppt, pp. 1-33, presented May 7, 2003.
Jianjun Zhang et al., “Constructing a Proximity-Aware Power Law Overlay Network,” available at www.cc.gatech.edu/˜zhangjj/html/zhang05constructing.pdf, pp. 1-5, presented at IEEE Global Telecommunications Conference (GLOBECOM 2005) Nov. 29, 2005, St. Louis, MO.
Miguel Castro, et al., “Topology-aware routing in structured peer-to-peer overlay networks,” Technical Report MSR-TR-2002-82, Microsoft Research, available at www.gnut.org/papers/location.pdf, pp. 1-18, 2002.
Miguel Castro et al., “Exploiting Network Proximity in Distributed Hash Tables,” available at www.cs.rice.edu/˜druschel/publications/fudico.pdf, pp. 1-4, presented at Proceedings of the International Workshop on Future Directions in Distributed Computing (FuDiCo), Jun. 6, 2002, Bertino Italy.
John Byers, et al., “Simple Load Balancing for Distributed Hash Tables,” available at www.iptps03.cs.berkeley.edu/final-papers/simple—load—balancing.ps, (pp. 1-5), presented at 2ndInternational Workshop on Peer-to-Peer Systems (IPTPS '03), Feb. 20, 2003, Berkeley, CA.
Marcin Bienkowski et al., “Dynamic Load Balancing in Distributed Hash Tables,” available at www.iptps05.cs.cornell.edu/PDFs/CameraReady—174.pdf, (pp. 1-6), presented at 4thInternational Workshop on Peer-to-Peer Systems (IPTPS '05), Feb. 25, 2005, Ithica NY.
David Tam et al., “Distributed Hash Tables,” available at www.eecg.edu/˜jacobsen/courses/rvr1770/etopic/DHT/ppt, (pp. 1-26) (last modified Feb. 13, 2003).
Zhichen Xu et al., “Netvigator: Scalable Network Proximity Estimation,” available at www.hpl.hp.com/techreports/2004/HPL-2004-28R1.pdf, (pp. 1-9), Mar. 3, 2005.
Albert Greenberg et al., “A Clean Slate 4D Approach to Network Control and Management,” ACM SIGCOMM Computer Communication Review, vol. 35, No. 5, available at http://www.acm.org/siys/sigcomm/ccr/archive/2005/october/p41-greenberg.pdf, pp. 43-54, Oct. 2005.
Albert Greenberg et al., “Refactoring Network Control and Management A Case for the 4D Architecture,” available at www.cs.princeton.edu/˜jrex/papers/CMU-CS-05-117.pdf, (pp. 1-28), Sep. 2005.
Albert Greenberg et al., “The 4D Architecture for Network Control and Management,” available at http://www.cs.cmu.edu/˜4D/, (pp. 1-2), accessed on Nov. 29, 2005.
“100x100 Clean Slate Project,” available at http://100x100network.org/, (pp. 1-2), accessed on Nov. 29, 2005.
“Network Control and Management in the 100x100 Architecture,” available at www.100x100network.org/presentations/Network-Control-and-Management.ppt, (pp. 1-77), presented May 2005.
Hui Zhang, “Clean Slate Design Approach to Networking Research,” available at www.cs.cme.edu/˜hzhang/Talks/CleanSlate.pdf, (pp. 1-64), presented May 2005.
“DHT (distributed hash table),” available at http://www.networkworld.com/details/805.html?def, (pp. 1-3), accessed Nov. 15, 2005.
“Hash table,” available at http://en.wikipedia.org/w/index.php?title=Hash—table&printable=yes, (pp. 1-10), accessed Nov. 15, 2005.
“Distributed hash table,” available at http://en.wikipedia.org/w/index.php.?title=Distributed—hash—table&printable=yes, (pp. 1-4), accessed Nov. 15, 2005.
“Key based routing,” available at http://en.wikipedia.org/wiki/Key—based—routing, (p. 1), accessed Nov. 15, 2005.

Affiliated with

Also associated with

Rating

Selecting an instance of a resource using 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 Selecting an instance of a resource using network..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Selecting an instance of a resource using network... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4265127