EP1358576A2 - Protocole de transfert par cable de localisations reparties par reseau - Google Patents

Protocole de transfert par cable de localisations reparties par reseau

Info

Publication number
EP1358576A2
EP1358576A2 EP01966551A EP01966551A EP1358576A2 EP 1358576 A2 EP1358576 A2 EP 1358576A2 EP 01966551 A EP01966551 A EP 01966551A EP 01966551 A EP01966551 A EP 01966551A EP 1358576 A2 EP1358576 A2 EP 1358576A2
Authority
EP
European Patent Office
Prior art keywords
ndtp
string
int
con
udp
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.)
Withdrawn
Application number
EP01966551A
Other languages
German (de)
English (en)
Inventor
John K. Overton
Stephen W. Bailey
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.)
Econnectix Inc
Original Assignee
Econnectix Inc
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
Priority claimed from US09/661,222 external-priority patent/US7103640B1/en
Application filed by Econnectix Inc filed Critical Econnectix Inc
Publication of EP1358576A2 publication Critical patent/EP1358576A2/fr
Withdrawn 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/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
    • 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]
    • G06F16/9566—URL specific, e.g. using aliases, detecting broken or misspelled links
    • 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/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
    • 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/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
    • H04L67/10015—Access to distributed or replicated servers, e.g. using brokers
    • 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/26—Special purpose or proprietary protocols or architectures
    • 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

  • This invention relates generally to the storage and retrieval of information, and in particular, to a protocol for dynamic and spontaneous global search and retrieval of information across a distributed network regardless of the data format.
  • Data can reside in many different places.
  • a client seeking information sends a request to a server.
  • a server typically, only data that are statically associated with that server are returned.
  • the search is also usually restricted to previously known systems. The search is thus conducted only where the server knows in advance to look.
  • Known retrieval systems are typically designed to search for data in limited forms.
  • a client requests files based on a subject, like a person's name. In the search results, therefore, only text files of peoples' names may be retrieved.
  • Another problem in current retrieval systems is that the client may receive text and image files in the search results, but could not seamlessly access the image files.
  • Yet another problem in current retrieval systems is that video and sound files related to the request may not even be found in the search results. For example, a doctor might be able to retrieve medical records on a specific patient, but cannot view an MRI or X-Ray results associated with that record.
  • a distributed data collection is a system where data is stored and retrieved among multiple machines connected by a network.
  • each machine in which some portion of the data in a distributed data collection may reside is called a "data repository machine", or simply a "data repository”.
  • data repository machine or simply a “data repository”.
  • One commonly asked question in a data repository environment is: Where is data associated with a particular entity in a distributed data collection? The data location is a key question when a distributed data collection has highly dynamic data distribution properties.
  • the invention provides a network distributed tracking wire transfer protocol, and a system and method for using the protocol in a networked environment.
  • the network distributed tracking wire transfer protocol includes two basic components: identification strings for specifying the identity of an entity in the distributed data collection, and location strings for specifying network locations of data associated with an entity.
  • the protocol accommodates variable length identifier and location strings. Relationships between identification strings and location strings can be dynamically and spontaneously manipulated thus allowing the corresponding data relationships also to change dynamically, spontaneously, and efficiently.
  • the network distributed tracking wire transfer protocol is application independent, organizationally independent, and geographically independent.
  • a system of components using the network distributed tracking protocol for storing and identifying data with a distributed data collection.
  • the components include (1) a data repository for storing data in the distributed data collection, (2) a client entity for manipulating data in the distributed data collection, and (3) a first server entity operative to locate data in the distributed data collection, which may be coupled to a client entity and/or data repository.
  • a client entity transmits an identifier string to the first server entity along with the client request, and the first server entity provides a set of location strings to the client entity in response thereto.
  • the first server entity maps the identifier string received from the client entity to a set of location strings.
  • the network may also include any number of additional server entities coupled to the first server entity.
  • a location string specifies the location of data associated with an entity in the distributed data collection and the identification string specifies the identification of an entity in a distributed data collection.
  • a first data repository entity stores data by associating an identification string with each particular stored unit of data, and by mapping the identification string to a location string associated with the first data repository.
  • the identification string and location string for the particular unit of data are at a first server entity coupled to the first data repository entity.
  • a request is transmitted from a client entity to the first server entity to retrieve at least one location string associated with the stored unit of data in the distributed data collection.
  • the request includes the identification string associated with the particular stored unit of data.
  • the request is received at the first server entity, which responds to the client entity by providing at least one location string associated with the particular stored unit of data to the client entity.
  • the request may also be transmitted to a second server entity prior to responding to the client entity, where the second server entity is coupled to the first server entity and includes the mapping of the identification string and location strings for the particular units of data.
  • the second server entity responds to the client entity by providing the at least one location string associated with the particular stored unit of data to the client entity.
  • the network distributed tracking protocol of the invention is a networking protocol that efficiently manages mappings from one or more identifier strings to zero or more location strings.
  • the protocol permits client entities to add and remove identifier/location associations, and request the current set of locations for an identifier or identifiers from server entities that comply with the protocol.
  • the protocol is designed for use in the larger context of a distributed data collection. As such, it supports an architecture in which information about where data associated with particular application entities can be managed and obtained independently of the data itself.
  • the protocol and its associated servers thus maintain a mapping between entity identifiers and data locations.
  • the identifier/location mapping maintained by the servers is very dynamic. Regardless of the expected system context in a distributed data collection, the protocol can be used for any application in which one-to- one or one-to-many associations among strings are to be maintained and accessed on a network.
  • the protocol supports identifier and location strings of up to 2 32 -4 bytes in length, but in most applications it is expected that the strings are typically short. String length is not fixed by the protocol, except by the upperbound. Accordingly, string formats are controlled at a local level and not dictated by the protocol.
  • FIG. 1 is an example of multiple outstanding protocol requests.
  • FIG. 2 is a layout of one presently preferred string format.
  • FIG. 3 is a layout of one presently preferred NDTP_GET message.
  • FIG. 4 is a layout of one presently preferred NDTP_GET_RSP message.
  • FIG. 5 is a layout of one presently preferred NDTP_PUT message.
  • FIG. 6 is a layout of one presently preferred NDTP_PUT_RSP message.
  • FIG. 7 is a layout of one presently preferred NDTP_DEL message.
  • FIG. 8 is a layout of one presently preferred NDTP_DEL_RSP message.
  • FIG. 9 is a layout of one presently preferred NDTP_RDR_RSP message, where FIG. 9(a) shows a server table layout, and FIG. 9(b) shows a redirection function layout.
  • FIG. 10 is a system block diagram showing a multi-server implementation environment of the network distributed tracking wire transfer protocol of the invention.
  • FIG. 11 is a system diagram showing an NDTP server constellation configuration.
  • FIG. 12 is a system diagram showing a client-centric constellation approach.
  • FIG. 13 is a system diagram showing a server-centric constellation approach.
  • NDTP network distributed tracking protocol
  • An "identifier string” or an “identifier” is a unique string with which zero or more location strings are associated in an NDTP server.
  • a "data location” or a “location” is a string that is a member of a set of strings associated with an identifier string in an NDTP server.
  • An “NDTP client” or a “client” is a network-attached component that initiates update or lookup of identifier/location mappings from an NDTP server with NDTP request messages.
  • NDTP server or a “server” is a network- attached component that maintains a set of identifier/location mappings that are modified or returned in response to NDTP request messages from NDTP clients.
  • Network Byte Order is the ordering of bytes that compose an integer of larger than a single byte as defined in the Internet Protocol (IP) suite.
  • IP Internet Protocol
  • Network Byte Order specifies a big-endian, or most significant byte first, representation of multibyte integers. In this specification a byte is preferably composed of eight bits.
  • NDTP Network Distributed Tracking Protocol
  • NDTP Network Distributed Tracking Protocol
  • NDTP is a transactional protocol, which means that each operation within NDTP consists of a request message from an NDTP client to an NDTP server, followed by an appropriate response message from the NDTP server to the NDTP client.
  • NDTP defines an entity key (or "identifier") as a unique string used to refer to an entity about which a distributed query is performed.
  • the NDTP server treats the entity key as an unstructured stream of octets, which is assumed to be unique to a particular entity.
  • the precise structure of the NDTP entity key and the mechanism for ensuring its uniqueness are a function of the application in which the NDTP server is used.
  • the NDTP entity key might be a unique customer identifier, for example, a Social Security Number, in either printable or binary integer form, as is appropriate to the application.
  • NDTP also defines a data location specifier as a string used to specify a data respository in which data associated with a particular entity may be found.
  • NDTP server treats NDTP data location specifiers as unstructured streams of octets.
  • the structure of an NDTP data location specifier is a function of the application in which the NDTP server is used.
  • an NDTP data location specifier might be an Internet machine name, and a TCP/IP port number for a relational database server, or an HTTP Universal Resource Locator(URL), or some concatenation of multiple components.
  • the NDTP server efficiently maintains and dispenses one to zero or one to many relationships between entity keys and data location specifiers.
  • an entity key may be associated with any number of data location specifiers.
  • the NDTP server is updated to indicate an association between the entity key and the data repository's data location specifier.
  • the NDTP server supplies the set of data repositories in which data may be found for that entity key.
  • the protocol of the invention is designed to provide maximum transaction throughput from the NDTP server, associated clients, and associated data repositories when appropriate.
  • the design goal is realized through two design principles:
  • NDTP messages should preferably be as short as possible to maximize the rate of NDTP transactions for a given network communication bandwidth.
  • NDTP messages should preferably be structured for efficient processing on existing machine architectures. Design Optimizations.
  • Numerical fields of an NDTP message are preferably represented in binary integer format rather than ASCII or other printable format to minimize host processing overhead and network utilization. Numerical fields of NDTP messages are also aligned on 32-bit boundaries to minimize the cost of manipulation on current machine architectures. Manipulating unaligned multibyte integer quantities on modern machine architectures usually incurs an extra cost ranging from mild to severe compared to manipulating the same quantities in aligned form. In keeping with other network protocol standards including TCP/IP, multioctet integer quantities in NDTP are preferably encoded using the big endian integer interpretation convention, as set forth above.
  • NDTP is designed to support asynchronous operation, where many requests may be sent to an NDTP server before a response from any of them is received.
  • Each NDTP message is preceded by a fixed size, 12-octet header, using the preferred data structure: typedef struct ndtp- dr ⁇ uint8_T op; /* opcode */ uint8_t pad [3 ] ; uint32_t id; /* transaction identifier */ uint32_t size; /* total request size following the header */
  • NDTP_DEL delete request
  • NDTP_DEL_RSP delete response
  • NDTP RDR RSP provide redirection id:
  • Each "_RSP" message echoes the id field of the associated request. size:
  • Size in octets of the remainder of the NDTP message.
  • the size field should always be a multiple of 4 octets.
  • Variably sized portions of NDTP messages are preferably defined with a size field rather than some other delimiter mechanism to facilitate efficient reading of NDTP messages. Requests may be made to the network layer to read the entire variably sized portion of an NDTP message, rather than reading small chunks while scanning for a delimiter. Furthermore, client and server resource management can be more efficient since the size of NDTP messages is known before reading.
  • the variably sized portions of NDTP messages are composed of zero or more NDTP stings: typedef struct ndtp_str ⁇ uint32_t len; uint8_t data [ ] ; ⁇ ndtp_str_t;
  • arrays denoted in this document with "[ ]” imply a dimension which is only known dynamically and this indefinite array size specifier is not allowed in C struct definitions. Note also the following:
  • len the number of significant octets of data following the len field in the data area.
  • data len octets of data, followed by up to 3 octets of padding, to ensure that the total length of the NDTP string structure is a multiple of 4 octets.
  • variable sized portion NDTP messages are composed of zero or more NDTP stings and NDTP strings preferably occupy an even multiple of 4 octets, this ensures that the "size" field of NDTP message headers will preferably be a multiple of 4 octets.
  • NDTP preferably has a simple, stateless request/response structure.
  • Each request message 10 sent by a client 12 has a corresponding response message 14 returned by the server
  • NDTP is asynchronous in nature. Many requests 10 from a single client 12 may be outstanding simultaneously, and responses 14 may or may not be returned from the server 16 in the order in which the requests 10 were issued. Each NDTP request 10 contains an NDTP request identifier 18 that is returned in the NDTP response 14 for the associated request 10. An NDTP client 12 uses a unique NDTP request identifier 18 for each NDTP request 10 that is outstanding at the same time to an NDTP server 16 if it wishes to correlate responses with requests. There are four operations preferably supported by the protocol:
  • the response to adding a location association to an identifier 18 is a simple acknowledgement. If the location is already associated with the identifier 18, adding the association has no effect, but the request 10 is still acknowledged appropriately. In other words, the NDTP add operation is idempotent.
  • the response to deleting a location association from an identifier 18 is a simple acknowledgement. If the location is not currently associated with the identifier 18, deleting the association has no effect, but the request 10 is still acknowledged appropriately. In other words, the NDTP delete operation is idempotent.
  • the response 14 to getting all locations associated with an identifier 18 is a list of the locations presently associated with an identifier 18. If no locations are currently associated with an identifier 18, a list of length zero is returned.
  • NDTP messages 10, 14 preferably have a regular structure that consists of a message operation code, followed by a request identifier 18, followed by a string area length (in bytes) 20, followed by zero or more strings 22, as shown in FIG. 2.
  • NDTP message formats are preferably independent of the network transport layer used to carry them.
  • NDTP preferably defines mappings of these messages 10, 14 onto TCP and UDP transport layers (described in detail below), but other mappings could also be defined and it is likely that these NDTP message formats would not require change. For example, the notation
  • ROUND4(x) means x, rounded up to the next multiple of 4.
  • Multibyte integers in NDTP messages are represented in network byte order; using the big-endian convention. In other words, the most significant byte of a multibyte integer is sent first, followed by the remainder of the bytes, in decreasing significance order.
  • Strings in NDTP are represented as counted strings, with a 32-bit length field 20, followed by the string data 22, followed by up to 3 bytes of padding 24 to make the total length of the string representation equal to
  • the NDTP_GET message has a message operation code 30 of 0, and a single NDTP string 32 which is the identifier string for which to get associated location strings. This layout is shown diagrammatically in FIG. 3.
  • the NDTP_GET_RSP message has a message operation code 40 of 1 , and zero or more strings 42 that are the locations currently associated with the requested identifier. This layout is shown diagrammatically in FIG. 4. NDTP PUT Format
  • the NDTP_PUT message has a message operation code 50 of 2, and two NDTP strings 52, 54.
  • the first string 52 is the identifier for which to add a location association, and the second string 54 is the location to add. This layout is shown diagrammatically in FIG. 5.
  • the NDTP_PUT_RSP message has a message operation code 60 of 3, and zero NDTP strings. This layout is shown diagrammatically in FIG. 6.
  • the NDTP_DEL message has a message operation code 70 of 4, and two NDTP strings 72, 74.
  • the first string 72 is the identifier from which to delete a location association, and the second string 74 is the location to delete. This layout is shown diagrammatically in FIG. 7.
  • NDTP DEL RSP Format The NDTP_DEL_RSP message has a message operation code 80 of 5, and zero NDTP strings. This layout is shown diagrammatically in FIG. 8.
  • the NDTP_RDR_RSP message has a message operation code 90 of 6, and one or more NDTP strings 92, 94. Two layouts apply, which are shown diagrammatically in FIGS. 9(a) and 9(b).
  • the NDTP_GET message contains a single NDTP string which is the entity key for which associated data locations are requested. typedef struct ndtp_get ⁇ ndtp hdr t hdr; ndtp_str_t key; ⁇ ndtp_get_t;
  • the NDTP_GET_RSP message contains zero or more NDTP strings which are the data location specifiers associated with the NDTP entity key: typedef struct ndtp_get_rsp ⁇ ndtp_hdr_t hdr; uint32_t rsps; ndtp_str_t values []; ⁇ ndtp_get_rsp_t;
  • the NDTP_PUT messages contains two NDTP strings which are (1) the NDTP entity key and (2) the NDTP data location specifier which is to be associated with the NDTP entity key.
  • the NDTP_PUT_RSP message has no NDTP strings, and simply indicates that the requested entity key/data location specifier association was added: typedef struct ndtp__put_rsp ⁇ ndtp_hdr_t hdr; ⁇ ndtp_put_rsp_t;
  • the requested entity key/data location specifier association is added in addition to any other associations already maintained by the NDTP server. If the requested entity key/data location specifier association is already in effect, the NDTP_PUT still succeeds and results in an NDTP_PUT_RSP message.
  • the NDTP_DEL message contains two NDTP strings which are (1) the NDTP entity key and (2) the NDTP data location specifier which is to be unassociated with the NDTP entity key: typedef struct ndtp_del ⁇ ndtp_hdr_t hdr; ndtp_str_t key; ndtp_str_t data; ⁇ ndtp del t;
  • the NDTP_DEL_RSP message has no NDTP strings, and simply indicates that the requested entity key/data location specifier association was deleted. typedef struct ndtp_del_rsp ⁇ ndtp_hdr_t hdr;
  • the NDTP_DEL still succeeds and results in an NDTP_DEL_RSP message.
  • NDTP supports a distributed server implementation for which two principle redirection methods apply: (1) embedded redirection links, and (2) passed functions.
  • the passed functions method in turn has two variants: (a) a well-known function, and (b) a communicated function. (These methods and variants are described in further detail below.)
  • the NDTP server network front end preferably maximizes NDTP transaction throughput including concurrent NDTP requests from a single client as well NDTP requests from multiple concurrent clients.
  • NDTP defines a transaction oriented protocol, which can be carried over any of a variety of lower level network transport protocols.
  • TCP/IP TCP/IP provides a ubiquitously implemented transport which works effectively on both local area and wide area networks.
  • An NDTP client using TCP/IP preferably connects with the NDTP server at an established TCP port number, and then simply writes NDTP request messages through the TCP/IP connection to the server, which then writes NDTP response messages back to the client through the same TCP/IP connection in the reverse direction.
  • TCP/IP implementations perform buffering and aggregation of many small messages into larger datagrams, which are carried more efficiently through the network infrastructure.
  • Running NDTP on top of TCP/IP will take advantage of this behavior when the NDTP client is performing many NDTP requests. For example, a data repository which is undergoing rapid addition of data records associated with various entities will perform many rapid NDTP_PUT operations to the NDTP server that can all be carried on the same NDTP TCP/IP connection.
  • UDP/IP If an NDTP client only performs occasional, isolated NDTP operations, or there are a vast number of clients communicating with an NDTP server, TCP/IP will not offer the best possible performance because many traversals of the network are required to establish a TCP/IP connection, and yet more network traversals are required to transfer actual NDTP messages themselves. For such isolated NDTP transactions, depending upon the application and network infrastructure in use, it is beneficial to have the NDTP server employ UDP/IP, which is a widely available connectionless datagram protocol.
  • UDP/IP does not support reliable data transfer, or any congestion control mechanism.
  • NDTP clients using UDP/IP must implement reliability and congestion control maintaining transaction timeouts and performing exponential retry backoff timers, precisely analogous to the congestion control mechanism implemented by Ethernet, and other well known UDP protocols.
  • the NDTP protocol is stateless from the standpoint of the NDTP server, which means that there is no congestion control or reliability burden on the server; it is all implemented in a distributed manner by the NDTP UDP/IP clients.
  • the NDTP server network front end preferably services NDTP query requests in a FIFO style by reading the NDTP_GET message, performing the lookup for the entity key in the NDTP server string store, and writing the NDTP_GET_RSP message.
  • Each NDTP query is independent of any other NDTP transactions (other queries or updates), so it is possible to process multiple NPTP queries simultaneously on multiprocessor machines.
  • the NPTP server permits this by not performing multiprocessor locking in the NDTP query processing path.
  • the current prototype NDTP server preferably does not create multiple read service threads per NDTP connection, so multiprocessing will only occur while processing queries from different NDTP connections. Nonetheless, the NDTP server could be extended to support multiprocessing of NDTP queries from a single NDTP connection if this turned out to be advantageous.
  • processing NDTP updates requires the high latency operation of committing the change to nonvolatile storage.
  • the NDTP server network front end preferably supports multiple concurrent asynchronous update transactions. Also, each update is preferably performed atomically to avoid creating an inconsistent state in the string store.
  • the string store supports only a single mutator thread, which means that all NDTP updates are serialized through the string store mutator critical code sections.
  • the string store mutation mechanism is implemented as a split transaction.
  • a call is made to the string store mutation function, which returns immediately indicating either that the mutation is complete, or that the completion will be signaled asynchronously through a callback mechanism.
  • the mutator function might indicate an immediate completion on an NDTP_PUT operation if the entity key/data location specifier mapping was already present in the database.
  • the network front end will immediately write the update response message back to the client.
  • the network front end maintains a queue of NDTP updates for which it is awaiting completion.
  • the completion callback is called by the string store log file update mechanism, the network front end writes the NDTP update response messages for all completed updates back to the clients. If no new NDTP update requests are arriving from NDTP clients, and there are some incomplete updates in the update queue, the network front end preferably calls the string store log buffer flush function to precipitate the completion of the incomplete updates in update queue.
  • the NDTP server network front end may be conditionally compiled to use either of two standard synchronous I/O multiplexing mechanisms, select or poll, or to use threads to prevent blocking the server waiting for events on individual connections.
  • the select and poll interfaces are basically similar in their nature, but different in the details.
  • the multiplexing function is called to determine if any of the connections have input available, and if so, it is read into the connection's input buffer. Once a complete NDTP request is in the buffer, it is acted upon. Similarly, the network front end maintains an output buffer for each connection, and if there is still a portion of an NDTP response message to send, and the connection has some output buffer available, more of the NDTP response message is sent.
  • the threaded version of the NDTP server network front end preferably creates two threads for each NDTP connection, one for reading and one for writing. While individual threads may block as input data or output buffer is no longer available on a connection, the thread scheduling mechanism ensures that if any of the threads can run, they will.
  • the threaded version of the NPTP server is most likely to offer best performance on modern operating systems, since it will permit multiple processors of a system to be used, and the thread scheduling algorithms tend to be more efficient than the synchronous I/O multiplexing interfaces. Nonetheless, the synchronous I/O multiplexing versions of NPTP server will permit it to run on operating systems with poor or nonexistent thread support.
  • mapping operation in both a TCP and UPP environment appears below.
  • TCP Internet Protocol
  • IP Internet Protocol
  • TCP provides reliable, bi-directional stream data transfer.
  • TCP also implements adaptive congestion avoidance to ensure data transfer across a heterogeneous network with various link speeds and traffic levels.
  • NPTP is preferably carried on TCP in the natural way.
  • An NPTP/TCP client opens a connection with a server on a well-known port. (The well- known TCP (and UPP) port numbers can be selected arbitrarily by the initial NPTP implementer. Port numbers that do not conflict with existing protocols should preferably be chosen.)
  • the client sends NPTP requests 10 to the server 16 on the TCP connection, and receives responses 14 back on the same connection.
  • protocol errors are detected on an NPTP/TCP connection, the NPTP/TCP connection should be closed immediately. If further NPTP/TCP communication is required after an error has occurred, a new NPTP/TCP connection should be opened.
  • detectable protocol errors include:
  • NPTP/TCP servers 16 and clients 12 need not maintain any additional form of operation timeout. The only transport errors that can occur will result in gross connection level errors.
  • a client 12 should assume that any NPTP requests 10 for which it has not received responses 14 have not been completed. Incomplete operations may be retried. However, whether unacknowledged NPTP requests 10 have actually been completed is implementation dependent. Any partially received NPTP messages should also be ignored.
  • Unreliable Patagram Protocol is a best-effort datagram protocol that, like TCP, is also part of the universally implemented subset of the IP suite.
  • UPP provides connectionless, unacknowledged datagram transmission.
  • the minimal protocol overhead associated with UPP can deliver extremely high performance if used properly.
  • NPTP/UPP clients 12 send UPP datagrams with NPTP request messages 10 to a well-known UPP port (see above).
  • NPTP/UPP servers 16 return NPTP response messages 14 to the client 12 selected local UPP port indicated in the NPTP/UPP datagram containing the requests 10.
  • NPTP/UPP does not require any form of connection or other association to be established in advance. An NPTP interchange begins simply with the client request message 10.
  • the mapping of NPTP on to UPP permits multiple NPTP messages to be sent in a single UPP datagram.
  • UPP datagrams encode the length of their payload, so when a UPP datagram is received, the exact payload length is available.
  • the recipient of an NPTP/UPP datagram will read NPTP messages from the beginning of the UPP datagram payload until the payload is exhausted.
  • a sender of an NPTP/UPP datagram is free to pack as many NPTP messages as will fit in a UPP datagram.
  • IP provides mechanisms for discovering this maximum transfer size, called the Path Maximum Transfer Unit (Path MTU), but a discussion of these mechanisms is beyond the scope of this specification.
  • An implementation of NPTP/UPP should preferably respect these datagram size limitations.
  • an NPTP/UPP client 12 implementation should implement a timeout mechanism to await the response for each outstanding NPTP request 10.
  • this response timer is implementation dependent, and may be set adaptively as a client 12 receives responses from a server 16, but a reasonable default maximum value is preferably 60 seconds. If a response 14 is not received within the response timeout, the client 12 may retransmit the request 10. NPTP/UPP servers 16 need not maintain any timeout mechanisms.
  • the client 12 retry mechanism may place some requirements on a client's 12 use of the NPTP request identifier 18 field. If the response timer is shorter than the maximum lifetime of a datagram in the network, it is possible that a delayed response will arrive after the response timer for the associated request has expired. An NPTP/UPP client 12 implementation should ensure that this delayed response is not mistaken for a response to a different active NPTP request 10. Pistinguishing current responses from delayed ones is called antialiasing.
  • One presently preferred way to perform antialiasing in NPTP/UPP is to ensure that NPTP request identifier 18 values are not reused more frequently than the maximum datagram lifetime.
  • NPTP/UDP client 12 implementations that use the NPTP request identifier 18 for antialiasing should ignore (i.e., skip) NPTP messages within a NPTP/UPP datagram with invalid NPTP request identifier 18 values.
  • NPTP/UPP implementations detecting any other protocol error should also preferably discard the remainder of the current NPTP/UPP datagram without processing any further NPTP requests from that datagram.
  • Some examples of such detectable errors include: • Illegal NPTP message operation code;
  • NDTP_GET NDTP_GET_RSP, NDTP_PUT Or NDTP_DEL;
  • NPTP/UPP Because NPTP/UPP messages are limited to the length of a single UPP datagram payload, NPTP/UPP cannot be used to transfer long NPTP messages. For example, it would be very difficult to send an NDTP_GET message with NPTP/UPP for a 64K byte identifier string. This case is avoidable by a client 12 realizing that an NPTP message is too long to send as a UPP datagram and using NPTP/TCP instead. However, a greater limitation is that NPTP currently provides no mechanism for an NPTP server
  • the NPTP server 16 should not send a response 14, and it may or may not chose to complete the request 10.
  • the recovery mechanism in this case preferably is, after several unsuccessful attempts to use NPTP/UPP, a client 12 may try again with NPTP/TCP.
  • UPP does not provide any form of congestion avoidance it is possible that the simple retry strategy specified for NPTP/UPP can create network congestion.
  • Network congestion can cause a severe degradation in the successful delivery of all network traffic (not just NPTP traffic, nor just the traffic from the particular client/server 12, 16 pair) through a congested network link.
  • Congestion will occur when an NPTP/UPP implementation is sending datagrams faster than can be accommodated through a network link. Sending a large number of NPTP/UPP datagrams all at once is the most likely way to trigger such congestion. Sending a single NPTP/UPP datagram, assuming it is smaller than the Path MTU, and then waiting for a response 14 is unlikely to create congestion.
  • NPTP/UPP should be confined to contexts where clients 12 send few outstanding requests at a time, or where network congestion is avoided through network engineering techniques.
  • network congestion is a highly dynamic property that is a function of network traffic from all sources through a network link and will vary over time over any given network path.
  • An NPTP/UPP client 12 implementation can recover from network congestion by switching to NPTP/TCP after several failed retries using NPTP/UPP. Failure due to network congestion may be indistinguishable from failure due to UPP packet size limitations, but since the recovery strategy is the same in both cases, there is no need to distinguish these cases.
  • NPTP/UPP Given the stateless, transactional nature of NPTP, NPTP/UPP generally performs much better than NPTP/TCP. This performance improvement is measurable both in terms of the maximum sustainable transaction rate of an NPTP server 16, and the latency of a single response to an NPTP client 12.
  • PNS Pomain Name Service
  • NPTP fits naturally in the UPP model. It is a working assumption of NPTP (and PNS) that for every NPTP transfer, there will be an associated transfer of real data that is an order of magnitude or more greater in size than the NPTP protocol traffic. This property will naturally limit the amount of NPTP traffic on a network.
  • NPTP/UPP congestion avoidance mechanism for NPTP/UPP.
  • security implies an existing, durable association between NPTP clients 12 and NPTP servers 16. This association is much like (and in the case of SSL, it is) a network connection. Therefore, depending upon what security technology is applied, developing a congestion avoidance mechanism for NPTP/UPP may be an irrelevant exercise.
  • NPTP provides two mechanisms for server redirection.
  • the redirection mechanisms allow cluster and hierarchical topologies, and mixtures of such topologies (described in detail below).
  • the first redirection mechanism supported by NPTP, embedded redirection links uses an application specific convention to return redirection pointers as NPTP data location strings.
  • location strings are W3C URLs
  • a URL with the schema ndtp: could be a server indirection pointer.
  • An NDTP_GET_RSP message may contain any mixture of real data location strings and NPTP server redirection pointers. In this case, the client must issue the same NDPT_GET query message to other NPTP servers indicated by the redirection pointers.
  • the total set of data location strings associated with the supplied identifier string is the collection of all the data location strings returned from all the NDTP servers queried.
  • the embedded redirection link technique does not require any specific NDTP protocol support. Therefore, it could be used within the
  • the second redirection mechanism which is specified as a future extension of NDTP, is having the server return an NDTP_RDR_RSP message in response to an NDTP request for which the NDTP server has no ownership of the supplied identifier string.
  • the NDTP_RDR_RSP mechanism applies to all NDTP requests, not just NDTP_GET.
  • the second redirection mechanism has two variants.
  • the first variant of the NDTP_RDR_RSP function mechanism specifies a well-known function that all NDTP server and client implementations know when they are programmed, and the NDTP_RDR_RSP message carries a table of NDTP server URLs.
  • the format of the NDTP_RDR_RSP message with an NDTP server URL table is shown in FIG. 9(a).
  • the appropriate NDTP server is selected from the table in the NDTP_RDR_RSP message by applying a well-known function to the identifier string and using the function result as an index into the NDTP server table.
  • the well-known function preferably applied is the hashpjw function presented by Aho, Sethi and Ullman in their text Compilers, Principles, Techniques and
  • the size parameter is the number of elements in the NDTP server URL table returned in the NDTP_RDR_RSP message.
  • the size parameter must be a prime number, therefore the NDTP server URL table must also have a prime number of elements.
  • the same NDTP server may appear multiple times in the NDTP server URL table. For example, if the server URL table has 2039 elements, by putting one NDTP server URL in the first 1019 table elements, and a second NDTP server URL in the second 1020 table elements, the responsibility for the index string space will be split roughly in half.
  • the second variant of the NDTP_RDR_RSP function mechanism specifies that a general function description will be sent to the NDTP client in the NDTP_RDR_RSP message.
  • the NDTP client will apply this function to the identifier string and the output of the function will be the NDTP server URL to which to send NDTP requests for the particular identifier string.
  • the advantage of this technique over the well-know function approach is that it allows application-specific partitions of the identifier string space. This can permit useful administrative control. For example, if General Electric manages all identifiers beginning with the prefix "GE", a general function can be used to make this selection appropriately.
  • the disadvantage of using a general function is it may be less efficient to compute than a well-known function.
  • NDTP is expected to be applied in environments that make extensive use of the Java programming platform. Therefore the
  • NDTP_RDR_RSP mechanism preferably uses a feature of the Java programming language called "serialized representation" to communicate generalized functions in the NDTP_RDR_RSP message.
  • serialized representation A serialized form of a Java object is a stream of bytes that represents the precise state of the object, including its executable methods. For example, the Java Remote Method
  • RMI Invocation
  • NDTP_RDR__RSP contains the serialized form of an object implementing this Java interface:
  • the format of the NDTP_RDR_RSP message with a Java Serialized form of the NDTP redirection function is specifically identified in FIG. 9(b).
  • the NDTP server redirection mechanism also permits construction of NDTP server clusters (described below). It is expected that the identifier string hash function will be defined at the time NDTP is implemented, but the actual list of NDTP servers 90 will change from application to application and within a single application throughout the lifetime of the system. Therefore, it is necessary for clients to be able to discover updated NDTP server lists, and any other relevant dynamic parameters of the server selection function as these inputs change.
  • An NDTP server hierarchy 100 permits identifier/location association data to be owned and physically controlled by many different entities.
  • An NDTP server cluster should be managed by a single administrative entity 102, and the distribution of data can be for performance and scaling purposes.
  • a server hierarchy would provide some fault isolation so portions of the identifier/location association data can be accessed and updated in the presence of failures of some NDTP servers 104.
  • an NDTP server hierarchy can localize NDTP update operations (NDTP_PUT and NDTP_DEL), which can improve performance and reduce network load.
  • a hierarchical NDTP server topology also allows organizations to maintain their own local NDTP server 104 or NDTP server cluster 102 that manages associations to data locations that are within the organizations' control.
  • Upper tier NDTP servers 108 would be used to link the various leaf
  • NDTP servers 104 NDTP servers 104.
  • FIG. 11 illustrates an NDTP server constellation 110 as it relates to a client 112 and a data repository 114.
  • the client 112 and data repository 114 of FIG. 11 were merged into the single client entity 106 for ease of discussion. Their distinction can now be separated and identified in order to illustrate the storage and retrieval of data in a distributed data collection.
  • a client 112 consults the server constellation 110, which may be construed in either of two forms (see FIGS. 12 and 13), and which returns location strings in response to a client 112 request. Once the client 112 has the location string for a particular unit of data, the client 112 contacts and retrieves information directly from the data repository 114. In one embodiment, if the client 112 contains a data repository 114, internal application logic would facilitate this interaction.
  • data collection is being employed rather than the term “database” because database frequently invokes images of Relational Database Systems (which is only one application of the protocol); an NDTP data collection could just as easily be routing tables as it could be files or records in a RDBS database.
  • NDTP server constellations 110 preferably have two basic organizational paradigms: Client-Centric and Server-Centric.
  • NDTP supports both by design, and both approaches apply to all aspects of managing the relationships between identifiers and locations, such as data retrieval, index manipulation, and server redirection. Each will be discussed separately below.
  • NDTP_RDR_RSP redirection response message
  • This design constructs operating patterns for (1) redirection, (2) index operations, and (3) hierarchical or cluster topologies.
  • the important point is that the Network Distributed Tracking Protocol is designed to support highly configurable methods for processing index-related operations.
  • NDTP supports two specific redirection mechanisms, which are not mutually exclusive and may be combined in any way within a single NDTP server constellation 110. This formation may increase performance when many clients (not shown) participate, since client processing is emphasized rather than server processing.
  • the first NDTP redirection mechanism uses a distinctively encoded location string for each NDTP server 120a,b that contains additional location strings associated with the identifier string supplied in the NDTP request 122a,b. This is an embedded redirection link. For example, if location strings are some form of HTTP URL, a URL with the schema specifier ndtp: would indicate a redirection. Using this scheme, the location strings associated with an identifier string may be spread among multiple NDTP servers 120a, b. In addition to redirection, in FIG. 12, all index manipulation operations continue to apply, but they are directed at the correct NDTP server 110b for which they apply: NDTP_GET, NDTP_PUT,
  • the second NDTP redirection mechanism uses a NDTP_RDR_RSP message to indicate that the server 120a to which the NDTP request 122a was directed does not contain any of the location strings associated with the identifier string supplied in the NDTP request 122a.
  • the NDTP_RDR_RSP message contains all the information required for the originator of the NDTP request 122a to reissue the original NDTP request 122b to a different NDTP server 120b that does have location strings associated with the identifier string supplied in the NDTP request 122b.
  • This information may be an array of NDTP server hosts from which one is selected by applying a well-known function to the identifier string supplied in the NDTP request 122b, or the communicated function to apply as well as a list or other description of the NDTP server hosts from which to choose, as described above.
  • Figure 12 illustrates a cluster topology for client interaction with NDTP servers 120.
  • a single client queries a first server 120a (ServerO), learns of a new index location (Serverl), and then contacts that server 120b (Serverl) for the operations it wishes to execute on the index that the client identifies.
  • the basic idea is that a client asks a server 120a to process an index operation. If the contacted server 120a does not have all the information, as for example in a redirect, then it passes the request to another server 120b. If the second server 120b is appropriate it responds appropriately, or it passes the request on to another server (not shown), and so on.
  • Figure 12 could also illustrate a hierarchical topology if a client (not shown) contacted another client in a handoff as shown in FIG. 10, where a client 106 "asks up" to another client 106, and so on.
  • the server constellation 110 could also be using a hierarchical organization or a cluster organization for managing indices.
  • the important point of this topology is pushing processing emphasis toward clients (not shown) rather than toward servers 120a,b.
  • Such protocol design has scale implications as the number of participating machines/mechanisms increases, since it distributes aggregate processing.
  • FIG. 13 shows the server constellation 110 characterizing "server-centric" functionality.
  • an NDTP server 130a receives a request 132a from a client (not shown).
  • the server 130a passes the request to a second server 130b (Serverl), which is an appropriate server for the process, and the second server 130b returns a response 134a to the first server 130a (ServerO). If the second server 130a (Serverl) was not appropriate, it could pass the request to another server (not shown), and so on.
  • Each NDTP server 130a,b will combine the results of NDTP requests 132a,b it has performed of other NDTP servers 130a,b with whatever responses 134a,b it generates locally for the original NDTP request 132a, and the combined response 134b will be the appropriate response for the original NDTP request 132a.
  • This design constructs operating patterns for (1) index operations and
  • NDTP server 130a,b for which they apply: NDTP_GET, NDTP_PUT, NDTP_DEL.
  • FIG. 13 illustrates an hierarchical topology for client interaction with NDTP servers 130.
  • a single client queries a first server 130a (ServerO), which is not appropriate, and so the first server 130a (not the client) itself contacts an appropriate server 130b (Serverl) for operations it "passes through” to execute on the index that the client has identified.
  • FIG. 13 could illustrate a cluster topology if a server 130a contacted another server 130b in a what is known as a "peer" handoff.
  • the important point of this topology is that it pushes processing emphasis toward servers 130a,b rather than toward clients. Since index processing services can be centralized, administration of the indices can be administered more conveniently in certain cases.
  • NDTP server constellation 110 is a single server 130, and the protocol is designed to permit massive scale with a single or simple server constellation. Highly configurable installations are possible using "client- centric” or “server-centric” techniques. NDTP server constellations 110 composed of more than one NDTP server may use any combination of the two approaches for performance optimization and data ownership properties. Client-centric and server-centric approaches can be used to build NDTP server clusters, NDTP server trees, NDTP server trees of NDTP server clusters, or any other useful configuration. NDTP design thus explicitly addresses the emerging "peer-to-peer” topologies called “pure” and "hybrid”.
  • the "pure” peer-to-peer approach emphasizes symmetric communication among peers, and is achievable through the “server-centric” approach.
  • the “hybrid” peer-to-peer approach emphasizes asymmetric communication among non-peer participants, and is achievable through the “client-centric” approach.
  • NDTP permits any additional mixtures between client-centric and server-centric approaches to provide superior configurability and performance tuning.
  • NDTP preferably has no provisions for security. Three key features of security should therefore be provided:
  • NPTP/TCP will be extended using SSL/X.509 to support these security features in a straightforward, 'industry standard' way.
  • IPSec supports securing all IP traffic, not just TCP between two endpoints. IPSec is a somewhat more heavyweight technology than SSL, and the rate of adoption in industry is somewhat slow. Nonetheless, it can provide the relevant capabilities to NPTP/UPP.
  • TCP has provided decades of solid service, and is so widely implemented that the mainstream computer industry could not imagine using another protocol to replace it.
  • TCP lacks several features that may be necessary to enable the next step in network applications.
  • the TCP design assumed pure software implementations by relatively powerful host computer computers.
  • developments in network technology have increased the packet rate that a TCP implementation must handle to deliver full network speed beyond the capabilities of even increasingly powerful host computers.
  • TCP's design makes this very difficult. It is unclear whether it will become possible to implement the relevant portions of TCP in hardware in a timely fashion.
  • NPTP clients could likely still use a cheaper software implementation of the new transport because of individual clients' modest performance demands.
  • the Network Pistributed Tracking Protocol is a networking protocol that runs on top of any stream (e.g. TCP) or datagram (e.g. UPP) network transport layer.
  • the goal of NPTP is to support a network service that efficiently manages mappings from each individual key string, an identifier, to an arbitrary set of strings, locations.
  • NPTP permits protocol participating clients to add and remove identifier/location associations, and request the current set of locations for an identifier from protocol servers.
  • NPTP is designed for use in the larger context of a distributed data collection. As such, it supports an architecture, in which information about where data associated with particular application entities, can be managed and obtained independently of the data itself. One way to understand this is as a highly dynamic PNS for data.
  • NPTP maintains a mapping between names and machines.
  • NPTP and its associated servers maintain a mapping between entity identifiers and data locations.
  • the identifier/location mapping maintained by NPTP servers is much more dynamic (more frequent updates), than the domain name/IP address mapping maintained by PNS.
  • NPTP is designed to support very fast, very diverse, and very large scale mapping manipulations.
  • NPTP can be used for any application in which one-to-zero or one-to-many associations among strings are to be maintained and accessed on a network.
  • identifier is likely to make sense in most cases, but the term location may not.
  • NPTP supports identifier and location strings of up to 2 32 -4 bytes in length, it is a general assumption that the strings are typically short.
  • the invention provides for the management and manipulation of indices and their associated relationships. Even more importantly, it is the manipulation of dynamic and spontaneous relationships between indices and locations, not the indices and locations, that is the core significance.
  • the Network Pistributed Tracking Protocol was written to manipulate these relationships, of which indices (identifiers) and locations are components of the aggregate solution.
  • c NDTP server test client TCP-specific code ndtpc_udp .c: NDTP server test client UDP-specific code ndptd.c: NDTP server top level ndptd.h: NDTP server top level definitions ndtpd_sync .c : NDTP server synchronous I/O multiplexing version nd pd_sync .h: NDTP server synch I/O multiplexing version definitions ndtpd_thr.c : NDTP server threaded I/O version ndtpd_thr.h: NDTP server threaded I/O version definitions ndtpd_udp .
  • c NDTP server UDP-specific code ndtpd_udp .h: NDTP server UDP-specific code definitions ox_mac . : OverX machine specific abstraction definitions ox_thread.h: OverX thread abstraction definitions ss_test .c: String store test driver string_store.c: String store implementation string_s ore . h : String store interface definitions timestamp.h: Performance testing time stamp definitions
  • An ndtp_str_t is variable length, but always padded to a multiple
  • ndtp_get_rsp has enough ndtp_str_ts at the end to fill the payload */ typedef struct ndtp_get_rsp ⁇ ndtp_hdr_t hdr; ndtp_str_t value; /* actually n of these */
  • printf (tendif printf (" -P test put operation ⁇ n” ) ; printf (" -P: server port ⁇ n”); printf ( ' -r: use random keys and data ⁇ n” ) ; printf ( ' -s n[u] : string (key and return data) size ⁇ n”); printf ( ' u: k: 1024 bytes, m: 1024*1024 bytes ⁇ n” ) ; printf ( g: 1024*1024*1024 bytes (default is lm) ⁇ n”); printf ( -c, -d, -g, and -p may be used in any combination.
  • ⁇ a * (1024 * 1024) ; break; default: usage ( ) ,- ⁇ return a; ⁇ static void init_generators (void)
  • ⁇ sock socket ( PF_INET, SOCK_STREAM, 0 ) ; if (sock ⁇ 0 ) ⁇ perror ( " socket ailed” ) ,- exit ( 17 ) ; )
  • test_upd (iterations, outstanding, 1) ; ⁇ void test__get (int iterations, int outstanding, int testCheck)
  • #include ⁇ sys/types .h> ((include ⁇ sys/uio.h> #include ⁇ errno.h> ((include ⁇ sys/socket.h> ((include ⁇ netdb.h> ((include ⁇ unistd.h> ((include ⁇ string.h> ((include ⁇ assert.h> ((include ⁇ netinet/in.h> /* struct sockaddr_in */ ((include ⁇ stdio.h> ((include ⁇ sys/time.h> ((include ⁇ stdlib.h> ((include ⁇ limits.h>
  • buf f_udp init_udp (ntohs (addr->sin_port ) , 0 , 64 * 1024 ) ; bcopy ( ( caddr_t ) addr, ( caddr_t ) & server Addr , sizeof ( * addr) ) ; ) void test_put ( int iterations , int outstanding)
  • test_upd ( iterations , outstanding, 1 ) ;
  • PRINTD (DEBUG_TOP
  • static int upds_live; static int upds_ready; static int upd_head; static int upd_tail; static upd_state_t *upds; static int do_reset 0; static void serve (ss_desc_t *ss) ; static void proc_req(ss_desc_t *ss) ; static void get (ndtp_get_t *req, ss_desc_t *ss) ; static void upd(ndtp_put_t *req, ss_desc_t *ss) ,- static void upd_rsp(upd_state_t *upd) ; static void upd_done (void *arg, ss_i_t completions) ,- static void send_upd_rsps (void) ; void ndtpd_serve (ss_desc_t *ss, int port, int sock
  • PRINTD (DEBUG_TOP, ("waiting for updates: %d ⁇ n", upds_live) ) ; ss_wait_update (ss) ,- ⁇ else ⁇
  • PRINTD (DEBUG_TOP, ("snoozing for input ⁇ n")); udp_tx_flush (buff_udp) ; udp_rx_avai1 (buff_udp, 1) ; ⁇ ⁇ ⁇ void proc_req (ss_desc_t *ss)
  • ndtp_hdr_t *hdr &req->hdr
  • ndtp_str_t *key &req->key
  • ssize — be; ssize_t bcO; int assocs; ss_i_t totalLen; ndtp_get_rsp_t *r; ndtp_str_t *s; ndtp_str_t *s0 ; mt i; key->len ntohl (key->len) ,- if (hdr->size ⁇ key->len) C fprint (stderr, "get payload (%u) too short for key (%u) ⁇ n", hdr->size, key->len) ; return; ⁇ if (udp_tx_left(buff_udp) ⁇ sizeof (ndtp_hdr_t) + ND
  • ⁇ a * (1024 * 1024) ,- break; default: usage ( ) ; ⁇ return a;
  • uint32_t *p (uint32_t *) hdr; printf ( " 0x%08x 0x%08x 0x%08x ⁇ n " , p [ 0 ] , p [ l ] , p [ 2 ] )
  • static dq_t active_cons static dq_t active_cons ; static dq_t upds_waiting; static int listen_sock; static int sock_buf_size; static int tcp_no_delay; static int cons_size; static con_t *cons;
  • static void do_listen(int port) static void serve (ss_desc_t *ss) ; static void do_accept (void) ; static void do_read (con_t *con) ; static void proc_req(con_t *con) ; static void get(con_t *con, ss_desc_t *ss) ; static void upd(con_t *con, ss_desc_t *ss) ; static void do_write(con_t *con) ,- static void add_upd_rsp (con_t *con, uint32_t id, uint8_t rspOp) ; static void upd_done (void *arg, ss_i_t completions); static void close_con(con_t *con) ; static void find_max_sock(dq_t *con, int *maxFd) ; void ndt
  • static int async_upds 0; static ss_desc_t *string_store; static int listen_sock; static THR_T update_thread; static int updated; static dq_t cons_free; static int waiting_cons; static MUT_T cons_lock; static COND_T cons_avail; static dq_t upds_free; static int waiting_upds; / of threads waiting for an UPD block * /
  • Static MUT_T upds_lock static COND_T upds_avail; static int upds_live; static dq_t upds_pending; static int waiting_mutate; static MUT__T mutate_lock; static COND_T mutate_go; static int empty_req; static MUT_T empty_lock; static COND_T empty_go; static THR_T empty_thread;
  • static void *emptier (void *ss) ; static void do_listen(int port) ; static void serve (void) ; static void do_accept (void) ; static void *reader(void *arg) ; static int recv_bytes (con_t *con, uint8_t *buf, size_t bufSize); static void close_con(con_t *con) ; static int get(con_t *con, ndtp_hdr_t *hdr, uint8_t *payload, ss_desc_t *ss) ; static int upd(con_t *con, ndtp_hdr_t *hdr, uint8_t *payload, ss_desc_t *ss) ; static void upd_done (void *arg, ss_i_t completions); static void *writer(void *arg) ,- static void *update
  • CON_FLAG_OPEN; if ( !
  • upd->con con
  • upd->rsp.op del ?
  • NDTP_DEL_RSP NDTP_PUT_RSP
  • upd->rsp.id hdr->id
  • upd->rsp.size 0; con->updsPending++ ; upds_live++;
  • upds_live--; con->updsPending--- ; MUTATE_DONE; be write (con->sock, &upd->rsp, sizeof (upd->rsp) ) ; FREE_UPD(upd) ; if (be ⁇ sizeof (upd->rsp) ) ⁇ if (be ⁇ 0) ⁇ fprintf (stderr, "error sending update rsp: %s ⁇ n” , strerror (errno) ) ,- ⁇ else ⁇ fprintf (stderr, "only sent %lu bytes of %lu byte update rsp ⁇ n",
  • MUT_LOCK (con->writerLock) ; INSQT (&con->updsDone, upd) ; MUT_UNLOCK (con->writerLock) ; ⁇ else ⁇ / *
  • This program source is the property of OverX, Inc. and contains information which is confidential and proprietary to OverX, Inc.. No part of this source may be copied, reproduced, disclosed to third parties, or transmitted in any form or by any means, electronic or mechanical for any purpose without the express written consent of OverX, Inc..
  • This program source ' is the property of OverX, Inc. and contains

Landscapes

  • Engineering & Computer Science (AREA)
  • Databases & Information Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Data Mining & Analysis (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computer And Data Communications (AREA)
  • Multi Processors (AREA)

Abstract

La présente invention concerne un protocole de transfert par câble de localisations réparties par réseau destiné à stocker et à localiser des données dans une collecte de données réparties. Ce protocole comprend une chaîne de localisation destinée à spécifier la localisation du réseau des données associées avec une entité de cette collecte de données réparties, et une chaîne d'identification destinée à spécifier l'identité d'une entité de cette collecte de données répartie. Selon ce protocole, la longueur de la chaîne de localisation et la longueur de la chaîne d'identification sont variables, et une association entre une chaîne d'identification et une chaîne de localisation peut être modifiée de façon spontanée et dynamique. Ce protocole de transfert par câble de localisations réparties par réseau est indépendant de l'application, de l'organisation et de la géographie. Cette invention concerne aussi un procédé d'utilisation de ce protocole dans un environnement de collecte de données réparties et un système de mise en oeuvre de ce protocole.
EP01966551A 2000-09-13 2001-09-04 Protocole de transfert par cable de localisations reparties par reseau Withdrawn EP1358576A2 (fr)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
US09/661,222 US7103640B1 (en) 1999-09-14 2000-09-13 Network distributed tracking wire transfer protocol
US661222 2000-09-13
PCT/US2001/027383 WO2002023400A2 (fr) 2000-09-13 2001-09-04 Protocole de transfert par cable de localisations reparties par reseau

Publications (1)

Publication Number Publication Date
EP1358576A2 true EP1358576A2 (fr) 2003-11-05

Family

ID=24652674

Family Applications (1)

Application Number Title Priority Date Filing Date
EP01966551A Withdrawn EP1358576A2 (fr) 2000-09-13 2001-09-04 Protocole de transfert par cable de localisations reparties par reseau

Country Status (3)

Country Link
EP (1) EP1358576A2 (fr)
AU (1) AU2001287055A1 (fr)
WO (1) WO2002023400A2 (fr)

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
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
US5978773A (en) * 1995-06-20 1999-11-02 Neomedia Technologies, Inc. System and method for using an ordinary article of commerce to access a remote computer
US5913210A (en) * 1998-03-27 1999-06-15 Call; Charles G. Methods and apparatus for disseminating product information via the internet

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See references of WO0223400A2 *

Also Published As

Publication number Publication date
AU2001287055A1 (en) 2002-03-26
WO2002023400A2 (fr) 2002-03-21
WO2002023400A3 (fr) 2003-08-07

Similar Documents

Publication Publication Date Title
US7814170B2 (en) Network distributed tracking wire transfer protocol
US5946467A (en) Application-level, persistent packeting apparatus and method
US7672275B2 (en) Caching with selective multicasting in a publish-subscribe network
US9547726B2 (en) Virtual file-sharing network
Currid TCP offload to the rescue: Getting a toehold on TCP offload engines—and why we need them
US20050086384A1 (en) System and method for replicating, integrating and synchronizing distributed information
US20020016867A1 (en) Cluster event service method and system
Allcock et al. The globus extensible input/output system (xio): A protocol independent io system for the grid
US8352619B2 (en) Method and system for data processing
US10536560B2 (en) System and method for implementing augmented object members for remote procedure call
Thompson et al. Ndn-cnl: A hierarchical namespace api for named data networking
WO2003060712A2 (fr) Procede et systeme permettant d'acceder a des ressources partagees au moyen de bases d'informations de gestion configurables
GB2412771A (en) System for managing cache updates
Alwagait et al. DeW: a dependable web services framework
JP3628514B2 (ja) 計算機間データ送受信方法
EP1358576A2 (fr) Protocole de transfert par cable de localisations reparties par reseau
US20030149797A1 (en) Fast socket technology implementation using doors and memory maps
Seifert et al. SCI SOCKET-A fast socket implementation over SCI
Martignetti Shared memory crash cast: a low level implementation of Paxos supporting crash failures in shared memory with RDMA
Anderson et al. The DASH network communication architecture
Friday et al. Experiences of using generative communications to support adaptive mobile applications
Eisenhauer et al. The dataexchange library
Wang Design and Implementation of TCPHA
Balay A lightweight middleware architecture and evaluation of middleware performance
Panda et al. Commodity High Performance Interconnects

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: 20030414

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

17Q First examination report despatched

Effective date: 20040212

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

Free format text: STATUS: THE APPLICATION IS DEEMED TO BE WITHDRAWN

18D Application deemed to be withdrawn

Effective date: 20040623