EP1364277A4 - Appareil, procede et systeme d'acces aux informations dans un environnement homologue - Google Patents

Appareil, procede et systeme d'acces aux informations dans un environnement homologue

Info

Publication number
EP1364277A4
EP1364277A4 EP02718882A EP02718882A EP1364277A4 EP 1364277 A4 EP1364277 A4 EP 1364277A4 EP 02718882 A EP02718882 A EP 02718882A EP 02718882 A EP02718882 A EP 02718882A EP 1364277 A4 EP1364277 A4 EP 1364277A4
Authority
EP
European Patent Office
Prior art keywords
information
upuni
module
peer
peers
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Ceased
Application number
EP02718882A
Other languages
German (de)
English (en)
Other versions
EP1364277A2 (fr
Inventor
David Sidman
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Content Directions Inc
Original Assignee
Individual
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Individual filed Critical Individual
Publication of EP1364277A2 publication Critical patent/EP1364277A2/fr
Publication of EP1364277A4 publication Critical patent/EP1364277A4/fr
Ceased legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/02—Protocols based on web technology, e.g. hypertext transfer protocol [HTTP]
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90—Details of database functions independent of the retrieved data types
    • G06F16/95—Retrieval from the web
    • G06F16/955—Retrieval from the web using information identifiers, e.g. uniform resource locators [URL]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L61/00—Network arrangements, protocols or services for addressing or naming
    • H04L61/30—Managing network names, e.g. use of aliases or nicknames
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L61/00—Network arrangements, protocols or services for addressing or naming
    • H04L61/45—Network directories; Name-to-address mapping
    • H04L61/4552—Lookup mechanisms between a plurality of directories; Synchronisation of directories, e.g. metadirectories
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security
    • H04L63/04—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks
    • H04L63/0428—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the data content is protected, e.g. by encrypting or encapsulating the payload
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security
    • H04L63/04—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks
    • H04L63/0428—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the data content is protected, e.g. by encrypting or encapsulating the payload
    • H04L63/0485—Networking architectures for enhanced packet encryption processing, e.g. offloading of IPsec packet processing or efficient security association look-up
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security
    • H04L63/08—Network architectures or network communication protocols for network security for authentication of entities
    • H04L63/0823—Network architectures or network communication protocols for network security for authentication of entities using certificates
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security
    • H04L63/08—Network architectures or network communication protocols for network security for authentication of entities
    • H04L63/083—Network architectures or network communication protocols for network security for authentication of entities using passwords
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security
    • H04L63/12—Applying verification of the received information
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/104—Peer-to-peer [P2P] networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/2866—Architectures; Arrangements
    • H04L67/30—Profiles
    • H04L67/306—User profiles
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L2463/00—Additional details relating to network architectures or network communication protocols for network security covered by H04L63/00
    • H04L2463/101—Additional details relating to network architectures or network communication protocols for network security covered by H04L63/00 applying security measures for digital rights management
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/104—Peer-to-peer [P2P] networks
    • H04L67/1061—Peer-to-peer [P2P] networks using node-based peer discovery mechanisms
    • H04L67/1063—Discovery through centralising entities
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/104—Peer-to-peer [P2P] networks
    • H04L67/1074—Peer-to-peer [P2P] networks for supporting data block transmission mechanisms
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/30—Definitions, standards or architectural aspects of layered protocol stacks
    • H04L69/32—Architecture of open systems interconnection [OSI] 7-layer type protocol stacks, e.g. the interfaces between the data link level and the physical level
    • H04L69/322—Intralayer communication protocols among peer entities or protocol data unit [PDU] definitions
    • H04L69/329—Intralayer communication protocols among peer entities or protocol data unit [PDU] definitions in the application layer [OSI layer 7]

Definitions

  • the present invention relates generally to an apparatus, method and system to access information across peer-to-peer communications network. More particularly, the disclosed invention relates to an apparatus, method and system to facilitate the distribution, propagation, and transfer of more uniform copies of content based on the publisher's approved content.
  • Networks are commonly thought to consist of the interconnection and interoperation of clients, peers, servers, and intermediary nodes in a graph topology.
  • server refers generally to a computer, other device, software, or combination thereof that processes and responds to the requests of remote users across a communications network. Servers serve their information to requesting "clients/' A computer, other device, software, or combination thereof that facilitates, processes information and requests, and/or furthers the passage of information from a source user to a destination user is commonly referred to as a "node.”
  • Networks are generally thought to facilitate the transfer of information from source points to destinations.
  • TCP/IP Transmission Control Protocol-Internet Protocol
  • DoD Department of Defense
  • the development of TCP/IP was in part driven by a requirement by the DoD to have a network that will continue to operate even if damaged during battle, thus allowing for information to be routed around damaged portions of the communications network to destination addresses.
  • the Internet is a packet-switched network and thus, information on the
  • IP addressing information called headers, which are used by routers to facilitate the delivery of the packets from a source to a destination across intermediary nodes on the Internet.
  • the packets Upon arrival at the destination, the packets are reassembled to form the original message, and any missing packets are requested again.
  • IP component of the protocol is responsible for routing packets of information based on a four byte addressing mechanism; the address is written as four numbers separated by dots, each number ranging from 0 to 255, e.g., "123.255.0.123". IP addresses are assigned by Internet authorities and registration agencies, and are unique.
  • the TCP portion of the protocol is used for verifying that packets of information are correctly received by the destination computer from the source, and if not, to retransmit corrupt packets.
  • Other transmission control protocols are also commonly used that do not guarantee delivery, such as User Datagram Protocol (UDP).
  • UDP User Datagram Protocol
  • WorldWideWeb.app (the web) was developed in late 1990. Subsequently, information navigation interfaces such as web browsers have become widely available on almost every computer operating system platform.
  • the web is the manifestation and result of a synergetic interoperation between user interfaces (e.g., web browsers), servers, distributed information, protocols, and specifications. Web browsers were designed to facilitate navigation and access to information, while information servers were designed to facilitate provision of information.
  • Information Servers function to serve information to users that typically access the information by way of web browsers.
  • information servers typically provide information to users employing web browsers for navigating and accessing information on the web.
  • Microsoft's Internet Explorer and Netscape Navigator are examples of web browsers.
  • navigation user interface devices such as WebTV have also been implemented to facilitate web navigation.
  • Microsoft's Information Server and Apache are examples of information servers.
  • UNIVERSAL RESOURCE LOCATOR (URL) The expansion of the web has resulted in an enormous quantity of information, which is accessible through the use of Universal Resource Locators (URLs).
  • An URL is an address that is typically embodied as a hyperlink in a web page or is typed into a web browser.
  • URLs for a given resource refer only to a location for that resource.
  • the reference to the location is achieved through the use of an unresolved IP address in conjunction with a directory path and file name; e.g., "http://www.aWebSite.com/aFolder/aFile.html”.
  • the URL directs the browser to connect to the computer named "www" in the domain "aWebSite.com,” and to request the file named "aFile.html” stored in directory "aFolder” at that computer.
  • UNIVERSAL NAME IDENTIFIER UNI
  • the Corporation for National Research Initiatives has created and implemented a new means of naming and locating information, called the Handle System.
  • the Handle System is designed to improve upon the current use of URLs.
  • the Handle System introduces a level of indirection to locating and distributing information over the Internet.
  • the Handle System is a general-purpose system for naming resources. Instead of being assigned a URL based on a particular resource's current network location, a resource may be assigned a Universal Name Identifier.
  • a UNI is a form of Universal Resource Identifier (URI).
  • URIs include both UNIs and URLs.
  • a UNI unlike a URL, serves and shall be regarded henceforth as a name for the resource that is persistent regardless of changes in the resource's location or other attributes.
  • URN Universal Resource Name
  • URN Universal Resource Name
  • a Handle is a type of URN.
  • a Digital Object Identifier (DOI) is a type of Handle.
  • various forms of UNIs include Handles, URNs, DOIs, and/or the like. The various terms and/or forms of UNIs will be used interchangeably throughout this document, and may be assumed to be interchangeable unless stated otherwise.
  • a Handle is a unique name, which is registered with the Handle System along with the current network location of the named resource. This location information commonly takes the fonn of a URL.
  • One common type of Handle is known as a Digital Object Identifier (DOI). Handles may be then distributed to users in lieu of a URL, and superficially appear to function similarly to a hyperlink.
  • DOI Digital Object Identifier
  • Handle When a user encounters a Handle, the user may select or enter the Handle much like a URL hyperlink, so long as the user's web browser is capable of making Handle requests. Such an encounter triggers an automated process to look up a resource's current location.
  • the current location of the resource is associated with the resource's Handle in a directory made available by the Handle System, which in turn directs the user to the resource's current location.
  • the Handle System directory entry can be updated, thereby assuring a persistent association between a Handle and the resource it identifies.
  • An analogy can be made to the physical world: knowing only a URL for a given resource is akin to knowing only a person's street address, and not her name.
  • the Handle System allows resources to be permanently named by way of a Handle, and it allows the current network location of resources to be looked up based on that name in a Handle System directory. DIGITAL RIGHTS MANAGEMENT (DRM
  • DRM Digital Rights Management
  • P2P PEER-TO-PEER COMMUNICATIONS
  • P2P peer-to-peer
  • a basic P2P solution provides each user on a network with both a server and client application that allows each user to respectively make available and access resources (e.g., files, CPU time, memory, etc.) with other users.
  • each combined client and server node on a P2P network is referred to as a peer.
  • Examples such as Gnuetella, MusicCity (e.g, Morpheus), and Napster networks evince the public's desire to share files in a distributed and unfettered fashion.
  • DOIs enable access to information over a conimunications network by providing a persistent identifier for information that may be regularly relocated.
  • DOIs overcome the limitations of network addressing schemes limited to addressing locations by providing a mechanism to associate identifiers with information through an added level of indirection instead of associating identifiers with locations.
  • DOIs provide a mechanism that allows for the association of an identifier with information instead of a location
  • DOIs in and of themselves do not provide for the access of multiple and/or varying instances of a piece of information in various locations, formats, or the access of various services associated with a given piece of information, based on various contexts of use.
  • a method for using a peer to catalog information. The method: mining source identifying data as metadata from within new information and querying a database holding unique, persistent, and universal name identifiers (UPUNI) and metadata (MUPUNI database; i.e., a database that stores both metadata and UPUNIs) with the mined metadata for an UPUNI corresponding to the mined metadata, if the new information has no embedded UPUNI; resolving an UPUNI to location addresses for accessing originating versions of the information; and adding an entry of the new information's availability into a local data- structure to catalog information items available on a peer for transmission to others.
  • UPUNI unique, persistent, and universal name identifiers
  • MUPUNI database i.e., a database that stores both metadata and UPUNIs
  • a method for using a peer to access information.
  • the method comprises: searching for peers with an obtained unique, persistent, and universal name identifier (UPUNI) for desired information, which corresponds to the obtained UPUNI; obtaining search results; identifying candidate peers from which to obtain desired information that corresponds to the obtained UPUNI; requesting desired information from a candidate peer; and obtaining the desired information from the candidate peer.
  • UPUNI unique, persistent, and universal name identifier
  • a method for using a peer to validate information.
  • the method comprises: obtaining an unique, persistent, and universal name identifier (UPUNI) for identified information; requesting validating credentials for the identified information from an UPUNI resolution system with the obtained UPUNI; obtaining the requested validating credentials; and comparing a representative digital verification value against the obtained validating credentials.
  • UPUNI unique, persistent, and universal name identifier
  • a memory storing a data structure has associated data types, including: a data type to store a unique, persistent, and universal name identifier (UPUNI); and a data type to store location addresses of peers with information substantively similar to information referenced by the UPUNI.
  • UPUNI unique, persistent, and universal name identifier
  • Figure 1 illustrates one example embodiment incorporated into a DOI Enabled Peer-to-Peer (DE2P) controller
  • FIGS. 2 and 3 illustrate URL addressing across a communications network with moving information
  • Figure 4 illustrates accessing of information through DOIs
  • Figures 5 and 6 provide an overview of a Handle
  • Figures 7 and 8 provide an overview of the resolution mechanism for allowing users to access desired information
  • Figure 9 provides an overview of an exemplary sequence of actions that a user performs to access information using DOIs
  • Figure 10 provides a more complete overview of an exemplary sequence of actions that users perform to access content information
  • Figure 1 1 illustrates an exemplary mechanism for accessing information over a communications network
  • Figure 12 provides an overview of another embodiment of exemplary mechanisms for retrieving information over a communications network
  • Figure 13 provides an overview of an exemplary DOI system
  • Figure 14 depicts one non-limiting example embodiment of data flow for a cataloguing system effecting information access in a peer-to-peer environment
  • Figure 15 shows the logic flow of one non-limiting example embodiment of a cataloguing system for effecting information access in a peer-to-peer environment
  • Figure 16 depicts a data flow diagram of a file search and request system effecting information access in a P2P environment
  • Figure 17 is a logic flow diagram for a file search and request system for effecting information access in a P2P environment
  • Figure 18 illustrates a data flow diagram for a post-receipt validation system for effecting information access in a P2P environment
  • Figure 19 depicts a logic flow diagram for a file receipt validation system for effecting information access in a P2P environment.
  • Figure 1 illustrates one non-limiting example embodiment incorporated into a Digital Object Identifier Enabled Peer-to-peer (DE2P) controller 101.
  • the DE2P controller 101 may serve to register, resolve, process, store, update, and validate Handles and any associated information, and/or the like.
  • the DE2P controller 101 may be connected to and/or communicate with entities such as, but not limited to: one or more users from user input devices 111 ; peripheral devices 1 12; and/or a communications network 113.
  • the DE2P controller may even be connected to and/or communicate with a cryptographic processor device 128.
  • a typical DE2P controller 101 may be based on common computer systems that may comprise, but are not limited to, components such as: a computer systemization 102 connected to memory 129.
  • Computer Systemization may comprise, but are not limited to, components such as: a computer systemization 102 connected to memory 129.
  • a computer systemization 102 may comprise a clock 130, central processing unit (CPU) 103, a read only memory (ROM), a random access memory (RAM), and/or an interface bus 107, and conventionally, although not necessarily, are all interconnected and/or communicating through a system bus 104.
  • the system clock typically has a crystal oscillator and provides a base signal.
  • the clock is typically coupled to the system bus and various means that will increase or decrease the base operating frequency for other components interconnected in the computer systemization.
  • the clock and various components in a computer systemization drive signals embodying information throughout the system. Such transmission and reception of signals embodying information throughout a computer systemization may be commonly referred to as communications.
  • communicative signals may further be transmitted, received, and the cause of return and or reply signal conimunications beyond the instant computer systemization to: communications networks, input devices, other computer systemizations, peripheral devices, and/or the like.
  • a cryptographic processor 126 may similarly be connected to the system bus.
  • any of the above components may be connected directly to one another, connected to the CPU, and/or organized in numerous variations employed as exemplified by various computer systems.
  • the CPU comprises at least one high-speed data processor adequate to execute program modules for executing user and/or system-generated requests.
  • the CPU may be a microprocessor such as the Intel Pentium Processor and/or the like.
  • the CPU interacts with memory through signal passing through conductive conduits to execute stored program code according to conventional data processing techniques. Such signal passing facilitates communication within the DE2P controller and beyond through various interfaces.
  • Interface bus(ses) 107 may accept, connect, and/or communicate to a number of interface adapters, conventionally although not necessarily in the form of adapter cards, such as but not limited to: input output interfaces (I/O) 108, storage interfaces 109, network interfaces 1 10, and/or the like.
  • cryptographic processor interfaces 127 similarly may be connected to the interface bus.
  • the interface bus provides for the communications of interface adapters with one another as well as with other components of the computer systemization.
  • Interface adapters are adapted for a compatible interface bus.
  • Interface adapters conventionally connect to the interface bus via a slot architecture.
  • Conventional slot architectures may be employed, such as, but not limited to: Accelerated Graphics Port (AGP), Card Bus, (Extended) Industry Standard Architecture ((E)ISA), Micro Channel Architecture (MCA), NuBus, Peripheral Component Interconnect (PCI), Personal Computer Memory Card International Association (PCMCIA), and/or the like.
  • AGP Accelerated Graphics Port
  • E Extended) Industry Standard Architecture
  • MCA Micro Channel Architecture
  • PCI Peripheral Component Interconnect
  • PCMCIA Personal Computer Memory Card International Association
  • Storage interfaces 109 may accept, communicate, and/or connect to a number of storage devices such as, but not limited to: storage devices 114, removable disc devices, and/or the like. Storage interfaces may employ connection protocols such as, but not limited to: (Ultra) Advanced Technology Attachment (Packet Interface) ((Ultra) ATA(PI)), (Enhanced) Integrated Drive Electronics ((E)IDE), Institute of Electrical and Electronics Engineers (IEEE) 1394, fiber channel, Small Computer Systems Interface (SCSI), Universal Serial Bus (USB), and/or the like.
  • Network interfaces 1 10 may accept, communicate, and/or connect to a communications network 113.
  • Network interfaces may employ connection protocols such as, but not limited to: direct connect, Ethernet (thick, thin, twisted pair 10/100/1000 Base T, and/or the like), Token Ring, wireless connection such as IEEE 802.11b, and/or the like.
  • a communications network may be any one and/or the combination of the following: a direct interconnection; the Internet; a Local Area Network (LAN); Metropolitan Area Network (MAN); an Operating Missions as Nodes on the Internet (OMNI); a secured custom connection; a Wide Area Network (WAN); a wireless network (e.g., employing protocols such as, but not limited to a Wireless Application Protocol (WAP), I-mode, and/or the like); and/or the like.
  • a network interface may be regarded as a specialized form of an input output interface.
  • I/O 108 may accept, communicate, and/or connect to user input devices 111, peripheral devices 112, cryptographic processor devices 128, and/or the like.
  • I/O may employ connection protocols such as, but not limited to: Apple Desktop Bus (ADB); Apple Desktop Connector (ADC); audio: analog, digital, monaural, RCA, stereo, and/or the like; IEEE 1394; infrared; joystick; keyboard; midi; optical; PC AT; PS/2; parallel; radio; serial; USB; video interface: BNC, composite, digital, RCA, S-Video, VGA, and/or the like; wireless; and/or the like.
  • ADB Apple Desktop Bus
  • ADC Apple Desktop Connector
  • audio analog, digital, monaural, RCA, stereo, and/or the like
  • IEEE 1394 infrared
  • joystick keyboard
  • midi optical
  • PC AT PC AT
  • PS/2 parallel
  • radio serial
  • USB USB
  • video interface BNC, composite, digital, RCA, S-Video, VGA, and/
  • a common output device is a video display, which typically comprises a CRT or LCD based monitor with an interface (e.g., VGA circuitry and cable) that accepts signals from a video interface.
  • the video interface composites information generated by a computer systemization and generates video signals based on the composited information.
  • the video interface provides the composited video information through a video connection interface that accepts a video display interface (e.g., a VGA connector accepting a VGA display cable).
  • User input devices 1 1 1 may be card readers, dongles, finger print readers, gloves, graphics pads, joysticks, keyboards, mouse (mice), trackballs, trackpads, retina readers, and/or the like. Peripheral devices 1 12 may be connected and/or communicate with or to
  • Peripheral devices may be cameras, dongles (for copy protection, ensuring secure transactions as a digital signature, and/or the like), external processors (for added functionality), goggles, microphones, monitors, network interfaces, printers, scanners, storage devices, visors, and/or the like.
  • Cryptographic units such as, but not limited to, microcontrollers, processors 126, interfaces 127, and/or devices 128 may be attached, and/or communicate with the DE2P controller.
  • a MC68HC16 microcontroller commonly manufactured by Motorola Inc., may be used for and/or within cryptographic units. Equivalent microcontrollers and/or processors may also be used.
  • the MC68HC16 microcontroller utilizes a 16-bit multiply-and-accumulate instruction in the 16 MHz configuration and requires less than one second to perform a 512-bit RSA private key operation.
  • Cryptographic units support the authentication of communications from interacting agents, as well as allowing for anonymous transactions.
  • Cryptographic units may also be configured as part of CPU.
  • Other commercially available specialized cryptographic processors include VLSI Technology's 33 MHz 6868 or Semaphore Commumcations' 40 MHz Roadrunner 284. Memory
  • a storage device 1 14 may be any conventional computer system storage. Storage devices may be a fixed hard disk drive, and/or other devices of the like. However, it is to be understood that a DE2P controller and/or a computer systemization may employ various forms of memory 129.
  • a computer systemization may be configured wherein the functionality of on-chip CPU memory (e.g., registers), RAM, ROM, and any other storage devices are provided by a paper punch tape or paper punch card mechanism; of course such an embodiment is not preferred and would result in an extremely slow rate of operation.
  • memory 129 will include ROM, RAM, and a storage device 1 14.
  • any mechanization and/or embodiment allowing a processor to affect the storage and/or retrieval of information is regarded as memory 129.
  • a computer systemization generally requires and makes use of memory.
  • memory is a fungible technology and resource, thus, any number of memory embodiments may be employed in lieu of or in concert with one another.
  • the storage devices 114 may contain a collection of program and/or database modules and/or data such as, but not limited to: an operating system module 115 (operating system); an information server module 116 (information server); a user interface module 117 (user interface); a web browser module 118 (web browser); databases 119; a cryptographic server module 120 (cryptographic server); DOI Enabled Peer-to-Peer (DE2P) module 125; and/or the like (i.e., collectively a module collection). These modules may be stored and accessed from the storage devices and/or from storage devices accessible through an interface bus.
  • non-conventional software modules such as those in the module collection, typically and preferably, are stored in a local storage device 1 14, they may also be loaded and/or stored in memory such as: peripheral devices, RAM, remote storage facilities through a communications network, ROM, various forms of memory, and/or the like.
  • Operating System The operating system module 115 is executable program code facilitating the operation of a DE2P controller. Typically, the operating system facilitates access of I/O, network interfaces, peripheral devices, storage devices, and/or the like.
  • the operating system preferably is a conventional product such as Apple Macintosh OS X Server, AT&T Plan 9, Microsoft Windows NT Server, Unix, and/or the like operating systems.
  • the operating system is highly fault tolerant, scalable, and secure.
  • An operating system may communicate to and/or with other modules in a module collection, including itself, and/or facilities of the like.
  • the operating system communicates with other program modules, user interfaces, and/or the like.
  • the operating system may contain, communicate, generate, obtain, and/or provide program module, system, user, and/or data communications, requests, and/or responses.
  • the operating system once executed by the CPU, may enable the interaction with communications networks, data, I/O, peripheral devices, program modules, memory, user input devices, and/or the like.
  • the operating system provides communications protocols that allow the DE2P controller to communicate with other entities through a communications network 1 13.
  • Various communication protocols may be used by the DE2P controller as a subcarrier transport mechanism for interacting with the Handle System, such as, but not limited to: multicast, TCP/IP, UDP, unicast, and/or the like.
  • An information server module 1 16 is stored program code that is executed by the CPU.
  • the information server may be a conventional Internet information server such as, but not limited to, Microsoft's Internet Information Server and/or the Apache Software Foundation's Apache.
  • the information server allows for the execution of program modules through facilities such as C++, Java, JavaScript, ActiveX, Common Gateway Interface (CGI) scripts, Active Server Page (ASP), and/or the like.
  • the information server supports secure communications protocols such as, but not limited to, File Transfer Protocol (FTP); HyperText Transfer Protocol (HTTP); Secure Hypertext Transfer Protocol (HTTPS), Secure Socket Layer (SSL), and/or the like.
  • an information server provides results in the form of web pages to web browsers, and allows for the manipulated generation of the web pages through interaction with other program modules.
  • the information server resolves requests for information at specified locations on a DE2P controller based on the remainder of the HTTP request.
  • a request such as http://123.124.125.126/myInformation.html might have the IP portion of the request "123.124.125.126” resolved by a DNS server to an information server at that IP address; that information server might in turn further parse the http request for the "/mylnformation.html” portion of the request and resolve it to a location in memory containing the information "mylnformation.html.”
  • An information server may communicate to and/or with other modules in a module collection, including itself, and/or facilities of the like. Most frequently, the information server communicates with operating systems, other program modules, user interfaces, web browsers, and/or the like.
  • An information server may contain, communicate, generate, obtain, and/or provide program module, system, user, and/or data communications, requests, and/or responses.
  • a user interface module 117 is stored program code that is executed by the CPU.
  • the user interface is a conventional graphic user interface as provided by, with, and/or atop operating systems and/or operating environments such as Apple Macintosh OS, e.g., Aqua, Microsoft Windows (NT), Unix X Windows (KDE, Gnome, and/or the like), and/or the like.
  • the user interface may allow for the display, execution, interaction, manipulation, and/or operation of program modules and/or system facilities through textual and/or graphical facilities.
  • the user interface provides a facility through which users may affect, interact, and/or operate a computer system.
  • a user interface may communicate to and/or with other modules in a module collection, including itself, and/or facilities of the like. Most frequently, the user interface communicates with operating systems, other program modules, and/or the like.
  • the user interface may contain, communicate, generate, obtain, and/or provide program module, system, user, and/or data communications, requests, and/or responses.
  • a web browser module 1 18 is stored program code that is executed by the CPU.
  • the web browser is a conventional hypertext viewing application such as Microsoft Internet Explorer or Netscape Navigator (preferably with 128bit encryption by way of HTTPS, SSL, and/or the like).
  • Some web browsers allow for the execution of program modules through facilities such as Java, JavaScript, ActiveX, and/or the like.
  • web browsers are handle-enabled by way of a browser plug-in software such as the Handle System plug-in available from www.cnri.org.
  • handle support is integrated into the web browser.
  • Web browsers and like information access tools may be integrated into PDAs, cellular telephones, and/or other mobile devices.
  • a web browser may communicate to and/or with other modules in a module collection, including itself, and/or facilities of the like. Most frequently, the web browser communicates with information servers, operating systems, integrated program modules (e.g., plug-ins), and/or the like; e.g., it may contain, communicate, generate, obtain, and/or provide program module, system, user, and/or data communications, requests, and/or responses.
  • information servers operating systems, integrated program modules (e.g., plug-ins), and/or the like; e.g., it may contain, communicate, generate, obtain, and/or provide program module, system, user, and/or data communications, requests, and/or responses.
  • a combined application may be developed to perform similar functions of both. The combined application would similarly affect the obtaining and the provision of information to users, user agents, and/or the like from DE2P enabled nodes.
  • the combined application may be nugatory on systems employing standard web browsers. Such a combined module could be configured to communicate directly with the DE2
  • a DE2P database module 1 19 may be embodied in a database that is stored program code that is executed by the CPU and its stored data; the stored program code portion configuring the CPU to process the stored data.
  • the database is a conventional, fault tolerant, relational, scalable, secure database such as Oracle or Sybase.
  • Relational databases are an extension of a flat file. Relational databases consist of a series of related tables. The tables are interconnected via a key field. Use of the key field allows the combination of the tables by indexing against the key field; i.e., the key fields act as dimensional pivot points for combining information from various tables. Relationships generally identify links maintained between tables by matching primary keys. Primary keys represent fields that uniquely identify the rows of a table in a relational database. More precisely, they uniquely identify rows of a table on the "one" side of a one-to-many relationship.
  • the DE2P database may be implemented using various standard data-structures, such as an array, hash, (linked) list, struct, table, and/or the like. Such data-structures may be stored in memory and/or in (structured) files. If the DE2P database is implemented as a data-structure, the use of the DE2P database may be integrated into another module such as the DE2P module. Databases may be consolidated and/or distributed in countless variations through standard data processing techniques. Portions of databases, e.g., tables, may be exported and/or imported and thus decentralized and/or integrated.
  • the database module 119 includes tables such as but not limited to a UNI (e.g., Handle, DOI and/or other UNIs) table 119a, URL table 119b, metadata table 119c, multiple resolution table 119d, a node list table 119e, and/or the like. All the tables may be related by (enhanced) DOI key field entries as they are unique. In an alternative embodiment, these tables have been decentralized into their own databases and their respective database controllers (i.e., individual database controllers for each of the above tables). Of course, employing standard data processing techniques, one may further distribute the databases over several computer systemizations and/or storage devices. Similarly, configurations of the decentralized database controllers may be varied by consolidating and/or distributing the various database modules 1 19a-e. The DE2P may be configured to keep track of user requests and various transactions tracking via database controllers.
  • a UNI e.g., Handle, DOI and/or other UNIs
  • URL table 119b e.
  • a DE2P database may communicate to and/or with other modules in a module collection, including itself, and/or facilities of the like. Most frequently, the DE2P database communicates with a DE2P module, other program modules, and/or the like. The database may contain, retain, and provide information regarding other nodes and data.
  • a cryptographic server module 120 is stored program code that is executed by the CPU 103, cryptographic processor 126, cryptographic processor interface 127, cryptographic processor device 128, and/or the like.
  • cryptographic processor interfaces will allow for expedition of encryption and/or decryption requests by the cryptographic module; however, the cryptographic module, alternatively, may run on a conventional CPU.
  • the cryptographic module allows for the encryption and/or decryption of provided data.
  • the cryptographic module allows for both symmetric and asymmetric (e.g., Pretty Good Protection (PGP)) encryption and/or decryption.
  • PGP Pretty Good Protection
  • the cryptographic module allows conventional cryptographic techniques such as, but not limited to: digital certificates (e.g., X.509 authentication framework), digital signatures, dual signatures, enveloping, password access protection, public key management, and/or the like.
  • digital certificates e.g., X.509 authentication framework
  • digital signatures e.g., digital signatures
  • dual signatures enveloping
  • password access protection e.g., password access protection
  • public key management e.g., password management, and/or the like.
  • the cryptographic module will facilitate numerous (encryption and/or decryption) security protocols such as, but not limited to: checksum, Data Encryption Standard (DES), Elliptical Curve Encryption (ECC), International Data Encryption Algorithm (IDEA), Message Digest 5 (MD5, which is a one way hash function), passwords, RC5 (Rivest Cipher), Rijndael, RSA (which is an Internet encryption and authentication system that uses an algorithm developed in 1977 by Ron Rivest, Adi Shamir, and Leonard Adleman), Secure Hash Algorithm (SHA), Secure Socket Layer (SSL), Secure Hypertext Transfer Protocol (HTTPS), and/or the like.
  • DES Data Encryption Standard
  • ECC Elliptical Curve Encryption
  • IDEA International Data Encryption Algorithm
  • MD5 Message Digest 5
  • RC5 Raster Cipher
  • Rijndael Rijndael
  • RSA which
  • the cryptographic module facilitates the process of "security authorization" whereby access to a resource is inhibited by a security protocol wherein the cryptographic module effects authorized access to the secured resource.
  • a cryptographic module may communicate to and/or with other modules in a module collection, including itself, and/or facilities of the like.
  • the cryptographic module supports encryption schemes allowing for the secure transmission of information across a communications network to enable a DE2P module to engage in secure transactions if so desired by users.
  • the cryptographic module facilitates the secure accessing of resources on DE2P and facilitates the access of secured resources on remote systems; i.e., it may act as a client and/or server of secured resources.
  • the cryptographic module communicates with information servers, operating systems, other program modules, and or the like.
  • the cryptographic module may contain, communicate, generate, obtain, and/or provide program module, system, user, and/or data communications, requests, and/or responses.
  • IAMRS Information Access Multiple Resolution Server
  • the DE2P affects accessing, obtaining and the provision of information, and/or the like between nodes on a communications network.
  • the IAMRS has the ability to resolve UNIs to multiple instantiations.
  • the IAMRS acts as a lookup facility to create, maintain, and update associations between a given piece of information, its DOI, and its current locations.
  • the IAMRS coordinates with the DE2P database to identify nodes that may be useful for improving data transfer for requested information, for resolving to various formats of the requesting information, providing an enhanced mechanism to create queries regarding the information, and/or the like.
  • An IAMRS enabling access of information between nodes may be developed by employing standard development tools such as, but not limited to: C++, shell scripts, Java, Javascript, SQL commands, web application server extensions, Apache modules, Perl scripts, binary executables, and/or other mapping tools, and/or the like.
  • the IAMRS server employs a cryptographic server to encrypt and decrypt communications.
  • the IAMRS may service requests, update association information for UNIs, and much more.
  • a DE2P module may communicate to and/or with other modules in a module collection, including itself, and/or facilities of the like. Most frequently, the IAMRS module communicates with a DE2P database, operating systems, other program modules, and/or the like.
  • the IAMRS may contain, communicate, generate, obtain, and/or provide program module, system, user, and/or data communications, requests, and/or responses. DOI Enabled Peer
  • a DOI Enabled Peer-to-Peer (DE2P) module 135 is stored program code that is executed by the CPU.
  • the DE2P catalogs Figures 14 and 15
  • facilitates search requests Figures 16 and 17
  • verifies obtained content from requests Figures 18 and 19
  • the DE2P is a DOI enabled peer that enables searching, transferring, and verifying content across a P2P network based on DOIs.
  • the DE2P may include a P2P list collector to aggregate a node list 119e that is keyed to DOIs 119a.
  • This database and/or data- structure aggregation of nodes lists copies of DOI referenced content and is searchable.
  • the DE2P also provides the ability to validate content. Furthermore, the DE2P may be used to embed DOI values into content referenced by the DOI so that the content may be validated.
  • the DE2P coordinates with the DE2P database to identify nodes satisfying search requests from other peers.
  • a DE2P enabling access of information between nodes maybe be developed by employing standard development tools such as, but not limited to: C++, shell scripts, Java, Javascript, SQL commands, web application server extensions, Apache modules, Perl scripts, binary executables, and/or other mapping tools, and/or the like.
  • the DE2P employs a cryptographic server to encrypt and decrypt communications.
  • the DE2P may catalog content, service requests, redirect requests, and much more.
  • a DE2P module may communicate to and/or with other modules in a module collection, including itself, and/or facilities of the like. Most frequently, the DE2P module communicates internally and with other peers across a communications network with: a DE2P database, an IAMRS module, operating systems, other program modules, and/or the like.
  • the DE2P may contain, communicate, generate, obtain, and/or provide program module, system, user, and/or data communications, requests, and/or responses.
  • Distributed DE2P may contain, communicate, generate, obtain, and/or provide program module, system, user, and/or data communications, requests, and/or responses.
  • any of the DE2P node controller components and/or functionalities may be combined, consolidated, and/or distributed in any number of ways to facilitate development and/or deployment.
  • the module collection may be combined in any number of ways to facilitate deployment and/or development. To accomplish this, one must simply integrate the components into a common code base or in a facility that can dynamically load the components on demand in an integrated fashion.
  • the module collection may be consolidated and/or distributed in countless variations through standard data processing and/or development techniques. Multiple instances of any one of the program modules in the program module collection may be instantiated on a single node, and/or across numerous nodes to improve performance through load balancing data processing techniques. Furthermore, single instances may also be distributed across multiple controllers and/or storage devices; e.g., databases.
  • the preferred DE2P controller configuration will depend on the context of system deployment. Factors such as, but not limited to, the capacity and/or location of the underlying hardware resources may affect deployment requirements and configuration. Regardless of if the configuration results in more consolidated and/or integrated program modules, results in a more distributed series of program modules, and/or results in some combination between a consolidated and/or distributed configuration, communication of data may be communicated, obtained, and/or provided. Instances of modules (from the module collection) consolidated into a common code base from the program module collection may communicate, obtain, and/or provide data.
  • module collection components are discrete, separate, and/or external to one another, then communicating, obtaining, and/or providing data with and/or to other module components may be accomplished through standard data processing techniques such as, but not limited to: Application Program Interfaces (API) information passage; (distributed) Component Object Model ((D)COM), (Distributed) Object Linking And Embedding ((D)OLE), and/or the like), Common Object Request Broker Architecture (CORBA), process pipes, shared files, and/or the like (inter-application communication).
  • API Application Program Interfaces
  • DCOM Component Object Model
  • CORBA Common Object Request Broker Architecture
  • Messages sent between discrete module components for inter-application communication or within memory spaces of a singular module for intra-application communication may be facilitated through the creation and parsing of a grammar.
  • a grammar may be developed by using standard development tools such as lex, yacc, and/or the like, which allow for grammar generation and parsing functionality, which in turn may form the basis of communication messages within and between modules.
  • lex, yacc, and/or the like allow for grammar generation and parsing functionality, which in turn may form the basis of communication messages within and between modules.
  • the preferable embodiment will depend upon the context of system deployment.
  • the logical and/or topological structure of any combination of the module collection and/or the present invention as described in the figures and throughout are not limited to a fixed execution order and/or arrangement, but rather, any disclosed order is exemplary and all functional equivalents, regardless of order, are contemplated by the disclosure.
  • IP ADDRESSING Users access communications networks through addresses. Addresses represent locations. Users traverse locations in a communications network hoping to find information.
  • a common communications addressing scheme employs the IP address.
  • the IP address may be likened to the real world by analogy to a street address.
  • the IP address itself is a sequence of numbers, e.g., 209.54.94.99, and commonly has an associated name, e.g., www.contentdirections.com.
  • a distributed database registry maintains the associated pairs of names and IP addresses and serves to resolve associated names into corresponding IP addresses. This allows people to remember and use names, e.g., www.report.com, instead of being forced to memorize and use a series of numbers, e.g., 209.54.94.99.
  • DNS Domain Name Servers
  • IP addresses It is common for IP addresses to be embodied as Universal Resource Locators (URLs) that append even more navigation information into an address. Users may employ software to access information stored at URLs through the use of HTTP. An example is when a user specifies "http://www.report.com /reports/1999/IncomeStatement.html" in a web browser. Typically this further navigation information, i.e., "/reports/ 1999/IncomeStatement.html,” provides a specific storage location within a computer server. This further navigation location may be likened to a real world address more specific than a street address that includes information such as a company name, department, and room number.
  • URLs Universal Resource Locators
  • An Information Server is a means for facilitating conimunications between a communication network and the computer server at a particular IP address.
  • Commercial examples of an Information Server include Apache.
  • An Information Server may be likened to a mail department for a business that further routes correspondence to appropriate locations within the business.
  • Figures 2 and 3 illustrate that IP addressing mechanisms do not maintain an association with information as it moves across a communications networks.
  • Web page links generally employ HTTP, which in turn relies on IP addressing.
  • URL links simply point to a location on a communication network and are not necessarily associated with any specific information.
  • a URL link referencing www.news.com will have different information associated between the URL and the information made available at the www.news.com location as information at the location is updated daily.
  • locations themselves may disappear as companies move information, move their operations, go out of business, etc.
  • a report entitled "Company Sales for 1999" 222 existing at a location www.report.com 1999/Report.html 208 may be moved to www.report- archives.com/1999/Old-report.html 310, e.g., because the information was sold from one entity to another, archived, or for many other reasons.
  • the report at www.report.com/1999/Report.html 208 may have had 5 million web pages and URL links referencing the location 244, and when users attempt to access the information they may well receive a "404 File not found" error 309 because that location no longer exists and/or no longer contains the desired information.
  • the error results because the DNSs were designed to always resolve users' requests to a location and because DNSs are not designed to maintain an association between URLs and a specific instantiation of information.
  • Figure 2 depicts a web page 201 , a user entered address 202, a document 203, and a memory device 204 all employing URLs and consequently IP addressing in an attempt to reference a piece of information (the report "Company Sales for 1999") 222. Then in Figure 2, the information 222 is moved from its original location 208 (for example at www.report.com/1999/Report.html) to a new location 310 of Figure 2 (for example www.report.com/1999/Archives.html).
  • the Handle System includes an open set of protocols, a namespace, and an implementation of the protocols.
  • the protocols enable a distributed computer system to store Handles (such as DOIs) of digital content and resolve those Handles into the information necessary to locate and access the content, to locate and access information related to the content, or to locate and access (i.e., provide an interface to) services associated with the content.
  • the Handle System provides a general-purpose, distributed global naming service for the reliable management of information and services on networks over long periods of time. It is important to note that throughout the present disclosure that "source,” “content” and/or “information” made accessible through the DOI system may comprise any identifiable content, source, information, services, transactions, and work of authorship, including articles, books, intangible objects, music albums, people, tangible physical objects, and/or the like further including selected discrete portions and/or combinations thereof.
  • the accessible information may be a URL to an application that initiates a service, a transaction, provides a selection mechanism, and/or the like.
  • the DOI may even be associated with information identifying a human being such as a social security number, telephone number, and/or the like.
  • the DOI may be associated with software modules, programming "objects," or any other network-based resource.
  • a DOI can be used to represent most anything including the online representation of physical products (e.g., items currently identified by UPC or bar codes).
  • DOIs could resolve to the manufacturer's catalog page describing or offering the product, or even, in a multiple-resolution scenario, offer all services related to the object such as where to go to get the item repaired; where to find replacement parts; what the new or replacement product is; what kinds of pricing or leasing options are available, etc.
  • Other example embodiments implementing DOIs include: representing different modules of software that may operate in distributed fashion across a communications network; telephone numbers for Voice-over-IP technology; gene sequences; medical records and/or other permanent records (DOIs will be especially useful with permanent records protected via encryption and/or other method that might invoke a certificate or decryption key); and/or the like.
  • DOI is to represent the permanent location of a temporary and/or dynamic value such as, but not limited to a current stock quote; current bid and offer prices (for stocks and/or any other kind of auction and/or exchange); a company's current annual report (versus different DOIs for different prior-year annual reports); and/or the like.
  • a temporary and/or dynamic value such as, but not limited to a current stock quote; current bid and offer prices (for stocks and/or any other kind of auction and/or exchange); a company's current annual report (versus different DOIs for different prior-year annual reports); and/or the like.
  • DOIs Digital Object Identifiers
  • DOIs are associated with (i.e., are names for) information itself. DOIs are instances of “Handles” and operate within the framework of the "Handle system.” A DOI allows for access to persistently associated information.
  • the DOI is a string of characters followed by a separator further followed by a string of characters, e.g., 10.1065/abcl23def.
  • DOIs are names for information, which can be used to look up that information's location and other attributes, as well as related services. It is envisioned that information may be any information as well as any computer-readable files, including e-books, music files, video files, electronic journals, software, smaller portions and/or combinations of any of the aforementioned content as well. It should be noted that since the electronic content will be made available over a communications network, hereinafter this application refers to such available information as being published on a communications network.
  • a DOI is a permanent and persistent identifier given to a piece of information made available on a communications network and registered in an electronic form, so that even if the location (i.e., URL), format, ownership, etc. of the content or associated data changes, users will be able to access the associated data.
  • DOIs, or Handles may be distributed to users in lieu of a URL.
  • a user may access information associated with a particular DOI by selecting or entering the DOI in a Handle-enabled web browser much like a URL hyperlink.
  • Many types of browsers may be enabled by way of browser plug-in software such as the Handle System plug-in available from www.cnri.org. Such an attempt to access DOI associated information triggers an automated process to look up a resource's current location.
  • the current location of the resource is associated with the resource's DOI in a centrally managed directory made available by the Handle System, which in turn directs the user (i.e., the user's web browser) to the resource's current location. This direction is often accomplished by returning a current URL associated with the selected DOI and corresponding information.
  • Figure 4 illustrates the access of information through DOIs in contrast to Figures 2 and 3 above.
  • the information (report of "Company Sales for 1999) 222 is given a DOI through a registration process.
  • users reference 444 the information using the DOI through web pages 401, typed entry in a web browser 402, documents 403, devices 404, barcodes 406, and/or the like.
  • users engage the DOI links 444 they are resolved in a centralized DOI directory 411 and the requesting users are given a URL link 244 to the information's 222 initial location (www.report.com/1999/Report.html) 208.
  • the publisher of the information 410 Upon the information being moved 434 from its initial location (www.report.com/1999/Report.html) 208 to a new location (www.report.com/1999/Archives.html) 310, the publisher of the information 410 would inform the DOI centralized directory 445 of the new location for the information by sending an updated URL 245 referencing the new location. Thereafter, if users 401-404 attempt to access the information through the DOI links 444, the DOI directory will properly provide the new location 310 by way of the updated URL 245.
  • DOIs may not only be used to identify information, but also smaller portions thereof.
  • DOI system it is possible for a book to have one DOI, while each of its chapters would have other unique DOIs to identify them; furthermore, each figure in the book may have yet other unique DOIs to identify them.
  • DOI system it is possible to identify information with variable granularity as desired by the content publishers.
  • the Handle System employs a pre-determined set of policies for efficient and user- friendly utilization thereof, some of which of which are listed below.
  • the use of the Handle System for DOI resolution should ideally be free to users, with the costs of operation of the system possibly borne by the publishers.
  • All DOIs are to be registered with a global DOI registry. Registrants are responsible for the maintenance of state data and metadata relating to DOIs that they have registered.
  • the syntax of the DOI follows a standardized syntax. In use, the DOI will be an opaque string (dumb number). DOI registration agencies will manage the assignment of DOIs, their registration and the declaration of the metadata associated with them.
  • Figure 5 and 6 provide a schematic view of a Handle 600.
  • a Handle 600 has two components, the prefix 501 and the suffix 602.
  • the prefix 501 and the suffix 502 are separated by a forward slash 507.
  • the Handle 500 may incorporate any printable characters from almost every major language written or used today.
  • the DOI registration agency will award a unique prefix 501 to a publisher.
  • the registration agency may put the responsibility on these publishers for ensuring that the suffix 502 assigned is unique as well. This may be achieved with a registration tool running on the user's client computer system. In another embodiment, the registration agency will ensure that the suffix 502 is unique by applying various suffix generation algorithms as discussed throughout this disclosure.
  • the Registration Agency and the Handle System administrators will both verify uniqueness of any new Handle before depositing it in the Handle System.
  • the Registration Agency deposits DOI records with the Handle System.
  • the Handle System in turn services DOI resolution requests through a DOI directory.
  • the prefix 501 itself has two components separated by a prefix separator 506, which is a period.
  • the first part of the Handle prefix is the Handle type 504.
  • the second part of the Handle prefix is the Handle creator 505.
  • the Handle type 504 identifies what type of Handle system is being used. When the Handle type 504 starts with a "10" the Handle is distinguished as being a DOI as opposed to any other implementation type of the Handle System.
  • the next element of the prefix, separated by a period, is the Handle creator 505, which is a number (or string of characters) that is assigned to an organization that wishes to register DOIs. Together, these two elements 504 and 505 form the unique publisher prefix portion of the DOI.
  • Handle or specifically DOI prefixes
  • a publishing company might have a single DOI prefix 501, or might have a different one for each of its journals, or one for each of its imprints.
  • W ile generally a prefix 501 may be a simple numeric string, the scope of the Handle System is not limited thereby.
  • a prefix 501 may also utilize alphabetical characters or any other characters.
  • the suffix 502 is a unique string of alphanumeric characters, which, in conjunction with a particular prefix 501, uniquely identifies a piece of information. It should be appreciated that the combination of the prefix 501 for a publisher and the unique suffix 502 provided by the publisher avoids the need for the centralized allocation of DOI numbers.
  • the suffix 502 may be any alphanumeric string that the publisher chooses, so long as it is unique among all suffixes registered in conjunction with the publisher's prefix.
  • Figure 6 provides a view of another embodiment of the DOI 600, in which a textbook's ISBN number serves as the suffix 602. Consequently, where it is convenient, the publisher of the underlying content may choose to select as the suffix 602 any other identification code accorded to the original piece of content.
  • Enhanced DOI Enhanced DOI
  • Figure 5 further illustrates an enhanced DOI 510 grammar.
  • an enhancement to the DOI grammar is embodied as an enhanced prefix 511.
  • the enhanced prefix 511 is comprised of an enhancement grammar target 517 and enhancement separator 514, which is an "@" symbol, but it is understood any other character may be designated as the enhancement separator.
  • the enhancement grammar target 517 may itself be any string of characters other than the enhancement separator 514.
  • the enhancement grammar target 517 may be employed for the purpose of having the DOI 500 resolve to multiple versions of a specified information as will be described in greater detail throughout this disclosure.
  • the enhancement grammar target 517 may itself be further comprised of an enhancement grammar verb 512 and enhancement grammar target object 513 separated by an enhancement target separator 516, e.g., a period.
  • the enhancement target separator 516 may be designated as any character(s).
  • the enhancement grammar verb 512 acts as a modifier to select amongst a plurality of multiple resolution targets for a DOI
  • the enhancement grammar target object 513 is a value passed to the target object and/or a Handle system resolution server for further action.
  • HANDLE SYSTEM METADATA A DOI 500 is merely an identification number that does not necessarily convey any information about its associated information.
  • the present invention provides for the use of metadata, which is descriptive data about the identified information. While metadata may be any data-structure that is associated with a DOI, according to one embodiment, the metadata will be comprised of a few basic fields that can accurately and succinctly identify the published information.
  • the metadata will comprise an identifier associated with the entity from a legacy identifier scheme such as the International Standard Book Number (ISBN) for a book, title of the published content, type of content being published (such as book, music, video, etc.), whether the content is original or a derivation, a primary author of the content, the role of the primary author in creating the content, the name of the publisher, and/or the like.
  • ISBN International Standard Book Number
  • the metadata will comprise an identifier associated with the entity from a legacy identifier scheme such as the International Standard Book Number (ISBN) for a book, title of the published content, type of content being published (such as book, music, video, etc.), whether the content is original or a derivation, a primary author of the content, the role of the primary author in creating the content, the name of the publisher, and/or the like.
  • ISBN International Standard Book Number
  • the DOI system envisions the use of different metadata for different types of content.
  • Metadata will be made available to any user of the DOI system to enable them to find the basic description of the entity that any particular DOI identifies. This basic description will allow the user to understand some basic things about the entity that published the content or the content itself.
  • the metadata allows for the recognition of the information identified by the DOI 500 as well as its unambiguous specification.
  • the metadata will also allow for the interaction between the information and other contents in the network (and with metadata about those entities).
  • Figures 7 and 8 provide an overview of the resolution mechanism for allowing users to access the desired information by merely providing the DOI to the DOI Handle system.
  • Resolution in the present context includes the submitting of an identifier to a network service and receiving in return one or more pieces of current information related to the identifier.
  • the user uses her web browser 700 client to point to content identified by a particular DOI 710.
  • This DOI 710 has only one URL associated with it, and must resolve to that URL.
  • the user is directed to URL 720, where the desired content lies.
  • this mechanism allows the location of the information to be changed while maintaining the name of the entity as an actionable identifier. If the publisher changes the location of the content, the publisher must merely update the DOI's entry in the Handle System database to ensure that the existing DOI 710 points to the new location of the content. As a result, while the location of the content has changed, the DOI remains the same and users are able to access the content from its new location by using the existing DOI.
  • Figure 8 provides an overview of a DOI system where users may use a DOI for resolving a request for one piece of content, out of a plurality of available identical copies of the same piece of content that are identified by the same DOI, as well as the location of data about the piece of content, and services associated with the content (such as purchasing the content).
  • the user uses the web browser 800 and provides the necessary DOI 830.
  • the DOI 830 may be structured to describe the type of service desired 835.
  • the DOI system is able to resolve the particular piece of content 840 that the user desires to access.
  • Figure 9 provides an overview of the sequence of actions that a user performs to access information, in accordance with the present invention.
  • the user launches the browser client 900 on a computing device 905, such as personal computer, personal digital assistant (PDA), and/or the like.
  • the user engages the browser 900 to make a DOI query.
  • the DOI query is forwarded to the DOI Directory Server 910 over a communications network.
  • the system of the DOI Directory Server 910 examines the DOI against the entries stored therein and forwards the appropriate URL to the browser 900 on the user's computer 900, in a manner that is invisible to the user.
  • the browser is pointed to the desired content on a server with the appropriate publisher information 920.
  • Figure 10 provides a more complete view of the sequence of actions that a user performs to access content information, as shown in Figure 9.
  • the user launches the browser client 1000 on a computing device 1005.
  • the user engages the browser 1000 to make a DOI query.
  • the DOI query is forwarded to the DOI Directory Server 1010 over the communications network.
  • the system of the DOI Directory Server 1010 examines the DOI against the entries stored therein. As a result of the checking of the DOI against the entries stored in the DOI Directory Server 1010, the DOI Directory Server 1010 determines where the DOI must lead the user 1025.
  • the appropriate URL for the content is automatically forwarded to the user's browser 1000, without any intermediate intervention or action by the user.
  • the browser 1000 is pointed to the appropriate publisher 1020 whose server is addressed by the underlying URL.
  • the URL is used by the publisher's server 1020 to determine the exact location for content desired by the user, and the publisher's server 1020 forwards the appropriate content 1030 to the user.
  • Figure 11 provides an overview of some of the exemplary mechanisms for accessing information over a communications network by resolving a DOI to obtain the URL where the desired content is located, in accordance with the present invention.
  • the user may directly provide the DOI and the DOI system retrieves and forwards the appropriate content to the user by simply linking to the appropriate URL.
  • the user may provide information related to some of the fields included in the metadata, whereupon a DOI lookup service identifies the appropriate DOI, which in turn may be resolved to the desired content's location.
  • a search engine 11010 may be provided to a user.
  • the search engine is offered and disposed in communication with the registration agency's DOI and metadata database.
  • a search engine such as www.google.com may be adapted to submit queries to the registration agency's databases.
  • the user searches for the appropriate DOI by providing some identifying information to the search engine 11010.
  • the search engine 1 1010 uses the identifying information provided and searches a database of metadata to retrieve the DOI associated with the provided metadata information.
  • the user conducting the search may be presented with returned DOIs from the metadata database and/or URLs resolved from said returned DOIs.
  • the retrieved DOI is sent to the DOI directory 1 101 1, which resolves the URL wherein the desired content is located by a publisher 1 1040.
  • the user's browser is pointed to the appropriate content 11060.
  • the user may provide the DOI 11015 in the address window 1 1020 of a browser 1 1025.
  • the DOI 11015 may contain the address of a proxy server for the DOI directory 11011, which in Figure 11 is "dx.doi.org.”
  • the browser is pointed to the DOI directory 11011 located at dx.doi.org, which resolves the URL at which the desired content is located by a publisher 11040 and points the user's browser thereto.
  • the DOI may be embedded in a document or some form of information 11030, whereupon clicking the DOI directs the user to the appropriate DOI directory 1 1011, which determines the URL at which the desired content is located and points the user's browser thereto.
  • the DOI may be provided on a memory 11040, such as a CD-ROM or a floppy disk, whereupon the memory may automatically, or upon being activated, direct the user to the appropriate DOI directory 11011, which resolves the URL at which the desired content is located and points the user's browser thereto.
  • a memory 11040 such as a CD-ROM or a floppy disk
  • the memory may automatically, or upon being activated, direct the user to the appropriate DOI directory 11011, which resolves the URL at which the desired content is located and points the user's browser thereto.
  • the DOI may be provided in printed form to a user, who enters the DOI manually as above or by way of optical and/or mechanical peripheral input device.
  • Figure 12 provides an overview of another embodiment of the exemplary mechanisms for retrieving information over a communications network, whereupon the DOI system resolves a DOI to obtain the URL where the desired information is located.
  • a plurality of DOI directories 1210 exist as a distributed DOI directory and form a Handle System 1200.
  • the distributed DOI directory acts and responds to requests as if it were a singular directory 11011. Otherwise resolutions take place similarly as in Figure 11.
  • Figure 13 provides an overview of an exemplary DOI system, in accordance with the present invention, wherein the publishers, the DOI registration service and the Handle System collaborate together to create an efficient DOI system.
  • the prefix holder 1355 may submit information to a DOI registration service 1300 comprising a DOI 1342 and associated metadata 1366.
  • the registration service 1300 is responsible for parsing and/or reformatting the user's streams of submitted information 1342, 1366 for subsequent deposit in a Handle system 1350 and/or metadata database 1310.
  • the scope of the content that can be addressed using a DOI is unlimited.
  • the content 1366 may comprise any information and work of authorship, including articles, books, music albums, or selected discrete portions thereof.
  • the publisher 1342 collects metadata for the content 1366.
  • the metadata may comprise the content's DOI 500, a DOI genre, an identifier, title, type, origination, primary agent, agent's role, and/or the like. It may also comprise listings of associated services having to do with the identified piece of content offered by various parties, such as the locations of web pages where a piece of content may be purchased online.
  • the DOI 500 and the metadata are transmitted to the DOI registration service 1300.
  • the DOI registration service 1300 maintains a database of DOIs 500, metadata of all the registered content 1366, as well as the URL at which the content 1366 is located.
  • the DOI registration service 1300 forwards the metadata to a metadata database 1310, 119c of Figure 1, which may or may not be integrally maintained by the DOI registration service 1300.
  • the DOI registration service 1300 may use the collected metadata for providing it to other data services 1320 or for providing value added resources 1330 to the users.
  • the DOI registration service 1300 sends the appropriate DOI Handle data to the Handle System 1350, which may comprise a plurality of DOI Directory Servers 1341.
  • Figure 14 depicts one non-limiting example embodiment of data flow for a cataloguing system effecting information access in a peer-to-peer environment.
  • a peer 1401 e.g., DE2P
  • One category of content may have an embedded DOI, i.e., embedded DOI content (hereinafter ED content).
  • ED content embedded DOI content
  • content may be first encrypted with a DRM system and the DOI value may be appended to the encrypted content, thus remaining unencrypted.
  • the DOI value may be embedded into content, which is subsequently encrypted.
  • DOI locale content i.e., DOI locale content
  • CCD content carbon copied DOI content
  • UD content unreferenced DOI content
  • Content may be registered with a handle system and have DOIs persistently refer to the location of content as established by the content's publisher. It is important to note that the location of content as established by the content's publisher will often be different from the copy stored at any given peer's 1401 storage device 1403 in a P2P network; i.e., most content on a P2P network will be CCD content rather than DL content. The reason for the likely greater availability of CCD content is that P2P networks promote copying content from locations other than those referenced or specified by a content's publisher.
  • DOIs may be embedded into content in a number of ways such as, but not limited to: entering DOIs as values into known format metadata fields, e.g., values into MP3 tags; appending a DOI to the end of a file after an end-of-file (EOF) token; applying a watermark representing the DOI; and/or the like.
  • known format metadata fields e.g., values into MP3 tags
  • EEF end-of-file
  • a peer 1401 is disposed in communication with a metadata database (MDDB) 1402 and a peer to peer list collector 1404.
  • the peer "X" 1401 is generally disposed in communication with numerous other peers (not pictured), each of which may be similarly disposed in communication with a MDDB 1402 and P2P list collector 1404. Disposition of communication typically, although not necessarily, takes place across a communications network. Of course the functionality of the MDDB 1402 and/or P2P list collector 1404 may be distributed or centralized across numerous systems for performance enhancing reasons.
  • the P2P list collector may itself be a peer similar to the peer depicted in box 1401, or alternatively it may be a server more tailored to serving requests of other peers.
  • the P2P list collector 1404 is disposed in communication with a mass storage device 1405.
  • the P2P list collector may be a local "super node" for example as is provided in a Morpheus P2P network or a centralized node for example as is provided in a Napster network.
  • Such more centralized P2P list collectors obtain list catalogues of content 1403 from various peers 1401.
  • all peers 1401 simply catalogue content stored in their local storage devices 1403, or alternatively, integrated the functionality of a P2P list collector 1404 into each peer 1401.
  • each peer 1401 may maintain a list of nodes 1405a itself.
  • a peer 1401 first sends content metadata to a MDDB 1402 in the form of a query upon which the metadata database may search.
  • the content metadata may be obtained from the content stored at the peer's storage device 1403 by extracting metadata information from files directly.
  • Various techniques for mining metadata may be employed such as, but not limited to: obtaining embedded DOIs from the content, extracting metadata from tag information embedded in content (e.g., extracting artist, title, album information from an MP3 file), parsing a file searching for tokens (e.g., parsing a Microsoft Word file to identify its author and title), and/or the like.
  • the MDDB 1402 Upon sending the content metadata to the MDDB in the form of a query to ascertain an associated DOI for said content, the MDDB 1402 will provide the peer with an appropriately matching and associated DOI in response.
  • the peer 1401 may discern and obtain associated DOIs for all its content that does not have DOIs imbedded within the content itself. If the content already had a DOI embedded, the peer may verify that the DOI returned by the MDDB corresponds. See figures 18 and 19 for more detail on verification. Such verification will increase the fidelity of content made available across a P2P network. Such verification may take place for each item of content available on the peer's 1401 storage device 1403. Even if verification does not take place, access of CCD content may be tracked for statistical and other varied purposes.
  • the peer 1401 then may provide a P2P list collector 1404 with a message comprising: the peer's network location, e.g., an IP address, and a list of content available at the peer 1401 with associated DOIs.
  • peer X 1401 mines metadata from song 3 in its storage device 1403 and sends that to MDDB 1402, which in turn identifies and provides a query response identifying song 3 to be a copy of content referenced by DOIc. Peer X then associates Song 3 with DOIc.
  • Peer X may make such an association in a number of ways such as, but not limited to: embedding DOIc within the content of Song 3, employing an internal data-structure (e.g., a table, (value paired linked) list, etc.) to associate DOIc with Song 3 within Peer X, and/or the like.
  • an internal data-structure e.g., a table, (value paired linked) list, etc.
  • each peer 1401 builds an internal list of all content available at its storage device 1403.
  • Each entry referencing a content item will be accompanied by a DOI that either references the content and/or references content similar in substance elsewhere.
  • the P2P list collector may obtain numerous content list messages from numerous peers 1401 across a communications network that are reporting what content each peer has made available to other peers.
  • the P2P list collector manages and contains a data-structure 1405a that has a list of DOIs and associated nodes on a network topology where information associated with the DOI is available.
  • Standard data processing techniques may be employed to manage the list collector data-structure 1405 such as, but not limited to: a table with value pair fields keying nodes, e.g., represented by their IP addresses, containing content with a particular DOI reference and its DOI field; a (linked) list, and/or the like.
  • the P2P list collector 1404 provides a convenient mechanism to aggregate lists of available nodes that contain data associated with any particular DOI. In this way a P2P list collector 1405 can catalogue all the various nodes that are currently storing certain versions of content based on the content's DOI.
  • the peer 1401 may send its content list to a P2P list collector 1404. Thereafter, the P2P list collector 1404 adds a reference to the peer 1401 within its data-structure 1405 a associating the peer 1401 with various DOIs listed within the P2P list collector 1404 data-structure 1405a. In effect, this makes a particular peer 1401 available to other peers if and when those other peers execute a search for content with the P2P list collector. Thus, a P2P list collector 1404 maintains references to various peers hosing content available to other peers for downloading.
  • a peer that conducts a search for a piece of content and obtains references back from the P2P list collector may then obtain a copy of the requested content from other node/peers referenced in the P2P list collector's 1404 data-structure 1405a.
  • a peer 1401 may query a P2P list collector for a copy of Song 3, i.e., content referenced by DOIb.
  • the P2P list collector would inform Peer X 1401 that nodes/peers J and K are currently holding copies of Song 3. Thereafter, Peer X 1401 may initiate a download of a copy of Song 3 from peers J and/or K (not pictured).
  • P2P list collector 1404 may then add Peer X as a node holding Song 3, i.e., DOIc, content within its data-structure 1405a.
  • Peer X as a node holding Song 3, i.e., DOIc
  • Referencing content by DOIs in such a manner has an advantage in that it there is a greater likelihood that a copy of the content will not be different or substandard from the original version of the content as referenced by its corresponding DOI.
  • Such a referencing scheme has a further advantage in making it possible to download copies of the desired content with greater speed by downloading portions of the content simultaneously from multiple nodes known to hold accurate versions of copied content.
  • Figure 15 shows the logic flow of one non-limiting example embodiment of a cataloguing system for effecting information access in a peer-to-peer environment.
  • a cataloguing system may be a component within a peer 1401, a P2P list collector 1404, and/or the like.
  • the cataloguing system may be used to catalog content stored on the peer's storage device 1403 and is disposed in communication with a MDDB 1402.
  • the cataloguing system determines if there is new content to catalog 1501.
  • a determination of if there is new content to catalogue may be made employing standard data-processing techniques to determine if new content items have been added and/or not accounted for, such as, but not limited to: scanning a database and/or directory structure for additions entered at times later than the last scan, compiling a list of entries in a database and/or directory structure and adding entries not matched with previous list compilations, and/or the like.
  • the cataloguing system terminates 1502. If there is new content to catalog 1501, then for each piece of content available to a peer 1401, the cataloguing system then determines if the iterated content has a DOI imbedded within 1503. If the cataloguing system determines there is no DOI embedded within the content 1503, then the cataloguing system collects metadata from the content 1504. In one non-limiting example, the cataloguing system may collect the metadata from the content by employing parsing and examining the file based on known file types. For example, MP3 files are known to contain metadata with regard to the files' recording quality, name of artists who created the content, title of the music, and/or the like.
  • the metadata describing the content may be obtained by the user supplying such information by way of a dialogue box GUI widget, and/or the like.
  • Such metadata may be mined from a file and used to look up a DOI in a MDDB 1505.
  • the MDDB acts as a metadata-DOI resolution server, i.e., resolving either metadata and/or DOIs into their respective counterparts. If no DOI is found based on the metadata query to the MDDB, then an error signal may be generated. In one example, the error signal may be used to notify the user that there is no known DOI associated with the new content. In an alternative embodiment, the error signal may also be used to activate other error handling modules.
  • the cataloguing system may parse through content based on unknown file types looking for key fields and tokens such as artists, author, title and/or the like.
  • the cataloguing system Upon determining that the content has an embedded DOI 1503, the cataloguing system retrieves the embedded DOI 1506. In an optional embodiment, the cataloguing system may then verify that the content stored locally that is being catalogued corresponds to verified content associated with a DOI 1511. In one non- limiting example embodiment, this verification may be achieved by requesting a verification from a handle system.
  • the handle system verification may be achieved in a number of ways (see Figures 18 and 1 for more detail) including, but not limited to: submitting an enhanced DOI resolution request, e.g., verify.option@DOI, to the handle system, which may return and/or resolve to checksum, file size, digital certificate depending on the value of the option target; submitting a regular DOI resolution request that resolves to the content, which may then allow for a comparison of attributes between the resolved content and the locally available content; and/or the like forms of verification.
  • an enhanced DOI resolution request e.g., verify.option@DOI
  • the cataloguing system may then add obtained DOI 1506, 1505 to the local list of DOIs 1507.
  • the local list of DOIs may be a list of DOIs that are to be shared with a wide group of peers. Such sharing may be achieved by the peers by enabling the sending and receiving of content search requests and comparison of the search request to a data-structure to a local list of content.
  • the cataloguing system determines if there is more content to catalog 1508.
  • the cataloguing system iterates and determines if there is a new content item to catalog 1501. If there is no more new content to catalog 1508, then the cataloguing system 1508 may submit a list of DOIs to the list collector 1509, 1404. Handle System as a P2P List Collector
  • the list collector 1404 taking the submission 1509 may be the handle system itself.
  • the peer 1401 (or even another P2P list collector 1404) may provide location addresses hosting CCD content associated with a DOI to a DOI registration server, i.e., an Information Access Registration Server (IARS).
  • IARS Information Access Registration Server
  • the IARS may add content-DOI resolution entries in its internal database that adds peers' location addresses as multiple resolution entries for any associated DOIs; such Peer Location Address (PLA) entries may also be
  • PLA entries require as a deliberate act by the would- be hoster; a dialog box and or web form may be engaged to allow the peer to authorize PLA entry into the handle system through an IARS.
  • PLA entry occurs passively by the peer by having a DOI embedded in the content that provides a PLA entry to an IARS.
  • Such PLA entries employ the handle system registration system to provide additional hosts for content accessible through multiple resolution; i.e., in one non-limiting example embodiment the PLA entries themselves are requests to an IARS/IAMRS to register a new location for a piece of information associated with a particular DOI.
  • PLA entries may be made anonymously and/or through privileged and managed facilities.
  • a managed (either human-managed or automated) embodiment only certain users are permitted to register themselves as hosts.
  • privileges for PLA entries are provided only to members of a specified group.
  • entry and or membership into a group automatically causes the peer to initiate a PLA entry into an IAMS.
  • Group privileges may be assigned by various classifications such as, but not limited to: known user and group lists (e.g., those of operating systems such as Unix, Windows NT, and/or the like); peers with thresholds of continuous uptime (e.g., if a peer is available to other peers for more than some specified amount of time); peers with an availability of a specified quantity and/or quality of content (e.g., peers with content libraries above or below specified thresholds); peers with reliability of content (e.g., content verified by a Directory Quality Assurance Server testing); peers with quality of content provision (e.g., peers that provide transmission speeds above or below specified thresholds); peers with proven track records (e.g., peers may be rewarded for "good behavior” that have over or under a specified level of successful transmissions); peers with high selling records (e.g., peers may be rewarded for "good behavior” that have over or under a specified level of successful transmissions resulting in sales and/or payment for access to transmitted materials); peers with peer access credentials (e.g.,
  • a peer would check its local storage to determine if access credentials have been previously obtained, and if the access credentials are still valid. Examples of how to determine if access credentials are current may include, but are not limited to, examining expiration dates in the access credentials and obtaining new credentials after expiration dates; examining the number of accesses permitted in the access credentials and obtaining new credentials after the access limit has been reached; comparing the local access credentials with those resolved to by an associated DOI; and/or the like.
  • peer access credentials may be obtained (e.g., purchased) through a digital rights clearinghouse, website, and/or the like; in such an embodiment if no peer access credentials were available locally or otherwise, the peer may be directed to a DRM system, a Digital Object Identifier Access Tracker (DOIAT), and/or the like.
  • DOIAT Digital Object Identifier Access Tracker
  • such a cataloging P2P system (as described above in Figures 14 and 15) enables the DOI system of Figure 8 and elsewhere to operate in a P2P environment.
  • the propagation and reference to content is no longer limited to the control of publishers/owners of the content. This frees the content owner from having to position, maintain, and support many different locations to distribute and/or load balance availability of the content.
  • the above cataloging system enables the DOI to become a mechanism for identifying and routing to different copies, i.e., CCD content, of the same object in a fiilly decentralized, un-managed P2P environment.
  • any end user who wants to host a copy of an item for public access could register themselves onto a P2P service that then updates a DOI record to point to their location.
  • ad hoc content-DOI resolution servers i.e., the handle system
  • the public may modify entries in the handle system itself by adding entries of nodes that host copies of DOI referenced content, i.e., CCD content, into content-DOI resolution servers as multiple resolution node entries. This has the added benefit of converting CCD content into DL content for anyone using the handle system, and thus transforming the entire DOI system (of Figure 8 and elsewhere) into an organic P2P system.
  • Figure 16 depicts a data flow diagram of a file search and request system effecting information access in a P2P environment.
  • a peer 1601 is disposed in communication with an MDDB 1602.
  • the peer is also disposed in communication with a P2P list collector 1606 that contains and/or has access to a storage device 1607.
  • the P2P list collector 1606 storage device 1607 contains a data-structure that associates DOIs with peer nodes 1607a.
  • the peer 1601 may also be disposed in communication with other peers.
  • Each of the other peers, peer D 1603, peer G 1604 and peer F 1605 are similarly disposed in communication with the MDDB 1602 and the P2P list collector 1606 as is peer A 1601.
  • a user at peer A 1601 may submit a search to an MDDB 1602 by entering search criteria (e.g., artist name, title of work, recording quality, and/or the like) into a user interface widget, e.g., text field.
  • search criteria e.g., artist name, title of work, recording quality, and/or the like
  • the peer encapsulates the user's search request and submits it to the MDDB, which performs a query and returns query results to the peer 1601.
  • the query results provided by the MDDB may be in the form of DOIs.
  • a user at peer A 1601 may browse the list of query results from the MDDB and select content that the user desires. In one non- limiting example a user at peer A 1601 may select a DOI B.
  • the selection is sent as a query request to a P2P list collector 1606.
  • the P2P list collector 1606 looks up peers associated with the use's desired content selection based on DOI B.
  • DOI B is associated with peers D, F and G within the P2P list collector's lookup data-structure 1607a.
  • the P2P list collector 1606 returns query results informing peer A that content associated with DOI B may be found on peers D, F and G. Thereafter, peer A initiates a file transfer request with peers D, F and G.
  • the file transfer request and subsequent responses may be provided through standard transfer protocols such as, but not limited to: File Transfer Protocol, Hyper Text Transfer Protocol, TCP/IP packets, and/or the like.
  • peer A could request a check sum to validate that the files contained on peers D, F and G match and are the equivalent of information that is properly associated with DOI B as has already been discussed.
  • each of the other peers D, F and G may make their own queries amongst themselves, with peer A 1601 and any other peers available across the P2P network.
  • Figure 17 is a logic flow diagram for a file search and request system for effecting information access in a P2P environment. Initially, the search and request system determines if a DOI of desired content is known 1701. If the DOI for desired content is not known, the search and request system enables the user to look up the DOI in an MDDB based on metadata query tokens 1702.
  • the search and request system submits a search request based on the obtained DOI to a P2P list collector to derive a list of hosts containing content.
  • the P2P list collector 1606 may derive the list of hosts by matching the obtained DOI with DOIs in its content catalogue data-structure 1607a for matching DOI entries and retrieving peer/nodes known to contain the desired content that correspond to the matched DOIs 1703. It is important to note that the P2P list collector 1607a may be varied in its role.
  • the P2P list collector is merely another peer identical in design and function to all other peers 1401.
  • the P2P list collector 1404 is a centralized database accessed by all requesting peers 1401. In yet another alternative embodiment, the P2P list collector 1404 acts as a super node listing available peer nodes housing content to a limited group of peers. The preferred embodiment will vary and depend upon deployment requirements such as scalability, resource availability, and/or the like.
  • the search and request system Upon querying a P2P list collector 1703, 1606, the search and request system will obtain results from the P2P list collector identifying candidate peers from which to obtain content corresponding to the desired DOI 1713. Upon obtaining a list of potential peers from which to obtain the desired work 1713, the search and request system will contact a peer using an established P2P protocol 1704. Non-limiting example protocols include, but are not limited to, TCP/IP, UDP, FTP, and/or the like. Upon contacting the peer and establishing a P2P protocol 1704, the desired content corresponding to a DOI is requested by DOI reference 1705. The request is made by submitting a DOI as a search term. The peer catalogs content in its storage device 1403 employing DOIs as key fields facilitating searches.
  • a file transfer is initiated 1715. If the file is not available, an error message is generated 1725.
  • the search and request system determines if the file has been successfully retrieved 1706. If it has not been successfully retrieved, an alternative host is contacted and a P2P protocol connection is established with the alternative host 1704.
  • a search and request system may contact multiple hosts simultaneously establishing P2P protocols with each of the multiple hosts; in this way it may engage in multiple transfers of various portions of the same requested file to increase the file transfer rate of said file.
  • the search and request system determines if the retrieved file is valid 1707.
  • the file is determined to be valid by comparing it against a check sum based on the file's size and/or other attributes with a check sum stored in the handle system's metadata database regarding content associated with that particular DOI.
  • the search and request system may initiate a new P2P protocol with an alternative peer to obtain a valid file. Iteration will continue in such a manner until the user desires the cancellation of such file transfers and/or successfully retrieves a file.
  • Figure 18 illustrates a data flow diagram for a post-receipt validation system for effecting information access in a P2P environment.
  • a peer 1801 is disposed in communication with a handle system 1803.
  • the peer provides a DOI to resolve with the handle system 1803.
  • the peer may include a mass storage device 1802 and/or the like that may contain content with embedded DOIs, e.g., Song 1 with DOIb.
  • the handle system may resolve DOIs with any associated information and also may resolve a DOI with metadata in a MDDB.
  • Metadata may include items such as lyrics, authentication information, audio fingerprints, HTTP locations for content, HTTP locations for purchasing content and/or the like.
  • the handle system provides the peer 1801 with a resolution location from which it may obtain content, metadata, services, and/or the like.
  • the handle system will resolve to content, metadata, services, and/or the like based on an enhanced DOI; e.g., validate@DOIa would resolve to validation information associated with DOIa.
  • the post-receipt validation system may be integrated into a peer 1401. FILE RECEIPT VALIDATION SYSTEM LOGIC FLOW
  • Figure 19 depicts a logic flow diagram for a file receipt validation system for effecting information access in a P2P environment. Initially, the file validation system requests validating credentials from the handle system for any desired DOI 1901.
  • Validating credentials may include, but are not limited to: checksums, digital certificates, digital fingerprints, encryption keys, comparison of content/tags (e.g., comparing the author, title, publisher, etc. tags embedded within CCD content item and that of a DL content item), content itself (e.g., extracting portions of a DL content item for comparison with a CCD content item), passwords, and/or the like - including DOIs which may denote credentials such as any of the preceding.
  • specific requests for authentication and/or validation forms may be enabled through the use of an enhanced DOI grammar and through multiple resolution of DOIs.
  • a request may be: submitted as an enhanced DOI resolution request, e.g., verify.option@DOI, to the handle system, which may return and/or resolve to checksum, file size, digital certificate depending on the value of the option target; submitted as a regular DOI resolution request that resolves to the content, which may then allow for a comparison of attributes between the resolved content and the locally available content; and/or the like forms of verification.
  • an enhanced DOI resolution request e.g., verify.option@DOI
  • the file validation system may then employ authentication and validation techniques to locally establish the authenticity and/or validation of a retrieved file 1902.
  • the file validation system will employ a checksum on the locally retrieved file and compare it with the check sum returned from the handle system.
  • the file validation system will compare the fingerprint retrieved from the locally stored file and that from the handle system.
  • the file validation system will decrypt a supplied and/or embedded digital certificate and compare it with a digital certificate obtained from a validation authority.
  • the file validation system Upon calculating the appropriate authentication and validation information, the file validation system will compare the obtained credentials with the calculated values 1903. If the file validation system determines that the compared credential values do not match the calculated values, the file will be deemed to be invalid and a signal e ⁇ or will be generated 1904. However, if the calculated authentication and/or validation values match the values obtained from the handle system, the retrieved file will be determined to be valid 1903 and a signal indicating that the file is valid will be generated 1905. It should be noted that the file receipt validation system may be integrated into a peer 1401.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computer Security & Cryptography (AREA)
  • Computing Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Computer Hardware Design (AREA)
  • Theoretical Computer Science (AREA)
  • Databases & Information Systems (AREA)
  • Data Mining & Analysis (AREA)
  • General Physics & Mathematics (AREA)
  • Physics & Mathematics (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
  • Storage Device Security (AREA)
  • Information Transfer Between Computers (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Computer And Data Communications (AREA)
  • Editing Of Facsimile Originals (AREA)
  • Stored Programmes (AREA)

Abstract

L'invention concerne un appareil, un procédé et un système permettant de cataloguer, marquer, faciliter les recherches, transférer et valider des informations dans un réseau de systèmes homologues (P2P). Cette invention concerne l'identification et l'association de contenus référencés par un DOI au moyen de copies sensiblement similaires desdits contenus. Le contenu ne comportant pas de référence DOI peut être marqué au moyen de son DOI identifié et associé pour faciliter les transactions du P2P. On améliore la disponibilité et/ou la qualité du contenu dans un réseau distribué en déterminant si les copies dudit contenu dans le réseau P2P sont liées à un contenu référencé DOI d'un éditeur. On peut apporter cette amélioration en vérifiant si le contenu résultant des interrogations dans un réseau P2P est le même que le contenu référencé DOI de l'éditeur. Ceci permet d'obtenir un contenu identifié et/ou plus facilement identifiable; par exemple, il est plus facile de déterminer que n'importe quelles copies de contenu original sont suffisamment fidèles pour être sensiblement liées au contenu original. L'invention concerne également la possibilité d'améliorer la gestion du droit numérique par un tel contenu identifié en encourageant la propagation du contenu au moyen de matériaux de gestion des droits numériques intégrés, lorsque l'éditeur le souhaite. Ainsi, l'invention permet la distribution et la propagation d'un ensemble plus uniforme de contenus dans un réseau de communication. De même, l'invention permet aux systèmes DOI standards de fonctionner dans un environnement P2P où des homologues multiples P2P non contrôlés par les propriétaires de contenus peuvent affecter la disponibilité et l'accès aux contenus dans le système de gestion et/ou le réseau P2P.
EP02718882A 2001-01-25 2002-01-25 Appareil, procede et systeme d'acces aux informations dans un environnement homologue Ceased EP1364277A4 (fr)

Applications Claiming Priority (23)

Application Number Priority Date Filing Date Title
US26433301P 2001-01-25 2001-01-25
US264333P 2001-01-25
US26787501P 2001-02-08 2001-02-08
US267875P 2001-02-08
US26789901P 2001-02-09 2001-02-09
US267899P 2001-02-09
US26876601P 2001-02-14 2001-02-14
US268766P 2001-02-14
US27047301P 2001-02-21 2001-02-21
US270473P 2001-02-21
US27645901P 2001-03-16 2001-03-16
US276459P 2001-03-16
US27979201P 2001-03-29 2001-03-29
US279792P 2001-03-29
US30376801P 2001-07-10 2001-07-10
US303768P 2001-07-10
US32827401P 2001-10-09 2001-10-09
US32827001P 2001-10-09 2001-10-09
US32827501P 2001-10-09 2001-10-09
US328270P 2001-10-09
US328274P 2001-10-09
US328275P 2001-10-09
PCT/US2002/002475 WO2002058453A2 (fr) 2001-01-25 2002-01-25 Appareil, procede et systeme d'acces aux informations dans un environnement homologue

Publications (2)

Publication Number Publication Date
EP1364277A2 EP1364277A2 (fr) 2003-11-26
EP1364277A4 true EP1364277A4 (fr) 2005-03-30

Family

ID=27582755

Family Applications (10)

Application Number Title Priority Date Filing Date
EP02706002A Withdrawn EP1366438A4 (fr) 2001-01-25 2002-01-25 Dispositif, procede et systeme servant a assurer la qualite d'un repertoire
EP08170143A Withdrawn EP2053525A3 (fr) 2001-01-25 2002-01-25 Procédé, appareil et logiciel pour registrer un identificateur de document persistant
EP08165819A Withdrawn EP2146290A1 (fr) 2001-01-25 2002-01-25 Appareil, procédé et système pour l'accès aux informations pour effectuer un enregistrement
EP02718881A Withdrawn EP1364291A4 (fr) 2001-01-25 2002-01-25 Appareil, procede et systeme pour resolution multiple affectant l'acces aux informations
EP02718882A Ceased EP1364277A4 (fr) 2001-01-25 2002-01-25 Appareil, procede et systeme d'acces aux informations dans un environnement homologue
EP09150228A Withdrawn EP2079028A1 (fr) 2001-01-25 2002-01-25 Appareil, procédé et système pour la génération de contenus DRM contenant des élements permanents
EP02713463A Withdrawn EP1358543A4 (fr) 2001-01-25 2002-01-25 Dispositif, procede et systeme d'enregistrement donnant acces a l'information
EP02720861A Withdrawn EP1364278A4 (fr) 2001-01-25 2002-01-25 Appareil, procede et systeme pour mettre en oeuvre un suivi d'acces aux informations
EP09153818A Withdrawn EP2085895A1 (fr) 2001-01-25 2002-01-25 Appareil, procédé et système pour la résolution multiple relative à l'accès aux informations
EP02709190A Withdrawn EP1358729A4 (fr) 2001-01-25 2002-01-25 Appareil, procede et systeme d'acces a des informations de gestion de droits numeriques

Family Applications Before (4)

Application Number Title Priority Date Filing Date
EP02706002A Withdrawn EP1366438A4 (fr) 2001-01-25 2002-01-25 Dispositif, procede et systeme servant a assurer la qualite d'un repertoire
EP08170143A Withdrawn EP2053525A3 (fr) 2001-01-25 2002-01-25 Procédé, appareil et logiciel pour registrer un identificateur de document persistant
EP08165819A Withdrawn EP2146290A1 (fr) 2001-01-25 2002-01-25 Appareil, procédé et système pour l'accès aux informations pour effectuer un enregistrement
EP02718881A Withdrawn EP1364291A4 (fr) 2001-01-25 2002-01-25 Appareil, procede et systeme pour resolution multiple affectant l'acces aux informations

Family Applications After (5)

Application Number Title Priority Date Filing Date
EP09150228A Withdrawn EP2079028A1 (fr) 2001-01-25 2002-01-25 Appareil, procédé et système pour la génération de contenus DRM contenant des élements permanents
EP02713463A Withdrawn EP1358543A4 (fr) 2001-01-25 2002-01-25 Dispositif, procede et systeme d'enregistrement donnant acces a l'information
EP02720861A Withdrawn EP1364278A4 (fr) 2001-01-25 2002-01-25 Appareil, procede et systeme pour mettre en oeuvre un suivi d'acces aux informations
EP09153818A Withdrawn EP2085895A1 (fr) 2001-01-25 2002-01-25 Appareil, procédé et système pour la résolution multiple relative à l'accès aux informations
EP02709190A Withdrawn EP1358729A4 (fr) 2001-01-25 2002-01-25 Appareil, procede et systeme d'acces a des informations de gestion de droits numeriques

Country Status (4)

Country Link
EP (10) EP1366438A4 (fr)
JP (11) JP2004530183A (fr)
AU (4) AU2002251832A1 (fr)
WO (6) WO2002060110A2 (fr)

Families Citing this family (32)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
SE0202451D0 (sv) * 2002-08-15 2002-08-15 Ericsson Telefon Ab L M Flexible Sim-Based DRM agent and architecture
DE10239062A1 (de) 2002-08-26 2004-04-01 Siemens Ag Verfahren zum Übertragen von verschlüsselten Nutzdatenobjekten
US8311890B2 (en) * 2002-11-01 2012-11-13 Google Inc. Method and system for dynamic textual ad distribution via email
US7406535B2 (en) * 2002-12-20 2008-07-29 Symantec Operating Corporation Role-based message addressing for a computer network
FR2868896B1 (fr) * 2004-04-13 2008-03-14 Canon Kk Procede et dispositif de controle d'acces a un document numerique partage dans un reseau de communication de type poste a poste
FR2873525B1 (fr) * 2004-07-20 2006-11-17 Canon Kk Procede et dispositif de transfert de droit associe a une donnee numerique dans un reseau de communication distribue
US7499980B2 (en) 2004-08-19 2009-03-03 International Business Machines Corporation System and method for an on-demand peer-to-peer storage virtualization infrastructure
US8307026B2 (en) 2004-08-19 2012-11-06 International Business Machines Corporation On-demand peer-to-peer storage virtualization infrastructure
US20170200228A1 (en) * 2004-09-22 2017-07-13 Fmr Llc Multichannel Exchange Mechanism Apparatuses, Methods and Systems
JP2008530639A (ja) * 2005-01-11 2008-08-07 コンテントディレクションズ インコーポレイティッド 統合、情報処理及び自己組付け広告、電子商取引及びオンラインクライアントインターラクションのための装置、方法及びシステム
US7523273B2 (en) 2005-05-05 2009-04-21 International Business Machines Corporation Autonomic storage provisioning to enhance storage virtualization infrastructure availability
EP1752925A1 (fr) * 2005-07-20 2007-02-14 Siemens Aktiengesellschaft Procédé et système pour la distribution de contenu protégé digitalement dans un réseaux poste à poste
US7512943B2 (en) * 2005-08-30 2009-03-31 Microsoft Corporation Distributed caching of files in a network
JP2007280303A (ja) * 2006-04-11 2007-10-25 Brother Ind Ltd 情報通信システム、コンテンツカタログ情報配信方法、及びノード装置等
JP4862463B2 (ja) * 2006-04-11 2012-01-25 ブラザー工業株式会社 情報通信システム、コンテンツカタログ情報検索方法、及びノード装置等
JP4655986B2 (ja) 2006-04-12 2011-03-23 ブラザー工業株式会社 ノード装置、記憶制御プログラム及び情報記憶方法
US8423479B2 (en) 2007-05-07 2013-04-16 Yahoo! Inc. Trusted third party clearing house for lead tracking
EP2120172A1 (fr) 2008-05-08 2009-11-18 Zentech S.r.l. Procédé et système permettant de partager légalement un contenu numérique protégé par copyright
IT1391750B1 (it) * 2008-09-26 2012-01-27 Prossima Isola S R L Metodo ed apparato per il reperimento di uno o piu' indirizzi dove e' presente la versione piu' aggiornata di un documento
CN102377810A (zh) * 2010-08-25 2012-03-14 北京鑫丰南格科技有限责任公司 一种临床信息交互方法及应用该方法的设备
JP2012169855A (ja) * 2011-02-14 2012-09-06 Nippon Telegr & Teleph Corp <Ntt> ネットワーク管理装置、ネットワークシステム、ネットワーク管理方法、及びネットワーク管理プログラム
KR101243057B1 (ko) 2012-11-23 2013-03-26 한국과학기술정보연구원 학술논문 xml 풀텍스트 생성을 위한 자동화 입력 시스템 및 방법
ES2805343T3 (es) * 2012-12-18 2021-02-11 Thomson Reuters Entpr Centre Gmbh Sistemas y procesos habilitados para dispositivos móviles para plataforma de investigación inteligente
US9069879B2 (en) 2012-12-27 2015-06-30 Dropbox, Inc. Globally unique identifiers in an online content management system
US10922426B2 (en) 2017-09-29 2021-02-16 Dropbox, Inc. Managing content item collections
US11222162B2 (en) 2017-09-29 2022-01-11 Dropbox, Inc. Managing content item collections
JP6905084B2 (ja) * 2017-09-29 2021-07-21 ドロップボックス， インコーポレイテッド コンテンツアイテムコレクションの管理
KR101986482B1 (ko) * 2017-12-12 2019-06-07 주식회사 디지캡 콘텐츠 정보 저장 및 관리를 위한 콘텐츠 블록체인
EP3499387A1 (fr) * 2017-12-18 2019-06-19 Nagravision S.A. Dispositif et procédé de résolution d'adresse d'un contenu multimédia référencé par une liaison informatique
JP2021103342A (ja) 2018-04-02 2021-07-15 ソニーグループ株式会社 情報処理装置、情報処理方法、およびプログラム
CN111524005B (zh) * 2020-04-15 2023-08-08 四川赛康智能科技股份有限公司 一种基于区块链的handle标识系统及数据处理方法
CN113114484B (zh) * 2021-03-18 2023-04-18 普奥云洲智能科技(上海)有限公司 一种基于Handle标识系统的工业互联网网关系统及配置方法

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0715244A1 (fr) * 1994-11-23 1996-06-05 Xerox Corporation Système pour commander la distribution et l'utilisation d'oeuvres numériques en utilisant un grammaire pour les droits d'usage
US5918214A (en) * 1996-10-25 1999-06-29 Ipf, Inc. System and method for finding product and service related information on the internet
US5950173A (en) * 1996-10-25 1999-09-07 Ipf, Inc. System and method for delivering consumer product related information to consumers within retail environments using internet-based information servers and sales agents
US6154738A (en) * 1998-03-27 2000-11-28 Call; Charles Gainor Methods and apparatus for disseminating product information via the internet using universal product codes

Family Cites Families (48)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5694603A (en) * 1982-09-28 1997-12-02 Reiffin; Martin G. Computer memory product with preemptive multithreading software
US5021968A (en) * 1987-01-13 1991-06-04 Robertson-Ceco Corporation Graphics-based wire-cable management system
US5136647A (en) 1990-08-02 1992-08-04 Bell Communications Research, Inc. Method for secure time-stamping of digital documents
US6076733A (en) * 1993-11-24 2000-06-20 Metrologic Instruments, Inc. Web-based system and method for enabling a viewer to access and display HTML-encoded documents located on the world wide web (WWW) by reading URL-encoded bar code symbols printed on a web-based information resource guide
CA2091640A1 (fr) * 1991-09-19 1994-09-16 Jerry R. Martinez Methode et appareil pour valider l'information de credit lors de la livraison a domicile d'une commande
US5347791A (en) * 1992-11-05 1994-09-20 Fmc Corporation Computer controlled horizontal wrapper
DE69432503T2 (de) * 1993-10-08 2003-12-24 Ibm Informationsarchivierungssystem mit objektabhängiger Funktionalität
US6135646A (en) * 1993-10-22 2000-10-24 Corporation For National Research Initiatives System for uniquely and persistently identifying, managing, and tracking digital objects
US5590038A (en) * 1994-06-20 1996-12-31 Pitroda; Satyan G. Universal electronic transaction card including receipt storage and system and methods of conducting electronic transactions
US5835735A (en) * 1995-03-03 1998-11-10 Eastman Kodak Company Method for negotiating software compatibility
US5765874A (en) * 1995-05-09 1998-06-16 Custom Creative Insights Corporation Method for mass customization of printed materials
US5999095A (en) * 1995-05-19 1999-12-07 Slc Technologies, Inc. Electronic security system
US5805800A (en) * 1995-11-07 1998-09-08 Fujitsu Limited Apparatus and method for controlling storage medium using security capabilities
US5774552A (en) * 1995-12-13 1998-06-30 Ncr Corporation Method and apparatus for retrieving X.509 certificates from an X.500 directory
JP4205179B2 (ja) * 1996-02-16 2009-01-07 富士ゼロックス株式会社 文書管理システム
US5768388A (en) * 1996-03-01 1998-06-16 Goldwasser; Shafi Time delayed key escrow
US5991876A (en) * 1996-04-01 1999-11-23 Copyright Clearance Center, Inc. Electronic rights management and authorization system
AU3000897A (en) * 1996-05-13 1997-12-05 Corporation For National Research Initiatives Identifying, managing, accessing, and tracking digital objects and associated rights and payments
US6154777A (en) * 1996-07-01 2000-11-28 Sun Microsystems, Inc. System for context-dependent name resolution
US6061738A (en) * 1997-06-27 2000-05-09 D&I Systems, Inc. Method and system for accessing information on a network using message aliasing functions having shadow callback functions
US6111506A (en) * 1996-10-15 2000-08-29 Iris Corporation Berhad Method of making an improved security identification document including contactless communication insert unit
CN1244933A (zh) * 1996-10-25 2000-02-16 Ipf股份有限公司 互联网上消费品信息管理服务系统及其方法
US6233684B1 (en) * 1997-02-28 2001-05-15 Contenaguard Holdings, Inc. System for controlling the distribution and use of rendered digital works through watermaking
JPH1125048A (ja) * 1997-06-30 1999-01-29 Hitachi Ltd ネットワークシステムのセキュリティ管理方法
US6061708A (en) * 1997-05-31 2000-05-09 International Business Machines Corporation System and method for supporting mixed-phase transactions in an object-oriented environment
JPH10336172A (ja) * 1997-06-04 1998-12-18 Kyushu Syst Joho Gijutsu Kenkyusho 電子認証用公開鍵の管理方法
US6073140A (en) * 1997-07-29 2000-06-06 Acxiom Corporation Method and system for the creation, enhancement and update of remote data using persistent keys
US5974453A (en) * 1997-10-08 1999-10-26 Intel Corporation Method and apparatus for translating a static identifier including a telephone number into a dynamically assigned network address
US6014628A (en) * 1997-11-03 2000-01-11 Exigent International, Inc. Method and system for tracking any entity through any set of processes utilizing a temporal projection
US6151624A (en) * 1998-02-03 2000-11-21 Realnames Corporation Navigating network resources based on metadata
JP4013354B2 (ja) * 1998-09-24 2007-11-28 富士ゼロックス株式会社 データ固定化システム、データ固定化装置、データ中継装置、情報端末装置、データ固定化プログラムを記録したコンピュータ読み取り可能な記録媒体、データ中継プログラムを記録したコンピュータ読み取り可能な記録媒体、及び情報端末用プログラムを記録したコンピュータ読み取り可能な記録媒体
US6519700B1 (en) * 1998-10-23 2003-02-11 Contentguard Holdings, Inc. Self-protecting documents
US6343361B1 (en) * 1998-11-13 2002-01-29 Tsunami Security, Inc. Dynamic challenge-response authentication and verification of identity of party sending or receiving electronic communication
US6325284B1 (en) * 1998-12-30 2001-12-04 Walker Digital, Llc Device and method for promoting the selection and use of a credit card
US20020087559A1 (en) * 1999-01-11 2002-07-04 PRATT John Method and system for retrieving documents using hyperlinks
US6356915B1 (en) * 1999-02-22 2002-03-12 Starbase Corp. Installable file system having virtual file system drive, virtual device driver, and virtual disks
US6269373B1 (en) * 1999-02-26 2001-07-31 International Business Machines Corporation Method and system for persisting beans as container-managed fields
FI990461A0 (fi) * 1999-03-03 1999-03-03 Nokia Mobile Phones Ltd Menetelmä ohjelmiston lataamiseksi palvelimelta päätelaitteeseen
US7383205B1 (en) * 1999-03-27 2008-06-03 Microsoft Corporation Structure of a digital content package
AU4230300A (en) * 1999-04-12 2000-11-14 Reciprocal, Inc. System and method for data rights management
JP2000324166A (ja) * 1999-05-13 2000-11-24 Nippon Telegr & Teleph Corp <Ntt> コンテンツディレクトリシステム
JP2000322432A (ja) * 1999-05-13 2000-11-24 Nippon Telegr & Teleph Corp <Ntt> コンテンツディレクトリシステム
JP3723379B2 (ja) * 1999-05-13 2005-12-07 日本電信電話株式会社 コンテンツディレクトリシステム
JP3374100B2 (ja) * 1999-05-13 2003-02-04 日本電信電話株式会社 コンテンツｉｄ付与システム
JP2000322308A (ja) * 1999-05-13 2000-11-24 Nippon Telegr & Teleph Corp <Ntt> コンテンツディレクトリシステム
JP2000322433A (ja) * 1999-05-13 2000-11-24 Nippon Telegr & Teleph Corp <Ntt> コンテンツディレクトリサーバ
JP2000322431A (ja) * 1999-05-13 2000-11-24 Nippon Telegr & Teleph Corp <Ntt> コンテンツｉｄ付与システム
CA2405044C (fr) * 2000-05-02 2007-01-23 At&T Corp. Systeme et procede de gestion de la mobilite inter-domaine

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0715244A1 (fr) * 1994-11-23 1996-06-05 Xerox Corporation Système pour commander la distribution et l'utilisation d'oeuvres numériques en utilisant un grammaire pour les droits d'usage
US5918214A (en) * 1996-10-25 1999-06-29 Ipf, Inc. System and method for finding product and service related information on the internet
US5950173A (en) * 1996-10-25 1999-09-07 Ipf, Inc. System and method for delivering consumer product related information to consumers within retail environments using internet-based information servers and sales agents
US6154738A (en) * 1998-03-27 2000-11-28 Call; Charles Gainor Methods and apparatus for disseminating product information via the internet using universal product codes

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
"IN SEARCH OF THE UNICORN: THE DIGITAL OBJECT IDENTIFIER FROM A USER PERSPECTIVE", BNBRF REPORT, XX, XX, no. 89, February 1998 (1998-02-01), pages 1 - 36, XP002950960 *
MOJO NATION DOCS: "Technology Overview of Mojo Nation", N.A., 14 February 2000 (2000-02-14), XP002177454 *
PASKIN M: "Digital object identifier: implementing a standard digital identifier as the key to effective digital rights management", ANNOUNCEMENT INTERNATIONAL DOI FOUNDATION, XX, XX, April 2000 (2000-04-01), pages 1 - 20, XP002955229 *
TILLEY S ET AL: "Spreading knowledge about gnutella: a case study in understanding net-centric applications", N.A., 12 May 2001 (2001-05-12), pages 189 - 198, XP010541020 *

Also Published As

Publication number Publication date
JP4570645B2 (ja) 2010-10-27
WO2002060112A8 (fr) 2003-11-06
EP1366438A1 (fr) 2003-12-03
WO2002059724A3 (fr) 2002-10-10
JP2004532538A (ja) 2004-10-21
EP1358543A4 (fr) 2005-03-30
JP2004530965A (ja) 2004-10-07
JP2008016045A (ja) 2008-01-24
EP1364278A2 (fr) 2003-11-26
JP3938047B2 (ja) 2007-06-27
EP1364291A2 (fr) 2003-11-26
WO2002060110A2 (fr) 2002-08-01
JP2004537080A (ja) 2004-12-09
JP4620769B2 (ja) 2011-01-26
EP1358729A2 (fr) 2003-11-05
WO2002060110A3 (fr) 2003-01-30
WO2002058453A2 (fr) 2002-08-01
WO2002059724A2 (fr) 2002-08-01
EP1364277A2 (fr) 2003-11-26
EP1358543A1 (fr) 2003-11-05
JP4366078B2 (ja) 2009-11-18
JP4782215B2 (ja) 2011-09-28
JP4166573B2 (ja) 2008-10-15
AU2002249992A1 (en) 2002-08-06
EP1366438A4 (fr) 2005-04-20
WO2002060112A3 (fr) 2002-10-17
AU2002243689A1 (en) 2002-08-06
EP2085895A1 (fr) 2009-08-05
AU2002249993A1 (en) 2002-08-06
EP2079028A1 (fr) 2009-07-15
JP2009080829A (ja) 2009-04-16
WO2002060112A2 (fr) 2002-08-01
AU2002251832A1 (en) 2002-08-06
JP2009199605A (ja) 2009-09-03
EP1358729A4 (fr) 2005-04-06
JP4401074B2 (ja) 2010-01-20
WO2002059739A1 (fr) 2002-08-01
WO2002059724A9 (fr) 2002-12-12
JP2008072710A (ja) 2008-03-27
JP2004532439A (ja) 2004-10-21
JP2004533030A (ja) 2004-10-28
JP2004530183A (ja) 2004-09-30
JP4681643B2 (ja) 2011-05-11
EP2053525A3 (fr) 2009-07-22
EP2053525A2 (fr) 2009-04-29
JP2009116883A (ja) 2009-05-28
WO2002058453A3 (fr) 2002-09-26
EP2146290A1 (fr) 2010-01-20
WO2002059797A1 (fr) 2002-08-01
EP1364291A4 (fr) 2005-04-20
EP1364278A4 (fr) 2009-01-07

Similar Documents

Publication Publication Date Title
US20110113034A1 (en) Apparatus, method and system for effecting information access in a peer environment
US8156151B2 (en) Apparatus, method and system for tracking information access
JP4570645B2 (ja) ピア環境において情報アクセスを実行するための装置、方法及びシステム
US20100306247A1 (en) Apparatus, Method and System for Accessing Digital Rights Management Information
US20100174746A1 (en) Apparatus, Method and System for Multiple Resolution Affecting Information Access
US20150178340A1 (en) Apparatus, Method and System for Registration Effecting Information Access

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20030822

AK Designated contracting states

Kind code of ref document: A2

Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LI LU MC NL PT SE TR

AX Request for extension of the european patent

Extension state: AL LT LV MK RO SI

A4 Supplementary search report drawn up and despatched

Effective date: 20050211

RIC1 Information provided on ipc code assigned before grant

Ipc: 7G 06F 17/30 A

RAP1 Party data changed (applicant data changed or rights of an application transferred)

Owner name: CONTENT DIRECTIONS, INC.

RIN1 Information on inventor provided before grant (corrected)

Inventor name: SIDMAN, DAVID

R17P Request for examination filed (corrected)

Effective date: 20050822

17Q First examination report despatched

Effective date: 20070530

R17D Deferred search report published (corrected)

Effective date: 20020926

R17P Request for examination filed (corrected)

Effective date: 20030822

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION HAS BEEN REFUSED

18R Application refused

Effective date: 20091007