Electrical computers and digital processing systems: multicomput – Computer network managing – Network resource allocating
Reexamination Certificate
2004-06-03
2009-12-15
Boutah, Alina N. (Department: 2443)
Electrical computers and digital processing systems: multicomput
Computer network managing
Network resource allocating
C709S203000, C709S201000, C709S213000, C709S217000, C709S218000, C709S219000, C709S246000, C707S793000, C707S793000, C707S793000, C707S793000, C707SE17032
Reexamination Certificate
active
07634566
ABSTRACT:
A network has network nodes for storage of respective copies of a data file. One of the network nodes has a corresponding unique locality control object for the copies of the data file. The locality control object provides authority for the one network node to control storing and modifying any of the copies of the data file. The other network nodes lacking the locality control object must obtain permission from the one network node before modifying any one of the copies of the data file. The network nodes also can negotiate for passing the locality control object from the one network node to another one of the network nodes based on determined locality attributes associated with the copies of the data file.
REFERENCES:
patent: 5423044 (1995-06-01), Sutton et al.
patent: 5442797 (1995-08-01), Casavant et al.
patent: 5613136 (1997-03-01), Casavant et al.
patent: 5737738 (1998-04-01), Sharman
patent: 5802062 (1998-09-01), Gehani et al.
patent: 5828876 (1998-10-01), Fish et al.
patent: 5829025 (1998-10-01), Mittal
patent: 5864851 (1999-01-01), Breitbart et al.
patent: 5950201 (1999-09-01), Van Huben et al.
patent: 6128647 (2000-10-01), Haury
patent: 6421767 (2002-07-01), Milillo et al.
patent: 6460055 (2002-10-01), Midgley et al.
patent: 6516350 (2003-02-01), Lumelsky et al.
patent: 6523036 (2003-02-01), Hickman et al.
patent: 6523066 (2003-02-01), Montroy et al.
patent: 6529917 (2003-03-01), Zoltan
patent: 6532535 (2003-03-01), Maffezzoni et al.
patent: 6539381 (2003-03-01), Prasad et al.
patent: 6549949 (2003-04-01), Bowman-Amuah
patent: 6550057 (2003-04-01), Bowman-Amuah
patent: 6557111 (2003-04-01), Theimer et al.
patent: 6560609 (2003-05-01), Frey et al.
patent: 6567818 (2003-05-01), Frey et al.
patent: 6571282 (2003-05-01), Bowman-Amuah
patent: 6574617 (2003-06-01), Immerman et al.
patent: 6574749 (2003-06-01), Parsons
patent: 6574750 (2003-06-01), Felber et al.
patent: 6578068 (2003-06-01), Bowman-Amuah
patent: 6578069 (2003-06-01), Hopmann et al.
patent: 6611631 (2003-08-01), Blair et al.
patent: 6678719 (2004-01-01), Stimmel
patent: 6714519 (2004-03-01), Luzzatti et al.
patent: 6779025 (2004-08-01), Wolfe et al.
patent: 6826570 (2004-11-01), Eshel et al.
patent: 6826598 (2004-11-01), Titmuss et al.
patent: 6904431 (2005-06-01), Holmgren
patent: 7080075 (2006-07-01), Chan et al.
patent: 7299285 (2007-11-01), Kasper, II
patent: 7328263 (2008-02-01), Sadjadi
patent: 7340743 (2008-03-01), Anural et al.
patent: 2001/0039548 (2001-11-01), Shinkai et al.
patent: 2001/0042139 (2001-11-01), Jeffords et al.
patent: 2002/0177449 (2002-11-01), McDonnell et al.
patent: 2003/0008661 (2003-01-01), Joyce et al.
patent: 2003/0105871 (2003-06-01), Goldick
patent: 2003/0131020 (2003-07-01), Karamanolis et al.
patent: 2003/0233281 (2003-12-01), Takeuchi et al.
patent: 2004/0199486 (2004-10-01), Gopinath et al.
patent: 2004/0205339 (2004-10-01), Medin
patent: 2005/0033948 (2005-02-01), Wei
patent: 2005/0065961 (2005-03-01), Aguren
patent: 2005/0120137 (2005-06-01), Moulton et al.
patent: 2005/0226059 (2005-10-01), Kavuri et al.
patent: 2005/0240748 (2005-10-01), Yoder
patent: 2005/0283649 (2005-12-01), Turner et al.
patent: 2006/0101025 (2006-05-01), Tichy et al.
patent: 0814590 (1997-12-01), None
patent: 1063831 (2000-12-01), None
patent: 2385683 (2003-08-01), None
Ogasawara et al. TO-Lock: Removing Lock Overhead Using the Owner's Temporal Locality. IEEE Computer Society. 2004, abstract, sections 1 thru 4.2.
“Accessing Nearby Copies of Replicated Objects in a Distributed Environment”, C. Greg Plaxton et al., ACM Symposium on Parallel Algorithms and Architectures, 1997.
Dabek et al., “Building Peer-to-Peer Systems With Chord, a Distributed Lookup Service”, Proceedings of the 8thWorkshop on Hot Topics in Operating Systems (HotOS-VIII), May 2001.
Petersen at al., “Flexible Update Propagation for Weakly Consistent Replication”, Proceedings of the 16th(ACM) Symposium on Operating Systems Principles (SSOP-16), Saint Malo, France, 1997.
Hildrum, “Why Do We Need Locality?”, Feb. 17, 2004, http://oceanstore.cs.berkeley.edu/info/whytapestry.html.
Hildrum, “The Ocean Store Project”, Feb. 17, 2004, http://oceanstore.cs.berkeley.edu/info/overview.html.
Wells, “The OceanStore Archive: Goals, Structures, and Self-Repair”, U.C. Berkeley Masters Report, May 2000.
Search Report mailed Feb. 25, 2009, European Patent Application No. 05756076.5 (Corresponding to U.S. Appl. No. 10/859,208), 3 pages.
Sayal et al., “Selection Algorithms for Replicated Web Servers”, Performance Evaluation Review ACM USA, vol. 26, No. 3, Dec. 1998, pp. 44-50, XP002515122.
Hara, “Effective Replica Allocation in Ad Hoc Networks for Improving Data Accessibility”, Proceedings IEEE Infocom 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society, IEEE Piscataway, NJ, vol. 3, 2001, pp. 1568-1576, XP002515123.
Toebes John
Turner Bryan C.
Boutah Alina N.
Cisco Technology Inc.
Turkevich Leon R.
LandOfFree
Arrangement in a network for passing control of distributed... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Arrangement in a network for passing control of distributed..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Arrangement in a network for passing control of distributed... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4140496