System and method for dynamically sharing media in a computer network
Patent 7174433 Issued on February 6, 2007. Estimated Expiration Date: April 5, 2024. Estimated Expiration Date is calculated based on simple USPTO term provisions. It does not account for terminal disclaimers, term adjustments, failure to pay maintenance fees, or other factors which might affect the term of a patent.
711/147, Shared memory area711/4, Dynamic-type storage device (e.g., disk, tape, drum)711/118, Caching711/119, Multiple caches711/202, Address mapping (e.g., conversion, translation)711/220, Combining two or more values to create address709/219, Accessing a remote server709/231, Computer-to-computer data streaming707/10, Distributed or remote access370/254, NETWORK CONFIGURATION DETERMINATION709/203, Client/server718/104, Resource allocation714/2, Fault recovery707/204, Archiving or backup714/20, Plural recovery data sets containing set interrelation data (e.g., time values or log record numbers)711/162, Backup707/205, File allocation714/5, Of memory or peripheral subsystem714/6, Redundant stored data accessed (e.g., duplicated data, error correction coded data, or other parity-type data)711/211, Address multiplexing or address bus manipulation705/42, Remote banking (e.g., home banking)707/1, DATABASE OR FILE ACCESSING707/203, Version management718/100, TASK MANAGEMENT OR CONTROL714/4, Of network718/101, Batch or transaction processing711/117, Hierarchical memories711/111, Accessing dynamic storage device711/150, Simultaneous access regulation714/23, Resetting processor714/45, Output recording (e.g., signature or trace)714/1, Reliability and availability370/431, CHANNEL ASSIGNMENT TECHNIQUES705/1, AUTOMATED ELECTRICAL FINANCIAL OR BUSINESS PRACTICE OR MANAGEMENT ARRANGEMENT707/100, DATABASE SCHEMA OR DATA STRUCTURE709/200, MISCELLANEOUS710/5, Input/Output command process707/200, FILE OR DATABASE MAINTENANCE707/103R, Object-oriented database structure707/206, Garbage collection709/236, Computer-to-computer data framing370/222, In a ring or loop network717/115, Script710/8, Peripheral configuration709/229, Network resources access controlling714/11, Concurrent, redundantly operating processors715/511, Version management711/114, Arrayed (e.g., RAIDs)711/100, STORAGE ACCESSING AND CONTROL700/214, Article storing, retrieval, or arrangement (e.g., warehousing, automated library)709/240, Prioritized data routing709/213, MULTICOMPUTER DATA TRANSFERRING VIA SHARED MEMORY715/764, On-screen workspace or object711/154, Control technique711/170Memory configuring
A computerized method for sharing removable storage media in a network, the method comprising associating, in an index entry, a first piece of removable storage media in a first storage device with at least a first storage policy copy and a second storage policy copy; copying, to the first piece of removable storage media, data associated with the first storage policy copy; and copying, to the first piece of removable storage media, data associated with the second storage policy copy.
Other References
Armstead et al., “Implementation of a Campus-wide Distributed Mass Storage Service: The Dream vs. Reality,” IEEE, 1995, pp. 190-199.
Arneson, “Mass Storage Archiving in Network Environments,” IEEE, 1998, pp. 45-50.
Cabrera et al., “ADSM: A Multi-Platform, Scalable, Backup and Archive Mass Storage System,” Digest of Papers of the Computer Society Conference, IEEE Comp. Soc. Press, vol. Conf. (Mar. 5, 1995), pp. 420-427.
Eitel, “Backup and Storage Management in Distributed Heterogeneous Environments,” IEEE, 1994, pp. 124-126.
Jander, M., “Launching Storage-Area Net,” Data Communications, US, McGraw Hill, NY, vol. 27, No. 4 (Mar. 21, 1998), pp. 64-72.
Rosenblum et al., “The Design and Implementation of a Log-Structure File System,” Operating Systems Review SIGOPS, vol. 25, No. 5, New York, US, pp. 1-15 (May 1991).
Jason Gait, “The Optical File Cabinet: A Random-Access File System For Write-Once Optical Disks,” IEEE Computer, vol. 21, No. 6, pp. 11-22 (1988) (see in particular figure 5 in p. 15 and the recitation in claim 5).