CN115277301B - Method and device for scheduling equalization and switching of multimedia signal streams - Google Patents
Method and device for scheduling equalization and switching of multimedia signal streams Download PDFInfo
- Publication number
- CN115277301B CN115277301B CN202210888853.8A CN202210888853A CN115277301B CN 115277301 B CN115277301 B CN 115277301B CN 202210888853 A CN202210888853 A CN 202210888853A CN 115277301 B CN115277301 B CN 115277301B
- Authority
- CN
- China
- Prior art keywords
- nodes
- cost
- link
- node
- determining
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/12—Avoiding congestion; Recovering from congestion
- H04L47/125—Avoiding congestion; Recovering from congestion by balancing the load, e.g. traffic engineering
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
- H04L12/44—Star or tree networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N7/00—Television systems
- H04N7/22—Adaptations for optical transmission
Abstract
The disclosure provides a method and a device for balancing and switching multimedia signal stream scheduling. The method comprises the following steps: acquiring an empowerment undirected graph comprising nodes and links between the nodes; determining a cost function between any nodes according to the nodes and the links; determining a link multiplexing function between any nodes according to the links; and determining a multicast tree model of multimedia signal stream transmission from the root node to any node according to the cost function and the link multiplexing function. According to the method and the device, the optimal path of the multimedia signal stream transmission, namely, the multicast tree model, can be determined based on constraint conditions by determining the cost function between any nodes and the link multiplexing function between any nodes, so that the load of a plurality of links of a network can be balanced, the load of each link is minimized, and the multiplexing upper limit is not exceeded, thereby improving the overall transmission efficiency.
Description
Technical Field
The disclosure relates to the field of computer technology, and in particular, to a method and a device for balancing and switching multimedia signal stream scheduling.
Background
The single-ridge multi-leaf architecture is suitable for most television station requirements. The system has good expandability, and can increase the access capability of the network by expanding the Leaf nodes. The forwarding capacity and the table entry capacity of the Spine node determine the scale of the whole network, and the Spine node adopts a 100GE/400GE high-density board card to support expansibility above 8 slots so as to meet 4K non-compressed signal bearing of thousand-channel scale and evolve to 8K non-compressed signal bearing in the future. The Spine node adopts high-performance equipment, and the network can bear 2048 4K service signals.
The IP matrix scheduling platform adopts a core-based management control scheduling scheme to realize 'transfer control separation', a matrix controller combines 4K/8K signal information issued by an upper ISV media controller, and a 'flow characteristic-planning path' issued by the controller is given to an IP matrix router cluster of a spine-leaf networking.
The implementation method of the earlier stage under the control mode of the spine-leaf networking is as follows:
the upper media controller issues a service demand flow table to the matrix controller, the controller defines three signals of a signal group 1, a signal group 2 and a signal group 3 according to the service demand of a user, the signal is input by the Leaf1, the signal is output by the Leaf2, the signal is output by the Leaf3 and the signal is required to be copied by the link of the Leaf1 where the input signal is positioned among the Leaf ridges by the front control scheme, and the 3 signals are sequentially sent to the port 1 of the Leaf2, the port 2 of the Leaf3 and the port 3 of the Leaf 4.
However, this solution has the following problems:
waste bandwidth, easily cause network congestion: the video streams in each group of signals are identical, and only the audio streams are combined differently, but because of the different signal groups, three service streams occupy three times of bandwidth, and between Leaf and Spine, multiple stream tables are required to be issued to different output Leaf nodes for one flow.
The information disclosed in the background section of the application is only for enhancement of understanding of the general background of the application and should not be taken as an acknowledgement or any form of suggestion that this information forms the prior art already known to a person skilled in the art.
Disclosure of Invention
The embodiment of the disclosure provides a method and a device for scheduling equalization and switching of multimedia signal streams, which can determine an optimal path for transmission of the multimedia signal streams based on constraint conditions by determining a cost function between any nodes and a link multiplexing function between any nodes, namely, a multicast tree model, so that loads of a plurality of links of a network can be equalized, loads of all links are minimized, and the upper limit of multiplexing is not exceeded, thereby improving the overall transmission efficiency.
In a first aspect of an embodiment of the present disclosure, a method for scheduling equalization and handover of a multimedia signal stream is provided, including: acquiring a weighted undirected graph comprising nodes and links between the nodes, wherein the nodes comprise an optical switch, a server and terminal equipment; determining a cost function between any nodes according to the nodes and the links; determining a link multiplexing function between any nodes according to the links; and determining a multicast tree model of multimedia signal stream transmission from a root node to any node in the loss weighted undirected graph according to the cost function and the link multiplexing function.
According to an embodiment of the present disclosure, determining a cost function between any nodes according to the node and the link includes: according to the formula Cost (u, v) = Σ x,y∈P(u,v) C (x, y) determining the Cost function Cost (u, v), wherein (u, v) is any two nodes, P (u, v) is a set of nodes included on a link between the (u, v) nodes, and (x, y) is any two nodes in P (u, v), wherein C (x, y) is a multimedia signal stream transmission Cost between any two nodes.
According to an embodiment of the present disclosure, the transmission cost C (x, y) of the multimedia signal stream between any two nodes is determined by at least one of transmission cost, transmission time, bandwidth, latency, and resource occupation between any two nodes.
According to an embodiment of the present disclosure, determining a link multiplexing function between any nodes according to the link includes: multi (u, v) = Σaccording to the formula x,y∈P(u,v) M (x, y) determining the link multiplexing function Multi (u, v), wherein (u, v) is any two nodes, P (u, v) is a set of nodes included on a link between the (u, v) nodes, and (x, y) is any two nodes in P (u, v), wherein M (x, y) is the number of link multiplexing channels between any two nodes.
According to an embodiment of the disclosure, determining a multicast tree model for multimedia signal streaming from a root node to any node in a loss weighted undirected graph according to the cost function and the link multiplexing function includes: optimizing according to the following constraint conditions to obtain the multicast tree model,sigma (sigma) e∈P(u,v) M (E) is less than or equal to delta, wherein E is a link between a root node s and any node, delta is a link multiplexing upper limit, E T Is a collection of links from a root node to any node.
According to an embodiment of the disclosure, in the optimization process, the constraint further includes a formula Cost (v) =cost (u, v) Multi (u) +cost (u, v), where Cost (v) is a root node to node v Cost function and Multi (u) is a root node to node u link multiplexing function.
According to an embodiment of the present disclosure, the multimedia signal stream is acquired by the monitoring front end, and the optical switch node further includes an optical transceiver and a router, and the multimedia signal stream is transmitted between the nodes according to the multicast tree model.
In a second aspect of the embodiments of the present disclosure, a device for balancing and switching multimedia signal stream scheduling is provided, including: the system comprises a weighted undirected graph acquisition module, a weighted undirected graph acquisition module and a weighted undirected graph acquisition module, wherein the weighted undirected graph acquisition module is used for acquiring a weighted undirected graph comprising nodes and links between the nodes, and the nodes comprise an optical switch, a server and terminal equipment; the cost function determining module is used for determining a cost function between any nodes according to the nodes and the links; the link multiplexing function determining module is used for determining a link multiplexing function between any nodes according to the links; and the multicast tree model obtaining module is used for determining a multicast tree model for transmitting the multimedia signal stream from the root node to any node in the loss weighted undirected graph according to the cost function and the link multiplexing function.
According to an embodiment of the disclosure, the cost function determination module is further configured to: according to the formula Cost (u, v) = Σ x,y∈P(u,v) C (x, y) determining the Cost function Cost (u, v), wherein (u, v) is any two nodes, P (u, v) is a set of nodes included on a link between the (u, v) nodes, and (x, y) is any two nodes in P (u, v), wherein C (x, y) is a multimedia signal stream transmission Cost between any two nodes.
According to an embodiment of the present disclosure, the transmission cost C (x, y) of the multimedia signal stream between any two nodes is determined by at least one of transmission cost, transmission time, bandwidth, latency, and resource occupation between any two nodes.
According to an embodiment of the disclosure, the link multiplexing function determination module is further configured to: multi (u, v) = Σaccording to the formula x,y∈P(u,v) M (x, y) determining the link multiplexing function Multi (u, v), wherein (u, v) is any two nodes, P (u, v) is a set of nodes included on a link between the (u, v) nodes, and (x, y) is any two nodes in P (u, v), wherein M (x, y) is the number of link multiplexing channels between any two nodes.
According to an embodiment of the present disclosure, theThe multicast tree model obtaining module is further configured to: optimizing according to the following constraint conditions to obtain the multicast tree model, Sigma (sigma) e∈P(u,v) M (E) is less than or equal to delta, wherein E is a link between a root node s and any node, delta is a link multiplexing upper limit, E T Is a collection of links from a root node to any node.
According to an embodiment of the disclosure, in the optimization process, the constraint further includes a formula Cost (v) =cost (u, v) Multi (u) +cost (u, v), where Cost (v) is a root node to node v Cost function and Multi (u) is a root node to node u link multiplexing function.
According to an embodiment of the present disclosure, the multimedia signal stream is acquired by the monitoring front end, and the optical switch node further includes an optical transceiver and a router, and the multimedia signal stream is transmitted between the nodes according to the multicast tree model.
A third aspect of embodiments of the present disclosure provides an apparatus comprising: a processor; a memory for storing processor-executable instructions; wherein the processor is configured to invoke the instructions stored by the memory to perform the method.
In a fourth aspect of the disclosed embodiments, there is provided a computer readable storage medium having stored thereon computer program instructions, characterized in that the computer program instructions, when executed by a processor, implement the method.
Drawings
Fig. 1 schematically illustrates a flowchart of a multimedia signal stream scheduling equalization and handover method according to an embodiment of the present disclosure;
fig. 2 schematically illustrates a case diagram of a multimedia signal stream scheduling equalization and handover method according to an embodiment of the present disclosure;
fig. 3 schematically illustrates a block diagram of a multimedia signal stream scheduling equalization and switching device according to an embodiment of the present disclosure;
FIG. 4 is a block diagram of a multimedia signal stream scheduling equalization and switching device, according to an exemplary embodiment;
fig. 5 is a block diagram illustrating a multimedia signal stream scheduling equalization and switching electronic device, according to an example embodiment.
Detailed Description
For the purposes of making the objects, technical solutions and advantages of the embodiments of the present disclosure more apparent, the technical solutions of the embodiments of the present disclosure will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present disclosure, and it is apparent that the described embodiments are only some embodiments of the present disclosure, not all embodiments. Based on the embodiments in this disclosure, all other embodiments that a person of ordinary skill in the art would obtain without making any inventive effort are within the scope of protection of this disclosure.
The terms "first," "second," "third," "fourth" and the like in the description and in the claims and in the above-described figures, if any, are used for distinguishing between similar objects and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used may be interchanged where appropriate such that the embodiments of the disclosure described herein may be capable of operation in sequences other than those illustrated or described herein.
It should be understood that, in various embodiments of the present disclosure, the size of the sequence number of each process does not mean that the execution sequence of each process should be determined by its functions and internal logic, and should not constitute any limitation on the implementation process of the embodiments of the present disclosure.
It should be understood that in this disclosure, "comprising" and "having" and any variations thereof are intended to cover non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements that are expressly listed or inherent to such process, method, article, or apparatus.
It should be understood that in this disclosure, "plurality" means two or more. "and/or" is merely an association relationship describing an association object, and means that three relationships may exist, for example, and/or B may mean: a exists alone, A and B exist together, and B exists alone. The character "/" generally indicates that the context-dependent object is an "or" relationship. "comprising A, B and C", "comprising A, B, C" means that all three of A, B, C comprise, "comprising A, B or C" means that one of the three comprises A, B, C, and "comprising A, B and/or C" means that any 1 or any 2 or 3 of the three comprises A, B, C.
It should be understood that in this disclosure, "B corresponding to a", "a corresponding to B", or "B corresponding to a" means that B is associated with a from which B may be determined. Determining B from a does not mean determining B from a alone, but may also determine B from a and/or other information. The matching of A and B is that the similarity of A and B is larger than or equal to a preset threshold value.
As used herein, "if" may be interpreted as "at … …" or "at … …" or "in response to a determination" or "in response to detection" depending on the context.
The technical scheme of the present disclosure is described in detail below with specific examples. The following embodiments may be combined with each other, and some embodiments may not be repeated for the same or similar concepts or processes.
Future IP-based multicast networks support lossless and non-compressed transmission of signals, and non-blocking scheduling is a key for realizing lossless and non-compressed transmission of multimedia signal streams. In the scheduling process, an optimal scheduling mode can be obtained through a load balancing algorithm, and in the related art, the common load balancing algorithm is as follows:
round Robin (Round Robin)
The round robin method will cycle the received streaming requests to each physical link between the spine-leaf. If this is used, each physical link in the ingress IP matrix for all flow groups should have similar resource capacity and similar load-bearing. Round robin scheduling is a simple and efficient way of allocating requests. However, the round robin procedure should be specific to different flow group types, which means different network bandwidth occupation, so this approach does not meet the requirement of network link load balancing inside the IP matrix.
Weighted round robin (Weighted Round Robin)
The algorithm solves the defects of a simple round robin scheduling algorithm: incoming flow set issuing requests are assigned to several links in the IP matrix in sequence, but the weights assigned in advance for each physical link are considered. The administrator simply defines the link weights by physical links. Link a is given a weight of 100 while link B is given a weight of 50. This means that link a will continuously accept 2 requests before link B receives the first request, and so on. But the physical link is inherently of a quality and therefore does not require a weighted round robin approach.
Minimum number of bearers (Least Connection)
The "least number of connections" algorithm may avoid: incoming requests are allocated according to the bandwidth carried by each physical link. I.e. the link with the least bearer bandwidth will automatically receive the next incoming request. The IP matrix controller calculates the bandwidth of all links within the IP matrix. The method can develop a multimedia signal flow scheduling balancing and switching method based on the algorithm, so that network link loads are balanced.
Fig. 1 exemplarily shows a flowchart of a multimedia signal stream scheduling equalization and handover method according to an embodiment of the present disclosure, as shown in fig. 1, the method includes:
Step S1, acquiring a weighted undirected graph comprising nodes and links between the nodes, wherein the nodes comprise an optical switch, a server and terminal equipment;
step S2, determining a cost function between any nodes according to the nodes and the links;
step S3, determining a link multiplexing function between any nodes according to the links;
and S4, determining a multicast tree model of multimedia signal stream transmission from a root node to any node in the loss weighted undirected graph according to the cost function and the link multiplexing function.
In step S1, a weighted undirected graph g= (V, E) may be obtained according to an embodiment of the present disclosure; the weighted undirected graph may be a graph formed by abstracting nodes (e.g. optical switches, servers, terminal devices, etc.) and links passing through in the process of transmitting the multimedia signal stream, i.e. V is a set of nodes in the weighted undirected graph, v= { V 1 ,V 2 …V n E is a set of links between nodes, e= { E 1 ,e 2 …e m }. Thus, in the weighted undirected graph, nodes and links between nodes may be included, which may be unidirectional links or bidirectional links, and this disclosure is not limited in this regard.
According to an embodiment of the present disclosure, the multimedia signal stream is acquired by the monitoring front end, and the optical switch node further includes an optical transceiver and a router, and the multimedia signal stream is transmitted between the nodes according to the multicast tree model. The monitoring front-end may include a camera and an image processing device at the front-end, and may convert the acquired video stream into a multimedia signal stream, so that the video stream may be transmitted in a link, for example, to an optical switch or other node.
According to an embodiment of the present disclosure, the node comprises an optical switch node, in which an optical transceiver may be further included for receiving or transmitting a multimedia signal stream. In the optical switch node, a router may be further included, and may be configured to find an address of the multimedia signal stream and transmit the address through the optical transceiver link. In a link, an optical cable may be included, which is made up of a plurality of optical fibers, which may be used to efficiently transmit multimedia signal streams. Further, since the optical cable has an upper transmission limit, the link also has a transmission cost and an upper multiplexing limit.
According to an embodiment of the present disclosure, the multicast tree model may be obtained through the above-described multimedia signal streaming method, and may be used to determine an optimal multimedia signal streaming route that balances the load of the entire network link.
In an example, after the multimedia signal stream is acquired by the monitoring front end, the multimedia signal stream may be transmitted to different nodes through various links, for example, to different optical switches, and transmitted to different terminal devices or servers by the optical switches, and the servers may also accept access of the terminal devices to acquire the multimedia signal stream, so a transmission link network of the multimedia signal stream is complex, and load imbalance between links is easy to occur, which leads to a situation that the overall transmission efficiency is reduced. Therefore, the multicast tree model can be obtained by the multimedia signal stream transmission method, and the optimal transmission path of the multimedia signal stream is determined based on the multicast tree model, so that the load of each network link is balanced, the overall transmission efficiency is improved, and the requirements of lossless and non-compression transmission of the multimedia signal stream are met.
According to an embodiment of the present disclosure, in step S2, a cost function between any nodes may be determined according to the nodes and the links. The cost function is the transmission cost of a transmission link through which a certain node transmits a multimedia signal stream to another node. As described above, links have transmission costs because of the upper transmission limit of the fiber optic cable. In addition, the transmission cost may be determined by other factors, such as transmission cost, transmission time, bandwidth, latency, resource occupation, etc., and the present disclosure does not limit the determination factors of the transmission cost.
According to an embodiment of the present disclosure, step S2 may include: determining the Cost function Cost (u, v) according to equation (1):
Cost (u,v)＝∑ x,y∈P(u,v) C(x,y) (1)
wherein (u, v) is any two nodes, P (u, v) is a set of nodes included on a link between the (u, v) nodes, and (x, y) is any two nodes of P (u, v), wherein C (x, y) is a multimedia signal stream transmission cost between any two nodes. The transmission cost C (x, y) of the multimedia signal flow between any two nodes is determined by at least one of transmission cost, transmission time, bandwidth, waiting time and resource occupation between any two nodes.
According to an embodiment of the present disclosure, (u, v) is any two nodes, which may be adjacent nodes or non-adjacent nodes, and if the two nodes are non-adjacent nodes, there may also be a plurality of nodes on a link between the two nodes, where a node on a link between the two nodes, and the two nodes may both be (x, y) two nodes. The links between the (x, y) two nodes are each a subset of the links between the (u, v) two nodes.
According to the embodiment of the disclosure, the cost function of the link between any two nodes can be determined based on the formula (1), so that the cost function of the transmission of the multimedia signal stream from the root node to any node can be determined in the multicast tree model, the cost function is minimized, the cost of each link is minimized and balanced, and the purposes of balancing the loads of each network link and improving the overall transmission efficiency are achieved.
According to an embodiment of the present disclosure, in step S3, a link multiplexing function between any nodes may be determined according to the links. The link multiplexing function is the number of channels to which the link is multiplexed, and as described above, there is an upper limit for transmission of the optical cable, and thus there is an upper limit for multiplexing the link. That is, a link may be multiplexed with multiple data streams, i.e., multiple data streams are transmitted over the same link. In the process of multimedia signal stream transmission, when the multimedia signal stream acquired by the monitoring front end is transmitted to a plurality of nodes, the same link is used between certain nodes, namely, link multiplexing is performed, but the link has a multiplexing upper limit, so when the multicast tree model is determined, when the same link is multiplexed by multiple multimedia signal streams, the channel number of the multimedia signal stream does not exceed the multiplexing upper limit of the link.
According to an embodiment of the present disclosure, step S3 may include: determining the link multiplexing function Multi (u, v) according to formula (2):
Multi (u,v)＝∑ x,y∈P(u,v) M(x,y) (2)
wherein (u, v) is any two nodes, P (u, v) is a set of nodes included on a link between the (u, v) nodes, and (x, y) is any two nodes of P (u, v), wherein M (x, y) is a number of link multiplexing channels between any two nodes.
According to an embodiment of the present disclosure, a link multiplexing function Multi (u, v) between any two nodes (u, v) may be determined based on formula (2), where (u, v) is any two nodes, and the two nodes may be adjacent nodes or non-adjacent nodes, and if the two nodes are non-adjacent nodes, there may be a plurality of nodes on a link between the two nodes, where a node on a link between the two nodes, and the two nodes may be both (x, y) two nodes. The links between the (x, y) two nodes are each a subset of the links between the (u, v) two nodes. Thus, the number of link multiplexing channels M (x, y) between two nodes (x, y) is a subset of the link multiplexing function Multi (u, v) between two nodes (u, v), and M (x, y) can be summed to obtain Multi (u, v).
According to the embodiment of the disclosure, the link multiplexing function of the multimedia signal stream transmitted from the root node to any node can be determined in the multicast tree model, and the link multiplexing function between the root node and any node does not exceed the multiplexing upper limit, so that the link can smoothly transmit the multimedia signal, the transmission waiting time is reduced, the overall transmission load is reduced, the load of the transmission network is balanced, and the overall transmission efficiency is improved.
According to an embodiment of the present disclosure, after obtaining the cost function and the link multiplexing function between any two nodes described above, an optimal path between a root node to any node may be determined based on the obtained two functions in step S5. Any node can be one or more nodes, in the optimal path, multiple multimedia signal streams can be multiplexed with the same link, and one path of multimedia signal stream can also be enabled to flow through multiple links, and finally reach the destination node, namely, the destination node can be reached after the turnover of the multiple nodes, so that the overall transmission efficiency is maximized, and the overall transmission load is balanced.
According to an embodiment of the present disclosure, step S5 may include: optimizing according to the following constraint condition (3) to obtain the multicast tree model:
∑ e∈P(u,v) M(e)≤Δ (3)
Wherein E is the link between the root node s and any node, delta is the upper limit of link multiplexing, E T Is a collection of links from a root node to any node.
According to an embodiment of the present disclosure, node s is the root node, multicast tree model t= (V T ,E T ) Wherein V is T The destination node is the destination of the multimedia signal stream transmission, the path node is the node of the path in the process of transmitting the multimedia signal stream to the destination node by the root node s,the destination node set is D, wherein the destination node can be any node other than the root node, and thus the destination node set +.>That is, the destination node set D belongs to the set after all nodes have removed the root node, and the destination node set +.>E T A set E of links from a root node to any node T Subset of set E of links between any two nodes of weighted undirected graph G, i.e. < +.>In summary, the multicast tree model T is a subset of the weighted undirected graph G, that is, the optimal path for the root node to stream the multimedia signal to the destination node, and the nodes of the path, the destination node and the root node are included in the multicast tree model T, so that- >
According to embodiments of the present disclosure, optimization may be performed in a variety of optimization manners to determine an optimal path for multimedia signal streaming under the optimization conditions of the above formula (3), i.e., to determine a multicast tree model. Further, for the case that there may be multiplexing input and/or multiplexing output of the multimedia signal stream in a certain link, the optimization efficiency may be improved by the following constraint condition (4), and an optimal path may be obtained. In the optimization process, the constraint condition further includes formula (4):
Cost(v)＝Cost(u,v)Multi(u)+Cost(u,v) (4)
where Cost (v) is the root node to node v Cost function and Multi (u) is the root node to node u link multiplexing function. Based on the formula (4), the path from the root node to the node v can be made to be the path with the minimum Cost function, that is, the Cost function between any node (u, v) on the right side of the formula (4) is made to be the smallest, the Cost function between any node (u, v) is made to be the node on the path from the root node s to the destination node v, and the link is made not to exceed the upper multiplexing limit, so that the Cost function Cost (v) from the root node to the node v is made to be the smallest.
According to the embodiment of the disclosure, the formula (4) is used as the condition in the optimization, so that the searching of the optimal path can be facilitated, the efficiency of searching the optimal path is improved, and the multicast tree model can be obtained quickly and efficiently.
According to embodiments of the present disclosure, after the multicast tree model is obtained, the multicast tree model may be used in a path determination process for multimedia signal streaming. For example, in the process that the monitoring front end acquires the video multimedia signal stream and transmits the video multimedia signal stream to each node, the optimal path can be determined through the multicast tree model. Alternatively, when the user requests the server to transmit the multimedia signal stream through the terminal device, an optimal path for transmitting the multimedia signal stream to each terminal device by the server may be determined through the multicast tree model.
According to the embodiments of the present disclosure, after the optimal path is determined using the multicast tree model as described above, the multimedia signal stream may be transmitted according to the optimal path through the optical cable. At the time of transmission, a node (e.g., an optical switch) may convert a received signal into an electrical signal, which is provided to a user, e.g., the user may acquire the electrical signal through a terminal device and convert it into multimedia, e.g., video, audio, etc. Alternatively, the optical switch may also convert the electrical signals to optical signals and transmit the optical signals (e.g., multimedia signal streams) to other nodes via fiber optic cables. The optical cable is used for transmitting the multimedia signal stream, so that the anti-interference performance in the transmission process can be improved, the transmission efficiency can be improved, the transmission bandwidth can be increased, the upper load limit in the transmission process can be increased, the optical cable can be used for transmitting larger-scale data, and the lossless and compression-free rapid transmission of the multimedia signal stream can be realized.
By the method for scheduling, balancing and switching the multimedia signal streams, the optimal path of the transmission of the multimedia signal streams, namely, the multicast tree model, can be determined based on constraint conditions by determining the cost function between any nodes and the link multiplexing function between any nodes, so that the load of a plurality of links of a network is balanced, the load of each link is minimized, and the load of each link does not exceed the multiplexing upper limit, thereby improving the overall transmission efficiency.
According to the embodiment of the disclosure, the multimedia signal stream scheduling equalization and switching method can be based on the netconf protocol and IETF standard, can realize the non-blocking scheduling of the radio and television service HD, 4K and 8K, ts streams, and can realize the lossless and non-compression rapid transmission of the multimedia signal stream. The non-blocking scheduling of the leaf ridge architecture is realized, and a large-scale broadcast and television activity scene can be supported. And each link in the system can be ensured to be loaded uniformly, so that network bandwidth is saved. Further, the multimedia signal flow scheduling equalization and switching method can be operated through the SDN controller, so that the SDN controller supports second-level dynamic capacity expansion and smooth upgrading of the system; the SDN controller supports a security system, adopts a white list mechanism of a seven-tuple mac address, prevents illegal intrusion equipment from entering a I P system, has a VPN management function and has an IP address level access control function for a bottom router; the method has the capability of actively discovering unknown multimedia signal streams; and the SDN controller is used for carrying out omnibearing management on a downstream router, and comprises router port fanout, PTP setting, input and output flow rate monitoring, QOS guarantee, fec verification and port speed limiting.
The multimedia signal stream scheduling equalization and switching method has the following application scenes:
1. the media controller remains unchanged and still defines an input signal stream group and an output signal stream group;
2. the matrix controller receives the service requirement issued by the media controller, analyzes the overlapping relation of the signal flow groups and the distribution condition of the output Leaf and the output ports (input and output flow group identification information such as multicast group address), and sends a total signal (1 video flow+N audio flow+1 auxiliary data flow) from the input Leaf1 node to the required output Leaf and the different ports of the output Leaf according to the algorithm calculation result.
Specifically, after receiving the service requirement issued by the media controller, the matrix controller generates a complete signal flow table (including 1 path of video, 3 paths of audio and 1 path of auxiliary data) by the Leaf1 based on the multimedia signal flow scheduling equalization and switching method, and issues the complete signal flow table to Leaf1, spine1, leaf2 and Leaf4 nodes according to the complete signal flow table, and only 1 part of bandwidth consumption is generated in the signal transmission process. Meanwhile, the matrix controller sends out interface flow tables up and down in the Leaf2 and the Leaf4, such as video and audio 1 flow required by the output port 1 of the Leaf2 to output the signal 1, the output port 2 outputs the signal 2, and the output port 3 of the Leaf4 outputs the signal 3.
This implementation solves the problem of wasting bandwidth between Leaf and Spine: after matching through a scheduling algorithm, copying the whole input signal according to one flow only when the input signal is sent to the same output Leaf; meanwhile, the complexity of the intermediate flow table is simplified, the matrix controller outputs the whole intermediate flow table to each output node in a single way, and output flow is formed at the output ports of each output node according to output signal combination, and then the output flow is forwarded; when the signals are switched, only the input stream table and the output interface stream table are changed, and the intermediate stream table is unchanged.
Through experimental tests, the multiplexing algorithm of the IP matrix controller realizes input flow, three output flows are arranged at the far end, and one path of bandwidth is occupied. Reducing the requirement on the system bandwidth; the bandwidth consumption of the network inside the IP matrix is reduced, and the system performance is improved.
Fig. 2 schematically illustrates a case diagram of a multimedia signal stream scheduling equalization and handover method according to an embodiment of the present disclosure. As shown on the left side of fig. 2, in the case of a ring network, a multimedia signal stream may be transmitted from a root node (e.g., a monitoring front end, a server, etc.) to any node (e.g., an optical switch, etc.) in the environment network through an optical cable, and then in the course of transmission, a cost function of a link in the ring network transmitted from the root node to the any node, for example, a cost function transmitted from one side of the ring network to the any node, and a cost function transmitted from the other side of the ring network to the any node, may be considered, and a minimum value of the cost function may be determined, so that an optimal path, i.e., a multicast tree model, may be determined.
As shown on the right side of fig. 2, is a star network. The multimedia signal stream may be transmitted by the root node (e.g., monitoring front end, server, etc.) to any node in the ambient network (e.g., optical switch, etc.) through the optical cable, and then in the transmission process, the multiplexing upper limit of the links of the outwardly diverging nodes in the star network may be considered, and the optimal path may be determined without exceeding the multiplexing upper limit of the links, and the multimedia signal stream may be transmitted by the root node to any node according to the optimal path.
Fig. 3 exemplarily shows a block diagram of a multimedia signal stream scheduling equalization and switching apparatus according to an embodiment of the present disclosure, as shown in fig. 3, the apparatus includes: a weighted undirected graph acquisition module 11, configured to acquire a weighted undirected graph including a node and a link between nodes, where the node includes an optical switch, a server, and a terminal device; a cost function determining module 12, configured to determine a cost function between any nodes according to the node and the link; a link multiplexing function determining module 13, configured to determine a link multiplexing function between any nodes according to the link; and the multicast tree model obtaining module 14 is configured to determine a multicast tree model for multimedia signal stream transmission from a root node to any node in the loss weighted undirected graph according to the cost function and the link multiplexing function.
According to an embodiment of the disclosure, the cost function determination module is further configured to: according to the formula Cost (u, v) = Σ x,y∈P(u,v) C (x, y) determining the Cost function Cost (u, v), wherein (u, v) is any two nodes, P (u, v) is a set of nodes included on a link between the (u, v) nodes, and (x, y) is any two nodes in P (u, v), wherein C (x, y) is a multimedia signal stream transmission Cost between any two nodes.
According to an embodiment of the present disclosure, the transmission cost C (x, y) of the multimedia signal stream between any two nodes is determined by at least one of transmission cost, transmission time, bandwidth, latency, and resource occupation between any two nodes.
According to an embodiment of the disclosure, the link multiplexing function determination module is further configured to: multi (u, v) = Σaccording to the formula x,y∈P(u,v) M (x, y) determining the link multiplexing function Multi (u, v), wherein (u, v) is any two nodes, P (u, v) is a set of nodes included on a link between the (u, v) nodes, and (x, y) is any two nodes in P (u, v), wherein M (x, y) is the number of link multiplexing channels between any two nodes.
According to an embodiment of the present disclosure, the multicast tree model obtaining module is further configured to: optimizing according to the following constraint conditions to obtain the multicast tree model, Sigma (sigma) e∈P(u,v) M (E) is less than or equal to delta, wherein E is a link between a root node s and any node, delta is a link multiplexing upper limit, E T Is a collection of links from a root node to any node.
According to an embodiment of the disclosure, in the optimization process, the constraint further includes a formula Cost (v) =cost (u, v) Multi (u) +cost (u, v), where Cost (v) is a root node to node v Cost function and Multi (u) is a root node to node u link multiplexing function.
According to an embodiment of the present disclosure, the multimedia signal stream is acquired by the monitoring front end, and the optical switch node further includes an optical transceiver and a router, and the multimedia signal stream is transmitted between the nodes according to the multicast tree model.
FIG. 4 is a block diagram of a multimedia signal stream scheduling equalization and switching device, according to an exemplary embodiment; as shown, the apparatus includes one or more of the following components: a processing component 1502, a memory 1504, a power component 1506, a multimedia component 1508, an audio component 1510, an input/output (I/O) interface 1512, a sensor component 1514, and a communications component 1516.
The processing component 1502 generally controls overall operation of the device 1500, such as operations associated with display, telephone calls, data communications, camera operations, and recording operations. The processing component 1502 may include one or more processors 1520 to execute instructions to perform all or part of the steps of the methods described above. Further, the processing component 1502 may include one or more modules that facilitate interactions between the processing component 1502 and other components. For example, the processing component 1502 may include a multimedia module to facilitate interaction between the multimedia component 1508 and the processing component 1502.
The memory 1504 is configured to store various types of data to support operations at the device 1500. Examples of such data include instructions for any application or method operating on device 1500, contact data, phonebook data, messages, pictures, video, and the like. The memory 1504 may be implemented by any type or combination of volatile or nonvolatile memory devices such as Static Random Access Memory (SRAM), electrically erasable programmable read-only memory (EEPROM), erasable programmable read-only memory (EPROM), programmable read-only memory (PROM), read-only memory (ROM), magnetic memory, flash memory, magnetic or optical disk.
The power supply assembly 1506 provides power to the various components of the device 1500. The power supply component 1506 can include a power management system, one or more power supplies, and other components associated with generating, managing, and distributing power for the device 1500.
The multimedia component 1508 comprises a screen between the device 1500 and the user that provides an output interface. In some embodiments, the screen may include a Liquid Crystal Display (LCD) and a Touch Panel (TP). If the screen includes a touch panel, the screen may be implemented as a touch screen to receive input signals from a user. The touch panel includes one or more touch sensors to sense touches, swipes, and gestures on the touch panel. The touch sensor may sense not only the boundary of a touch or sliding action, but also the duration and pressure associated with the touch or sliding operation. In some embodiments, multimedia assembly 1508 includes a front camera and/or a rear camera. The front camera and/or the rear camera may receive external multimedia data when the device 1500 is in an operational mode, such as a shooting mode or a video mode. Each front camera and rear camera may be a fixed optical lens system or have focal length and optical zoom capabilities.
The audio component 1510 is configured to output and/or input audio signals. For example, the audio component 1510 includes a Microphone (MIC) configured to receive external audio signals when the device 1500 is in an operational mode, such as a call mode, a recording mode, and a voice recognition mode. The received audio signals may be further stored in the memory 1504 or transmitted via the communication component 1516. In some embodiments, the audio component 1510 further comprises a speaker for outputting audio signals.
The I/O interface 1512 provides an interface between the processing component 1502 and peripheral interface modules, which can be keyboards, click wheels, buttons, and the like. These buttons may include, but are not limited to: homepage button, volume button, start button, and lock button.
The sensor assembly 1514 includes one or more sensors for providing status assessment of various aspects of the device 1500. For example, the sensor assembly 1514 may detect an on/off state of the device 1500, a relative positioning of the components, such as a display and keypad of the device 1500, the sensor assembly 1514 may also detect a change in position of the device 1500 or one component of the device 1500, the presence or absence of user contact with the device 1500, an orientation or acceleration/deceleration of the device 1500, and a change in temperature of the device 1500. The sensor assembly 1514 may include a proximity sensor configured to detect the presence of nearby objects without any physical contact. The sensor assembly 1514 may also include a light sensor, such as a CMOS or CCD image sensor, for use in imaging applications. In some embodiments, the sensor assembly 1514 may also include an acceleration sensor, a gyroscopic sensor, a magnetic sensor, a pressure sensor, or a temperature sensor.
The communication component 1516 is configured to facilitate communication between the device 1500 and other devices, either wired or wireless. The device 1500 may access a wireless network based on a communication standard, such as WiFi, 2G, 3G, 4G, 5G, or a combination thereof, or an intercom network. In one exemplary embodiment, the communication component 1516 receives broadcast signals or broadcast-related information from an external broadcast management system via a broadcast channel. In one exemplary embodiment, the communication component 1516 further includes a Near Field Communication (NFC) module to facilitate short range communications. For example, the NFC module may be implemented based on Radio Frequency Identification (RFID) technology, infrared data association (IrDA) technology, ultra Wideband (UWB) technology, bluetooth (BT) technology, and other technologies.
In an exemplary embodiment, the apparatus 1500 may be implemented by one or more Application Specific Integrated Circuits (ASICs), digital Signal Processors (DSPs), digital Signal Processing Devices (DSPDs), programmable Logic Devices (PLDs), field Programmable Gate Arrays (FPGAs), controllers, microcontrollers, microprocessors, or other electronic components for executing the methods described above.
In an exemplary embodiment, a non-transitory computer-readable storage medium is also provided, such as memory 1504, including instructions executable by processor 1520 of device 1500 to perform the above-described methods. For example, the non-transitory computer readable storage medium may be ROM, random Access Memory (RAM), CD ROM, magnetic tape, floppy disk, optical data storage device, etc.
Fig. 5 is a block diagram illustrating a multimedia signal stream scheduling equalization and switching electronic device, according to an example embodiment. For example, the device 1600 may be provided as a server. The device 1600 includes a processing component 1602 that further includes one or more processors, and memory resources represented by a memory 1603 for storing instructions, such as application programs, executable by the processing component 1602. The application programs stored in memory 1603 may include one or more modules each corresponding to a set of instructions. Further, the processing component 1602 is configured to execute instructions to perform the methods described above.
The device 1600 may also include a power component 1606 configured to perform power management of the device 1600, a wired or wireless network interface 1605 configured to connect the device 1600 to a network, and an input output (I/O) interface 1608. The device 1600 may operate based on an operating system stored in memory 1603, such as Windows Server, mac OS XTM, unixTM, linuxTM, freeBSDTM, or the like.
The present invention may be a method, apparatus, system, and/or computer program product. The computer program product may include a computer readable storage medium having computer readable program instructions embodied thereon for performing various aspects of the present invention.
The computer readable storage medium may be a tangible device that can hold and store instructions for use by an instruction execution device. The computer readable storage medium may be, for example, but not limited to, an electronic storage device, a magnetic storage device, an optical storage device, an electromagnetic storage device, a semiconductor storage device, or any suitable combination of the foregoing. More specific examples (a non-exhaustive list) of the computer-readable storage medium would include the following: portable computer disks, hard disks, random Access Memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), static Random Access Memory (SRAM), portable compact disk read-only memory (CD-ROM), digital Versatile Disks (DVD), memory sticks, floppy disks, mechanical coding devices, punch cards or in-groove structures such as punch cards or grooves having instructions stored thereon, and any suitable combination of the foregoing. Computer-readable storage media, as used herein, are not to be construed as transitory signals per se, such as radio waves or other freely propagating electromagnetic waves, electromagnetic waves propagating through waveguides or other transmission media (e.g., optical pulses through fiber optic cables), or electrical signals transmitted through wires.
The computer readable program instructions described herein may be downloaded from a computer readable storage medium to a respective computing/processing device or to an external computer or external storage device over a network, such as the internet, a local area network, a wide area network, and/or a wireless network. The network may include copper transmission cables, fiber optic transmissions, wireless transmissions, routers, firewalls, switches, gateway computers and/or edge servers. The network interface card or network interface in each computing/processing device receives computer readable program instructions from the network and forwards the computer readable program instructions for storage in a computer readable storage medium in the respective computing/processing device.
Computer program instructions for carrying out operations of the present invention may be assembly instructions, instruction Set Architecture (ISA) instructions, machine-related instructions, microcode, firmware instructions, state setting data, or source or object code written in any combination of one or more programming languages, including an object oriented programming language such as Smalltalk, c++ or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The computer readable program instructions may be executed entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computer (for example, through the Internet using an Internet service provider). In some embodiments, aspects of the present invention are implemented by personalizing electronic circuitry, such as programmable logic circuitry, field Programmable Gate Arrays (FPGAs), or Programmable Logic Arrays (PLAs), with state information for computer readable program instructions, which can execute the computer readable program instructions.
Various aspects of the present invention are described herein with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer-readable program instructions.
These computer readable program instructions may be provided to a processing unit of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processing unit of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks. These computer readable program instructions may also be stored in a computer readable storage medium that can direct a computer, programmable data processing apparatus, and/or other devices to function in a particular manner, such that the computer readable medium having the instructions stored therein includes an article of manufacture including instructions which implement the function/act specified in the flowchart and/or block diagram block or blocks.
The computer readable program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other devices to cause a series of operational steps to be performed on the computer, other programmable apparatus or other devices to produce a computer implemented process such that the instructions which execute on the computer, other programmable apparatus or other devices implement the functions/acts specified in the flowchart and/or block diagram block or blocks.
The flowcharts and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of instructions, which comprises one or more executable instructions for implementing the specified logical function(s). In some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
Note that all features disclosed in this specification (including any accompanying claims, abstract and drawings) may be replaced by alternative features serving the same, equivalent or similar purpose, unless expressly stated otherwise. Thus, unless expressly stated otherwise, each feature disclosed is one example only of a generic set of equivalent or similar features. Where used, further, preferably, still further and preferably, the brief description of the other embodiment is provided on the basis of the foregoing embodiment, and further, preferably, further or more preferably, the combination of the contents of the rear band with the foregoing embodiment is provided as a complete construct of the other embodiment. A further embodiment is composed of several further, preferably, still further or preferably arrangements of the strips after the same embodiment, which may be combined arbitrarily.
It will be appreciated by persons skilled in the art that the embodiments of the invention described above and shown in the drawings are by way of example only and are not limiting. The objects of the present invention have been fully and effectively achieved. The functional and structural principles of the present invention have been shown and described in the examples and embodiments of the invention may be modified or practiced without departing from the principles described.
Finally, it should be noted that: the above embodiments are only for illustrating the technical solution of the present disclosure, and not for limiting the same; although the present disclosure has been described in detail with reference to the foregoing embodiments, it should be understood by those of ordinary skill in the art that: the technical scheme described in the foregoing embodiments can be modified or some or all of the technical features thereof can be replaced by equivalents; such modifications and substitutions do not depart from the spirit of the corresponding technical solutions from the scope of the technical solutions of the embodiments of the present disclosure.
Claims (6)
1. The method for scheduling equalization and switching of the multimedia signal stream is characterized by comprising the following steps:
acquiring a weighted undirected graph comprising nodes and links between the nodes, wherein the nodes comprise an optical switch, a server and terminal equipment;
determining a cost function between any nodes according to the nodes and the links;
determining a link multiplexing function between any nodes according to the links;
determining a multicast tree model of multimedia signal stream transmission from a root node to any node in the weighted undirected graph according to the cost function and the link multiplexing function;
determining a link multiplexing function between any nodes according to the links, including:
Multi (u, v) = Σaccording to the formula x，y∈P(u，v) M (x, y), determining the link multiplexing function Multi (u, v), wherein u, v is any two nodes, P (u, v) is a set of nodes included on a link between u, v nodes, x, y is any two nodes in P (u, v), and M (x, y) is the number of link multiplexing channels between any two nodes;
according to the cost function and the link multiplexing function, determining a multicast tree model for multimedia signal stream transmission from a root node to any node in the weighted undirected graph, including:
optimizing according to the following constraint conditions to obtain the multicast tree model, sigma (sigma) e∈P(u,v) M (E) is less than or equal to delta, wherein E is a link between a root node s and any node, delta is a link multiplexing upper limit, E T A set of links from a root node to any node;
in the optimization process, the constraint condition further comprises a formula Cost (v) =cost (u, v,) Multi (u) +cost (u, v), wherein Cost (v) is a Cost function from a root node to a node v, and Multi (u) is a link multiplexing function from the root node to the node u;
determining a cost function between any nodes according to the nodes and the links, wherein the cost function comprises the following steps:
according to the formula Cost (u, v) = Σ x，y∈P(u，v) C (x, y) determining the Cost function Cost (u, v), wherein u, v is any two nodes, P (u, v) is a set of nodes included on a link between the u and v nodes, x, y is any two nodes in P (u, v), and C (x, y) is a multimedia signal stream transmission Cost between any two nodes.
2. The method of claim 1, wherein the transmission cost C (x, y) of the multimedia signal stream between any two nodes is determined by at least one of transmission cost, transmission time, bandwidth, latency, and resource occupancy between any two nodes.
3. The method of claim 1, wherein the multimedia signal stream is acquired by a monitoring front end, the optical switch node further comprising an optical transceiver and a router, the multimedia signal stream being transmitted between the nodes in accordance with the multicast tree model over an optical fiber.
4. A multimedia signal stream scheduling equalization and switching device, comprising:
the system comprises a weighted undirected graph acquisition module, a weighted undirected graph acquisition module and a weighted undirected graph acquisition module, wherein the weighted undirected graph acquisition module is used for acquiring a weighted undirected graph comprising nodes and links between the nodes, and the nodes comprise an optical switch, a server and terminal equipment;
the cost function determining module is used for determining a cost function between any nodes according to the nodes and the links;
The link multiplexing function determining module is used for determining a link multiplexing function between any nodes according to the links;
the multicast tree model obtaining module is used for determining a multicast tree model of multimedia signal stream transmission from a root node to any node in the weighted undirected graph according to the cost function and the link multiplexing function;
the link multiplexing function determination module is further configured to: multi (u, v) = Σaccording to the formula x，y∈P(u,v) M (x, y), determining the link multiplexing function Multi (u, v), wherein u, v is any two nodes, P (u, v) is a set of nodes included on a link between u, v nodes, x, y is any two nodes in P (u, v), and M (x, y) is the number of link multiplexing channels between any two nodes;
the multicast tree model obtaining module is further configured to: optimizing according to the following constraint conditions to obtain the multicast tree model,sigma (sigma) e∈P(u,v) M (E) is less than or equal to delta, wherein E is a link between a root node s and any node, delta is a link multiplexing upper limit, E T A set of links from a root node to any node;
in the optimization process, the constraint condition further comprises a formula Cost (v) =cost (u, v) Multi (u) +cost (u, v), wherein Cost (v) is a Cost function from a root node to a node v, and Multi (u) is a link multiplexing function from the root node to the node u;
Determining a cost function between any nodes according to the nodes and the links, wherein the cost function comprises the following steps:
according to the formula Cost (u, v) = Σ x，y∈P(u,v) C (x, y) determining the Cost function Cost (u, v), wherein u, v is any two nodes, P (u, v) is a set of nodes included on a link between the u and v nodes, x, y is any two nodes in P (u, v), and C (x, y) is a multimedia signal stream transmission Cost between any two nodes.
5. An apparatus, comprising:
a processor;
a memory for storing processor-executable instructions;
wherein the processor is configured to invoke the instructions stored in the memory to perform the method of any of claims 1 to 3.
6. A computer readable storage medium having stored thereon computer program instructions, which when executed by a processor, implement the method of any of claims 1 to 3.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210888853.8A CN115277301B (en) | 2022-07-27 | 2022-07-27 | Method and device for scheduling equalization and switching of multimedia signal streams |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210888853.8A CN115277301B (en) | 2022-07-27 | 2022-07-27 | Method and device for scheduling equalization and switching of multimedia signal streams |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115277301A CN115277301A (en) | 2022-11-01 |
| CN115277301B true CN115277301B (en) | 2023-09-26 |
Family
ID=83770385
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210888853.8A Active CN115277301B (en) | 2022-07-27 | 2022-07-27 | Method and device for scheduling equalization and switching of multimedia signal streams |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115277301B (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110266600A (en) * | 2019-05-29 | 2019-09-20 | 西南电子技术研究所（中国电子科技集团公司第十研究所） | Bandwidth constraint multicast routing optimization method |
| CN110401824A (en) * | 2019-07-24 | 2019-11-01 | 北京小鸟科技股份有限公司 | KVM optical transmission system, the tandem type optical transmitter and receiver, optical interface card of multiplexing |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP5071165B2 (en) * | 2007-03-19 | 2012-11-14 | 日本電気株式会社 | Route multiplexing communication system, communication node, and communication method |
| US10129043B2 (en) * | 2015-11-04 | 2018-11-13 | Huawei Technologies Canada Co., Ltd. | Apparatus and method for network flow scheduling |
-
2022
- 2022-07-27 CN CN202210888853.8A patent/CN115277301B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110266600A (en) * | 2019-05-29 | 2019-09-20 | 西南电子技术研究所（中国电子科技集团公司第十研究所） | Bandwidth constraint multicast routing optimization method |
| CN110401824A (en) * | 2019-07-24 | 2019-11-01 | 北京小鸟科技股份有限公司 | KVM optical transmission system, the tandem type optical transmitter and receiver, optical interface card of multiplexing |
Non-Patent Citations (1)
| Title |
|---|
| 链路共享的时延约束组播路由局部平衡优化算法;刘维群 等;《计算机应用研究》;第29卷(第03期);引言及第1节 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115277301A (en) | 2022-11-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| WO2020116928A1 (en) | Method and apparatus for management of network based media processing functions in wireless communication system | |
| WO2014069798A1 (en) | Voice recognition apparatus and voice recognition method thereof | |
| US20220167026A1 (en) | Network based media processing control | |
| WO2015009086A1 (en) | Multi-level speech recognition | |
| CN107979534B (en) | Method implemented in a device connected to a user premises equipment and corresponding device | |
| CN108809686B (en) | Resource synchronization method and device, electronic equipment and computer readable storage medium | |
| CN106888079A (en) | Resource allocation methods and device | |
| CN108355350B (en) | Application service access method and device based on mobile edge computing | |
| IL226516A (en) | Wireless device system-architecture | |
| WO2020185000A1 (en) | Methods and systems for optimizing processing of application requests | |
| CN113366812B (en) | Providing communication services using a set of I/O devices | |
| US20200304469A1 (en) | Methods and apparatus for controlling and implementing firewalls | |
| CN108958762A (en) | A kind of upgrade method and device of software | |
| CN115211151B (en) | Data analysis method and device for wireless network, communication equipment and storage medium | |
| WO2014092372A1 (en) | Method and apparatus for cloud based power management of local network devices | |
| WO2023125350A1 (en) | Audio data pushing method, apparatus and system, and electronic device and storage medium | |
| CN110099240B (en) | Control method and device for video conference | |
| CN115277301B (en) | Method and device for scheduling equalization and switching of multimedia signal streams | |
| WO2021223157A1 (en) | Communication control method and communication control apparatus | |
| CN112328318A (en) | Method and device for automatic planning of proprietary cloud platform and storage medium | |
| US20230007573A1 (en) | Methods and apparatus for media communication services using network slicing | |
| WO2023206563A1 (en) | Scheduling information determination method and apparatus, and downlink control information sending method and apparatus | |
| CN112566262B (en) | Data processing method and device, communication equipment and storage medium | |
| CN110198429B (en) | Method and device for video conference hierarchical scheduling | |
| CN108924085B (en) | Network scheduling method, device and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |