WO2003105421A1 - ディジタル・コンテンツ配信システム、ディジタル・コンテンツ配信方法、該方法を実行するためのプログラム、該プログラムを記憶したコンピュータ可読な記録媒体、およびそのためのサーバおよびクライアント - Google Patents
ディジタル・コンテンツ配信システム、ディジタル・コンテンツ配信方法、該方法を実行するためのプログラム、該プログラムを記憶したコンピュータ可読な記録媒体、およびそのためのサーバおよびクライアント Download PDFInfo
- Publication number
- WO2003105421A1 WO2003105421A1 PCT/JP2003/007093 JP0307093W WO03105421A1 WO 2003105421 A1 WO2003105421 A1 WO 2003105421A1 JP 0307093 W JP0307093 W JP 0307093W WO 03105421 A1 WO03105421 A1 WO 03105421A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- packet
- network
- client
- server
- digital content
- Prior art date
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/40—Information retrieval; Database structures therefor; File system structures therefor of multimedia data, e.g. slideshows comprising image and additional audio data
- G06F16/48—Retrieval characterised by using metadata, e.g. metadata not derived from the content or metadata generated manually
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/40—Information retrieval; Database structures therefor; File system structures therefor of multimedia data, e.g. slideshows comprising image and additional audio data
-
- 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
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
- H04L45/04—Interdomain routing, e.g. hierarchical routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/121—Shortest path evaluation by minimising delays
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/16—Multipoint routing
-
- 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
- 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/1836—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast with heterogeneous network architecture
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/54—Store-and-forward switching systems
- H04L12/56—Packet switching systems
- H04L12/5601—Transfer mode dependent, e.g. ATM
- H04L2012/5603—Access techniques
-
- 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
Definitions
- Digital content distribution system digital content distribution method, program for executing the method, a computer-readable recording medium storing the program, and server and client for the same
- the present invention relates to the distribution of digital content, and more particularly, to the distribution of digital content from a digital content distribution site over a network and holding the content by a plurality of clients, thereby enabling the digital content to be distributed over the network.
- Digital content distribution system capable of efficiently distributing content, digital content distribution method, program for executing the method, computer-readable recording medium including the program, server for the same About the client.
- the present invention reduces daisy chain communication overhead for a given global group including a plurality of groups each including a plurality of clients and connected to each other via a network.
- Digital content distribution systems that enable the distribution of content, servers and clients therefor, and control methods for making a computer function as the servers and clients described above, and programs for them (4)
- the present invention relates to a computer-readable recording medium on which the program is recorded. Background art
- networks such as the Internet via computers, public telephone lines, ISDN, optical communication, wireless communication, ADSL, and CATV have become increasingly popular.
- digital 'content such as e-mail but also digital' content 'over the network, including text' data, voice data, image data, and composite multimedia 'data' It is considered that the service of distributing from a server located at a site to a client such as a plurality of computers or portable terminals via a network will become more widespread.
- LAN local 'area' network
- WAN wide 'area' networks
- the IP multicasting scheme proposed by Deering et al. Eliminates duplication of packets on the network 100 and enables good communication, but allows the router to perform simple IP forwarding. Instead, there was an inconvenience of complicating network resources, such as the need to deploy a dedicated router that has a “state” for the clients to be served. In addition, scalability is limited due to the need for additional network equipment or the inability to respond to unexpected failures or withdrawal of clients due to the complexity of network resources mentioned above. Inconvenience had occurred.
- IP multicast has a mechanism that data can be sent from any source to any group, so it is vulnerable to malicious attacks, it is necessary to secure a unique global address for the group, It is a best-of-auto type, and has the advantage of being able to operate services at low cost in terms of delivering digital content.
- IP multicast is unsuitable for applications such as corporate backbone lines where slight interruptions in the line can cause enormous loss, or for video distribution applications where constant bandwidth must always be secured. There is an inconvenience that handling such as avoidance and security is more difficult than unicast.
- IP multicast is not yet practical due to the need for major changes to the network infrastructure.
- the client also acts as a relay point of packet transmission, and transmits a packet to a client at a further downstream side.
- Figure 24 shows a schematic diagram of digital 'content' distribution using the application-level multicast method.
- the application-level multicast method shown in Figure 32 is used for the client.
- the rank is given to 106, and each packet can be transmitted according to the path tree structure.
- Pendarakis et al. Calculate the minimum network that connects clients efficiently, and Chu et al.
- the minimum network is formed, for example, as a minimum spanning tree (MST) whose branches are weighted by a round-trip time (RTT).
- MST minimum spanning tree
- RTT round-trip time
- 11-282332 describes a method in which each client uses a data cache and client correspondence table to find a client that caches desired data and obtain data from the client. Is disclosed. ⁇ The method disclosed in Japanese Patent Application No. 11-282332 enables the client to perform caching satisfactorily, but when the data is obtained, there is a delay at least by the length of the cached data. In the case of streaming that requires a small amount of time delay and real-time performance, the real-time performance is not sufficient. Further, Japanese Patent Application No. 11-282332 does not disclose caching with a large data length.
- the network 100 between the remote server 108 and the edge server 110 is a best-effort network. After transmitting the digital content by using up the bandwidth, the transmitted digital content is transmitted. Is cached once at Edge 'server 110. The cached digital content is streamed again from the edge server 110 to a nearby client, and the delivery of the digital content to the client is completed. That is, the method of Aramaki et al. Provides one solution for suppressing packet duplication between the server 108 and the edge 'server 110 and avoiding congestion. However, even when the edge server 110 is used, the overhead of the edge server 110 tends to be an issue, and when transmitting a packet from the edge server 110 to each client, the transmitted packet is not transmitted. It is necessary to reduce duplication.
- IP multicast the source transmits a packet by specifying an IP address having a value within a special range as a destination. This IP address represents a multicast group, and the receiving host sends a request to join this group to each router on the route, and the router that receives this identifies the group that sent the join request. And execute the process of distributing the packet.
- the same packet can be sent to many receiving hosts at once without duplication of the packet by using proper routing by using multicast.
- distribution of multicast content works well without causing a large investment burden on equipment and equipment, and inconvenience to communication traffic.
- IPv4 the current communication protocol used by the Internet as a whole
- the multicast function is not normally enabled, and actually performing an actual multicast on the Internet generally requires additional equipment.
- Fig. 34 shows a pseudo-multicast for the above-mentioned multicast-capable group, for example, a well-known method of a network 'system that enables a multicast-compatible network and another multicast-compatible content distribution. Show.
- the network system shown in FIG. 34 enables distribution of digital contents by forming a plurality of tunnels between a server and a plurality of groups.
- the digital data shown in FIG. 34 is transmitted to the global Darup G, which is composed of each of the Gnorapes 114a to 114c, via a first network 116, such as the Internet.
- the global group G shown in FIG. 34 includes groups 114a to 114c, and includes, for example, companies, public institutions, government agencies, and school educational institutions. Specifically, for example, taking one company as an example, Group 1 14a is a Hokkaido office, and Group 1 14c is a group of Kyushu offices of the same company. can do.
- the tunnels 118a to 118c are more specifically constructed by installing an entrance port and an exit port of a tunnel between two different networks, respectively, and transferring data packets via the entrance port and the exit port. , Deliver multicast 'packets to recipients on the network at once.
- Fig. 34 in order to perform multicast distribution to a plurality of groups, it is necessary to prepare a plurality of tunnels for each group.
- the above-mentioned tunneling technique is already generally known, and it is also known that when there are many groups, the multicast distribution by tunneling often does not function sufficiently.
- Fig. 34 multicast-distributes the digital contents to / from each of the groups 114a to 114c by using a so-called tunnel 118a to 118c.
- the tunnels 118a to 118c are more specifically constructed by installing an entrance port and an exit port of a tunnel between two different networks, respectively, and transferring data packets via the entrance port and the exit port. , Deliver multicast 'packe
- a digital content sender (hereinafter referred to as a provider) and a number of groups are connected via the Internet.
- Groups 114a to 114c are connected to the first network via lines with different communication capacities, such as ISDN, ADSL, CATV, and optical communication, used by the groups.
- groups 114a-114c may also include different types of communication infrastructure, each having a different communication capacity, such as a local 'area' network (LAN) configured using Ethernet or wireless communication networks.
- LAN local 'area' network
- a plurality of clients 122 are connected to these second networks, respectively, and these are connected to the first network 116 by a router 124 or the like. In such a situation, it is assumed that the server 112 transmits a packet to all the clients 122.
- the following problems occur with the conventional method of performing multicast distribution by tunneling.
- the present invention has been made in view of the above-described inconvenience, and in the present invention, digital content is provided in real time from a server to a plurality of information processing devices without depending on the number of groups.
- the server sends the digital' content as a packet via the first network to at least one client belonging to the second network.
- the transmitted packet is the smallest unit required to reconstruct digital 'content.
- the minimum unit packet is the minimum packet that can reconstruct the original digital contents without duplication of packets. In the present invention, it is hereinafter referred to as a source 'packet.
- the client receiving the source 'packet sends a copy of the received source packet to the client connected to the second network via the second network.
- the client that sent the packet receives a copy of the source 'packet received by the other client.
- Digital 'content transmitted in a plurality of packets during a predetermined period is reconstructed by being combined at the client, and is provided to the user at the client in real time.
- Embodiments of the present invention include the following: display of moving image data, display of audio data, display of image data constituting multimedia data, and playback of audio data synchronized therewith. It can include any of the known aspects.
- the present invention is defined as display or reproduction including the above-described providing mode. While providing the reconstructed digital content, the client receives further subsequent packets and completes the reconstruction of the subsequent stream during the provision of the already reconstructed digital content. Enables continuous digital content delivery.
- the present invention by repeating the above-described processing, avoids duplication of transmitted packets, continues stable distribution of digital contents, and responds to frequent departures or new participation of clients constituting the network. It is possible to respond flexibly.
- the present invention realizes a stable system that does not affect the efficiency of digital content distribution even with a large environmental change in each client such as a change in the CPU allocation status.
- the present invention does not use a specially configured router, switching hub, or auxiliary server, so that the cost of the network system is not unnecessarily increased and the network and Enables distribution of digital content without adding maintenance and other tasks.
- the present invention provides a pseudo-tunneling distribution for efficiently distributing from a server to a predetermined global group regardless of a tunnel for performing distribution.
- pseudo-tunnel delivery means that a server only delivers digital 'minimum source' packets required for reconstructing the content to the global group without duplication, and the client in the global group Means a distribution system and distribution method that can provide the same digital content smoothly without causing significant time lag.
- the server distributes packets to clients belonging to a plurality of groups without duplication.
- a plurality of clients constitute a group
- the plurality of groups constitute a global group.
- the server is configured to be able to transmit packets to the entire global group.
- the server selects a destination client from the global group each time.
- At least one client receives digital 'sources comprising content' packets from the server.
- the server or client has a client list of clients that make up the global group, and the client that receives the source 'packet is the source; the source that receives the packet; the packet delivery data or the pre-assigned copy. Distribute a copy of the source packet to other clients by referring to the list.
- the LAN in the group is effectively used.
- Each group can be communicated between clients belonging to each group, for example, by connecting to one switching hub, without affecting each other by using the function of the switch.
- a digital content is shared by a group by configuring a third network that supports multicasting between a plurality of clients connected under one router and an application computer. It allows the client overhead and hardware resources to be further reduced. That is, according to the present invention, there is provided a system for distributing digital content via a first network and a second network,
- a server connected to the first network for transmitting digital content
- the second network connected to the first network, the digital network including a client for receiving and providing the digital content, the server divides the held digital content into a plurality of packets; Means for transmitting a minimum unit packet for composing the digital content to the second network,
- the client constituting the second network uses the minimum unit packet received by the client from the server and a packet received from another client constituting the second network, and Means for retaining said digital content for all said clients connected in a second network.
- the server may include means for dynamically allocating the packet of the minimum unit to a plurality of clients of the second network.
- the means for assigning the minimum unit packet to a plurality of clients of the second network according to the present invention includes:
- the means for determining the overhead of the client includes: a time at which the server sends the minimum unit packet addressed to a predetermined client; and a notification that the predetermined client receives the minimum unit packet. Include means for determining the time difference from the issue time Can be.
- a server connected to a first network and transmitting digital content and a second network connected to the first network are configured to receive the digital content.
- a method for delivering digital content to the client via the first network and the second network comprising:
- the digital content is transmitted to all the clients connected in the second network using the smallest unit packet transmitted from the server and the packet received from the other client. Steps to keep
- a digital 'content distribution method is provided.
- a server connected to a first network for transmitting digital content and a second network connected to the first network are configured to receive the digital content.
- assigning step comprises:
- a server connected to a first network for transmitting digital content and a second network connected to the first network are configured to receive the digital content.
- assigning step comprises:
- the related acknowledgment is used to select a destination to be a related intermediate node. Selecting
- a server connected to a first network for transmitting digital content and a second network connected to the first network are configured to receive the digital content.
- a program, wherein the program is:
- the digital content is transmitted to the clients included in the second network by using the minimum unit packet received via the first network and a packet received from the other client. Steps to keep and
- a server that is connected to a first network and transmits digital content and a second network that is connected to the first network are configured to receive the digital content.
- the digital content is retained for the clients included in the second network using the minimum unit packet received via the first network and a packet received from the other client. Steps to be performed
- Dynamic allocation means for dynamically allocating a destination for the second network transmitting the packet of the minimum unit using the list
- a client that receives digital content distributed via a first network and configures a second network connected to the first network, the client comprising: Means for receiving, via the first network, a minimum unit packet constituting digital content divided into a plurality of packets;
- a system for delivering digital content to a predetermined global group via a first network and a second network the system being connected to the first network, A server that sends
- a plurality of groups constituting the global group comprising a client constituting the second network connected to the first network, and receiving and providing the digital content.
- the server includes means for dividing the held digital 'content into a plurality of packets and transmitting a minimum unit packet for composing the digital' content to the clients of the group without duplication,
- the client having received the minimum unit packet, transmits copies of the minimum unit packet received from the server to all clients constituting the sub-global group including the client and other clients constituting another group.
- a digital 'content distribution system including a means for distributing is provided.
- the digital group in order to distribute digital content via the first network to a global group including a plurality of groups connected via the second network, the digital group is connected to the first network.
- a computer is controlled as a supercomputer for distributing digital content via the first network to a global group including a plurality of groups connected via the second network.
- said method comprises:
- a program for controlling a computer as a server for distributing digital content via a first network to a global group including a plurality of groups connected via a second network Wherein the program is:
- the same packet of the minimum unit does not overlap for a predetermined group. Selecting and registering the distribution destination of the packet in the minimum unit, and storing the data of the selected distribution destination as the packet in the minimum unit.
- a program for controlling a computer as a server for distributing digital content via a first network to a global group including a plurality of groups connected via a second network Is a computer-readable storage medium on which is stored, wherein the program is:
- Reading and transmitting the stored minimum unit packet to configure the digital content to the selected clients of the group a client connected to the second network to distribute digital contents to a predetermined global group via a first network and a second network, and forming a group of the global group Wherein the client is
- a client connected to the second network to distribute digital contents to a predetermined global group via a first network and a second network, and forming a group of the global group Controlling the computer as the method, comprising: causing the computer to receive a packet via the first network or the second network and store the packet in a memory;
- a copy packet is generated from the received packet in response to the determination, and a copy 'packet is transmitted to at least another group of clients.
- a method for executing a step of distributing, and a step of storing the received packet in the memory when it is determined that the received packet is not the minimum unit packet is provided.
- a client connected to the second network to distribute digital contents to a predetermined global group via a first network and a second network, and forming a group of the global group
- a client connected to the second network to distribute digital contents to a predetermined global group via a first network and a second network, and forming a group of the global group
- a copy 'packet is generated from the received packet in response to the determination, and is copied to at least another group of clients.
- a storage medium is provided for executing the step of delivering and the step of storing the received packet in the memory when it is determined that the received packet is not the minimum unit packet.
- FIG. 1 is a schematic diagram showing a digital content distribution system 10 of the present invention.
- the digital content distribution system 10 of the present invention includes a server 14 connected to a network 12 and a plurality of servers 14 connected to the network 12 via network devices such as a router 16 and a switching hub 18. It comprises a client 20 and.
- the network 12 shown in FIG. 1 includes networks such as the Internet, WAN, and LAN, and communication media for configuring the network include public telephone lines, ISDN, ADSL, and optical networks. Communication, terrestrial radio communication, satellite communication, etc. can be used.
- the server 14 distributes digital and contents according to the present invention to the client 20 via the network 12 and the network 22.
- the digital content delivered in the present invention may be an MPEG-2, MPEG-4, or higher-order moving image that needs to provide content to multiple clients at the same time in real time.
- Data can be cited.
- multimedia data including a plurality of types of digital data such as moving image data, audio data, and text data in addition to moving image data can be used.
- the client 20 is connected to the network 12 via the router 16 and the switching hub 18 and the like, and also has an identifier, such as an IP address, assigned to each of the same routers 16. It is identified by the server 14 as a predetermined group # 1 or the like.
- the clients in a predetermined group constitute a network 22 connected by peer-to-peer connection, and the clients in the group can communicate with each other.
- the server 14 that can be used in the present invention can be composed of a personal computer or a workstation, and the personal computer or workstation is P ENTIUM (registered trademark).
- the CPU or a CPU compatible with it
- WIND OWS registered trademark
- WIND OWS registered trademark
- NT Microsoft 'Corporation
- OS / 2 trademark: International / Business'Machines' Corporation
- AIX trademark: International 'Business'Machines' Corporation, Unix, Linux
- client 20 may include a notebook personal computer connected via a wireless network, a PDA, and the like. it can.
- the digital 'content distribution system 10 of the present invention shown in FIG. 1 decomposes the moving image data into a plurality of streams, divides one stream into a plurality of packets, and The packet is transmitted as a source packet to a predetermined client 20 for each packet.
- the source 'packets making up the stream are transmitted to at least one client included in a given group, and the client receiving the source packet transmits the source packet to another client included in the given group.
- Send a copy of the received source 'packet (hereinafter referred to as a copy packet) to the client.
- the downstream client that has received the copy packet accumulates the copy 'packet for a predetermined period of time, and after a predetermined period of time, uses the packet identifier attached to the packet, for example, as a serial number to create a stream. Reconstruct and display or play digital 'content on the client. That is, in the present invention, the server 14 provides the same digital content to clients belonging to a predetermined group without transmitting duplicate packets for one group for each client. Make it possible.
- FIG. 2 shows an outline of the path tree structure configured in the present invention.
- the l: l: (m ⁇ l) tree structure of the configured tree structures forms one transmission path of a packet.
- a path is formed in two stages: a first stage path of a server intermediate node and a second stage path of an intermediate node and a client. It is assumed that no relay has more than two stages.
- FIG. 1 shows a first stage path of a server intermediate node and a second stage path of an intermediate node and a client. It is assumed that no relay has more than two stages.
- the server 14 selects one client 20a in the group as an intermediate node, and first transmits a source packet to the client 20a selected as the intermediate node.
- the client 20a functioning as an intermediate node that has received the source packet transmits the received packet to the clients 20b to 20d included in the group, thereby enabling sharing of the packet within the group.
- the number of clients 20a, which are regarded as intermediate nodes is not limited to one as shown in FIG. 2 (a).
- one or more clients can be dynamically selected. The selection of the intermediate node in the present invention will be described later in more detail.
- FIG. 2A shows an embodiment of a complete graph formed between the server 14 and each of the clients 20a to 20e in the specific embodiment shown in FIG. 2A.
- selection of a path in packet units can be considered as selection of a subtree structure (path tree structure) from a complete graph.
- each client is dynamically changed to be upstream or downstream of another client in the path tree structure. Become. Referring to the complete graph of the specific embodiment of the present invention shown in FIG.
- each stream of source ⁇ Transmit packets without duplicate packets.
- each Clients 20a-20e receive source packets that form part of the stream without duplication.
- clients belonging to the same group mutually copy the missing packets as copy 'packets, thereby compensating for the lack of packets for reconstructing one stream and recovering one stream.
- the above-described client function is referred to as a peer-to-group type distribution.
- Each packet is given a serial number in advance as a packet identifier in accordance with the streaming protocol, so that each client can recover the missing packet and the packet order in the stream.
- Figure 3 shows the source 'packet sending group # 1 from server 14 described above. 1 schematically illustrates a process of copying a client and transmitting a packet.
- the moving image data obtained at the server 14 is streamed and divided into a plurality of packets, and each source packet has, for example, a packet identifier of P1 to P5. Is attached.
- the size of the source 'packet shown in FIG. 3 is not particularly limited in the present invention, and can be any size.
- the stream 24 split into source'packets P1 to P5 is transmitted to group # 1 via the first network, for example, the Internet or a LAN or WAN belonging to a different domain.
- the first network for example, the Internet or a LAN or WAN belonging to a different domain.
- each of the clients 20a to 20e has substantially the same throughput, and each of the clients 20a to 20e has an intermediate capacity.
- the source 'packets PI to P5 are selected and transmitted to the clients 20a to 20e one packet at a time.
- the function of the client 20a that has received the packet PI will be described in detail.
- Each client 20a-20e includes a member 'list corresponding to the client belonging to group # 1 and referring to the member' list, within the group, for example, any previously known According to a communication protocol such as TCP / IP, UDP, or promiscuous mode, for example, by executing a broadcast communication, a copy 'packet is transmitted to the other clients 20b to 20e.
- a copy'packet When transmitting a copy 'packet, a copy' packet destined for each IP address of another client can be transmitted more reliably immediately after arrival of the source 'packet or at a fixed time interval. Transmission methods that can be used in The other clients 20b to 20e receive the copy 'packet from the client 20a and accumulate the copy' packet in the reception buffer.
- the other clients 20b to 20e also transmit the copy / packet, and each client can ensure that the processing of the subsequent stream is not affected, for example, in about 1 second or less.
- the packet is stored in the reception buffer for a predetermined period, and after the predetermined period has elapsed, the reception buffer ⁇ is designated in the reception buffer of the client 20a in accordance with the packet identifier.
- source 'packets for one stream are stored in the order of "? 1? 2? 3? 4? 5".
- the client 20a copies the packets and copies accumulated during a predetermined period; a FEC decoder, a source's decoder, etc., and a moving image for one stream; reconstructs the data as ⁇ PIP2P3P4P5 '' It becomes possible.
- the order of received packets can be recorded in the order in which they are received, not stored as a serial number, and sorted and reconfigured.
- FIG. 4 shows a case where a client to be an intermediate node is dynamically selected in the present invention. It is a figure showing an embodiment of a case.
- a network is constructed between the server 14 and the client 20 using a connection-oriented connection such as TCP. As shown in FIG.
- the server 14 monitors the throughput to each client and selects a client stochastically according to the magnitude of the throughput, as described in more detail later. The client with the highest throughput is not always selected. Then, the selected client 20b is set as the first intermediate node, and the first source 'packet P1 is transmitted. Further, the server 14 continuously monitors the change in the throughput of the client at a frequency of, for example, about several seconds or less, and dynamically selects an intermediate node from the client having a small overhead at that time. For example, in the embodiment shown in FIG.
- the client 20d has the smallest overhead at that time, and is therefore selected by the server 14 as an intermediate node, and the source packet, for example, the source packet P3 is It is shown receiving.
- the server 14 transmits the duplicated packet as the source 'packet of only one stream without transmitting the duplicated packet to the clients constituting the group # 1. It is possible to make all clients in group # 1 hold digital content.
- the present invention makes it possible to distribute the load concentration on the server 14 when transmitting data to the clients included in the group # 1 conventionally, and to distribute the load concentration to the entire network. And improve the scalability of traffic in the network.
- FIG. 5 shows the traffic of packets transmitted to and received from the client 20a according to the present invention. It is assumed that n packets are transmitted from the server 14 to each client equally per unit time. nZ The source packet of m is sent from the server 14 to the client 20a, and the client 20a receives the source packet sent from the server 14. The client that received the packet relays the received source.packet to the client m-1 (copy.packet delivery). The client 20a also receives a copy packet from another client at the same time.
- This communication traffic volume does not increase or decrease in the number of packets as compared with the case of the conventional example using the conventional Edge 'server configuration. The above-mentioned packet transmission amount is satisfied even when the clients are not evenly selected.
- the number of packets that each client needs to perform input / output processing per unit time is the case of equal selection, nZm from server 14 and ⁇ n / mX (m-1) ⁇ from other clients.
- This client selection process is proportional to the number m of clients, and does not depend on the number of clients at all in terms of the number of packet transmissions. Therefore, even if the number of clients increases, the digital content distribution of the present invention does not cause any inconvenience in network scalability.
- the present invention also envisages the opposite case of equal selection, i.e., where only one client receives all source 'packets from server 14. Even in this case, the number of input packets to the client is Since it is the same as in the conventional case, n source .packets are input by the selected client. Also, the output of the copy packet from the client that received the source packet is n X m packets only at that client.
- the path tree structure is dynamically selected so that the source packet is not biased and transmitted to only a single client described above, and the selection is as close as possible to the uniform selection.
- the path tree structure is dynamically selected, rather than statically using one or more of the clients and using it statically. In selecting the path tree structure,
- a path tree structure for transmitting a packet is dynamically configured.
- the above-described condition confirmation processing of (a) can be realized using a connection-oriented connection such as TCP.
- the RTT measurement described in (b) When sending a source 'packet, for example, using the format of IP v4, the time is recorded in the IP header part of the transmitted packet, and the client receiving the source' packet writes only the IP header part.
- the time recorded in the IP header, etc. such as returning it as is, or using a unique header generated at the application level separately, recording the time in the unique header, and returning this unique header as it is, etc.
- a method that uses the difference from the time when the server receives the return can be used.
- the time when the server 14 transmits the source packet can be stored, the response. Packet from the client can be received, and the time of the response 'packet's IP header can be read and confirmed.
- the copy rate which is the condition described in (c), uses the success rate at which packets can be sent from the intermediate client to the downstream client.
- the cause of the fluctuation of the copy rate may be that in a connection-oriented network such as a TCP, an intermediate client discards a packet due to a time limit.
- the copy rate is calculated from the packet arrival rate to the downstream client.
- FIG. 6 is a schematic diagram showing a case where a client is dynamically selected as an intermediate node in the present invention.
- the server 14 selects the client 20e as an intermediate node and transmits the source packet.
- the client 20 e is selected as the client that has returned the earliest response at that time, for example, in response to the start of digital content distribution from the server 14. Can be specified.
- a client other than client 20e does not return a response to server 14 for a pre-determined threshold time if another client is performing other processing, or has a lower RTT than client 20e. For example, it was not selected as an intermediate node because it was later than the set threshold.
- the client 20 e is judged to have sufficient processing capability as viewed from the server 14, and is determined to be an intermediate node that receives the source ′ packet.
- the client 20e that has received the source packet transmits a copy packet to another client in the group # 1 using, for example, broadcast.
- an assignment weight can be given between clients in relation to the RTT as described below. For example, in the most preferred embodiment of the present invention, the allocation weights that can be employed can be given based on the following equation:
- t k r k is,'. Lambda .: copy.
- the client is proportional to the number of packets that can be processed in other words a unit time. Therefore, the objective of this allocation method is to maximize effective throughput, that is, to maximize stability.
- the above conditions can be applied to each source 'packet.
- the allocation weight of the source 'packet can be updated periodically at predetermined time intervals. Clients that cannot receive the packet at each point are already excluded from the path selection, so even if there is an error in the assigned weight, there will be no serious situations where the source packet is lost. Further, in another embodiment of the present invention, the effective throughput can be determined using only the RTT. ⁇ B— 4> Dynamic reconfiguration
- the present invention further flexibly responds to changes in the network configuration by automatically responding to an increase in new clients when a new client is added to a group recognized by the server. Make it possible to respond.
- FIG. 7 shows processing of the server 14 when a new client is added to the group # 1 in the present invention.
- the client 20f communicates with the server 14 using, for example, the IP address of the server 14 obtained from another client. And send a JOIN request.
- the JOIN request can include the client identifier such as the IP address obtained or assigned by the newly joined client 2Of.
- the server 14 receives the JOIN request, and adds the client identifier of the client 20f to the client 'list of the group # 1 held in the server 14 and used as the destination list.
- a NEW MEMBER notification for notifying the clients 20a to 20d included in the group # 1 of the addition of a new client is sent to the IP address of the group # 1, for example. Broadcast using broadcast communication.
- the clients 20a to 20c in the group # 1 that received the NEW MEMBER notification update the member's list and register as a copy-packet distribution destination.
- the server 14 transmits a CONNECT request indicating that the connection has been completed to the newly joined client 20f.
- the CONNECT request can include a client identifier corresponding to a member of a client constituting the group # 1 held by the server 14.
- Client 20f receives the CONNECT request and updates the member's list. In order to do this, the applicant must belong to the same applicant. 00 2—08 8 70
- the automatic IP address acquisition method described in No. 2 can be used. If you can use the automatic IP address acquisition method disclosed in Japanese Patent Application No. 200 2-0 887 02, the member's list is already stored in each client 20a to 20f. The transmission of the NEW MEMBER notification from the server 14 may not be required.
- the server 14 can determine a path including the newly joined client 20f in the path tree structure for distributing digital contents.
- the client 20f immediately after the client 20f has joined, the client 20f is added at the most downstream of the created path tree structure, and the copy 'packet is transmitted from the other clients 20a to 20c. It can be configured to acquire.
- a new path tree structure including the client 20f is built upon path selection after a predetermined period of time in the RTT monitor.
- a large RTT is previously given as an initial value (large value) as shown in the following equation, and the source ⁇
- the frequency of receiving packets can be reduced.
- Figure 8 shows that the source packet is transmitted from the server 14 to the newly joined client 20f based on the newly created path tree new structure, and the other clients 20a to 20c The packet is sent to the newly joined client 20f. It is shown as being sent.
- the server 14 can know the leaving of the client via a connection-oriented network. Note that even if the client terminates abnormally, the disconnection can be detected, but in cases such as when the network is disconnected, an event occurs in which it cannot be detected until the timeout occurs. In the present invention, even if a timeout occurs, the source 'packet is not sent to the client due to the dynamic selection rule (confirmation of reception possibility), so that the packets received by other clients are simultaneously sent.
- the server 14 that recognizes the departure of the participating client immediately discards the path tree structure in which the client is an intermediate node, and prevents loss of the source packet.
- Clients that remain in Group # 1 can distribute the received source packets according to the member's list, or receive copies in Group # 1 when sending copy-based packets on a broadcast basis. It can also send copy packets to all new clients. Also, the remaining client can delete the detached client from the lowermost stream of the entire path tree structure by canceling the connection between the detached client and itself. Also, some of the source 'packets sent to the leaving client may be discarded with leaving without being relayed.
- FIG. 9 is a functional block diagram showing the configuration of the client 20 described in the present invention.
- Client 20 is connected to a second network 22 via a network interface card (NIC) 30.
- NIC network interface card
- the client 20 further includes a reception buffer 32, a memory 34, and a memory 36 such as RAM.
- the reception buffer 32 holds the received source 'packet and copy' packet until reconstructing the video image data stream.
- the reception buffer 32 can be configured as a ring buffer that writes a received packet to an address corresponding to a packet identifier each time a received packet is received.
- the client 20 includes a central processing unit (CPU) 36, a source decoder 38, and an FEC decoder 40.
- the FEC decoder is not always required in the present invention.
- the CPU 36 is driven by a clock, reads out packets stored in the reception buffer 32 at predetermined intervals, sends the packets to the source decoder 38 and the FEC decoder 40, and outputs a video image of one stream.
- .Data is being reconstructed.
- the reconstructed moving image image data for one stream is displayed or reproduced on the display 42 and provided to the client user.
- the moving image data displayed or played back to the user can be deleted from the client 20, or the entire stream from the start to the end of the digital content can be stored in the memory 34, and the Alternatively, it may be stored in a storage device 44 such as a magneto-optical disk-magnetic tape.
- the storage device 44 can also hold a member 'list configured to include a client identifier for identifying a client constituting the group # 1, for example.
- the member list is stored in the storage device 44 and the client memory 36 when the client starts. Where they are read and kept as resident files.
- the client shown in FIG. 9 receives the source packet, the client 20 designates the destination to which the copy packet is to be delivered by referring to the member 'list.
- the client 20 broadcasts the copy packet in accordance with the TCPZIP protocol, for example, with the destination in a format of IPv4 such as abc.def.ghi.255, the above-mentioned member—list is directly referred to No need.
- FIG. 10 is a diagram showing a configuration of the server 14 of the present invention.
- the server 14 shown in FIG. 10 is connected to the network 12 via a communication means 46 such as a modem, a DSU, or a network 'interface' card, and transmits digital 'content' to a client (not shown). Has been delivered.
- a communication means 46 such as a modem, a DSU, or a network 'interface' card
- An imaging means 48 such as a digital 'video camera' is connected to the server 14 shown in FIG. 10, and programs, lectures, greetings, educational programs, etc., which are desired to be distributed as digital 'contents, Recorded as digital data on a recording medium.
- the recorded digital data is taken into the server 14 via an appropriate interface, and is stored in, for example, the storage device 50. It is preferable that the digital data in the present invention is configured as multimedia data including the moving image data described above.
- the CPU 52 When transmitting digital 'contents to the client, first, the CPU 52 reads the digital' contents from the storage device 50 and sources the read digital 'contents to the encoder 54 and the FEC encoder 56. And send.
- the digital 'data receiving source' encoder 54 and the FEC encoder 56 perform streaming processing on the digital 'data, and further divide one stream into packets of a predetermined size, for example, packets P1 to P5.
- the generated packets P1 to P5 distribute digital content to, for example, group # 1 via the communication means 46.
- FIG. 11 illustrates the configuration of the embodiment of the source 'packet 58 that can be used in the present invention, using an IP header as an example.
- the source 'packet 58 transmitted from the server 14 includes, for example, an IP header 58a, and the IP header 58a includes a source address and a destination address 58b.
- the source packet 58 includes a digital packet 58c for distribution, a data packet 58c, a packet identifier 58d assigned as a serial number, for example, P1, and a source packet transmission time 58e.
- the above-mentioned / kucket 58c, the knotting knowledge IJ child 58d, and the transmission time! ! 58e can be configured as a unique packet created at the application 'level.
- the IP header 58a includes IP version information, a source IP address, and the like, and is configured so that the server 14 can determine the RTT based on a reply from the client.
- the server 14 can monitor the time at which the source packet, for example, P1 was transmitted, using a timer or the like.
- the response packet from the client that has received the source packet P1 is returned to the server 14 via the network 12, and is stored in an appropriate storage unit in the server 14, and the client transmits the response packet.
- the transmission time is read from the time recorded in, for example, the transmission time attached to the response 'packet.
- FIG. 11 (b) shows an embodiment of the configuration of the response 'packet 60 from the client. As shown in FIG. 11 (b), the response 'packet 60 includes an IP header 60a, and the IP header 60a includes the source address and the destination address 6 Ob as described above.
- the response packet 60 includes the received digital data packet identifier 60c, the time 60d when the client issued the response 'packet 60', and the transmission time 58e of the packet which transmitted the source 'packet P1. It is comprised including.
- the IP header 60a records the time at which the client transmitted the response 'packet 60 ', the source IP address of the source client, and the like. In the present invention, when the server 14 receives the response 'packet 60, the source' packet 58 and the response.The identifier included in the packet 60, and in the embodiment shown in FIG.
- the source 'response' packet corresponding to the reception of the packet 54 is determined using the packet identifier P1, and in a specific embodiment of the present invention, the transmission time 58 e and the issue time 60 e Calculate the RTT using 1 / RTT and the copy's rate to determine the client's effective throughput.
- the determined effective throughput is used, for example, after averaging for a certain period of time, to update the client 'list shown in FIG. Further, in another embodiment of the present invention, when the time is recorded in the IP header, the time recorded in the IP header can be directly used.
- FIG. 12 is a diagram showing an embodiment of a client 'list 62 used by the server 14 in the present invention. The client's list 62 shown in FIG.
- the 12 includes a group identifier 62 a registered when the server 14 distributes digital content, a client's address 62 b of clients included in a given group, and And the effective throughput 62c averaged for a predetermined period.
- the group identifier 62 a can be created by a content provider such as a television broadcasting station, a satellite broadcasting station, and an event “provider” by registration from a user.
- the server 14 is not a content provider and the server 14 distributes digital content via an intranet such as a company, government agency, legal institution, legislative institution, educational institution, or library, each company or institution should For example, IP addresses assigned to each group can be used.
- the client's address 62b is in a particular embodiment of the present invention.
- the IP address assigned to a specific group can be used.
- the effective throughput 62c shown in FIG. 12 is an essential parameter in the present invention used for the above-mentioned assignment weighting.
- the above-mentioned weighting stabilizes the path tree structure by preventing unnecessary fluctuations, secures the stability and reliability of the network, and removes, participates, or participates in the client.
- they are averaged over a time interval of, for example, about 1 second, and are updated regularly as effective throughput.
- the server 14 transmits, for example, source packets P1 to P3 to the client 20b according to the weights to the client 20b and the client 20c, and transmits source 'packets P4 and P5 to the client 20c.
- Source sent packet copied from client 20b, 20c selected as intermediate node to other clients in group # 1; sent as packets cPl-cP5 and received by each client After being stored in a buffer and stored for a predetermined time, it is used to reconstruct one stream. It should be noted that in other embodiments of the present invention, the number of source 'packets to be transmitted may be transmitted to the intermediate node at any other ratio.
- FIG. 14 is a diagram showing a second embodiment of the digital content distribution system of the present invention.
- the digital 'content distribution system shown in Fig. 14 uses a source server 64 for generating digital content, and a digital data stored in the source' server 64 and subjected to streaming processing and extracted and stored. Drain 'group 66 connected to server 66 via network 12 # 2 and G # 3. The clients included in each group are selected as intermediate nodes according to the present invention, and are configured to distribute digital content in the group.
- FIG. 15 is a block diagram showing the configuration of the source server 64 and the client shown in FIG. As shown in FIG. 15 (a), the source server generates streamed digital content from the generated digital data using the source 'decoder 64a and the FEC encoder 64b.
- FIG. 15 (b) shows the configuration processing on the client side.
- the client 20 receives the copy packet, accumulates the packet for a predetermined period, and reconstructs one stream of digital content using the FEC decoder 38 and the source decoder 40, and provides the digital content to the user. .
- the client 20a selected as the intermediate node copies the received source packet and sends it to other clients as a copy packet.
- D Digital 'Source' Packet Communication Protocol for Content Distribution 'FIG. 16 is a diagram showing, in chronological order, source' packet communication between the server and the client of the present invention.
- Source packets sent from the server are sent to any client at regular intervals.
- the client that receives the packet returns a response 'packet Ack (acknowle dgenmt)' to the server.
- the client is configured to report the copy success rate (copy 'rate) to the server periodically (eg, every second).
- the time from when the packet is sent to when the server receives the Ack is used as the RTT (Round-Trip Time) to determine the allocation weight of the intermediate node in the path tree structure.
- RTT Red-Trip Time
- FIG. 17 is a diagram showing the transmission of source packets and copy packets between clients selected as intermediate nodes in the present invention in time series between each client and server.
- Client a which receives source packets P1 and P2 from the server, sends copies 'packets # 1 and # 2 of packets P1 and P2' to client b of the same group. The copy success rate is periodically reported to the server.
- the server also sends packet P3 to client b, which sends copy packet # 3 to client a.
- the client a holds the packets P1 to P3 in the reception buffer, and the above-described process is sequentially repeated to accumulate packets for one stream.
- FIG. 18 is a flowchart showing the processing of the client of the present invention.
- the client selected as the intermediate node is always in a state of waiting for the arrival of the source 'packet, and monitors the arrival of the packet in step S100.
- the storage position in the reception buffer is calculated from the packet identifier in step S102.
- step S104 it is determined whether or not the buffer corresponding position is empty. If it is empty (yes), since the packet of the corresponding number has not yet arrived, in step S112, Write the received packet.
- step S114 it is determined whether or not the received packet is a source 'packet, for example, the arrival of the source' packet using the source address included in the IP header.
- step S116 reserve copy processing for transmission to other clients in the group.
- the reservation of the copy processing can be performed, for example, by registering a copy of the received packet in an appropriate FIFO buffer.
- the process returns to step S100 and waits for the arrival of a packet.
- the corresponding buffer 'address is not empty in the determination in step S104 (no)
- the packet with the packet identifier has already arrived.
- step S106 it is determined whether or not the packet with the identifier is reserved for copy processing. If the reservation is registered (yes), the source. Packet will be erased by overwriting.
- step S108 the reservation is deleted in step S108, the copy failure counter is incremented in step S110, and the In step S112, the packet received at that time is overwritten in the corresponding buffer position. This corresponds to the loss of the packet, which corresponds to the arrival of the following packet before the client sends a copy of the source 'packet. If it is determined in step S106 that the reservation has not been registered in the copy process (no), the process proceeds to step S112, and since the packet is a copy 'packet', the packet is overwritten on the corresponding buffer 'address. Step S100 is repeated.
- FIG. 19A is a diagram showing a flowchart of the copy processing in the present invention. The copy processing shown in FIG.
- step S120 waits until a source packet requiring the copy processing is registered in step S120.
- Source When the packet is registered, select the packet registered in step S122, for example, the previously registered packet if registered using the FIFO buffer in the described embodiment. Then, in step S124, it is broadcasted as a copy 'packet to another client, or transmitted individually to the other client by referring to the destination IP address. Thereafter, in step S128, the copy success counter is incremented, and the process returns to step S120 and waits.
- the ratio of the above-mentioned copy success counter to (copy success counter + copy failure counter) is sent to the server as the copy rate. If it is too low, processing such as retransmitting packets for one stream again is performed.
- FIG. 19 (b) is a flowchart showing a process performed by the server when an unexpected client detachment occurs or when it is detected that the corresponding client has a serious failure.
- the server constantly monitors the effective throughput of the client via the RTT and the copy rate. If no response packet is received within the threshold time, it is determined that the client has left or failed.
- FIG. 20 is a diagram showing another more specific embodiment of the digital content distribution system of the present invention.
- the embodiment shown in FIG. 20 is specifically an embodiment in the case where the present invention is applied to an in-house broadcast such as a lecture using an intranet in a business office. In the embodiment shown in FIG.
- the intranet in the office is connected to the end 'router 70 located in each section by a network 72 such as Ethernet (registered trademark) or Fiber Channel.
- a network 72 such as Ethernet (registered trademark) or Fiber Channel.
- connection is made using the router 74.
- the client 20 configures a network of about 3,000 units as a whole network. In the configuration shown in Fig.
- the sender 78 sends a packet to all clients, it is a packed bone.Even if a packed bone 'router with a band width of l Gbps is used as the router 74, for example, Video images that require a transmission speed of 8 Mbps' Data cannot be transmitted smoothly. For example, digital content distribution on a digital 'versatile' disk (DVD) is impossible using conventional methods. .
- the packet duplication avoidance of the present invention is not used, even in the case of 100 clients, a user cannot receive digital content in real time.
- the client 20 can perform the same switching using, for example, 100 Mbps Ethernet (registered trademark).
- the communication speed of the peer-to-peer connection between clients is expected to be 40 to 5 OMbps, so for example, transmission and reception of 8 Mbps in MPEG 4 There is no problem.
- the server 78 will transmit as many streams as the number of groups. If there are 30 end routers that connect 100 PCs under the control, a group can be assigned to each end router. In this case, 30 streams will be transmitted from the server 78 directly connected to the backbone router 74 at a consumption of 240 Mbps. In the embodiment shown in FIG.
- FIG. 21 is a diagram showing another specific embodiment of the present invention, in which digital content is simultaneously received by a plurality of clients 20 from a server 14 arranged on the Internet. An embodiment is implemented in accordance with the present invention. In the embodiment shown in FIG.
- FIG. 21 is a diagram showing still another embodiment of the present invention capable of reducing a load on a server on a wireless network.
- the processing at the server 14 is only transmission of a stream according to the number of groups and dynamic selection of a path.
- the additional overhead added is small.
- the reproduction of MP EG 2 and MP EG 4 requires much more CPU resources, so that the load on the client 20 may be higher than that on the server 14.
- the intranet connected via the wireless network even from the server 14 which is located on the wireless' network and has a small CPU resource. For example, it is possible to simultaneously deliver the MPEG4 stream at 384kbps to multiple clients located above.
- E Digital content distribution system that performs pseudo-tunnel distribution for digital content distribution
- FIG. 23 shows a digital content distribution system capable of performing pseudo tunnel distribution in the present invention.
- the digital 'content distribution system 80 shown in FIG. 23 includes a server 82 for receiving and holding digital' content from a sender and a group 84a to 84c including a plurality of clients 86. It is composed of the affiliated clients 86.
- the server 82 and the groups 84a to 84c are interconnected by a first network such as the Internet via a router 88.
- the clients 86 belonging to the group are interconnected by LANs configured in the group. Data sharing and information communication are enabled.
- the number of groups shown in FIG. 23 is not limited to the number shown in the drawings, and The number of clients is not limited to the number shown in the drawings.
- each group comprises a plurality of larger global groups G 1, and similarly configured global groups G 2 and G 3 are connected to the first network 12.
- the digital content can be distributed from the server 82 to G2 and G3, but different servers can be used.
- the function of the content distribution system 80 shown in FIG. 23 will be described in detail.
- the server 82 receives the digital content to be distributed from the sender server managed by the provider, or the server 82
- the digital content is stored in a storage means 90 such as a hard disk by inputting the content into a moving image or a file format in 82.
- the digital content is held in an appropriate buffer memory (not shown) included in the server 82.
- the held digital 'content is subjected to streaming processing in the server 82, divided into a plurality of segments, and generated as a source' packet.
- the generated source packet is transmitted to a client 86, which is selected using the execution throughput or the like according to the method of the present invention.
- the client 86 receives the source 'packet, it performs a digital' copy 'of the entire global group by performing a copy of the source' packet within the group or a copy of the packet between groups as shown in Figure 23. It allows content sharing.
- the client 86 also includes an application such as Windows Multimedia Player (trademark) for playing digital content, and stores digital content stored in the buffer memory of each client 86. Performs playback processing every minute and provides digital content to users. Functioning.
- an application is included in each client, and digital contents are stored for each client 86.
- the pseudo-tunnel distribution can be executed by describing in the source packet the data that causes the server 82 to execute the “copy” of the packet within the group or between the groups.
- the client stores the destination list selected from the client's list, determines the reception of the source 'packet, refers to the destination list, and transmits the copy packet.
- the transmission time description area 92a includes copy instruction flag areas 92c and 92d for instructing whether or not to execute a copy of the data, and a data packet description area 92e composed of digital content substantial data.
- the time when the server first sent the packet could be in any format recognizable by the client and the server.
- the transmission time description area 92a determines the client to which the supervisor 82 sends each packet.
- the packet identifier description area 92b is an area for recording the source number transmitted by the server 82 and the serial number attached to the packet.
- the copy instruction flag area 92c is used when the client reconstructs the chronological order of the source and source packets. This is an area in which the true / false flag of whether to make a copy is described, and the client sends a copy of all received packets for which the flag in this area is true to all clients in the group.
- the copy instruction flag area 92d stores the copy between groups. This is an area in which a true / false flag indicating whether or not to perform the first operation is described, and the client performs a process of transmitting a packet for which this flag is true to one of the clients in each of the other groups in the global group. Execute.
- the data.packet description area 9 2 d is an area in which the substantial data of the digital ′ content to be transmitted by the server 82 and reproduced by the client 86 is described. In the present invention, other additional elements may be added before, after or between these elements, or the order of the elements may be changed. In some cases, some elements may be omitted.
- the source 'packet 92 is configured to include a destination IP address specifying a destination when transmitting the source packet 92 and a source IP address, as shown in Fig. 11. .
- FIG. 24 (b) shows a second embodiment of the source packet generated by the content distribution server 82 of the present invention. In the embodiment shown in FIG. 24 (b), the source.
- Packet itself includes a list of clients to which a copy of the packet is to be transmitted, and specifies the delivery destination in more detail.
- the server 82 refers to the client 'list held by the server itself and describes the list of the transmission destinations in the source' packet 92.
- the source 'packet 92 shown in FIG. 24 (b) includes a transmission time description area 92a and a packet identifier description area 92b, which are the same as those described in FIG. 24 (a). It has a function to make the client execute this function.
- the source 'packet 92 shown in FIG. 24 (b) is provided with a copy instruction data area 92f for specifying the copy destination specified by the server 82.
- the client When the client determines that the source packet has been received, it reads the copy instruction data area 92f and executes the processing described below.
- the value N_dest described in the copy instruction data area 92f specifies the list length of the destination to which the copy is to be transmitted, and the values D estl to D est N are the IP addresses specifying the clients to which the copy 'packet is to be transmitted.
- Client identifiers such as can be used. For example, if your group is specified in the copy instruction data area 9 2 f, If so, the client sends its copy only to clients in the group.
- FIG. 24 (c) is a diagram showing a third embodiment of the source packet 92 used in the present invention. The embodiment shown in FIG.
- the client pre-stores the copy destination in the memory Alternatively, select from the clients' list stored in the storage device such as the hard disk, and select a client in another group that has an address in the address range assigned within a range that does not overlap with other clients, and Can be created. In the case of distributing copy packets within a group in the embodiment of FIG. 24 (c), distribution can be performed by executing broadcast communication within the group.
- the client sends a copy of each packet to the other clients in the group and receives a copy of the packet received by one of the clients belonging to each of the other groups in the global group. 'You can decide in advance to send a copy of the packet.
- the source 'packet shown in FIG. 24 (c) that can be used in this embodiment includes a transmission time description area 92a, a packet identifier description area 92b, and a data' packet description area 92e. And force, et al, is composed of the copy 'packet's destination is not included.
- the client distributes the copy packet to the copy destination list or the designated client.
- FIG. 25 is a flowchart showing a process executed by the server of the pseudo tunnel distribution of the present invention. In the pseudo tunnel distribution of the present invention, the server determines whether or not a new client has joined the group in step S130. 03 07093
- step S 52 Monitor the notification (Jo in request) sent from the server and make a judgment. If the server finds a newly joining client (yes), the server assigns a smaller value in advance to the execution throughput of the newly joining client in step S 132, and This prevents large amounts of source 'packets from being sent to newly joining clients. Then, in step S134, the server adds the client to the client 'list and enables digital' content to be delivered.
- the client can be identified by an identifier assigned to the client, for example, an IP address, a client name arbitrarily assigned to the client, and the like.
- step S136 the server notifies all clients including the newly joined client in the global group that the new client has joined the global group and an identifier such as its IP address.
- FIG. 26 is a diagram showing the process of the server and the client in the process of distributing digital content.
- the server refers to the client 'list and obtains the highest execution throughput or round' trip time (RTT). Select the smallest client and send the first source 'packet with reference to the client's IP address and so on.
- RTT round' trip time
- the same source 'packet is delivered to only one client belonging to the global group.
- the client receives the packet in step S142 and the packet received in step S144 Determines if the packet is a source packet from the server.
- the source packet can be determined using, for example, a source address, a copy instruction flag, and whether or not a copy instruction data area is included in the source 'packet. Further, in the present invention, a copy of the source 'packet can be created in any format as long as it can be determined that the packet is a copy' packet.
- the source's packet that can be used most universally can be determined using the source IP address in the packet because the IP address assigned to the server is usually a fixed IP address . If it is determined in step S144 that the packet is a source 'packet (yes), the client determines in step S146 the destination described in the source' packet or the destination shown in FIG. 24 (c). In the embodiment using the source 'packet, a copy of the source' packet is transmitted to a pre-registered distribution destination by referring to a copy destination list. In this case, the transmission of the copy packet is performed by including two processes. That is, (i) the source. The copy 'packet is transmitted to all the clients belonging to the group to which the client receiving the packet belongs.
- the group to which the client receiving the source' packet does not belong is assigned to each group. Select one of the clients in the group and send a copy of this packet. This selection can be set in advance, or the RTT of the client to be sent should be monitored according to an appropriate standard method, and a response with a small response time can be determined in the same way as the content distribution server. You can also select and send dynamically. If it is determined in step S144 that the received packet is not a source packet (no), the received packet is to be stored by the client, and in step S148, the client receives the received copy 'packet. Is stored in a ring buffer or the like, processing for digital content reproduction is started, and the process returns to step S142 to repeat processing for the next packet.
- FIG. 27 is a simplified diagram illustrating the process of transmitting and receiving a packet between the server and the client described above.
- client a is denoted by G
- Global group G belongs to group SG @ yi @ Z , and group 30 @ 1 @ 2 to 30 @@ 2 (1 ⁇ 1 ⁇ 1 ⁇ .
- Client a Sends a copy of the source 'packet received from server 82 to all clients belonging to group SG @ yi @ z and to one client b in each of the other (m-1) groups.
- the clients included in the global group G can receive packets from the server 82 and clients in other groups and clients in the same group.
- the source' packet is Since duplicate transmission is not performed, packet duplication at the client can be completely avoided, and there is no problem of packet duplication at the client and the resulting problem of processing duplicate packets, and smooth digital content
- the client stores a predetermined amount of source packets and copy 'packets in a ring-buffer, and then provides these packets to the application to transmit the digital' content.
- the server Enables distribution of digital content without squeezing communication bandwidth for all groups and clients Only one set of packets is sent from the server to the global group.
- One set includes source 'packet and copy' packets, and the average number of transmitted packets is one set or less per group.
- the average number of transmitted packets is one set or less per group.
- one received packet and one transmitted packet Is less than one set on average.
- the number of all clients included in the global group is defined as m again, and M is defined as the number of groups constituting the global group.
- the client statistically receives a set of 1 / m source 'packets and divides the received source packets into the group ( Copy to the client at m / M-1) and distribute to other groups at (M-1).
- the following equation is obtained.
- the client has been described as holding a pair of a digital content and an application for reproducing digital content.
- the client and the application can be operated on the same computer, but as will be described in more detail later, the application can also share digital content, as described later. Implementation It is not limited to the form.
- the server for generating digital 'contents' and the server for transmitting source' packets by performing streaming processing can be operated on the same computer, or can be separated from each other. Can be configured as When these are configured as separate computers, the communication between the provider and the server may be multicast or unicast using a communication protocol such as UDP or TCP. In this respect, the present invention is different from a so-called multicast 'tunnel' and enables to provide the same effect as multicast without using IP multicast at all between the server and the client.
- FIG. 28 is a diagram showing the timing of packet transmission and reception between the server and the client. As shown in FIG. 28, the server sends the source packet # 1 to the client # 1 at time tl.
- Client # 1 that has received the source packet #i sends a signal "Ack" notifying that the source packet has been received to the server.
- the server receives the signal "Ack” at time t2, calculates the time difference (t2-tl), and updates the execution throughput of the corresponding client in the client 'list.
- Client # 1 receives the source 'packet #i and generates a copy immediately' packet, and at time t3, the client of the group to which client # 1 belongs, in the embodiment shown in FIG. Copy to 2 ⁇ Send packet #i. At the same time, client # 1 sends a copy 'packet #i to client # 3, which belongs to another group.
- Client # 2 receives copy 'packet #i at time t4, and client # 3 receives copy' packet #i at time t5.
- Client # 3 sends a signal "Ack2" notifying that it has received the copy 'packet #i to client # 1, and signal "Ack2" is received by client # 1 at time t6.
- the client # 1 calculates the execution throughput in the group, for example, as a time difference (t6 ⁇ t3), and updates the corresponding client 'list in the list.
- client # 3 is JP03 / 07093
- FIG. 29 is a diagram showing another embodiment of the pseudo tunnel distribution system of the present invention.
- the bandwidth of reception / transmission (downlink / uplink) is asymmetric. The embodiment shown in FIG.
- FIG. 29 is effective when the bandwidth of the uplink is designed to be small in the network on the client side.
- a server sends a source 'packet
- at least a part of the source' packet is sent to a plurality of clients.
- clients belonging to different groups can be selected in ascending order of round trip time (RTT).
- RTT round trip time
- the source packet transmitted to a plurality of clients can use the source 'packet configuration shown in FIG. 24 (b) and directly specify which group and which client to copy.
- the client that receives source # packet # i copies the source packet # i to another group where the same source packet # i has not been sent before.
- the source 'packet #i' can describe the address of the group that sent the same source 'packet #i', and send a 'copy' packet to the group excluding the group of the described address. . Furthermore, by using the pseudo-tunnel distribution shown in Fig. 29, the traffic between groups can be reduced, and uplink packets can be reduced. Can be reduced. On the other hand, from the viewpoint of the server, the load becomes high because the same source 'packet needs to be transmitted to multiple clients.
- FIG. 30 is a diagram showing still another embodiment of the pseudo tunnel distribution system of the present invention.
- copy 'packets are not transmitted and received between clients in the group.
- the client instead of sending a packet directly from the client to the application, the client sends the received packet using broadcast or LAN-local multicast referred to as a third network. .
- FIG. 30 shows still another embodiment of the pseudo tunnel distribution system of the present invention.
- copy 'packets are not transmitted and received between clients in the group.
- the client instead of sending a packet directly from the client to the application, the client sends the received packet using broadcast or LAN-local multicast referred to as a third network. .
- the application is stored on another computer 94, and the computer 94 storing the application is used to play digital content from a client 86 via a third network 96. To obtain the required packets and play digital content.
- a wireless network or an Ethernet (registered trademark) is acceptable, but a third network used in the embodiment shown in FIG. 30 of the present invention.
- the network may be a network having a purpose different from that of the second network, for example, using Ethernet (registered trademark).
- the computer 94 storing the application can receive and play the packet which is updated by all the clients 86 in the group on the third network every time. Content can be played smoothly without excess or shortage. Further, in the embodiment shown in FIG.
- the application can receive the packet without being paired with the client.
- the client 86 can configure a pseudo tunnel without having to acquire and store all packets, which reduces the amount of communication traffic and saves hardware resources on the client side, while reducing digital 'content'. Distribution becomes possible.
- a dynamic path is optimized on a packet-by-packet basis, so that the system is less affected by client participation and withdrawal, and the client You can join or leave at any time.
- the system is hardly affected by disconnection due to abnormal termination or disconnection of the cable, and the stability can be improved.
- the burden on clients is basically evenly distributed, and the reception function works as a whole global group (distributed coordination), so no special auxiliary server is required.
- the burden on clients is basically evenly distributed, and the reception function works as a whole global group (distributed coordination), so no special auxiliary server is required.
- the burden on clients is basically evenly distributed, and the reception function works as a whole global group (distributed coordination), so no special auxiliary server is required.
- the burden on clients is basically evenly distributed, and the reception function works as a whole global group (distributed coordination), so no special auxiliary server is required.
- the load on the server is significantly reduced, and computers that can only use resources equal to or less than the client are allowed.
- it can function as a server.
- the present invention for a given global group including a plurality of groups connected to each other via a network and each including a plurality of clients, the overhead of communication traffic to the server is provided.
- Digital 'content distribution system that enables smooth and efficient distribution of digital' content while reducing the number of servers, as well as servers and clients therefor, and to make computers function as the above-mentioned servers and clients It is possible to provide a control method, a program for them, and a computer-readable recording medium on which the program is recorded.
- Multicast benefits include the ability to distribute packets in a non-overlapping manner to use the network more efficiently and avoid congestion, and eliminate the need for costly replacement work at the network layer.
- the properties are inherited without any loss, and it is possible to deliver excellent digital content.
- the second network can include a server such as a printer server, a mail server, and an appliance server.
- Means or portions for realizing the above-described functions of the present invention can be configured as software or a group of software modules described in a computer-executable program language, and are not necessarily configured as functional blocks illustrated in the drawings. No need to be done.
- the above-described program for executing the digital content distribution of the present invention can be described using various programming languages, for example, C language, C ++ language, Java (registered trademark), and the like.
- the code describing the program of the present invention is stored in a computer-readable recording medium such as a magnetic tape, a flexible disk, a hard disk, a compact disk (CD), a magneto-optical disk, and a digital versatile disk (DVD). be able to.
- a computer-readable recording medium such as a magnetic tape, a flexible disk, a hard disk, a compact disk (CD), a magneto-optical disk, and a digital versatile disk (DVD).
- FIG. 1 is a schematic diagram showing a digital content distribution system according to the present invention.
- FIG. 2 is a schematic diagram of a path tree structure configured in the present invention.
- FIG. 3 is a diagram schematically showing a process of transmitting a source “packet transmission or client copy” packet from a server.
- FIG. 4 is a diagram showing an embodiment in which a client to be an intermediate node is dynamically selected in the present invention.
- FIG. 5 is a diagram showing traffic of packets transmitted to and received from a client according to the present invention.
- FIG. 6 is a schematic diagram of a case where a client is dynamically selected as an intermediate node in the present invention.
- FIG. 1 is a schematic diagram showing a digital content distribution system according to the present invention.
- FIG. 2 is a schematic diagram of a path tree structure configured in the present invention.
- FIG. 3 is a diagram schematically showing a process of transmitting a source “packet transmission or client copy” packet from a server.
- FIG. 7 is a diagram showing processing of a server when a new client is added to group # 1 in the present invention.
- FIG. 8 is a diagram showing a process for a client who has newly joined based on a newly generated path tree new structure.
- FIG. 9 is a functional block diagram showing a configuration of a client according to the present invention.
- FIG. 10 is a functional block diagram showing the configuration of the server of the present invention.
- FIG. 11 is a diagram showing an embodiment of a source packet that can be used in the present invention.
- FIG. 12 shows an embodiment of a client 'list used by a server in the present invention.
- FIG. FIG. 13 is a diagram showing an embodiment of a path tree structure of the present invention selected by a server.
- FIG. 14 is a diagram showing a digital content distribution system according to a second embodiment of the present invention.
- FIG. 15 is a block diagram showing the configuration of the source server and client shown in FIG.
- FIG. 16 is a diagram showing, in chronological order, communication of source 'packets between the server of the present invention and the client.
- FIG. 17 is a diagram showing transmission of source 'packet and copy' packets between clients selected as intermediate nodes in the present invention in time series between each client and server.
- FIG. 18 is a flowchart showing processing of the client according to the present invention.
- FIGS. 19A and 19B are flowcharts of the copy processing in the present invention, and FIG.
- FIG. 19B is a flowchart for detecting that an unexpected client detachment has occurred or that the corresponding client has a serious failure.
- 9 is a flowchart showing the processing of the server in the case of performing the processing.
- FIG. 20 is a diagram showing another embodiment of the digital content distribution system of the present invention.
- FIG. 21 is a diagram showing still another embodiment of the digital content distribution system of the present invention.
- FIG. 22 is a diagram showing still another embodiment of the present invention, which makes it possible to reduce the load on a server on a wireless network.
- FIG. 23 is a block diagram showing the configuration of the content distribution system of the present invention.
- FIG. 24 is a diagram showing another embodiment of a source 'packet that can be used in the present invention.
- FIG. 25 is a flowchart of a process for executing content distribution according to the present invention.
- FIG. 26 is a flowchart showing processing of the server / client when executing the content distribution of the present invention.
- FIG. 27 is a diagram showing a simplified flow of a source 'packet and a copy' packet distributed by the content distribution of the present invention.
- FIG. 28 shows still another embodiment of the content distribution system of the present invention.
- FIG. 29 is a diagram showing still another embodiment of the content distribution system of the present invention.
- FIG. 30 is a diagram showing still another embodiment of the content distribution system of the present invention.
- Figure 31 is a schematic diagram of a conventional IP multicast system.
- Figure 32 is a schematic diagram of digital content distribution using a conventional application-level 'multicast method.
- Figure 33 is a schematic diagram of a conventional digital content distribution system that connects a client to an edge server.
- Figure 34 is a schematic diagram showing the distribution of conventional digital 'digital' using 'tunneling'.
- Figure 35 is a schematic diagram showing the communication traffic environment in the distribution of conventional digital 'digital using tunneling' content.
Abstract
Description
Claims
Priority Applications (6)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN038114313A CN1656749B (zh) | 2002-06-06 | 2003-06-04 | 数字内容分发系统、方法、程序及服务器和客户机 |
JP2004512360A JP4034780B2 (ja) | 2002-06-06 | 2003-06-04 | ディジタル・コンテンツ配信システム、ディジタル・コンテンツ配信方法、該方法を実行するためのプログラム、該プログラムを記憶したコンピュータ可読な記録媒体、およびそのためのサーバおよびクライアント |
US10/523,347 US7809850B2 (en) | 2002-06-06 | 2003-06-04 | Digital content delivery system, digital content delivery method, program for executing the method, computer readable recording medium storing thereon the program, and server and client for it |
KR20047018062A KR100754293B1 (ko) | 2002-06-06 | 2003-06-04 | 디지털 콘텐츠 배포 시스템, 디지털 콘텐츠 배포 방법, 이 방법을 실행하기 위한 프로그램을 기억한 컴퓨터 판독 가능한 기록 매체, 및 이를 위한 서버 및 클라이언트 |
EP03736036A EP1533952A4 (en) | 2002-06-06 | 2003-06-04 | SYSTEM AND METHOD FOR DISTRIBUTING DIGITAL CONTENTS, PROGRAM FOR EXECUTING SAID METHOD, COMPUTER-READABLE RECORDING MEDIUM STORING THIS PROGRAM, AND SERVER AND CLIENT THEREFOR |
AU2003242053A AU2003242053A1 (en) | 2002-06-06 | 2003-06-04 | Digital content delivery system, digital content delivery method, program for executing the method, computer-readable recording medium storing thereon the program, and server and client for it |
Applications Claiming Priority (4)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP2002165014 | 2002-06-06 | ||
JP2002-165014 | 2002-06-06 | ||
JP2002-303850 | 2002-10-18 | ||
JP2002303850 | 2002-10-18 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2003105421A1 true WO2003105421A1 (ja) | 2003-12-18 |
Family
ID=29738332
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/JP2003/007093 WO2003105421A1 (ja) | 2002-06-06 | 2003-06-04 | ディジタル・コンテンツ配信システム、ディジタル・コンテンツ配信方法、該方法を実行するためのプログラム、該プログラムを記憶したコンピュータ可読な記録媒体、およびそのためのサーバおよびクライアント |
Country Status (8)
Country | Link |
---|---|
US (2) | US7809850B2 (ja) |
EP (1) | EP1533952A4 (ja) |
JP (1) | JP4034780B2 (ja) |
KR (1) | KR100754293B1 (ja) |
CN (1) | CN1656749B (ja) |
AU (1) | AU2003242053A1 (ja) |
TW (1) | TWI265697B (ja) |
WO (1) | WO2003105421A1 (ja) |
Cited By (19)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2006025408A (ja) * | 2004-07-07 | 2006-01-26 | Microsoft Corp | ピアツーピアコンピュータネットワーク内の効率的な一対多コンテンツ配信 |
JP2006079606A (ja) * | 2004-09-03 | 2006-03-23 | Microsoft Corp | ピアツーピアネットワークでの受信側主導のシステム及び方法 |
JP2006099531A (ja) * | 2004-09-30 | 2006-04-13 | Nec Personal Products Co Ltd | コンテンツ配信管理サーバ、ユーザ端末装置、コンテンツ配信システム及びそれらの方法並びにプログラム |
JP2006319909A (ja) * | 2005-05-16 | 2006-11-24 | Konica Minolta Holdings Inc | データ通信の方法、ピアツーピア型のネットワーク、および情報処理装置 |
WO2007020774A1 (ja) * | 2005-08-19 | 2007-02-22 | Brother Kogyo Kabushiki Kaisha | 情報通信システム、情報通信方法、情報通信システムに含まれるノード装置および情報処理プログラムを記憶した記憶媒体 |
WO2008015982A1 (fr) * | 2006-07-31 | 2008-02-07 | International Business Machines Corporation | système de transmission d'informations par l'intermédiaire d'un réseau, procédé et programme informatique |
JP2008512931A (ja) * | 2004-09-10 | 2008-04-24 | ネイダーランゼ、オルガニザティー、ボー、トゥーゲパストナトゥールウェテンシャッペルーク、オンダーツォーク、ティーエヌオー | マルチキャスト送信の逆多重化のための方法およびデバイス |
JP2008117091A (ja) * | 2006-11-02 | 2008-05-22 | Nippon Hoso Kyokai <Nhk> | ファイル転送システムおよびその方法、管理装置ならびにサーバ |
JP2008193178A (ja) * | 2007-01-31 | 2008-08-21 | Hewlett-Packard Development Co Lp | データストリーミング方法 |
CN100421433C (zh) * | 2006-05-29 | 2008-09-24 | 中国移动通信集团公司 | 内容信息的分发方法 |
US7502863B2 (en) | 2004-10-19 | 2009-03-10 | International Business Machines Corporation | Method of distributing stream data and system thereof |
JP2009517921A (ja) * | 2005-11-29 | 2009-04-30 | 株式会社ソニー・コンピュータエンタテインメント | ピアツーピア・オーバレイ・ネットワークにおける同報通信メッセージング |
JP2009135883A (ja) * | 2007-10-30 | 2009-06-18 | Kyocera Corp | Ip放送受信装置 |
JP2011040980A (ja) * | 2009-08-11 | 2011-02-24 | Fuji Xerox Co Ltd | 装置管理システム、管理対象装置、およびプログラム |
JP2011186797A (ja) * | 2010-03-09 | 2011-09-22 | Toshiba Corp | データ通信装置及び方法 |
JP2014164556A (ja) * | 2013-02-26 | 2014-09-08 | Nippon Telegr & Teleph Corp <Ntt> | ブートイメージ配信方法及びブートイメージ配信システム |
US8853363B2 (en) | 2003-11-26 | 2014-10-07 | MAX-PLANCK-Gesellschaft zur Förderung der Wissenschaften e.V. | Substance binding human IgG Fc receptor IIb (FcγRIIb) |
US8892625B2 (en) | 2007-03-20 | 2014-11-18 | Thomson Licensing | Hierarchically clustered P2P streaming system |
JP2015177344A (ja) * | 2014-03-14 | 2015-10-05 | 富士通株式会社 | 配信方法、再生装置、配信装置、転送制御プログラムおよび配信制御プログラム |
Families Citing this family (72)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7260602B2 (en) * | 2003-03-31 | 2007-08-21 | Microsoft Corporation | System and method of network content location for roaming clients |
KR100651566B1 (ko) * | 2003-08-26 | 2006-11-28 | 삼성전자주식회사 | 이동통신 단말기에서 출력 버퍼링을 이용한 멀티미디어재생 장치 및 그 제어 방법 |
US7295525B2 (en) * | 2003-09-11 | 2007-11-13 | Sun Microsystems, Inc. | System and method for managing multicast group membership |
US20050122973A1 (en) * | 2003-12-09 | 2005-06-09 | Samsung Electronics Co., Ltd. | Network node capable of restricting a packet receiving activity during packet congestion and method thereof |
US20060098664A1 (en) * | 2004-11-09 | 2006-05-11 | Tvblob S.R.I. | Intelligent application level multicast module for multimedia transmission |
US20060176895A1 (en) * | 2005-02-07 | 2006-08-10 | Yakov Kamen | Data delivery pipeline optimized by cell-based data cascade technology |
WO2006085377A1 (ja) * | 2005-02-10 | 2006-08-17 | Fujitsu Limited | データ配信方法及び端末 |
EP1701486A1 (en) * | 2005-03-07 | 2006-09-13 | BRITISH TELECOMMUNICATIONS public limited company | Route selection in multi-hop cellular network |
US8730985B2 (en) | 2005-03-15 | 2014-05-20 | Time Warner Cable Enterprises Llc | Technique for providing on a program channel composite programming content attributed to different sources |
US8423728B1 (en) * | 2005-06-16 | 2013-04-16 | Emc Corporation | Physical based scheduler using run count and skip count values |
US7719988B1 (en) * | 2005-11-30 | 2010-05-18 | University Of Murcia | Mobility-aware mesh construction algorithm for low data-overhead multicast ad hoc routing |
US7680894B2 (en) * | 2006-01-09 | 2010-03-16 | Thomson Licensing | Multimedia content delivery method and system |
US7647405B2 (en) * | 2006-02-06 | 2010-01-12 | International Business Machines Corporation | Method for reducing variability and oscillations in load balancing recommendations using historical values and workload metrics |
JP4692355B2 (ja) * | 2006-03-30 | 2011-06-01 | ブラザー工業株式会社 | 情報通信システム、情報通信方法、情報通信システムに含まれるノード装置および情報処理プログラム |
US9198084B2 (en) | 2006-05-26 | 2015-11-24 | Qualcomm Incorporated | Wireless architecture for a traditional wire-based protocol |
JP2007336182A (ja) * | 2006-06-14 | 2007-12-27 | Funai Electric Co Ltd | コンテンツ配信システム、及びネットワークサーバ |
JP4287448B2 (ja) * | 2006-06-16 | 2009-07-01 | 株式会社東芝 | 通信装置、通信端末装置、通信システム、方法およびプログラム |
KR101145848B1 (ko) * | 2006-11-29 | 2012-05-17 | 삼성전자주식회사 | 콘텐츠 전송을 위한 접근 제어 방법 및 상기 접근 제어방법을 이용하는 네트워크의 노드 |
KR100748229B1 (ko) * | 2006-12-12 | 2007-08-10 | (주)지티앤에스 | 서버/클라이언트 시스템에서 업로드 데이터들의 우선순위결정방법 및 이를 이용한 경매 시스템 |
US7630370B2 (en) | 2007-02-28 | 2009-12-08 | Sharp Laboratories Of America, Inc. | Overlay join latency reduction using preferred peer list |
KR101409991B1 (ko) | 2007-04-16 | 2014-06-20 | 삼성전자주식회사 | P2p 통신 환경에서의 데이터 전송 방법 및 장치 |
JP2008294626A (ja) * | 2007-05-23 | 2008-12-04 | Brother Ind Ltd | コンテンツ分散保存システム、コンテンツ保存方法、ノード装置、及びノード処理プログラム |
US20090077254A1 (en) * | 2007-09-13 | 2009-03-19 | Thomas Darcie | System and method for streamed-media distribution using a multicast, peer-to- peer network |
US8904022B1 (en) * | 2007-11-05 | 2014-12-02 | Ignite Technologies, Inc. | Split streaming system and method |
JP4840334B2 (ja) * | 2007-11-14 | 2011-12-21 | ブラザー工業株式会社 | 端末装置、通信システム、プログラム及び方法 |
US7441135B1 (en) | 2008-01-14 | 2008-10-21 | International Business Machines Corporation | Adaptive dynamic buffering system for power management in server clusters |
US8379851B2 (en) * | 2008-05-12 | 2013-02-19 | Microsoft Corporation | Optimized client side rate control and indexed file layout for streaming media |
TWI395428B (zh) * | 2008-05-13 | 2013-05-01 | Tien Ming Wang | 對等式網路控制系統 |
US8102865B2 (en) * | 2008-05-16 | 2012-01-24 | Microsoft Corporation | Group based allocation of network bandwidth |
CN101291300B (zh) * | 2008-06-12 | 2011-04-20 | 华为技术有限公司 | 消息业务中文件传输的实现方法、装置和用户设备 |
US20100153578A1 (en) * | 2008-07-16 | 2010-06-17 | Nokia Corporation | Method and Apparatus for Peer to Peer Streaming |
US9398089B2 (en) | 2008-12-11 | 2016-07-19 | Qualcomm Incorporated | Dynamic resource sharing among multiple wireless devices |
US9264248B2 (en) | 2009-07-02 | 2016-02-16 | Qualcomm Incorporated | System and method for avoiding and resolving conflicts in a wireless mobile display digital interface multicast environment |
US20110229104A1 (en) * | 2009-10-22 | 2011-09-22 | Hundemer Hank J | System And Method For Recording and Playback Of Multimedia Content |
US9582238B2 (en) | 2009-12-14 | 2017-02-28 | Qualcomm Incorporated | Decomposed multi-stream (DMS) techniques for video display systems |
TW201209614A (en) | 2010-08-31 | 2012-03-01 | Ibm | Method for efficient response of Common Information Model (CIM) server |
JP5675234B2 (ja) * | 2010-09-10 | 2015-02-25 | 任天堂株式会社 | 情報処理システム、情報処理プログラムおよび情報処理方法 |
CN102412928B (zh) * | 2010-09-17 | 2017-03-01 | 株式会社Ntt都科摩 | 一种基于网络编码的数据传输方法及装置 |
US8516284B2 (en) | 2010-11-04 | 2013-08-20 | International Business Machines Corporation | Saving power by placing inactive computing devices in optimized configuration corresponding to a specific constraint |
US8964783B2 (en) | 2011-01-21 | 2015-02-24 | Qualcomm Incorporated | User input back channel for wireless displays |
US20130013318A1 (en) | 2011-01-21 | 2013-01-10 | Qualcomm Incorporated | User input back channel for wireless displays |
US10135900B2 (en) | 2011-01-21 | 2018-11-20 | Qualcomm Incorporated | User input back channel for wireless displays |
US9787725B2 (en) | 2011-01-21 | 2017-10-10 | Qualcomm Incorporated | User input back channel for wireless displays |
US9413803B2 (en) | 2011-01-21 | 2016-08-09 | Qualcomm Incorporated | User input back channel for wireless displays |
US9065876B2 (en) | 2011-01-21 | 2015-06-23 | Qualcomm Incorporated | User input back channel from a wireless sink device to a wireless source device for multi-touch gesture wireless displays |
US9503771B2 (en) | 2011-02-04 | 2016-11-22 | Qualcomm Incorporated | Low latency wireless display for graphics |
US10108386B2 (en) | 2011-02-04 | 2018-10-23 | Qualcomm Incorporated | Content provisioning for wireless back channel |
TW201238291A (en) * | 2011-03-14 | 2012-09-16 | Wistron Corp | Communication system and peer to peer transmission method |
FR2978003B1 (fr) * | 2011-07-11 | 2014-07-04 | Commissariat Energie Atomique | Procede de routage d'un flux en mode non-stockage |
US8792486B2 (en) * | 2011-08-31 | 2014-07-29 | Hewlett-Packard Development Company, L.P. | Packet routing within server device enclosure |
US9002931B2 (en) * | 2011-09-23 | 2015-04-07 | Real-Scan, Inc. | High-speed low-latency method for streaming real-time interactive images |
WO2013097184A1 (zh) * | 2011-12-30 | 2013-07-04 | 华为技术有限公司 | 业务分发方法、设备和系统 |
US9525998B2 (en) | 2012-01-06 | 2016-12-20 | Qualcomm Incorporated | Wireless display with multiscreen service |
US8868647B2 (en) * | 2012-01-11 | 2014-10-21 | Alcatel Lucent | Reducing latency and cost in resilient cloud file systems |
CN103209164A (zh) * | 2012-01-17 | 2013-07-17 | 上海狂龙数码科技有限公司 | 公共信息服务平台网络架构及数据传输方法 |
US9253124B2 (en) * | 2012-05-15 | 2016-02-02 | TV Band Service, LLC | Techniques for sending and relaying information over broadcast and non-broadcast communications media |
US9628373B2 (en) * | 2012-12-19 | 2017-04-18 | Comcast Cable Communications, Llc | Multipath communication in a network |
JP5724154B2 (ja) * | 2013-05-16 | 2015-05-27 | 株式会社Skeed | データ配信システム、データ配信のためのデータ通信装置およびプログラム |
CA2916655C (en) | 2013-07-17 | 2022-05-03 | Sony Corporation | Content supply device, content supply method, program, terminal device, and content supply system |
CN104753630A (zh) | 2013-12-27 | 2015-07-01 | 中兴通讯股份有限公司 | 一种数据传输方法和系统 |
US10306021B1 (en) * | 2014-08-21 | 2019-05-28 | Amazon Technologies, Inc. | Streaming content to multiple clients |
US10893266B2 (en) * | 2014-10-07 | 2021-01-12 | Disney Enterprises, Inc. | Method and system for optimizing bitrate selection |
CN105656794B (zh) * | 2014-11-14 | 2019-03-08 | 腾讯科技(深圳)有限公司 | 数据分发方法、装置及计算机可读存储介质 |
CN105656978B (zh) * | 2014-12-04 | 2019-06-25 | 中国移动通信集团公司 | 一种资源共享方法及装置 |
US10506257B2 (en) | 2015-09-28 | 2019-12-10 | Cybrook Inc. | Method and system of video processing with back channel message management |
US10756997B2 (en) | 2015-09-28 | 2020-08-25 | Cybrook Inc. | Bandwidth adjustment for real-time video transmission |
US10516892B2 (en) | 2015-09-28 | 2019-12-24 | Cybrook Inc. | Initial bandwidth estimation for real-time video transmission |
US10506245B2 (en) | 2015-11-18 | 2019-12-10 | Cybrook Inc. | Video data processing using a ring buffer |
US10506283B2 (en) * | 2015-11-18 | 2019-12-10 | Cybrook Inc. | Video decoding and rendering using combined jitter and frame buffer |
TWI586156B (zh) * | 2015-12-04 | 2017-06-01 | 鴻海精密工業股份有限公司 | 流媒體資料傳輸系統、傳輸方法及資料分佈伺服器 |
CN105549992A (zh) * | 2015-12-08 | 2016-05-04 | 北京奇虎科技有限公司 | 一种代码发布方法、装置和系统 |
KR102283635B1 (ko) * | 2020-11-11 | 2021-07-30 | (주)소셜인프라테크 | 복수 개의 노드 간 트랜잭션 정보의 상호 공유를 통한 디지털 콘텐츠 거래 중개 시스템 |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2001156855A (ja) * | 1999-11-30 | 2001-06-08 | Fujitsu Ltd | 動的情報バス生成方法及びサブネット管理プロセス |
JP2002135310A (ja) * | 2000-10-23 | 2002-05-10 | Nippon Telegr & Teleph Corp <Ntt> | ストリーム中継制御装置、ストリーム中継制御システム、ストリーム中継制御方法,ならびに該方法を記録した記録媒体 |
JP2002232466A (ja) * | 2000-11-30 | 2002-08-16 | Fujitsu Ltd | データの配布経路を生成する装置および方法 |
JP2003069639A (ja) * | 2001-08-27 | 2003-03-07 | Nec Corp | xDSL収容装置、マルチキャスト配信システム及びデータ配信方法 |
Family Cites Families (23)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5095444A (en) * | 1989-12-21 | 1992-03-10 | Legent Corporation | System and method for measuring inter-nodal transmission delays in a communications network |
ES2129038T3 (es) * | 1992-11-27 | 1999-06-01 | Ibm | Encaminamiento a destinos multiples entre dominios. |
US5864854A (en) * | 1996-01-05 | 1999-01-26 | Lsi Logic Corporation | System and method for maintaining a shared cache look-up table |
US5790541A (en) * | 1996-04-01 | 1998-08-04 | Motorola, Inc. | Apparatus, method, system and system method for distributed routing in a multipoint communication system |
US5778187A (en) * | 1996-05-09 | 1998-07-07 | Netcast Communications Corp. | Multicasting method and apparatus |
US5946316A (en) * | 1997-01-17 | 1999-08-31 | Lucent Technologies, Inc. | Dynamic distributed multicast routing protocol |
US6622157B1 (en) * | 1998-09-28 | 2003-09-16 | Certeon, Inc. | Extending network services using mobile agents |
US6850965B2 (en) * | 1998-11-17 | 2005-02-01 | Arthur Douglas Allen | Method for connection acceptance and rapid determination of optimal multi-media content delivery over network |
US6502140B1 (en) * | 1999-01-29 | 2002-12-31 | International Business Machines Corporation | Multicast support for small groups |
RU2001130759A (ru) * | 1999-04-15 | 2003-07-20 | Скайстрим Нетворкс Инк. (Us) | Система радиовещания данных |
EP1063814A1 (en) * | 1999-06-24 | 2000-12-27 | Alcatel | A method to forward a multicast packet |
JP2001036549A (ja) * | 1999-07-15 | 2001-02-09 | Toshiba Corp | データ処理システムおよびタイムスタンプ生成方法 |
JP3793941B2 (ja) * | 2000-02-24 | 2006-07-05 | 株式会社日立製作所 | 映像配送システムにおけるビデオサーバ装置およびその映像配送方法。 |
US20030115351A1 (en) * | 2001-12-14 | 2003-06-19 | Giobbi John J. | Digital content distribution system and method |
KR100391016B1 (ko) * | 2001-08-29 | 2003-07-12 | 한국전자통신연구원 | 엑스캐스트를 이용한 멀티캐스트 데이터 전송 방법 |
US20040030929A1 (en) * | 2001-11-06 | 2004-02-12 | Depeng Bi | Digital audio and video distribution transmission and playback |
US7304955B2 (en) * | 2002-03-28 | 2007-12-04 | Motorola, Inc. | Scalable IP multicast with efficient forwarding cache |
US7317721B1 (en) * | 2002-04-12 | 2008-01-08 | Juniper Networks, Inc. | Systems and methods for memory utilization during packet forwarding |
US7305483B2 (en) * | 2002-04-25 | 2007-12-04 | Yahoo! Inc. | Method for the real-time distribution of streaming data on a network |
US20030204602A1 (en) * | 2002-04-26 | 2003-10-30 | Hudson Michael D. | Mediated multi-source peer content delivery network architecture |
US7289503B1 (en) * | 2002-07-10 | 2007-10-30 | Juniper Networks, Inc. | Systems and methods for efficient multicast handling |
US7263099B1 (en) * | 2002-08-14 | 2007-08-28 | Juniper Networks, Inc. | Multicast packet replication |
US7519054B2 (en) * | 2005-01-27 | 2009-04-14 | Intel Corporation | Replication of multicast data packets in a multi-stage switching system |
-
2003
- 2003-06-02 TW TW92114899A patent/TWI265697B/zh not_active IP Right Cessation
- 2003-06-04 US US10/523,347 patent/US7809850B2/en active Active
- 2003-06-04 AU AU2003242053A patent/AU2003242053A1/en not_active Abandoned
- 2003-06-04 JP JP2004512360A patent/JP4034780B2/ja not_active Expired - Fee Related
- 2003-06-04 WO PCT/JP2003/007093 patent/WO2003105421A1/ja active Application Filing
- 2003-06-04 EP EP03736036A patent/EP1533952A4/en not_active Withdrawn
- 2003-06-04 KR KR20047018062A patent/KR100754293B1/ko not_active IP Right Cessation
- 2003-06-04 CN CN038114313A patent/CN1656749B/zh not_active Expired - Fee Related
-
2009
- 2009-08-09 US US12/538,145 patent/US8130757B2/en active Active
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2001156855A (ja) * | 1999-11-30 | 2001-06-08 | Fujitsu Ltd | 動的情報バス生成方法及びサブネット管理プロセス |
JP2002135310A (ja) * | 2000-10-23 | 2002-05-10 | Nippon Telegr & Teleph Corp <Ntt> | ストリーム中継制御装置、ストリーム中継制御システム、ストリーム中継制御方法,ならびに該方法を記録した記録媒体 |
JP2002232466A (ja) * | 2000-11-30 | 2002-08-16 | Fujitsu Ltd | データの配布経路を生成する装置および方法 |
JP2003069639A (ja) * | 2001-08-27 | 2003-03-07 | Nec Corp | xDSL収容装置、マルチキャスト配信システム及びデータ配信方法 |
Non-Patent Citations (1)
Title |
---|
See also references of EP1533952A4 * |
Cited By (27)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US8853363B2 (en) | 2003-11-26 | 2014-10-07 | MAX-PLANCK-Gesellschaft zur Förderung der Wissenschaften e.V. | Substance binding human IgG Fc receptor IIb (FcγRIIb) |
JP2006025408A (ja) * | 2004-07-07 | 2006-01-26 | Microsoft Corp | ピアツーピアコンピュータネットワーク内の効率的な一対多コンテンツ配信 |
JP2006079606A (ja) * | 2004-09-03 | 2006-03-23 | Microsoft Corp | ピアツーピアネットワークでの受信側主導のシステム及び方法 |
JP2008512931A (ja) * | 2004-09-10 | 2008-04-24 | ネイダーランゼ、オルガニザティー、ボー、トゥーゲパストナトゥールウェテンシャッペルーク、オンダーツォーク、ティーエヌオー | マルチキャスト送信の逆多重化のための方法およびデバイス |
US8699395B2 (en) | 2004-09-10 | 2014-04-15 | Nederlandse Organisatie Voor Toegepast-Natuurwetenschappelijk Onderzoek Tno | Method and device for inverse multiplexing of multicast transmission |
JP2006099531A (ja) * | 2004-09-30 | 2006-04-13 | Nec Personal Products Co Ltd | コンテンツ配信管理サーバ、ユーザ端末装置、コンテンツ配信システム及びそれらの方法並びにプログラム |
JP4555042B2 (ja) * | 2004-09-30 | 2010-09-29 | Necパーソナルプロダクツ株式会社 | コンテンツ配信管理サーバ、コンテンツ配信管理方法並びにプログラム |
US7502863B2 (en) | 2004-10-19 | 2009-03-10 | International Business Machines Corporation | Method of distributing stream data and system thereof |
JP2006319909A (ja) * | 2005-05-16 | 2006-11-24 | Konica Minolta Holdings Inc | データ通信の方法、ピアツーピア型のネットワーク、および情報処理装置 |
US8059561B2 (en) | 2005-08-19 | 2011-11-15 | Brother Kogyo Kabushiki Kaisha | Information communication system, information communication method, node device included in information communication system, and recording medium having information processing program recorded on it |
WO2007020774A1 (ja) * | 2005-08-19 | 2007-02-22 | Brother Kogyo Kabushiki Kaisha | 情報通信システム、情報通信方法、情報通信システムに含まれるノード装置および情報処理プログラムを記憶した記憶媒体 |
JP2009517921A (ja) * | 2005-11-29 | 2009-04-30 | 株式会社ソニー・コンピュータエンタテインメント | ピアツーピア・オーバレイ・ネットワークにおける同報通信メッセージング |
JP4671306B2 (ja) * | 2005-11-29 | 2011-04-13 | 株式会社ソニー・コンピュータエンタテインメント | ピアツーピア・オーバレイ・ネットワークにおける同報通信メッセージング |
CN100421433C (zh) * | 2006-05-29 | 2008-09-24 | 中国移动通信集团公司 | 内容信息的分发方法 |
JP4787881B2 (ja) * | 2006-07-31 | 2011-10-05 | インターナショナル・ビジネス・マシーンズ・コーポレーション | ネットワークを介した情報伝達システム、方法、コンピュータ・プログラム |
JPWO2008015982A1 (ja) * | 2006-07-31 | 2009-12-24 | インターナショナル・ビジネス・マシーンズ・コーポレーションInternational Business Maschines Corporation | ネットワークを介した情報伝達システム、方法、コンピュータ・プログラム |
WO2008015982A1 (fr) * | 2006-07-31 | 2008-02-07 | International Business Machines Corporation | système de transmission d'informations par l'intermédiaire d'un réseau, procédé et programme informatique |
JP2008117091A (ja) * | 2006-11-02 | 2008-05-22 | Nippon Hoso Kyokai <Nhk> | ファイル転送システムおよびその方法、管理装置ならびにサーバ |
JP2008193178A (ja) * | 2007-01-31 | 2008-08-21 | Hewlett-Packard Development Co Lp | データストリーミング方法 |
US8892625B2 (en) | 2007-03-20 | 2014-11-18 | Thomson Licensing | Hierarchically clustered P2P streaming system |
JP2009135883A (ja) * | 2007-10-30 | 2009-06-18 | Kyocera Corp | Ip放送受信装置 |
JP2011040980A (ja) * | 2009-08-11 | 2011-02-24 | Fuji Xerox Co Ltd | 装置管理システム、管理対象装置、およびプログラム |
JP2011186797A (ja) * | 2010-03-09 | 2011-09-22 | Toshiba Corp | データ通信装置及び方法 |
US9130957B2 (en) | 2010-03-09 | 2015-09-08 | Kabushiki Kaisha Toshiba | Data communication apparatus and method |
JP2014164556A (ja) * | 2013-02-26 | 2014-09-08 | Nippon Telegr & Teleph Corp <Ntt> | ブートイメージ配信方法及びブートイメージ配信システム |
JP2015177344A (ja) * | 2014-03-14 | 2015-10-05 | 富士通株式会社 | 配信方法、再生装置、配信装置、転送制御プログラムおよび配信制御プログラム |
US10284681B2 (en) | 2014-03-14 | 2019-05-07 | Fujitsu Client Computing Limited | Distribution method, playback apparatus, and distribution apparatus |
Also Published As
Publication number | Publication date |
---|---|
US8130757B2 (en) | 2012-03-06 |
EP1533952A4 (en) | 2009-01-14 |
TWI265697B (en) | 2006-11-01 |
EP1533952A1 (en) | 2005-05-25 |
US20100067534A1 (en) | 2010-03-18 |
CN1656749B (zh) | 2011-01-12 |
KR100754293B1 (ko) | 2007-09-03 |
US20060168104A1 (en) | 2006-07-27 |
TW200402217A (en) | 2004-02-01 |
KR20050007533A (ko) | 2005-01-19 |
CN1656749A (zh) | 2005-08-17 |
JP4034780B2 (ja) | 2008-01-16 |
US7809850B2 (en) | 2010-10-05 |
JPWO2003105421A1 (ja) | 2005-10-13 |
AU2003242053A1 (en) | 2003-12-22 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
JP4034780B2 (ja) | ディジタル・コンテンツ配信システム、ディジタル・コンテンツ配信方法、該方法を実行するためのプログラム、該プログラムを記憶したコンピュータ可読な記録媒体、およびそのためのサーバおよびクライアント | |
Zhang et al. | RSVP: A new resource reservation protocol | |
US6778493B1 (en) | Real-time media content synchronization and transmission in packet network apparatus and method | |
US20050015511A1 (en) | Accelerated large data distribution in overlay networks | |
US9426195B2 (en) | System and method for distribution of data packets utilizing an intelligent distribution network | |
US8619775B2 (en) | Scalable flow transport and delivery network and associated methods and systems | |
US11057319B2 (en) | System and method for recovery of packets in overlay networks | |
US9143333B2 (en) | System and method for multicast transmission | |
US20050108419A1 (en) | Multicast peering | |
US20080215681A1 (en) | Network architecture for multi-user collaboration and data-stream mixing and method thereof | |
WO2004073269A1 (ja) | 伝送システム,配信経路制御装置,負荷情報収集装置および配信経路制御方法 | |
US20060233154A1 (en) | Server to network signaling method for rapid switching between anycast multicast sources | |
WO1997048051A1 (en) | Ip multicast data distribution system with guaranteed quality of service | |
Arefin et al. | OpenSession: SDN-based cross-layer multi-stream management protocol for 3D teleimmersion | |
WO2010011668A1 (en) | A scalable flow transport and delivery network and associated methods and systems | |
JP2009004930A (ja) | シェーピング装置およびルータ装置 | |
US20070204005A1 (en) | Multicast peering | |
Lucas et al. | Distributed Error Recovery for Continuous Media Data in Wide-Area Multicast | |
JP7473025B2 (ja) | コンテンツ配信システム、ユニキャストマルチキャスト変換装置、コンテンツ配信方法及びコンテンツ配信プログラム | |
Hutchison et al. | A critique of modern internet protocols: The issue of support for multimedia | |
Schulzrinne | IP networks | |
Sun | IP Networks | |
JP2023033600A (ja) | コンテンツ配信システム、ユニキャストマルチキャスト変換装置、コンテンツ配信方法及びコンテンツ配信プログラム | |
Naik et al. | Experiences with an architecture for a distributed multimedia system | |
Krishnamohan | TIDE: A scalable continuous-media caching network |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AK | Designated states |
Kind code of ref document: A1 Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NI NO NZ OM PH PL PT RO RU SC SD SE SG SK SL TJ TM TN TR TT TZ UA UG US UZ VC VN YU ZA ZM ZW |
|
AL | Designated countries for regional patents |
Kind code of ref document: A1 Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZM ZW AM AZ BY KG KZ MD RU TJ TM AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LU MC NL PT RO SE SI SK TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
DFPE | Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101) | ||
WWE | Wipo information: entry into national phase |
Ref document number: 1020047018062 Country of ref document: KR |
|
WWE | Wipo information: entry into national phase |
Ref document number: 20038114313 Country of ref document: CN |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2004512360 Country of ref document: JP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2003736036 Country of ref document: EP |
|
WWP | Wipo information: published in national office |
Ref document number: 1020047018062 Country of ref document: KR |
|
WWP | Wipo information: published in national office |
Ref document number: 2003736036 Country of ref document: EP |
|
ENP | Entry into the national phase |
Ref document number: 2006168104 Country of ref document: US Kind code of ref document: A1 |
|
WWE | Wipo information: entry into national phase |
Ref document number: 10523347 Country of ref document: US |
|
WWP | Wipo information: published in national office |
Ref document number: 10523347 Country of ref document: US |