Method and system for background replication of data objects

Electrical computers and digital processing systems: multicomput – Computer network managing – Computer network monitoring

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C709S230000, C709S233000, C709S234000, C709S235000, C370S229000, C370S230000, C370S231000, C370S232000, C370S233000, C370S234000, C370S235000

Reexamination Certificate

active

07418494

ABSTRACT:
In an embodiment, a system and method may manage network resources to provide a near zero-cost background replication of data. Such a system may be inhibited from causing interference with foreground data flows. Such a system may also utilize a large fraction of spare network bandwidth. A system configured to implement such a method may include one or more servers and at least one client in communication via a network. Additionally the system may include a hint server, a monitor and/or a front-end application between a demand server and the network.

REFERENCES:
patent: 6076114 (2000-06-01), Wesley
patent: 6397258 (2002-05-01), Tsuji et al.
patent: 6700876 (2004-03-01), DiNicola et al.
patent: 6757255 (2004-06-01), Aoki et al.
patent: 6909693 (2005-06-01), Firoiu et al.
patent: 6934745 (2005-08-01), Krautkremer
patent: 7035214 (2006-04-01), Seddigh et al.
patent: 7096265 (2006-08-01), Simpson et al.
patent: 2002/0145976 (2002-10-01), Meyer et al.
patent: 2002/0150048 (2002-10-01), Ha et al.
patent: 2002/0184403 (2002-12-01), Dahlin et al.
patent: 2003/0107512 (2003-06-01), McFarland et al.
patent: 2003/0128711 (2003-07-01), Olariu et al.
patent: 2003/0223366 (2003-12-01), Jeffries et al.
patent: 2006/0129693 (2006-06-01), LeCroy et al.
Acharya et al., “A study of Internet Round-trip Delay*”, Dec. 1996; 18 pages.
Aggarwal et al., “Understanding the Performance of TCP Pacing,” Proc. of the IEEE INFOCOMM 2000 Conference on Computer Communications, Mar. 2000; pp. 1157-1165.
Anderson et al., “System Support for Bandwidth Management and Content Adaptation in Internet Applications,” Proc. USENIX OSDI Conf., San Diego, CA, Oct. 2000.
Bansal et al., “Binomial Congestion Control Algorithms,” IEEE INFOCOMM, 2001; pp. 1-10.
Bonald, Thomas, “Comparison of TCP Reno and TCP Vegas via Fluid Approximation,” Nov. 1998, pp. 1-34.
Brakmo, Lawrence, End-To-End Congestion Detection and Avoidance in Wide Area Networks, Ph.D. Dissertation, University of Arizona © Lawrence Sivert Brakmo 1996. pp. 1-78.
Brakmo et al., “TCP Vegas: New Techniques for Congestion Detection and Avoidance”, ACM SIGCOMM Conference, 1994; 11 pages.
Belani, et al., “The CRISIS Wide Area Security Architecture,” Proceedings of the Seventh USENIX Security Symposium, Jan. 1998; 14 pages.
Breslau et al., “Web Caching and zipf-like Distributions: Evidence and Implications,” IEEE INFOCOMM, Mar. 1999; pp. 1-9.
Chandra, Web workloads influencing disconnected service access, Master of Arts Thesis, May 2001; 80 pages.
Chandra et al., “End-to -end Wan Service Availability,” ACM SIGCOMM, Vancouver Canada, Sep. 1998; 12 pages.
Chandra et al. “Resource management for scalable disconnected access to web services,” May 2001; 11 pages.
Cho et al., “Synchronizing a database to Improve Freshness,” Oct. 25, 1999; pp. 1-30.
Chiu et al., “Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks,” Computer Networks and ISDN Systems, 1989, vol. 17; pp. 1-14. (Elsevier Science Publishers, V. B., North-Holland).
Cleary, et al., “Data Compression Using Adaptive Coding and Partial String Matching,” IEEE Transactions on Communications, 1984, vol. Com.-32, No. 4; pp. 396-402.
Dahlin et al. “A Quantitative Analysis of Cache Policies for Scalable Network File Systems,” Proceedings of the SIGMETRICS Conference on Measurement and Modeling of Computer Systems, May 1994; pp. 1-13.
Dahlin, “Interpreting Stale Load Information,” IEEE Transactions on Parallel and Distributed Systems, vol. 11 Oct. 2001; pp. 1-34.
Dahlin, “Support for Data-intensive Applications in Large-scale Systems,” NSF Workshop on New Challenges and Directions for Systems Research, Jul. 1997; 4 pages.
Dahlin et al., “Using Mobile Extensions to Support Disconnected Services,” University of Texas Department of Computer Sciences (TR-2000-20) Jun. 2000; pp. 1-15.
Dahlin, “PRACTI replication of Large-Scale Systems,” University of Texas at Austin Technical Report, 04-28, Jun. 2004, pp. 1-17.
Duchamp, Dan, “Prefetching Hyperlinks,” Proceedings of USITS' 99: The 2ndUSENIX Symposium on Internet Technologies & Systems, Oct. 11-14, 1999; 13 pages.
Dykes et al, “A Viability Analysis of Cooperative Proxy Caching,” IEEE, Apr. 2001; 10 pages.
Floyd, et al., “Equation-Based Congestion Control For Unicast Applications: the Extended Version,” SIGCOMM 2000, Aug. 2000, pp. 1-22.
Floyd, et al, “Random Early Detection Gateways for Congestion Avoidance,” IEEE, Aug. 1993; pp. 1-22.
Goyal et al., “A Hierarchical CPU Scheduler for Multimedia Operating Systems,” USENIX 2nd Symposium on OS Design and Implementation (OSDI '96), 1996; 14 pages.
Gray et al., “Rules of Thumb in Data Engineering,” IEEE, 2000; pp. 1-8.
Gwertzman et al., “The Case for Geographical Push-Caching,” Proceedings of the Fifth Workshop on Hot Topics in Operating Systems (HotOS-V), 1995; pp. 1-4.
Hengartner et al., “TCP Vegas Revisited” Proceedings of IEEE INFOCOM, Mar. 2000; 10 pages.
Howard et al., “Scale and Performance in a Distributed File System,” ACM Transactions on Computer Systems, 1998, vol. 6, No. 1; pp. 51-81.
Jacobson et al., “Congestion Avoidance and Control,” Nov. 1988; pp. 1-25.
Jain, “A Delay-based Approach for Congestion Avoidance in Interconnected Heterogeneous Computer Networks,” Apr. 1989; pp. 1-16.
Korupolu et al., “Coordinated placement and Replacement for Large-Scale Distributed Caches,” Proceedings of the 1999 Workshop on Internet Applications, Jun. 1999, 11 pages.
Kroeger, et al., “Exploring the Bounds of Web Latency Reduction From Caching and Prefetching,” USENIX Symposium on Internet Technologies and Systems, Dec. 1997; 11 pages.
Kumar, “Conformance Testing of Protocols Represented as Communicating finite State Machine,” Bachelor of Technology Project Report, Apr. 2001; 42 pages.
Lumb et al., “Towards Higher Disk Head Utilization: Extracting Free Bandwidth From Busy Disk Drives,” Appears in Proc. of the 4th Symposium on Operating Systems Design and Implementation, 2000; 16 pages.
Maltzahn et al., “On Bandwidth Smoothing,” 4th International Web Caching Workshop, 1999; 12 pages.
Markatos et al., “A top 10 Approach for Prefetching the Web,” Proceedings of INET'98: Internet Global Summit, Jul. 1998; 20 pages.
Martin et al., “Small Byzantine Quorum Systems,” Dependable Systems and Networks (DSN02), Jun. 2002; 10 pages.
Morris, “TCP Behavior with Many Flows” Presented at the IEEE international Conference on Network Protocols, Oct. 1997; pp. 17.
Padmanabhan et al., “Using Predictive Prefetching to Improve World Wide Web Latency,” 1996, ACM Computer Communication Review, vol. 27, No. 3, 14 pages.
Paxon, “End to End Routing Behavior in the Internet,” May 1996; pp. 1-26.
Popek et al., Replication in Ficus Distributed File Systems, Proceedings of the Workshop on Management of Replicated Data, Nov. 1990, pp. 20-25.
Odlyzko et al., “Internet growth: Myth and reality, use and abuse,” pp. 1-8, date unknown.
Ramakrishnan et al., “Network Working Group: Standards Track,” Sep. 2001; 63 pages.
Rejaie et al., “RAP: An End-to-end Rate-based Congestion Control Mechanism for Realtime Streams in the Internet,” 1999; pp. 1-8.
Sanghi et al., “Experimental Assessment of End-to-end Behavior on Internet,” Computer Science Technical Report Series; vol. CS-TR-2909, 1992; 19 pages.
Shenoy et al., “Cello: A Disk Scheduling Framework for Next Generation Operating Systems,” Proceeding of Sigmetrics, 1998; pp. 1-13.
Terry et al., “Managing Update Conflicts in Bayou, a Weakly Connected Replicated Storage Sy

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Method and system for background replication of data objects does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method and system for background replication of data objects, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and system for background replication of data objects will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4001874

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.