EP0859496B1 - Procédé et système pour une structure de communication hybride entre couches homologues - Google Patents

Procédé et système pour une structure de communication hybride entre couches homologues Download PDF

Info

Publication number
EP0859496B1
EP0859496B1 EP97308906A EP97308906A EP0859496B1 EP 0859496 B1 EP0859496 B1 EP 0859496B1 EP 97308906 A EP97308906 A EP 97308906A EP 97308906 A EP97308906 A EP 97308906A EP 0859496 B1 EP0859496 B1 EP 0859496B1
Authority
EP
European Patent Office
Prior art keywords
addresses
server
peer
destination addresses
destination
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.)
Expired - Lifetime
Application number
EP97308906A
Other languages
German (de)
English (en)
Other versions
EP0859496A3 (fr
EP0859496A2 (fr
Inventor
Binh Q. Nguyen
Richard J. Redpath
Sandeep Kishan Singhal
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.)
International Business Machines Corp
Original Assignee
International Business Machines Corp
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 International Business Machines Corp filed Critical International Business Machines Corp
Publication of EP0859496A2 publication Critical patent/EP0859496A2/fr
Publication of EP0859496A3 publication Critical patent/EP0859496A3/fr
Application granted granted Critical
Publication of EP0859496B1 publication Critical patent/EP0859496B1/fr
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F15/00—Digital computers in general; Data processing equipment in general
    • G06F15/16—Combinations of two or more digital computers each having at least an arithmetic unit, a program unit and a register, e.g. for a simultaneous processing of several programs
    • G06F15/163—Interprocessor communication
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/02—Details
    • H04L12/16—Arrangements for providing special services to substations
    • H04L12/18—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast
    • H04L12/1854—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast with non-centralised forwarding system, e.g. chaincast
    • 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/1004—Server selection for load balancing
    • H04L67/1023—Server selection for load balancing based on a hash applied to IP addresses or costs
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/40—Network security protocols
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/40—Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
    • H04N21/47—End-user applications
    • H04N21/478—Supplemental services, e.g. displaying phone caller identification, shopping application
    • H04N21/4788—Supplemental services, e.g. displaying phone caller identification, shopping application communicating with other users, e.g. chatting
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/60—Network structure or processes for video distribution between server and client or between remote clients; Control signalling between clients, server and network components; Transmission of management data between server and client, e.g. sending from server to client commands for recording incoming content stream; Communication details between server and client 
    • H04N21/63—Control signaling related to video distribution between client, server and network components; Network processes for video distribution between server and clients or between remote clients, e.g. transmitting basic layer and enhancement layers over different transmission paths, setting up a peer-to-peer communication via Internet between remote STB's; Communication protocols; Addressing
    • H04N21/632—Control signaling related to video distribution between client, server and network components; Network processes for video distribution between server and clients or between remote clients, e.g. transmitting basic layer and enhancement layers over different transmission paths, setting up a peer-to-peer communication via Internet between remote STB's; Communication protocols; Addressing using a connection between clients on a wide area network, e.g. setting up a peer-to-peer communication via Internet for retrieving video segments from the hard-disk of other client devices
    • 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
    • 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/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/104—Peer-to-peer [P2P] networks
    • H04L67/1087—Peer-to-peer [P2P] networks using cross-functional networking aspects
    • H04L67/1091—Interfacing with client-server systems or between P2P systems

Definitions

  • the present invention relates in general to computer software, and in particular, to a method and system for combining the advantages of client server communications and peer-to-peer communications in a multi-user network.
  • Client server systems need to be scalable and provide a realistic model for multi-user connectivity.
  • International Patent Application 9628920 discloses a distributed interactive multimedia system that employs central and peripheral hubs that function to provide services to a plurality of clients of a call manager server, or manager subsystem.
  • One object of the present embodiment of the invention is to provide a method for a scalable multi-user communication system.
  • it is an such object to reduce latency for user connectivity in a seamless manner.
  • Another such object is to provide scalability without assumptions which restrict the use of the communication system within certain types of networks.
  • Another such object is to enable applications to defer decisions about their communication topologies until they are executed.
  • One aspect of the invention provides a method of increasing server capacity on a network computer system, according to claim 1 comprising the steps of: determining a total number of destination addresses that an individual client will directly communicate with so as to provide a peer address total; characterised by assigning a plurality of destination addresses as peer addresses with which the individual client communicates directly or server addresses corresponding to destination addresses handled by a server interconnected to the individual client on the network such that destination addresses are assigned as peer addresses until the peer address total is reached to thereby reduce a total number of destination addresses handled by the server in real time by up to the peer address total; wherein any destination addresses in excess of the peer address total are assigned as addresses corresponding to destination addresses handled by a server; and transmitting data utilizing the peer addresses.
  • Bandwidth management is used to make decisions to reduce latency and provide scalability.
  • the availability of uni-cast and multi-cast connections for communications will be utilized whenever possible by the connected user and the server.
  • Server capacity is increased on a network computer system. A total number of peers than an individual client will communicate with directly is first determined. Then, a total number of clients handled by a server interconnected to the individual client is reduced by the determined total number of peers.
  • data processing system 8 which may comprise, for example, the Internet or an intranet, may include a plurality of networks, such as local area networks (LAN) 10 and 32, each of which preferably includes a plurality of individual computers 12 and 30, respectively, or a plurality of processors coupled by one or more means of communication such as LAN, WAN, shared memory, etc.
  • LAN local area networks
  • processors coupled by one or more means of communication
  • WAN wide area network
  • IWS Intelligent Work Stations
  • each individual computer may be coupled to a storage device 14 and/or a printer/output device 16 and may be provided with a pointing device such as mouse 17.
  • the data processing system 8 may also include multiple mainframe computers, such as mainframe computer 18, which may be preferably coupled to LAN 10 by means of communications link 22.
  • the mainframe computer 18 may also be coupled to a storage device 20 which may serve as remote storage for LAN 10.
  • LAN 10 may be coupled via communications link 24 through a subsystem control unit/communications controller 26 and communications link 34 to a gateway server 28.
  • Gateway server 28 is preferably an individual computer or IWS which serves to link LAN 32 to LAN 10.
  • LAN 32 and LAN 10 a plurality of documents or resource objects may be stored within storage device 20 and controlled by mainframe computer 18, Resource Manager, or Library Service with the resource objects thus stored.
  • mainframe computer 18 may be located a great geographic distance from LAN 10 and similarly LAN 10 may be located a substantial distance from LAN 32.
  • LAN 32 may be located in California while LAN 10 may be located within North Carolina and mainframe computer 18 may be located in New York.
  • Software program code which employs the present invention is typically stored in the memory of a storage device 14 of a stand alone workstation or LAN server from which a developer may access the code for distribution purposes, the software program code may be embodied on any of a variety of known media for use with a data processing system such as a diskette or CD-ROM, or may be distributed to users from a memory of one computer system over a network of some type to other computer systems for use by users of such other systems.
  • Such techniques and methods for embodying software code on media and/or distributing software code are well-known and will not be further discussed herein.
  • a client 102 which may be, for example, an individual computer 12 (see Fig. 1) transmits all outgoing real-time data to a server 104 via a transmission line 106.
  • the server 104 is responsible for retransmitting the data to the appropriate one or more clients 108 or 110, for example, based on the transmission mode of the packet.
  • This model imposes extra latency on the real-time data because the packets must travel to their destinations via a circuitous route from the initial client to the server and then to the destination client.
  • this model generally requires minimal network bandwidth and computation power at the client host because the client only needs to transmit each data packet one time.
  • this client-server model is most appropriate for personal computers connected to the Internet over dial-up modem links.
  • a strict peer-to-peer environment 200 is illustrated.
  • a client 202 transmits all outgoing real-time data directly to the destination peer or peers such as, for example, client 204 and client 206.
  • the strict peer-to-peer environment minimizes the latency on real-time data packets because information is routed by the most direct path to its destination.
  • the peer-to-peer environment requires considerably more bandwidth along the client's network link and imposes a greater load on the client's processor because each packet is transmitted multiple times. Consequently, the peer-to-peer system is most suitable for a high powered work station connected to a T-1 or better network link having multicast capabilities.
  • a Spline type environment 400 is shown.
  • a transmission from a client 402 to a client 404 would first go through a server 406 to a server 408 and finally to the client 404.
  • the Community Place environment may contain a plurality of servers which themselves communicate via peer-to-peer protocols. By providing multiple servers, the Community Place environment may improve scalability but the Community Place environment does not reduce the latency.
  • clients may be permitted to participate via peer-to-peer protocols, but they must make a binary decision between operating in a low-bandwidth client-server mode or a high-bandwidth peer-to-peer mode.
  • a hybrid environment 500 integrates a pure client-server and pure peer-to-peer option.
  • a client 502 transmits outgoing real-time data directly to a subset of destination peer clients, for example, to client 504, client 506 and client 508, while relying on a server 510 to transmit data to any remaining destinations.
  • This hybrid offers each client with a spectrum of communication options, effectively allowing the client to select the appropriate band-width/latency tradeoff for its outbound data dynamically at any time.
  • the hybrid environment 500 supports a pure client-server and a pure peer-to-peer model.
  • a client provides the server with its peer-to-peer capacity (M).
  • M peer-to-peer capacity
  • the client transmits the data to members of the distribution list until the peer-to-peer capacity (M) is reached; and then simply lists the remaining peers in the packet sent to the server. If the identity of the distribution list's remaining elements is known by the server, then the client may forego transmitting the distribution list to the server. As a consequence, transmission latency is reduced for those distribution processes/networks that receive data in a peer-to-peer fashion, and a total number of clients (N) available for service by the server may be positively adjusted upward as the individual peer-to-peer capacity relieves the load on the server.
  • the server may also use knowledge of M to limit the number of peer addresses that it provides to the client.
  • decision block 600 it is determined whether or not a user has set a value for M. It is possible with the present invention that a user may simply enter a number for M into a dialog and thus set the value. If the response to the decision 600 is yes, the present invention sets the peer-to-peer capacity and manages the set of clients allocated to the M peer-to-peer capacity so as to minimize latency at block 601 and the peer-to-peer capacity (M) is set at 602. If the response to decision block 600 is no, it is determined at decision block 604 whether or not the user is on a slow transmission line such as, for example, a modem.
  • a slow transmission line such as, for example, a modem.
  • a bandwidth management algorithm (beyond the scope of this invention) is used to analyze line loads to determine M, and the present invention determines what clients are in M to allow for latency minimization at block 608. The value for M is returned at 609.
  • a high level flowchart illustrates the use of the present invention once M has been calculated per Figure 6.
  • a variable I is set equal to zero, and at block 701 M is obtained. It is then determined at decision block 702 whether or not I is greater than or equal to zero and less than M. If it is determined at decision block 702 that the response is yes, update information is sent to a host or network identifier at block 704. At block 706, I is incremented by one and the present invention returns to decision block 702. If the response to decision block 702 is no, a distribution list is set empty at block 708. It is then determined in decision block 710 whether the packet must be sent to additional hosts (i.e., the total number of clients serviceable by the server).
  • a host or network identifier is added to the distribution list at 712.
  • the variable I is then incremented by one at block 714, followed by a return to decision block 710.
  • the response to decision block 710 is no, the distribution list and data is sent to the server in order to allow the server to send each identified host or network data at block 716.
  • the present invention then stops at 718.
  • the server will only need to update 42 (14X3)of the 182(14X13) active communication paths. If M were zero for each user rather than ten, the server would have to handle all updates or 182 (14X13) instead of only 42. Obviously, as users and capacities expand by factors of ten or more, the savings to the server become even more dramatic.
  • Sample Java source code which may be used to implement the present invention, could be:
  • server capacity is increased on a network computer system.
  • a total number of peers that an individual client will communicate with directly is determined.
  • a total number of clients handled by a server interconnected to the individual client is reduced by the determined total number or peers.

Landscapes

  • Engineering & Computer Science (AREA)
  • Signal Processing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Computer Security & Cryptography (AREA)
  • Multimedia (AREA)
  • General Engineering & Computer Science (AREA)
  • Computer Hardware Design (AREA)
  • Theoretical Computer Science (AREA)
  • Software Systems (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Computer And Data Communications (AREA)
  • Multi Processors (AREA)
  • Information Transfer Between Computers (AREA)

Claims (19)

  1. Procédé d'augmentation de la capacité d'un serveur sur un système informatique en réseau comprenant les étapes consistant à :
    déterminer (601) un nombre total d'adresses de destination avec lesquelles un client individuel communiquera directement de façon à procurer un total d'adresses homologues, caractérisé par
    l'affectation (712) d'une pluralité d'adresses de destination en tant qu'adresses homologues avec lesquelles le client individuel communique directement, ou en tant qu'adresses de serveur correspondant aux adresses de destination gérées par un serveur interconnecté au client individuel sur le réseau de sorte que des adresses de destination soient affectées comme adresses homologues jusqu'à ce que le total des adresses homologues soit atteint pour réduire ainsi un nombre total d'adresses de destination gérées par le serveur en temps réel d'un nombre allant jusqu'au total des adresses homologues,
    dans lequel les adresses de destination quelconques dépassant le total des adresses homologues sont affectées comme adresses correspondant aux adresses de destination gérées par le serveur, et
    la transmission de données en utilisant les adresses homologues.
  2. Procédé selon la revendication 1, dans lequel ledit nombre total d'adresses de destination est établi par ledit client individuel.
  3. Procédé selon la revendication 1, dans lequel ledit nombre total d'adresses de destination est établi par un algorithme de gestion de bande passante.
  4. Procédé selon la revendication 1, 2 ou 3, dans lequel des adresses affectées en tant qu'adresses de serveur sont connues dudit serveur et ledit client individuel n'est pas requis d'informer ledit serveur d'une identité desdites adresses.
  5. Procédé selon l'une quelconque des revendications 1 à 4, dans lequel ledit serveur connaît ledit total des adresses homologues et limite un nombre des adresses de destination non sollicitées procurées à une destination dudit client individuel.
  6. Procédé selon l'une quelconque des revendications 1 à 4, dans lequel ledit serveur peut minimiser le temps de latence en sélectionnant ledit total des adresses homologues.
  7. Procédé selon l'une quelconque des revendications 1 à 6, dans lequel au moins l'une desdites adresses homologues comprend un espace d'adressage à destinataires multiples.
  8. Procédé selon l'une quelconque des revendications 1 à 7, dans lequel ledit client exécute un cryptage ou une traduction du format des données pour permettre une communication vers lesdites adresses homologues.
  9. Procédé selon la revendication 8, dans lequel ledit serveur procure des clés de cryptage nécessaires ou d'autres informations de format de données pour permettre une communication vers lesdites adresses homologues fournies par ledit serveur.
  10. Système destiné à augmenter une capacité de serveur sur un réseau informatique comprenant :
    un moyen destiné à déterminer (601) un nombre total d'adresses de destination avec lesquelles un client individuel communiquera directement de façon à procurer un total d'adresses homologues,
    caractérisé par
    un moyen destiné à affecter une pluralité d'adresses de destination en tant qu'adresses homologues avec lesquelles le client individuel communique directement ou des adresses de serveur correspondant aux adresses de destination gérées par un serveur interconnecté au client individuel sur le réseau de sorte que des adresses de destination soient affectées comme adresses homologues jusqu'à ce que le total des adresses homologues soit atteint afin de réduire ainsi un nombre total des adresses de destination gérées par le serveur en temps réel d'un nombre allant jusqu'au total des adresses homologues,
    dans lequel des adresses de destination quelconques en plus du total des adresses homologues sont affectées en tant qu'adresses correspondant à des adresses de destination gérées par un serveur, et
    un moyen destiné à transmettre des données en utilisant les adresses homologues.
  11. Système selon la revendication 10, dans lequel ledit nombre total d'adresses de destination est établi par ledit client individuel.
  12. Système selon la revendication 10, dans lequel ledit nombre total d'adresses de destination est établi par un algorithme de gestion de bande passante.
  13. Système selon l'une quelconque des revendications 10 à 12, dans lequel des adresses affectées en tant qu'adresses de serveur sont connues dudit serveur et ledit client individuel n'est pas requis d'informer ledit serveur d'une identité desdites adresses.
  14. Système selon l'une quelconque des revendications 10 à 13, dans lequel ledit serveur connaît ledit total des adresses homologues et limite un nombre des adresses de destination non sollicitées procurées à une destination dudit client individuel.
  15. Système selon l'une quelconque des revendications 10 à 14, dans lequel ledit serveur peut minimiser le temps de latence en sélectionnant ledit total d'adresses homologues.
  16. Système selon l'une quelconque des revendications 10 à 15, dans lequel au moins l'une desdites adresses homologues comprend un espace d'adressage à destinataires multiples.
  17. Système selon l'une quelconque des revendications 10 à 16, dans lequel ledit client exécute un cryptage ou une traduction de format de données pour permettre une communication avec lesdites adresses homologues.
  18. Système selon la revendication 17, dans lequel ledit serveur procure des clés de cryptage nécessaires ou d'autres informations de format de données pour permettre une communication vers lesdites adresses homologues fournies par ledit serveur.
  19. Produit de programme informatique enregistré sur un support lisible par un ordinateur destiné à augmenter une capacité de serveur sur un réseau informatique, comprenant :
    un moyen lisible par un ordinateur destiné à déterminer (601) un nombre total d'adresses de destination avec lesquelles un client individuel communiquera directement de façon à procurer un total d'adresses homologues, caractérisé par
    un moyen lisible par un ordinateur destiné à affecter (712) une pluralité d'adresses de destination en tant qu'adresses homologues avec lesquelles le client individuel communique directement ou en tant qu'adresses de serveur correspondant à des adresses de destination gérées par un serveur interconnecté au client individuel sur le réseau de sorte que des adresses de destination soient affectées en tant qu'adresses homologues jusqu'à ce que le totale des adresses homologues soit atteint afin de réduire ainsi un nombre total des adresses de destination gérées par le serveur en temps réel d'un nombre allant jusqu'au total des adresses homologues,
    dans lequel des adresses de destination quelconques en plus du total des adresses homologues sont affectées en tant qu'adresses correspondant à des adresses de destination gérées par un serveur, et
    un moyen lisible par un ordinateur destiné à transmettre des données en utilisant les adresses homologues.
EP97308906A 1996-12-19 1997-11-06 Procédé et système pour une structure de communication hybride entre couches homologues Expired - Lifetime EP0859496B1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US08/769,564 US6041343A (en) 1996-12-19 1996-12-19 Method and system for a hybrid peer-server communications structure
US769564 1996-12-19

Publications (3)

Publication Number Publication Date
EP0859496A2 EP0859496A2 (fr) 1998-08-19
EP0859496A3 EP0859496A3 (fr) 2004-01-21
EP0859496B1 true EP0859496B1 (fr) 2006-08-02

Family

ID=25085830

Family Applications (1)

Application Number Title Priority Date Filing Date
EP97308906A Expired - Lifetime EP0859496B1 (fr) 1996-12-19 1997-11-06 Procédé et système pour une structure de communication hybride entre couches homologues

Country Status (5)

Country Link
US (1) US6041343A (fr)
EP (1) EP0859496B1 (fr)
JP (1) JP3495234B2 (fr)
KR (1) KR100268194B1 (fr)
DE (1) DE69736422T2 (fr)

Families Citing this family (30)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6718387B1 (en) * 1997-12-10 2004-04-06 Sun Microsystems, Inc. Reallocating address spaces of a plurality of servers using a load balancing policy and a multicast channel
US6317438B1 (en) * 1998-04-14 2001-11-13 Harold Herman Trebes, Jr. System and method for providing peer-oriented control of telecommunications services
US6418141B1 (en) * 1998-06-01 2002-07-09 Lucent Technologies, Inc. Multi-cast enabled web server
US6728947B1 (en) * 1998-06-05 2004-04-27 R. R. Donnelley & Sons Company Workflow distributing apparatus and method
US6487600B1 (en) * 1998-09-12 2002-11-26 Thomas W. Lynch System and method for supporting multimedia communications upon a dynamically configured member network
US20020086275A1 (en) * 1999-07-30 2002-07-04 Boney James L. Methods and apparatus for computer training relating to devices using a resource control module
US6514085B2 (en) 1999-07-30 2003-02-04 Element K Online Llc Methods and apparatus for computer based training relating to devices
KR100337757B1 (ko) * 2000-01-08 2002-05-24 송병준 자바 언어를 이용한 클라이언트간 통신 방법
US20020162109A1 (en) * 2001-04-26 2002-10-31 Koninklijke Philips Electronics N.V. Distributed storage on a P2P network architecture
US20030018701A1 (en) * 2001-05-04 2003-01-23 Gregory Kaestle Peer to peer collaboration for supply chain execution and management
CA2455502A1 (fr) * 2001-08-07 2003-02-20 Element K Online Llc Procede et systeme de developpement et de fourniture de cours de formation efficaces
CN1218574C (zh) * 2001-10-15 2005-09-07 华为技术有限公司 交互式视频设备及其字幕叠加方法
FR2832014A1 (fr) * 2001-11-08 2003-05-09 Thomson Licensing Sa Module et procede de communication inter-utilisateurs et produits correspondants
US20030126213A1 (en) * 2002-01-02 2003-07-03 International Business Machines Corporation Establishing direct instant messaging communication between wireless devices
US7130921B2 (en) * 2002-03-15 2006-10-31 International Business Machines Corporation Centrally enhanced peer-to-peer resource sharing method and apparatus
US7120691B2 (en) * 2002-03-15 2006-10-10 International Business Machines Corporation Secured and access controlled peer-to-peer resource sharing method and apparatus
US7343418B2 (en) * 2002-06-03 2008-03-11 Microsoft Corporation Peer to peer network
US7181442B2 (en) * 2002-09-24 2007-02-20 International Business Machines Corporation Method and apparatus for discovery of dynamic network services
US8095500B2 (en) 2003-06-13 2012-01-10 Brilliant Digital Entertainment, Inc. Methods and systems for searching content in distributed computing networks
US7729992B2 (en) 2003-06-13 2010-06-01 Brilliant Digital Entertainment, Inc. Monitoring of computer-related resources and associated methods and systems for disbursing compensation
DE10345535B4 (de) * 2003-09-30 2005-10-06 Siemens Ag Überprüfung der Verfügbarkeit eines Servers
US8627213B1 (en) * 2004-08-10 2014-01-07 Hewlett-Packard Development Company, L.P. Chat room system to provide binaural sound at a user location
US20060168012A1 (en) * 2004-11-24 2006-07-27 Anthony Rose Method and system for electronic messaging via distributed computing networks
JP4103892B2 (ja) * 2005-01-26 2008-06-18 オンキヨー株式会社 ピアツーピアコンテンツ配信システム
US8286218B2 (en) 2006-06-08 2012-10-09 Ajp Enterprises, Llc Systems and methods of customized television programming over the internet
US7720083B2 (en) * 2007-09-28 2010-05-18 Microsoft Corporation Intelligent routing in a hybrid peer-to-peer system
US20090254931A1 (en) * 2008-04-07 2009-10-08 Pizzurro Alfred J Systems and methods of interactive production marketing
US8868725B2 (en) * 2009-06-12 2014-10-21 Kent State University Apparatus and methods for real-time multimedia network traffic management and control in wireless networks
JP2011008709A (ja) * 2009-06-29 2011-01-13 Brother Industries Ltd 情報処理装置、コンテンツ配信システム、コンテンツ配信制御方法及びプログラム
TW201210284A (en) * 2010-08-27 2012-03-01 Ind Tech Res Inst Architecture and method for hybrid Peer To Peer/client-server data transmission

Family Cites Families (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
AU623808B2 (en) * 1989-09-19 1992-05-21 Fujitsu Limited Multiple access system for a communication network
US5285449A (en) * 1991-04-03 1994-02-08 International Business Machines Corporation Protocol for hybrid local area networks
EP0584027A2 (fr) * 1992-08-19 1994-02-23 International Business Machines Corporation Communication transparente entre couches homologues dans une architecture de communication à couches
US5444702A (en) * 1992-09-14 1995-08-22 Network Equipment Technologies, Inc. Virtual network using asynchronous transfer mode
US5592538A (en) * 1993-03-10 1997-01-07 Momentum, Inc. Telecommunication device and method for interactive voice and data
US5459725A (en) * 1994-03-22 1995-10-17 International Business Machines Corporation Reliable multicasting over spanning trees in packet communications networks
JPH08107462A (ja) * 1994-08-11 1996-04-23 Shosaku Kawai 通信ネットワーク構造及びそれを基礎とした通信ネットワークシステム並びにその通信方法
US5659544A (en) * 1994-10-17 1997-08-19 Lucent Technologies Inc. Method and system for distributed control in wireless cellular and personal communication systems
US5838683A (en) * 1995-03-13 1998-11-17 Selsius Systems Inc. Distributed interactive multimedia system architecture
US5608448A (en) * 1995-04-10 1997-03-04 Lockheed Martin Corporation Hybrid architecture for video on demand server
US5913028A (en) * 1995-10-06 1999-06-15 Xpoint Technologies, Inc. Client/server data traffic delivery system and method
US5761433A (en) * 1995-11-13 1998-06-02 Billings; Roger E. System for communicating data in a network using both a daisy chain link and separate broadcast links
US5822523A (en) * 1996-02-01 1998-10-13 Mpath Interactive, Inc. Server-group messaging system for interactive applications

Also Published As

Publication number Publication date
JP3495234B2 (ja) 2004-02-09
JPH10187643A (ja) 1998-07-21
EP0859496A3 (fr) 2004-01-21
KR100268194B1 (ko) 2000-11-01
EP0859496A2 (fr) 1998-08-19
DE69736422D1 (de) 2006-09-14
KR19980063395A (ko) 1998-10-07
US6041343A (en) 2000-03-21
DE69736422T2 (de) 2007-02-01

Similar Documents

Publication Publication Date Title
EP0859496B1 (fr) Procédé et système pour une structure de communication hybride entre couches homologues
US6178453B1 (en) Virtual circuit switching architecture
US7139926B1 (en) Stateful failover protection among routers that provide load sharing using network address translation (LSNAT)
Chawathe et al. RMX: Reliable multicast for heterogeneous networks
US8429221B2 (en) Content request routing method
US6965930B1 (en) Methods, systems and computer program products for workload distribution based on end-to-end quality of service
US7363347B2 (en) Method and system for reestablishing connection information on a switch connected to plural servers in a computer network
EP1561333B1 (fr) Controle du trafic de reseau dans des environnements d'egal a egal
US7689710B2 (en) Method and system for a front-end modular transmission control protocol (TCP) handoff design in a streams based transmission control protocol/internet protocol (TCP/IP) implementation
EP1117222B1 (fr) Procédé et dispositif pour effectuer une recherche rapide de service dans un réseau en grappe
US8346882B2 (en) Method for structuring a self-organized content distribution overlay network for a peer-to-peer network
US7260599B2 (en) Supporting the exchange of data by distributed applications
Bauer et al. Network infrastructure for massively distributed games
EP1094645B1 (fr) Méthode et dispositif pour fournir des services évolutifs en utilisant une table de distribution de paquets
US20040260745A1 (en) Load balancer performance using affinity modification
CA2691167A1 (fr) Systeme d'acces et de commande pour dispositifs actives par reseau
JPH098838A (ja) Ｌａｎを相互接続するための方法および装置
JPH11143804A (ja) マルチ・コンピュータ・サーバのためのネットワーク負荷均衡化
US6850484B1 (en) Packet redirection and message stream management
JP3666654B2 (ja) インターネット通信方法｛ＡｍｅｔｈｏｄｆｏｒａｎＩｎｔｅｒｎｅｔＣｏｍｍｕｎｉｃａｔｉｏｎ｝
US20020188730A1 (en) Method and system for a modular transmission control protocol (TCP) frequent-handoff design in a streams based transmission control protocol internet protocol (TCP/IP) implementation
JP2002269061A (ja) クライアントサーバシステム、中継サーバ、接続先サーバの決定方法
JP5437290B2 (ja) サービス振分方法、サービス振分装置、およびプログラム
US7508753B2 (en) Packet redirection and message stream management
JP3452410B2 (ja) 仮想空間データ転送方法

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

AK Designated contracting states

Kind code of ref document: A2

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

AX Request for extension of the european patent

Free format text: AL;LT;LV;MK;RO;SI

PUAL Search report despatched

Free format text: ORIGINAL CODE: 0009013

AK Designated contracting states

Kind code of ref document: A3

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

AX Request for extension of the european patent

Extension state: AL LT LV MK RO SI

RIC1 Information provided on ipc code assigned before grant

Ipc: 7H 04L 29/06 A

17P Request for examination filed

Effective date: 20040206

17Q First examination report despatched

Effective date: 20040408

AKX Designation fees paid

Designated state(s): DE FR GB

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): DE FR GB

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

REF Corresponds to:

Ref document number: 69736422

Country of ref document: DE

Date of ref document: 20060914

Kind code of ref document: P

ET Fr: translation filed
PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

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

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

26N No opposition filed

Effective date: 20070503

REG Reference to a national code

Ref country code: GB

Ref legal event code: 746

Effective date: 20081017

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: FR

Payment date: 20101203

Year of fee payment: 14

REG Reference to a national code

Ref country code: DE

Ref legal event code: R085

Ref document number: 69736422

Country of ref document: DE

Effective date: 20120316

REG Reference to a national code

Ref country code: GB

Ref legal event code: 732E

Free format text: REGISTERED BETWEEN 20120503 AND 20120509

REG Reference to a national code

Ref country code: GB

Ref legal event code: S47

Free format text: CANCELLATION OF ENTRY; APPLICATION BY FILING PATENTS FORM 15 WITHIN 4 WEEKS FROM THE DATE OF PUBLICATION OF THIS JOURNAL GOOGLE, INC METHOD AND SYSTEM FOR A HYBRID PEER-SERVER COMMUNICATIONS STRUCTURE APPLICATION BY PROPRIETOR TO CANCEL LICENCE OF RIGHT UNDER SECTION 47(1) FILED ON 9 MARCH 2012

REG Reference to a national code

Ref country code: DE

Ref legal event code: R082

Ref document number: 69736422

Country of ref document: DE

Representative=s name: PFENNING MEINIG & PARTNER GBR, DE

REG Reference to a national code

Ref country code: FR

Ref legal event code: ST

Effective date: 20120731

REG Reference to a national code

Ref country code: DE

Ref legal event code: R082

Ref document number: 69736422

Country of ref document: DE

Representative=s name: PFENNING, MEINIG & PARTNER MBB PATENTANWAELTE, DE

Effective date: 20120717

Ref country code: DE

Ref legal event code: R082

Ref document number: 69736422

Country of ref document: DE

Representative=s name: PFENNING MEINIG & PARTNER GBR, DE

Effective date: 20120717

Ref country code: DE

Ref legal event code: R081

Ref document number: 69736422

Country of ref document: DE

Owner name: GOOGLE INC., MOUNTAIN VIEW, US

Free format text: FORMER OWNER: INTERNATIONAL BUSINESS MACHINES CORPORATION, ARMONK, N.Y., US

Effective date: 20120717

REG Reference to a national code

Ref country code: GB

Ref legal event code: S47

Free format text: ENTRY CANCELLED; NOTICE IS HEREBY GIVEN THAT THE ENTRY ON THE REGISTER 'LICENCES OF RIGHT' UPON THE UNDERMENTIONED PATENT WAS CANCELLED ON 12 OCTOBER 2012 GOOGLE INC METHOD AND SYSTEM FOR A HYBRID PEER-SERVER COMMUNICATIONS STRUCTURE

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: FR

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20111130

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: DE

Payment date: 20161123

Year of fee payment: 20

Ref country code: GB

Payment date: 20161128

Year of fee payment: 20

REG Reference to a national code

Ref country code: DE

Ref legal event code: R071

Ref document number: 69736422

Country of ref document: DE

REG Reference to a national code

Ref country code: GB

Ref legal event code: PE20

Expiry date: 20171105

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: GB

Free format text: LAPSE BECAUSE OF EXPIRATION OF PROTECTION

Effective date: 20171105