WO2008080343A1 - Procédé et appareil pour réduire un retard de lecture multimédia - Google Patents

Procédé et appareil pour réduire un retard de lecture multimédia Download PDF

Info

Publication number
WO2008080343A1
WO2008080343A1 PCT/CN2007/071309 CN2007071309W WO2008080343A1 WO 2008080343 A1 WO2008080343 A1 WO 2008080343A1 CN 2007071309 W CN2007071309 W CN 2007071309W WO 2008080343 A1 WO2008080343 A1 WO 2008080343A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
nodes
user
optimal
program content
Prior art date
Application number
PCT/CN2007/071309
Other languages
English (en)
French (fr)
Inventor
Hongguang Guan
Original Assignee
Huawei Technologies Co., Ltd.
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Huawei Technologies Co., Ltd. filed Critical Huawei Technologies Co., Ltd.
Priority to ES07846135T priority Critical patent/ES2405627T3/es
Priority to EP07846135A priority patent/EP2053859B1/en
Publication of WO2008080343A1 publication Critical patent/WO2008080343A1/zh
Priority to US12/393,627 priority patent/US8055793B2/en

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/104—Peer-to-peer [P2P] networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L65/00—Network arrangements, protocols or services for supporting real-time applications in data packet communication
    • H04L65/80—Responding to QoS
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
    • H04L67/1004—Server selection for load balancing
    • H04L67/101—Server selection for load balancing based on network conditions
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/104—Peer-to-peer [P2P] networks
    • H04L67/1061—Peer-to-peer [P2P] networks using node-based peer discovery mechanisms
    • H04L67/1063—Discovery through centralising entities
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/104—Peer-to-peer [P2P] networks
    • H04L67/1061—Peer-to-peer [P2P] networks using node-based peer discovery mechanisms
    • H04L67/1065—Discovery involving distributed pre-established resource-based relationships among peers, e.g. based on distributed hash tables [DHT] 
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/104—Peer-to-peer [P2P] networks
    • H04L67/1061—Peer-to-peer [P2P] networks using node-based peer discovery mechanisms
    • H04L67/1068—Discovery involving direct consultation or announcement among potential requesting and potential source peers
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/40—Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
    • H04N21/43—Processing of content or additional data, e.g. demultiplexing additional data from a digital video stream; Elementary client operations, e.g. monitoring of home network or synchronising decoder's clock; Client middleware
    • H04N21/432—Content retrieval operation from a local storage medium, e.g. hard-disk
    • H04N21/4325—Content retrieval operation from a local storage medium, e.g. hard-disk by playing back content from the storage medium
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/40—Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
    • H04N21/43—Processing of content or additional data, e.g. demultiplexing additional data from a digital video stream; Elementary client operations, e.g. monitoring of home network or synchronising decoder's clock; Client middleware
    • H04N21/44—Processing of video elementary streams, e.g. splicing a video clip retrieved from local storage with an incoming video stream or rendering scenes according to encoded video stream scene graphs
    • H04N21/44004—Processing of video elementary streams, e.g. splicing a video clip retrieved from local storage with an incoming video stream or rendering scenes according to encoded video stream scene graphs involving video buffer management, e.g. video decoder buffer or video display buffer
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/40—Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
    • H04N21/47—End-user applications
    • H04N21/478—Supplemental services, e.g. displaying phone caller identification, shopping application
    • H04N21/4788—Supplemental services, e.g. displaying phone caller identification, shopping application communicating with other users, e.g. chatting

Definitions

  • the present invention relates to the field of streaming media, and in particular, to a method and apparatus for reducing media playback delay.
  • Streaming media technology is a technology for distributing multimedia data streams over IP networks.
  • the traditional playback technology is that the client downloads the complete file from the server and plays it.
  • the streaming media technology uses the streaming method to compress and parse the entire multimedia file into multiple compressed packets, and the multiple data packets are sent to the client.
  • the user can decompress and play the compressed package sent before, and download the subsequent compressed package, thereby saving the user's time.
  • VOD Video
  • Video on demand is a process of converting a recorded video program into a digital video file that can be directly played by a computer through a series of processes such as capturing and compressing, and is stored on a server of the website for on-demand broadcasting by the user, and the user provides the video service provider through the terminal device.
  • Video and audio programs and can be advanced, reversed, paused, etc. during viewing of the program.
  • Video on demand has the advantages of fast, convenient, and good interactivity. As the network bandwidth continues to increase, the video on demand service will have a broader development prospects.
  • IPTV Internet Protocol
  • CDN technology the core idea of CDN technology is to push content from the center to the edge of the user, which not only effectively improves the quality of service for users to access content, but also reduces the pressure on the central equipment and backbone network.
  • the content service can be changed from the original single central service structure to the distributed service structure.
  • the user clicks on the program the user can obtain the required media content from the edge server close to the user, and the user is fast-forwarding.
  • you play back such as rewinding and dragging, you are getting resources on the same edge server.
  • P2P Peer-to-Peer-Peer-to-Peer
  • streaming media such as PPLive, PPStream and other P2P-based streaming media software.
  • the user node acts as a server to provide content to share the burden on the server, while increasing the scalability of the system and enhancing the distribution of media data.
  • the content provided by each node to other nodes is changed according to the content viewed by the node. The change, so that when the user performs media playback, fast rewind or drag and other playback operations, you need to re-search the corresponding source, and then establish a TCP connection.
  • FIG. 1 shows the implementation principle of a PPLive streaming software.
  • the user When the user performs a drag operation on the playback progress, the user first needs to go to the central server to query the user list, and then according to the current playback situation, The corresponding node establishes a corresponding TCP connection to play, which will inevitably increase the delay of media playback, and does not take into account the close relationship between the nodes.
  • the center server is responsible for constantly updating the content provided by each node, thereby increasing the burden on the central server.
  • each user node since each user node only stores a small amount of media content, in this case, if a user wants to access a complete program, it is necessary to access multiple user nodes to obtain all resources, when the user fast forwards When rewinding or dragging, users may have to cross different nodes that provide program content, re-search, and establish a TCP connection, which will inevitably increase the delay of media playback.
  • the embodiment of the present invention provides a method and apparatus for reducing media playback delay, thereby solving a drag operation of a user performing a playback progress during streaming media playback based on the P2P technology, and causing playback due to switching between nodes. Delayed question,
  • a method of reducing media playback delays including:
  • the user node obtains node list information that can provide program content that it needs to watch;
  • the user node selects an optimal node from all nodes in the program content that can provide the program content corresponding to the program content in each of the more than one inter-segment of the program content, the most The optimal node is a node that is closest to the user node among all the nodes;
  • the user node establishes a connection with an optimal node selected on each inter-segment, receives media stream data of the program content from the optimal node, and plays the media stream data.
  • a device for reducing media playback delay comprising: a node information acquisition module, an optimal node selection module, a connection establishment module, and a play module;
  • the node information acquiring module is configured to acquire node list information that can provide program content that the user node needs to watch;
  • the optimal node selection module is configured to select, from each node in the more than one inter-segment of the program content, from all nodes that can provide program content corresponding to the respective inter-segments An optimal node, the optimal node being the node closest to the distance among all the nodes;
  • connection establishing module is configured to establish a connection with the selected optimal node respectively
  • the playing module is configured to receive media stream data of the program content from the optimal node, and play the media stream data.
  • the embodiment of the present invention greatly increases the quality of service of the user's video on demand by selecting the optimal node as the node for providing the program content.
  • a TCP connection is established in advance with the optimal node in the local node list by the user node.
  • FIG. 1 is a schematic diagram of the implementation of PPLive streaming media software in the prior art
  • FIG. 2 is a flow chart of a method for reducing media playback delay according to an embodiment of the present invention
  • FIG. 3 is a schematic diagram of a user performing a drag and play operation according to an embodiment of the present invention
  • FIG. 4 is a structural diagram of an apparatus for reducing media playback delay according to an embodiment of the present invention.
  • the user receives the content while providing content to other people.
  • the embodiment of the present invention divides two buffers on the user node, and one can be defined as a receiving buffer for receiving the media stream data. Cache, for playback; another can be defined as a shared buffer for providing media services to other nodes, and the shared buffer also stores program content that can be provided to other sub-nodes, and the content of the program is quite long. constant.
  • the content of the program stored in the shared buffer of the user node is registered in the P2P network, so that the user does not have to search after performing the drag operation of the playback progress, and does not have to spend extra time to track the change of the dynamic buffer of the node.
  • DHT Distributed Hash
  • the network or central server obtains a list of nodes that can provide the content of the program, and then selects the optimal node from it.
  • RTT Random Trip
  • Time-to-round trip measures to find a node from the plurality of other user nodes that is closest to a certain user node as a node that provides the content of the program. Saving the plurality of other user node information to the local node list of one of the user nodes, and establishing a TCP connection with the nodes providing the program content in advance, on the one hand, to maintain communication status with other user nodes, and the other In order to save time during the user's execution of the drag-and-drop operation.
  • Step 101 Distribute program content information that can be viewed by each user node to a shared buffer of each user node.
  • the distribution operation of the above program content can be performed by the super node.
  • the principle of distribution is to prioritize the distribution of program content to online long-term, relatively stable user nodes.
  • Step 102 When the user node needs to order a certain program content, the DHT network or the central server is used to obtain a list of nodes containing the program content.
  • Step 103 The user node separately measures the distance from each node in the node list that contains the content of the on-demand program through the RTT, and saves the distance as the measurement data of the close relationship between the nodes to the user node. In the local node list.
  • the RTT measurement can be implemented using the command form of the ping packet or the measurement message of the application layer.
  • Step 104 The user node selects, according to the distance parameter in the local node list, the optimal node among all the nodes that can provide the program content corresponding to each inter-segment on each inter-segment of the above-mentioned certain program content. And the sub-optimal node, which is the node closest to the user node among all the nodes, and the sub-optimal node is the node closest to the user node among all the nodes. Then, all the optimal nodes are used as the primary nodes providing the same program content, and all the sub-optimal nodes are saved together as a standby node providing the same program content to the local node list of the user node.
  • Step 105 The user node establishes a TCP connection with each of the active nodes in the local node list.
  • the user node After a primary node goes offline, the user node establishes a TCP connection with the standby node of the active node of the offline line, or searches for a new primary node instead of the active node of the offline, and establishes a TCP connection. .
  • Step 106 The user node receives the media stream data from the active node through the receiving buffer, and plays the media stream data.
  • FIG. 3 is a schematic diagram of a user performing a drag-and-play operation.
  • five nodes, eight, B, C, D, and E continuously form all the media data of an on-demand program.
  • Nodes G and F have the same program content as nodes A and C, respectively, and their distance from the current user node is greater than the distance between A and C and the current user node, acting as a standby node for the A and C nodes.
  • Table 1 is a list of local nodes saved by the current user node, where the metric value is derived from the RTT measurement, or directly measured by the RTT measurement.
  • the user watches the program.
  • the user is watching the resources provided by the A node (indicated by the solid arrow in Figure 3), the user node and the four nodes C, D, E.
  • TCP pre-connections are established separately (the dotted arrows in Figure 3 indicate TCP pre-connections), called keep-alive connections.
  • the content is provided by the node C. Since the user node has established a TCP connection with the node C, the resource is directly acquired from the node C. It reduces the time to find and establish a TC P connection, and the connection to the A node becomes a keep-alive connection.
  • a TCP connection can be established with the standby node having the same program content. If there is no standby node, the DHT network or the server can be searched to find the primary standby node again. If the user starts clicking, the nodes in the node list obtained from the P2P network cannot provide complete on-demand content. For example, in FIG. 3, only four nodes A, B, D, and E are acquired, and the C node is For some reasons, such as sudden dropped calls, etc., in the process of user-on-demand, the P2P network can be queried intermittently. If a new node providing program content is queried, further query is made to the optimal one. Node, and add the node to the list of local nodes to establish a TCP connection.
  • the optimal number of nodes and the sub-optimal nodes can be found by calculating the hop count of the route.
  • the principle is as follows: The number of route hops between nodes having the same program content in the daytime, and finding two nodes having the same program content at the lowest and lowest number of route hops of the user node according to the number of route hops, that is, the optimal node and Suboptimal node.
  • the method for reducing the media playback delay by calculating the number of route hops is exactly the same as the above embodiment, and will not be described here.
  • an embodiment of the present invention further provides an apparatus for reducing media playback delay, including: a node information acquiring module, an optimal node selecting module, a connection establishing module, and a playing module; [47] the node information acquiring module is configured to obtain, by using a distributed hash table network or a central server, a list of all nodes that can provide program content that needs to be viewed;
  • the optimal node selection module is configured to select, among all nodes in the more than one inter-segment of the program content, from all nodes that can provide program content corresponding to each inter-segment a superior node and a sub-optimal node, wherein the optimal node is a node closest to the distance among all the nodes, and the sub-optimal node is the node closest to the distance among all the nodes, and the optimal node and the sub-optimal The nodes are respectively saved as the primary node and the standby node of the respective segments;
  • the connection establishing module is configured to establish a TCP connection with each of the active primary nodes; and, when a primary node fails, may not establish a TCP connection with a primary node. Inches
  • the playing module is configured to receive media stream data of the program content from the optimal node or a standby node, and play the media stream data.
  • the device may further include:
  • a first cache module configured to save program content that can be provided to other nodes, and provide media services to other nodes;
  • a second cache module configured to save the received media stream data

Landscapes

  • Engineering & Computer Science (AREA)
  • Signal Processing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Multimedia (AREA)
  • General Engineering & Computer Science (AREA)
  • Databases & Information Systems (AREA)
  • Information Transfer Between Computers (AREA)
  • Two-Way Televisions, Distribution Of Moving Picture Or The Like (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Description

说明书 一种减少媒体播放延时的方法和装置
[1] 技术领域
[2] 本发明涉及流媒体领域， 特别涉及一种减少媒体播放延吋的方法和装置。
[3] 背景技术
[4] 流媒体技术是一种在 IP网络上发布多媒体数据流的技术。 传统播放技术是客户 端从服务器下载完整的文件后进行播放， 而流媒体技术是釆用了流式传输方式 ， 将整个多媒体文件压缩解析成多个压缩包， 将该多个数据包向客户端实吋地 顺序传送， 用户可以一边解压播放前面传送过来的压缩包， 一边下载后续的压 缩包， 从而节省了用户的吋间。 随着计算机技术的发展， 流媒体技术越来越广 泛地应用于 VOD (Video
on-demand) 视频点播。 视频点播是将录制好的视频节目通过捕捉、 压缩等一系 列过程转成可通过计算机直接播放的数字视频文件， 并存储在网站的服务器上 供访问者点播， 用户通过终端设备收看视频服务商提供的视频和音频节目， 并 且可以在观看节目中进行前进、 倒退、 暂停等操作。 视频点播具有快速、 方便 、 交互性好等优点， 随着网络带宽的不断加大， 视频点播业务将具有更广泛的 发展前景' 而 IPTV (internet Protocol
Television-网络电视） 的发展， 使流媒体技术的应用达到了空前的热度。
[5] 当通过 IPTV来传送 VOD吋， 传统的流媒体系统暴露出很多问题， 用户点播对 I
PTV中的服务器的冲击过大， 容易引入单点故障， 于是就引入了 CDN (Content Delivery
Network-内容分发网） 技术， CDN技术的核心思想是将内容从中心推到边缘靠近 用户的地方， 这样不但有效地提高了用户访问内容的服务质量， 而且还能减轻 中心设备和骨干网络的压力。 通过 CDN技术， 可以将内容服务从原来的单一中 心服务结构变为分布式服务结构， 用户在点击节目的吋候， 从靠近用户的边缘 服务器上就可以获取所需要的媒体内容， 用户在快进， 快退和拖拉等播放操作 的吋候， 都是在同一个边缘服务器上获取资源。 [6] 近年来， 随着 P2P (Peer-to-Peer-对等网络） 技术的迅速发展， P2P在流媒体方 面的应用也越来越多， 例如 PPLive，PPStream等基于 P2P的流媒体软件。 利用 P2P 的对等特点， 让用户节点作为服务器来提供内容， 来分担服务器的负担， 同吋 增加了系统的可扩展性， 使媒体数据的分布性增强。 目前基于 P2P技术的流媒体 系统中， 由于每个节点在接收内容的同吋， 也将接收到的内容发向其它节点， 所以每个节点向其它节点提供的内容是随着节点观看的内容变化而变化的， 这 样在用户进行媒体的快进、 快退或者拖拉等播放操作的吋候， 需要重新搜索对 应的片源， 然后才能建立 TCP连接。
[7] 图 1给出了一种 PPLive流媒体软件的实现原理图， 当用户对播放进度执行拖拉 操作的吋候， 用户首先要到中心服务器上去査询用户列表， 然后根据当前的播 放情况， 和相关节点建立相应的 TCP连接实现播放， 这样做势必会加大媒体播放 的延吋， 而且也没有考虑到各个节点间的亲近关系。 与此同吋中心服务器还要 负责不停地更新各个节点所提供的内容， 从而增加了中心服务器的负担。 另外 ， 由于每个用户节点仅仅保存一小部分媒体内容， 在这种情况下， 如果一个用 户想要访问一个完整的节目， 就需要访问多个用户节点才能获取全部的资源， 当用户进行快进、 快退或拖拉操作的吋候， 用户可能要跨越不同的提供节目内 容的节点， 进行重新搜索， 并建立 TCP连接， 这样也势必会加大媒体播放的延吋
[8] 在基于 CDN技术的网络下， 用户执行拖拉播放操作后， 由于还是从原来的服务 器上获取资源， 并不需要重新搜索服务器和建立 TCP连接， 所以播放延吋大概在 2-3秒左右， 而在基于 P2P技术的网络下， 用户执行拖拉播放操作后， 需要重新搜 索服务器和建立 TCP连接， 再加上播放缓存吋间， 播放延吋将达到 5秒以上， 这 个延吋对用户是无法接受的。
[9] 发明内容
[10] 本发明实施例提出了一种减少媒体播放延吋的方法和装置， 从而解决了基于 P2 P技术的流媒体播放过程中， 用户执行播放进度的拖拉操作吋， 由于节点间切换 造成播放延吋的问题，
[11] 本发明实施例是通过如下的技术方案实现的： [12] 一种减少媒体播放延吋的方法， 包括：
[13] 用户节点获取能提供其需要观看的节目内容的节点列表信息；
[14] 所述用户节点在所述节目内容的不止一个吋间段中的各个吋间段上， 从能提供 该各个吋间段对应的节目内容的所有节点中选择出最优节点， 该最优节点为所 述所有节点中与所述用户节点距离最近的节点；
[15] 所述用户节点分别与各个吋间段上选择出的最优节点建立连接， 从该最优节点 接收所述节目内容的媒体流数据， 并播放该媒体流数据。
[16] 一种减少媒体播放延吋的装置， 所述装置包括： 节点信息获取模块、 最优节点 选择模块、 连接建立模块和播放模块；
[17] 所述节点信息获取模块， 用于获取能提供用户节点需要观看的节目内容的节点 列表信息；
[18] 所述最优节点选择模块， 用于在所述节目内容的不止一个吋间段中的各个吋间 段上， 从能提供该各个吋间段对应的节目内容的所有节点中选择出最优节点， 该最优节点为所述所有节点中与其距离最近的节点；
[19] 所述连接建立模块， 用于分别与所述选择出的最优节点建立连接；
[20] 所述播放模块， 用于从所述最优节点接收所述节目内容的媒体流数据， 并播放 该媒体流数据。
[21] 从上述本发明的实施例提供的技术方案可以看出， 本发明实施例通过选择最优 节点作为提供节目内容的节点， 所以大大地增加了用户视频点播的服务质量。 本发明实施例通过用户节点预先分别与本地节点列表中的最优节点建立 TCP连接
， 所以大大地减少了流媒体播放进度拖拉操作的延吋。
[22] 附图说明
[23] 图 1是现有技术中 PPLive流媒体软件的实现原理图；
[24] 图 2是本发明实施例减少媒体播放延吋的方法流程图；
[25] 图 3是本发明实施例用户执行拖拉播放操作的示意图；
[26] 图 4是本发明实施例减少媒体播放延吋的装置的结构图。
[27] 具体实施方式
[28] 下面结合附图和具体实施例对本发明实施例作进一步说明， 但不作为对本发明 实施例的限定。
[29] 根据 P2P技术的特点： 用户一边接收内容， 一边向其他人提供内容， 本发明实 施例在用户节点上划分两个缓冲区， 一个可以定义为接收缓冲区， 用于接收媒 体流数据并缓存， 以便播放； 另一个可以定义为共享缓冲区， 用于向其它节点 提供媒体服务， 此外共享缓冲区中还存储可以提供给其它分节点的节目内容， 而该节目内容在相当长吋间内保持不变。 将用户节点的共享缓冲区中存储的节 目内容注册到 P2P网络中， 这样用户在执行播放进度的拖拉操作吋， 不必进行搜 索， 不必花费额外的吋间去跟踪节点动态缓冲区的变化情况。
[30] 本发明实施例在某个用户节点需要点播一个节目内容的吋候， 在开始阶段就从 DHT (Distributed Hash
Table-分布式哈希表)网络或者中心服务器获取到能够提供该节目内容的节点列表 ， 然后从中选择最优的节点。 当有多个其它用户节点能够同吋提供该节目内容 吋， 要通过比较该多个其它用户节点的性能， 并通过 RTT (Round Trip
Time-往返吋间） 测量来从该多个其它用户节点中寻找到距离上述某个用户节点 最近的节点， 作为提供该节目内容的节点。 将该多个其它用户节点信息保存到 上述某个用户节点的本地节点列表中， 同吋和各个提供节目内容的节点预先建 立 TCP连接， 一方面是为了保持和其它用户节点的通讯状态， 另一方面为了在用 户执行拖拉播放操作的吋候能够节省吋间。
[31] 下面针对用户点播某个节目的情况， 详细阐述本发明实施例减少媒体播放延吋 的方法， 其具体包括以下步骤， 参见图 2:
[32] 步骤 101 : 将各个用户节点可以观看的节目内容信息分发到各个用户节点的共 享缓冲区中。
[33] 上述节目内容的分发操作可以由超级节点来进行。 分发的原则为优先将节目内 容分发到在线吋间长， 比较稳定的用户节点。
[34] 步骤 102: 当用户节点需要点播某个节目内容， 通过 DHT网络或者中心服务器 来获取含有该节目内容的节点列表。
[35] 步骤 103: 用户节点通过 RTT分别测量出与节点列表中各个含有点播节目内容 的节点的距离， 并将此距离作为节点之间亲近关系的衡量数据保存到用户节点 的本地节点列表中。
[36] RTT的测量可以釆用 ping包的命令形式或者应用层的测量消息来实现。
[37] 步骤 104: 用户节点根据本地节点列表中的距离参数， 选择出在上述某个节目 内容的各个吋间段上， 能提供各个吋间段对应的节目内容的所有节点中的最优 节点和次优节点， 该最优节点为所有节点中与用户节点距离最近的节点， 该次 优节点为所有节点中与用户节点距离次最近的节点。 然后， 将所有最优节点作 为提供相同节目内容的主用节点， 将所有次优节点作为提供相同节目内容的备 用节点， 一起保存到用户节点的本地节点列表中。
[38] 步骤 105: 用户节点分别与其本地节点列表中的各个主用节点建立 TCP连接。
当某个主用节点下线后， 用户节点与该下线的主用节点的备用节点建立 TCP连接 ， 或者重新搜索一个新的主用节点来代替该下线的主用节点， 并建立 TCP连接。
[39] 步骤 106: 用户节点通过接收缓冲区从主用节点接收媒体流数据， 并播放该媒 体流数据。
[40] 当用户在上述某个节目内容的各个吋间段上执行拖拉播放操作吋， 由于该用户 节点已经与各个吋间段的主用节点建立了 TCP连接， 所以， 该用户节点可以很快 就从拖拉操作后， 重新选择的吋间段对应的主用节点或备用节点接收媒体流数 据， 从而缩短了切换所造成的延吋。
[41] 为了更加清楚地描述本实施例的技术方案， 下面以具体的例子来进一步说明： [42] 如图 3所示为用户执行拖拉播放操作的示意图。 图中节点八、 B、 C、 D、 E五个 节点连续的组成一个点播节目的所有媒体数据。 节点 G和 F分别与节点 A和 C具有 相同的节目内容， 它们和当前用户节点的距离大于 A和 C与当前用户节点的距离 ， 作为 A和 C节点的备用节点。 表 1为当前用户节点保存的本地节点列表， 其中度 量值是通过 RTT测量值得出的， 或者直接用 RTT的测量吋间来表示。
[43]
Figure imgf000008_0001
[44] 在 Tl吋刻用户观看节目， 在 T2吋刻吋， 用户正在观看 A节点提供的资源 （图 3 中实线箭头表示） ， 同吋用户节点和8、 C、 D、 E四个节点分别建立 TCP预连接 (图 3中虚线箭头表示 TCP预连接） ， 称为保活连接。 当用户从 T2吋刻直接跳至 T3吋刻吋， 即实现拖拉操作播放吋， 由节点 C来提供内容， 由于用户节点已经与 节点 C建立好了 TCP连接， 这样就直接从节点 C获取资源， 减少了査找和建立 TC P连接的吋间， 同吋将与 A节点的连接变成保活连接。 当一个节点失效的吋候， 可以和具有相同节目内容的备用节点建立 TCP连接， 如果没有备用节点， 可以通 过 DHT网络或者服务器进行搜索， 重新寻找主备用节点。 如果用户在开始点击 的吋候， 从 P2P网络获取到的节点列表中的节点不能提供完整的点播内容， 例如 在图 3中只获取到了 A、 B、 D、 E四个节点， C节点由于某些原因， 比如突然掉线 等因素， 这样在用户点播的过程中， 可以间断性得向 P2P网络査询， 如果査询到 有新的提供节目内容的节点， 则进一步査询到其中最优的节点， 并将该节点添 加到本地节点列表中， 同吋建立 TCP连接。
[45] 除了釆用 RTT测量方法寻找到最优节点和次优节点以外， 还可以釆用计算路由 的跳数寻找到最优节点和次优节点， 其原理是： 用户节点分别计算出与各个吋 间点具有相同节目内容的节点之间的路由跳数， 根据路由跳数找到与用户节点 路由跳数最少和次最少的各个吋间点具有相同节目内容的两个节点， 即最优节 点和次最优节点。 釆用计算路由跳数实现减少媒体播放延吋的方法与上述实施 例完全一样， 这里不再叙述。
[46] 参见图 4， 本发明实施例还提供了一种减少媒体播放延吋的装置， 包括： 节点 信息获取模块、 最优节点选择模块、 连接建立模块和播放模块； [47] 所述节点信息获取模块， 用于通过分布式哈希表网络或者中心服务器， 获取能 提供其需要观看的节目内容的所有节点列表；
[48] 所述最优节点选择模块， 用于在所述节目内容的不止一个吋间段中的各个吋间 段上， 从能提供各个吋间段对应的节目内容的所有节点中选择出最优节点和次 优节点， 该最优节点为所述所有节点中与其距离最近的节点， 该次优节点为所 述所有节点中与其距离次最近的节点， 并将所述最优节点、 次优节点分别作为 所述各个吋间段的主用节点和备用节点保存到本地；
[49] 所述连接建立模块， 用于与所述保存在本地的各个主用节点建立 TCP连接； 并 且， 当由于某个主用节点出现故障等原因， 与某个主用节点无法建立 TCP连接吋
， 与该某个主用节点对应的备用节点建立 TCP连接。
[50] 所述播放模块， 用于从所述最优节点或备用节点接收所述节目内容的媒体流数 据， 并播放该媒体流数据。
[51] 所述装置还可以包括：
[52] 第一缓存模块， 用于保存能提供给其它节点的节目内容， 向其它节点提供媒体 服务；
[53] 第二缓存模块， 用于保存接收到的媒体流数据；
[54] 以上所述， 仅为本发明较佳的具体实施方式， 但本发明的保护范围并不局限于 此， 任何熟悉本技术领域的技术人员在本发明揭露的技术范围内， 可轻易想到 的变化或替换， 都应涵盖在本发明的保护范围之内。 因此， 本发明的保护范围 应该以权利要求的保护范围为准。

Claims

权利要求书
[1] 1.一种减少媒体播放延吋的方法， 其特征在于， 包括：
用户节点获取能提供其需要观看的节目内容的节点列表信息； 所述用户节点在所述节目内容的不止一个吋间段中的各个吋间段上， 从能 提供该各个吋间段对应的节目内容的所有节点中选择出最优节点， 该最优 节点为所述所有节点中与所述用户节点距离最近的节点；
所述用户节点分别与各个吋间段上选择出的最优节点建立连接， 从该最优 节点接收所述节目内容的媒体流数据， 并播放该媒体流数据。
[2] 2.如权利要求 1所述的减少媒体播放延吋的方法， 其特征在于， 所述用户节 点获取能提供其需要观看的节目内容的节点列表信息具体包括： 所述用户节点通过分布式哈希表网络或者中心服务器获取能提供其需要观 看的点播节目内容的节点列表信息。
[3] 3.如权利要求 1所述的减少媒体播放延吋的方法， 其特征在于， 所述方法还 包括：
所述用户节点通过往返吋间测量分别测量出， 能提供所述各个吋间段对应 的节目内容的所有节点与其之间的距离， 并选择出与其距离最近和次最近 的两个节点， 并将距离最近的节点作为所述各个吋间段的主用节点， 将次 最近节点作为所述各个吋间段的备用节点， 将所述主用节点和备用节点保 存到本地。
[4] 4.如权利要求 1所述的减少媒体播放延吋的方法， 其特征在于， 所述方法还 包括：
所述用户节点通过路由跳数分别计算出， 能提供所述各个吋间段对应的节 目内容的所有节点与其之间的距离， 并选择出与其路由跳数最少和次最少 的两个节点， 并将这两个节点分别作为所述各个吋间段的主用节点和备用 节点保存到本地。
[5] 5.如权利要求 3或 4所述的减少媒体播放延吋的方法， 其特征在于， 所述方 法还包括：
所述用户节点与所述保存在本地的各个主用节点建立连接； 并且， 当所述 用户节点与某个主用节点无法建立连接吋， 所述用户节点与该某个主用节 点对应的备用节点建立连接。
[6] 6.如权利要求 5所述的减少媒体播放延吋的方法， 其特征在于， 所述方法还 包括：
当所述用户节点在所述节目内容的不止一个吋间段上重新选择吋间段吋， 所述用户节点从已经与其建立了连接的， 重新选择的吋间段的主用节点或 备用节点接收媒体流数据， 并播放该媒体流数据。
[7] 7.—种减少媒体播放延吋的装置， 其特征在于， 所述装置包括： 节点信息 获取模块、 最优节点选择模块、 连接建立模块和播放模块； 所述节点信息获取模块， 用于获取能提供用户节点需要观看的节目内容的 节点列表信息；
所述最优节点选择模块， 用于在所述节目内容的不止一个吋间段中的各个 吋间段上， 从能提供该各个吋间段对应的节目内容的所有节点中选择出最 优节点， 该最优节点为所述所有节点中与其距离最近的节点； 所述连接建立模块， 用于分别与所述选择出的最优节点建立连接； 所述播放模块， 用于从所述最优节点接收所述节目内容的媒体流数据， 并 播放该媒体流数据。
[8] 8.如权利要求 7所述的减少媒体播放延吋的装置， 其特征在于， 所述节点信 息获取模块通过分布式哈希表网络或者中心服务器获取能提供其需要观看 的节目内容的节点列表信息。
[9] 9.如权利要求 7或 8所述的减少媒体播放延吋的装置， 其特征在于：
所述最优节点选择模块， 还用于从能提供各个吋间段对应的节目内容的所 有节点中选择出次优节点， 该次优节点为所述所有节点中与其距离次最近 的节点， 并将所述最优节点、 次优节点分别作为所述各个吋间段的主用节 点和备用节点保存到本地。
[10] 10.如权利要求 9所述的减少媒体播放延吋的装置， 其特征在于：
所述连接建立模块， 还用于与所述保存在本地的各个主用节点建立连接； 并且， 当与某个主用节点无法建立连接吋， 与该某个主用节点对应的备用 节点建立连接。
PCT/CN2007/071309 2006-12-31 2007-12-21 Procédé et appareil pour réduire un retard de lecture multimédia WO2008080343A1 (fr)

Priority Applications (3)

Application Number Priority Date Filing Date Title
ES07846135T ES2405627T3 (es) 2006-12-31 2007-12-21 Método y dispositivo para reducir el retardo de la reproducción de medios
EP07846135A EP2053859B1 (en) 2006-12-31 2007-12-21 A method and apparatus for reducing delay of media play
US12/393,627 US8055793B2 (en) 2006-12-31 2009-02-26 Method and apparatus for reducing delay of media playing

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN2006101715967A CN101005606B (zh) 2006-12-31 2006-12-31 一种减少媒体播放延时的方法和装置
CN200610171596.7 2006-12-31

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US12/393,627 Continuation US8055793B2 (en) 2006-12-31 2009-02-26 Method and apparatus for reducing delay of media playing

Publications (1)

Publication Number Publication Date
WO2008080343A1 true WO2008080343A1 (fr) 2008-07-10

Family

ID=38704427

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2007/071309 WO2008080343A1 (fr) 2006-12-31 2007-12-21 Procédé et appareil pour réduire un retard de lecture multimédia

Country Status (5)

Country Link
US (1) US8055793B2 (zh)
EP (1) EP2053859B1 (zh)
CN (1) CN101005606B (zh)
ES (1) ES2405627T3 (zh)
WO (1) WO2008080343A1 (zh)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103036790A (zh) * 2012-12-31 2013-04-10 乐视网信息技术（北京）股份有限公司 一种引入节点带宽条件约束的p2p节点选择方法

Families Citing this family (46)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9549043B1 (en) 2004-07-20 2017-01-17 Conviva Inc. Allocating resources in a content delivery environment
US10862994B1 (en) 2006-11-15 2020-12-08 Conviva Inc. Facilitating client decisions
US9325786B2 (en) * 2006-07-27 2016-04-26 The Hong Kong University Of Science And Technology Peer-to-peer interactive media-on-demand
US8751605B1 (en) 2006-11-15 2014-06-10 Conviva Inc. Accounting for network traffic
US9264780B1 (en) 2006-11-15 2016-02-16 Conviva Inc. Managing synchronized data requests in a content delivery network
US8874725B1 (en) 2006-11-15 2014-10-28 Conviva Inc. Monitoring the performance of a content player
US9124601B2 (en) 2006-11-15 2015-09-01 Conviva Inc. Data client
CN101005606B (zh) 2006-12-31 2012-07-04 华为技术有限公司 一种减少媒体播放延时的方法和装置
CN101083605B (zh) * 2007-08-01 2011-07-06 华为技术有限公司 一种媒体源快速切换的方法、系统和装置
CN101389017B (zh) * 2007-09-14 2011-11-30 中兴通讯股份有限公司 一种移动流媒体直播业务中保存媒体文件的方法
CN101146110B (zh) * 2007-09-25 2011-06-29 深圳市迅雷网络技术有限公司 一种播放流媒体的方法
CN101179705B (zh) * 2007-11-29 2011-04-20 中兴通讯股份有限公司 伙伴资源节点选择方法和装置
CN101242430B (zh) * 2008-02-22 2012-03-28 华中科技大学 对等网络点播系统中的定点数据预取方法
CN101534475B (zh) * 2008-03-10 2012-02-01 联想移动通信科技有限公司 一种流媒体业务接收装置和方法及移动终端
CN101588468B (zh) * 2008-05-20 2013-08-07 华为技术有限公司 一种基于p2p的媒体播放方法、装置和系统
CN101296152B (zh) * 2008-06-26 2012-08-29 腾讯科技（深圳）有限公司 对等连接网络的数据调度方法和系统
CN101378494B (zh) * 2008-10-07 2011-04-20 中兴通讯股份有限公司 一种实现互联网电视媒体交互的系统及方法
US8402494B1 (en) 2009-03-23 2013-03-19 Conviva Inc. Switching content
CN101854374A (zh) * 2009-04-01 2010-10-06 日电（中国）有限公司 数据节点装置、对端信息获取方法和系统
US8762461B2 (en) 2009-06-17 2014-06-24 China Mobile Communications Corporation Method, system and device for searching active peer in P2P streaming media system
US9100288B1 (en) * 2009-07-20 2015-08-04 Conviva Inc. Augmenting the functionality of a content player
KR101562974B1 (ko) 2009-09-07 2015-10-30 삼성전자 주식회사 스트리밍 서비스의 지연 감소를 위한 단말기, 시드 서버 및 트랙커 서버
KR101568288B1 (ko) * 2009-09-21 2015-11-12 삼성전자주식회사 데이터 수신 장치 및 방법
CA2824723A1 (en) * 2009-09-26 2011-03-31 Disternet Technology Inc. System and method for micro-cloud computing
JP2013516854A (ja) * 2010-01-04 2013-05-13 アルカテル−ルーセント Ｉｐｔｖシステムのためのエッジコンテンツ配信デバイスおよびコンテンツ配信ネットワーク
CN102347937B (zh) * 2010-08-02 2014-06-04 杭州华三通信技术有限公司 一种发送流媒体数据的方法及虚拟管理器
CN101945254B (zh) * 2010-09-15 2012-05-30 中国科学院声学研究所 一种基于虚拟直播源的分布式流媒体点播方法
CN102447974B (zh) * 2011-11-03 2014-04-09 苏州大学 一种p2p视频点播系统合作数据预取方法
US8843758B2 (en) * 2011-11-30 2014-09-23 Microsoft Corporation Migrating authenticated content towards content consumer
CN102595207B (zh) * 2012-01-10 2015-09-23 深圳市同洲电子股份有限公司 一种内容分发系统、内容分发方法及内容分发装置
US9613042B1 (en) 2012-04-09 2017-04-04 Conviva Inc. Dynamic generation of video manifest files
US9246965B1 (en) 2012-09-05 2016-01-26 Conviva Inc. Source assignment based on network partitioning
US10182096B1 (en) 2012-09-05 2019-01-15 Conviva Inc. Virtual resource locator
CN103152611B (zh) * 2013-02-18 2018-04-27 中兴通讯股份有限公司 一种流媒体管道业务的控制方法和装置
CN104702579B (zh) 2013-12-09 2018-10-12 华为技术有限公司 用于确定用户设备的缓存状态的方法及装置
CN103997623B (zh) * 2014-05-06 2017-05-03 四川长虹电器股份有限公司 基于p2p技术的视频监控方法
CN104284201A (zh) * 2014-09-26 2015-01-14 北京奇艺世纪科技有限公司 一种视频内容的处理方法和装置
CN104301454A (zh) * 2014-11-13 2015-01-21 国家电网公司 一种域名解析重定向的方法、装置以及智能域名系统
US10178043B1 (en) 2014-12-08 2019-01-08 Conviva Inc. Dynamic bitrate range selection in the cloud for optimized video streaming
US10305955B1 (en) 2014-12-08 2019-05-28 Conviva Inc. Streaming decision in the cloud
CN105743950B (zh) * 2014-12-11 2019-11-19 深圳市腾讯计算机系统有限公司 数据缓存方法、装置及电子设备
CN108337283B (zh) * 2017-01-20 2022-04-15 创盛视联数码科技（北京）有限公司 一种iOS推流中获取最优推流节点的方法
CN110290394A (zh) * 2019-07-15 2019-09-27 宁波华数广电网络有限公司 一种视频点播系统及方法
CN111225242A (zh) * 2020-01-17 2020-06-02 广州酷狗计算机科技有限公司 视频播放容灾方法、装置及计算机存储介质
CN112040332B (zh) * 2020-08-19 2022-02-11 天津智融创新科技发展有限公司 平滑cdn带宽的视频内容的获取方法和系统
CN114245147B (zh) * 2022-02-24 2022-04-26 檀沐信息科技(深圳)有限公司 流媒体内容分发方法及系统

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1622548A (zh) * 2003-03-20 2005-06-01 微软公司 多重无线电统一协议
WO2005076553A1 (en) * 2004-01-30 2005-08-18 Hewlett-Packard Development Company, L.P. Selecting nodes close to another node in a network using location information for the nodes
CN1885812A (zh) * 2006-05-29 2006-12-27 华中科技大学 一种流媒体点播系统中时间相关的对等网络组织方法
CN101005606A (zh) * 2006-12-31 2007-07-25 华为技术有限公司 一种减少媒体播放延时的方法和装置

Family Cites Families (28)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6084581A (en) * 1996-05-10 2000-07-04 Custom Communications, Inc. Method of creating individually customized videos
US6788315B1 (en) * 1997-11-17 2004-09-07 Fujitsu Limited Platform independent computer network manager
US6377972B1 (en) * 1999-01-19 2002-04-23 Lucent Technologies Inc. High quality streaming multimedia
JP4299911B2 (ja) * 1999-03-24 2009-07-22 株式会社東芝 情報転送システム
US7574499B1 (en) * 2000-07-19 2009-08-11 Akamai Technologies, Inc. Global traffic management system using IP anycast routing and dynamic load-balancing
US8060581B2 (en) * 2000-07-19 2011-11-15 Akamai Technologies, Inc. Dynamic image delivery system
US7912978B2 (en) * 2000-07-19 2011-03-22 Akamai Technologies, Inc. Method for determining metrics of a content delivery and global traffic management network
US7689510B2 (en) * 2000-09-07 2010-03-30 Sonic Solutions Methods and system for use in network management of content
US20040039934A1 (en) * 2000-12-19 2004-02-26 Land Michael Z. System and method for multimedia authoring and playback
US7146429B2 (en) * 2001-03-16 2006-12-05 The Aerospace Corporation Cooperative adaptive web caching routing and forwarding web content data requesting method
US7555561B2 (en) * 2001-03-19 2009-06-30 The Aerospace Corporation Cooperative adaptive web caching routing and forwarding web content data broadcasting method
US7272645B2 (en) * 2001-05-25 2007-09-18 Sbc Technology Resources, Inc. Method of improving the reliability of peer-to-peer network downloads
US7054867B2 (en) * 2001-09-18 2006-05-30 Skyris Networks, Inc. Systems, methods and programming for routing and indexing globally addressable objects and associated business models
CA2411806A1 (en) * 2001-11-16 2003-05-16 Telecommunications Research Laboratory Wide-area content-based routing architecture
US8392609B2 (en) * 2002-09-17 2013-03-05 Apple Inc. Proximity detection for media proxies
US9160571B2 (en) * 2004-03-11 2015-10-13 Hewlett-Packard Development Company, L.P. Requesting a service from a multicast network
US7418454B2 (en) * 2004-04-16 2008-08-26 Microsoft Corporation Data overlay, self-organized metadata overlay, and application level multicasting
US7340453B2 (en) * 2004-07-30 2008-03-04 International Business Machines Corporation Microeconomic mechanism for distributed indexing
WO2006066052A2 (en) * 2004-12-16 2006-06-22 Sonic Solutions Methods and systems for use in network management of content
WO2006068365A1 (en) * 2004-12-21 2006-06-29 Electronics And Telecommunications Research Institute P2p overlay network construction method and apparatus
US20060230107A1 (en) * 2005-03-15 2006-10-12 1000 Oaks Hu Lian Technology Development Co., Ltd. Method and computer-readable medium for multimedia playback and recording in a peer-to-peer network
US20070156855A1 (en) * 2005-06-17 2007-07-05 Moses Johnson Channel searching media player
US20070005694A1 (en) * 2005-06-30 2007-01-04 Pando Networks, Inc. System and method for distributed multi-media production, sharing and low-cost mass publication
US7920572B2 (en) * 2005-09-20 2011-04-05 Cisco Technology, Inc. Modifying operation of peer-to-peer networks based on integrating network routing information
US7664742B2 (en) * 2005-11-14 2010-02-16 Pettovello Primo M Index data structure for a peer-to-peer network
US7801912B2 (en) * 2005-12-29 2010-09-21 Amazon Technologies, Inc. Method and apparatus for a searchable data service
US8170395B2 (en) * 2006-05-07 2012-05-01 Wellcomemat Llc Methods and systems for handling montage video data
US8307286B2 (en) * 2006-05-07 2012-11-06 Wellcomemat Llc Methods and systems for online video-based property commerce

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1622548A (zh) * 2003-03-20 2005-06-01 微软公司 多重无线电统一协议
WO2005076553A1 (en) * 2004-01-30 2005-08-18 Hewlett-Packard Development Company, L.P. Selecting nodes close to another node in a network using location information for the nodes
CN1885812A (zh) * 2006-05-29 2006-12-27 华中科技大学 一种流媒体点播系统中时间相关的对等网络组织方法
CN101005606A (zh) * 2006-12-31 2007-07-25 华为技术有限公司 一种减少媒体播放延时的方法和装置

Non-Patent Citations (1)

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

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103036790A (zh) * 2012-12-31 2013-04-10 乐视网信息技术（北京）股份有限公司 一种引入节点带宽条件约束的p2p节点选择方法

Also Published As

Publication number Publication date
ES2405627T3 (es) 2013-05-31
US8055793B2 (en) 2011-11-08
CN101005606A (zh) 2007-07-25
US20090164656A1 (en) 2009-06-25
EP2053859A4 (en) 2010-01-13
CN101005606B (zh) 2012-07-04
EP2053859B1 (en) 2013-02-27
EP2053859A1 (en) 2009-04-29

Similar Documents

Publication Publication Date Title
WO2008080343A1 (fr) Procédé et appareil pour réduire un retard de lecture multimédia
US8667164B2 (en) Method and apparatus for playing live content
US9172751B2 (en) Content distribution
US20080037527A1 (en) Peer-to-Peer Interactive Media-on-Demand
WO2010048774A1 (zh) 一种流媒体分发系统、方法及装置
KR20030056701A (ko) Ｐ２ｐ 방식을 이용한 멀티미디어 스트리밍 장치 및 방법
WO2008151536A1 (fr) Procédé de traitement de données de communication en réseau, système de communication en réseau et extrémité client
Lederer et al. Towards peer-assisted dynamic adaptive streaming over HTTP
JP2011082977A (ja) Ｐ２ｐネットワークシステム及びそのデータ送受信方法
JP5115509B2 (ja) コンテンツ配信システム、ノード装置、離脱処理遅延方法及び離脱処理遅延制御プログラム
JP2006515966A (ja) ビデオ・オンデマンド用のチャネル・マージ
JP7259056B2 (ja) メディアストリーム送信方法、装置、システム、およびデバイス
WO2023226949A1 (zh) 实时流媒体数据传输的方法、设备及存储介质
WO2012094992A1 (zh) 一种实现数据获取的方法和系统
WO2010025635A1 (zh) 一种播放切换方法、媒体服务器、用户终端和系统
WO2010075742A1 (zh) 一种p2p网络中获取媒体内容的方法、装置及系统
Ramadha et al. Design and implementation named data networking-based video streaming system
Peltotalo et al. RTSP‐based Mobile Peer‐to‐Peer Streaming System
WO2009135374A1 (zh) Iptv媒体交付系统、iptv媒体内容发布方法、及媒体交付系统
JP2009177811A (ja) 分割後のｐ２ｐモードでの繰延回復を目的としたコンテンツのライブ送信のための方法、並びに制御装置及び関連する設備
Mir et al. A Performance Evaluation Study of Video-on-Demand Traffic over IP Networks
Awiphan et al. Adaptive video streaming on named data networking with iot-assisted content delivery
Kandavanam et al. PaCRAm: Path aware content replication approach with multicast for IPTV networks
Song et al. Fast channel change IPTV system for enhanced user experience
KR101015098B1 (ko) Ｐ２ｐ 기반의 스트리밍 서비스 제공 시스템 및 방법

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 07846135

Country of ref document: EP

Kind code of ref document: A1

WWE Wipo information: entry into national phase

Ref document number: 2007846135

Country of ref document: EP

NENP Non-entry into the national phase

Ref country code: DE