Dispatching method and device of streaming media data and nodal equipment

Abstract

The invention relates to dispatching method and device of streaming media data, and nodal equipment. The method comprising the following steps of: acquiring a data block number of a current data block to be dispatched, querying a buddy node aggregation of a local node according to the data block number, and acquiring a buddy list possessing the current data block; determining a dispatching node according to a reference counting of a buddy node in the buddy list, wherein the dispatching node is the minimum buddy node of the reference counting, the reference counting of the buddy node is used for showing that the local node does not receive or does not receive within a given time the quantity of the data block of the relevant buddy node under the condition that the local node finishes sending a dispatching request to the relevant buddy node; and sending the dispatching request of dispatching the current data block to the dispatching node. The dispatching method and the device of streaming media data and the nodal equipment select the dispatching node based on network state to realize the dispatching of the streaming media data and simultaneously realize load balancing among nodes.

Description

technical field [0001] The present invention relates to streaming media technology, in particular to a P2P technology-based streaming media data scheduling method, device and node equipment. Background technique [0002] Peer-to-Peer (referred to as: P2P) technology mainly refers to the information control technology after the network connection is formed by the hardware, and the main representative form is the application based on the P2P network protocol on the application layer. It is generally believed that a P2P system is composed of a number of interconnected and cooperative computers, and relies on the active cooperation of marginalized (decentralized server) devices. Each member directly benefits from the participation of other members rather than from the server. The role of server and client, aware of each other's existence, constitutes a virtual or actual group. [0003] With the development of computing technology and the popularization of broadband networks, th...

AI Technical Summary

Problems solved by technology

In the above prior art, the random scheduling algorithm does not consider the network state and the capabilities of the nodes themselves. Although the round-robin scheduling algorithm considers the capabilities of the nodes themselves, it still does not consider the network state. Although the least data priority scheduling algorithm can obtain resources with scarce resources Streaming media data, but it cannot guarantee that the data to be broadcast will arrive in time, which may easily cause unsmooth playback and affect service quality

And from the above analysis, it can be seen that the above algorithms do not consider the network state, such as network heterogeneity, bandwidth fluctuations, and frequent node joining or exiting. Therefore, the adaptability to the network state is not good, especially when the network bandwidth fluctuates, the efficiency is very low. Unable to ensure the smooth progress of streaming media data scheduling, affecting playback quality

Images