CN109150732B - Video transmission optimization method of meat product production safety monitoring system - Google Patents

Video transmission optimization method of meat product production safety monitoring system Download PDF

Info

Publication number
CN109150732B
CN109150732B CN201811133976.0A CN201811133976A CN109150732B CN 109150732 B CN109150732 B CN 109150732B CN 201811133976 A CN201811133976 A CN 201811133976A CN 109150732 B CN109150732 B CN 109150732B
Authority
CN
China
Prior art keywords
node
link
core
multicast
nodes
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
Application number
CN201811133976.0A
Other languages
Chinese (zh)
Other versions
CN109150732A (en
Inventor
江晓
李斌
郭威
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Guangdong Rong Yip Food Co.,Ltd.
Original Assignee
Guangdong Rong Yip Food 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 Guangdong Rong Yip Food Co ltd filed Critical Guangdong Rong Yip Food Co ltd
Priority to CN201811133976.0A priority Critical patent/CN109150732B/en
Publication of CN109150732A publication Critical patent/CN109150732A/en
Application granted granted Critical
Publication of CN109150732B publication Critical patent/CN109150732B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/16—Multipoint routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation
    • H04L45/121—Shortest path evaluation by minimising delays
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation
    • H04L45/124—Shortest path evaluation using a combination of metrics
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation
    • H04L45/125—Shortest path evaluation based on throughput or bandwidth
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation
    • H04L45/126—Shortest path evaluation minimising geographical or physical path length
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/48—Routing tree calculation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N7/00—Television systems
    • H04N7/18—Closed-circuit television [CCTV] systems, i.e. systems in which the video signal is not broadcast

Landscapes

  • Engineering & Computer Science (AREA)
  • Signal Processing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Multimedia (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The invention discloses a video transmission optimization method of a meat product production safety supervision system. The method mainly comprises the following steps: A. respectively selecting core nodes according to a source node and a destination node in a video transmission network of the meat product production safety monitoring system; B. setting an upstream node and a downstream node by performing reverse path forwarding check on a core node, and constructing a multi-core multicast shared tree; C. the multicast packet is distributed with a virtual channel reserved slice cache region, so that the full self-adaption performance of the multicast route is improved, and the deadlock phenomenon is prevented; D. and the multicast transmission delay is slowed down by a self-adaptive data packet copying method, and the video transmission optimization of the meat product production safety monitoring system is completed. The method has strong expandability and fault tolerance, effectively utilizes the buffering resources of the network, improves the network performance, reduces the network overhead, avoids the occurrence of network congestion and even deadlock, and provides the transmission quality of the video.

Description

Video transmission optimization method of meat product production safety monitoring system
Technical Field
The invention belongs to the fields of information transmission, safety supervision and multicast, and particularly relates to a video transmission optimization method of a meat product production safety supervision system.
Background
In order to strengthen the safety supervision of the meat product production process, the production process needs to be monitored in real time, and monitoring videos are transmitted to a main control room. The existing video transmission has the phenomena of network congestion, processor overload, transmission delay and the like due to high video definition and large capacity, so that bandwidth resources are short, the network throughput is obviously reduced, a video receiver cannot reach acceptable flow characteristics easily, the network overhead is high, and the quality of received video is to be improved.
Disclosure of Invention
In order to solve the above problems, an object of the present invention is to provide a meat product production safety monitoring system video transmission optimization method with strong expandability and fault tolerance, which effectively utilizes buffering resources of a network, improves network performance, reduces network overhead, avoids network congestion and even deadlock, and provides video transmission quality.
A video transmission optimization method of a meat product production safety supervision system selects core nodes to construct a multi-core multicast shared tree, and performs transmission optimization by preventing deadlock and slowing transmission delay, wherein the method comprises the following steps:
A. respectively selecting core nodes according to a source node and a destination node in a video transmission network of the meat product production safety monitoring system;
B. setting an upstream node and a downstream node by performing reverse path forwarding check on a core node, and constructing a multi-core multicast shared tree;
C. the multicast packet is distributed with a virtual channel reserved slice cache region, so that the full self-adaption performance of the multicast route is improved, and the deadlock phenomenon is prevented;
D. and the multicast transmission delay is slowed down by a self-adaptive data packet copying method, and the video transmission optimization of the meat product production safety monitoring system is completed.
Further, the step a comprises:
(1) all monitoring equipment of meat product production safety monitoring system are used as source nodes n of video transmission networksSelecting a source core node n in the video transmission network of the meat product production safety monitoring system according to the minimum value of the sum of the distances d between the source node and the core nodescNamely:
Figure BDA0001814275380000021
wherein f is the condition of selecting the core node, N is the monitored quantity in the meat product production safety monitoring system,
Figure BDA0001814275380000022
representing the ith source node;
(2) selecting a node N having at least N paths with a source core noder：
R(nr,nsc)≥N
Selecting a destination node n from the nodesdThe nodes with the distance between the nodes less than the parameter threshold value epsilon are taken as target core nodes ndc：
d(ndc,nd)≤ε。
Further, the step B includes:
taking a source core node as a multicast tree root, searching a path set of each node, and setting an upstream node and a downstream node by executing reverse path forwarding check on the source core node and a destination core node; setting a timing device to time the message processing, and if the time is out, sending a message to an upstream node; otherwise, resetting the timer; if receiving the message of disconnecting from the downstream node, readjusting the upstream and downstream identifications; if a message for maintaining connection is received from a downstream node, resetting the timer; if a plurality of destination core nodes are connected to the destination nodes, the node with the minimum link cost is selected to transmit to form a transmission path, so that the multi-core multicast shared tree is constructed.
Further, the step C includes:
(1) if the destination node in the multicast tree has only one output port, transmitting information along the port; if the destination node in the multicast tree has two output ports, the information is transmitted along the port with the least congestion; by allocating a virtual channel to the multicast data packet to reserve a slice cache region, if all information in the link A is sent to the link B, a free virtual channel exists in the link A, and the information in the link D can be sent successfully, so that the free virtual channel exists in the link D, the information in the link C can be sent to the link D, and all the information is sent in sequence, thereby avoiding the deadlock phenomenon;
(2) if all the virtual channels in the link A are occupied, dividing the network into a plurality of areas according to the current position of the information, searching the preferential output port of the information reaching each area, and calculating the utilization function of the link bandwidth:
Figure BDA0001814275380000031
μsfor bandwidth allocation of path s, Vs(μs) Is a cost function of bandwidth allocation, Cs(μs) Is a cost function paid by the network for the use of information in link I, R is the number of paths, L is the number of links, s0Is the number of paths, s, through all linkslThe number of the paths passing through the link I is increased, so that the use efficiency of the link bandwidth is improved, one piece of information in the link A can reach a destination node, a new idle virtual channel is generated, and therefore, other pieces of link information can be transmitted in sequence, and the deadlock phenomenon is prevented.
Further, the step D includes:
if the number of destination nodes for data transmission is increased, the transmission path is prolonged to cause transmission delay, the network is divided into a plurality of areas according to the step C, when a data packet enters the network, the nodes are used for copying the data packet in a self-adaptive mode according to the number of idle ports, the number of the idle ports is at least two, if the destination nodes are located in different areas, the intermediate nodes are used for copying the data packet according to the number of the data packets processed currently, the distribution of the destination nodes and the priority of the idle ports, the priority of the idle output ports depends on the load capacity of the ports, the smaller the load is, the higher the priority is, the multicast transmission delay is relieved through a self-adaptive data packet copying method, and therefore video transmission optimization of the meat product production safety monitoring system.
The invention has the beneficial effects that:
under the condition that the video transmission quantity is larger and larger, the method has stronger expandability and fault tolerance, effectively utilizes the buffering resources of the network, improves the network performance, reduces the network overhead, avoids the occurrence of network congestion and even deadlock, and provides the transmission quality of the video.
Drawings
FIG. 1 is an overall flow chart of a video transmission optimization method of a meat product production safety supervision system;
FIG. 2 is a core node structure diagram;
FIG. 3 is a flow diagram of constructing a multi-core multicast shared tree;
FIG. 4 is a diagram of a network deadlock structure;
Detailed Description
Referring to fig. 1, the method of the present invention comprises the steps of:
A. respectively selecting core nodes according to a source node and a destination node in a video transmission network of the meat product production safety monitoring system (as shown in figure 2);
(1) all monitoring equipment of meat product production safety monitoring system are used as source nodes n of video transmission networksSelecting a source core node n in the video transmission network of the meat product production safety monitoring system according to the minimum value of the sum of the distances d between the source node and the core nodescNamely:
Figure BDA0001814275380000041
wherein f is the condition of selecting the core node, N is the monitored quantity in the meat product production safety monitoring system,
Figure BDA0001814275380000051
representing the ith source node.
(2) Selecting a node N having at least N paths with a source core noder：
R(nr,nsc)≥N
Selecting a destination node n from the nodesdThe nodes with the distance between the nodes less than the parameter threshold value epsilon are taken as target core nodes ndc：
d(ndc,nd)≤ε
B. Setting an upstream node and a downstream node by performing reverse path forwarding check on a core node, and constructing a multi-core multicast shared tree;
and taking the source core node as a multicast tree root, and searching a path set of each node. Upstream nodes and downstream nodes are set by performing reverse path forwarding checks on the source core node and the destination core node. Setting a timing device to time the message processing, and if the time is out, sending a message to an upstream node; otherwise, the timer is reset. If receiving the message of disconnecting from the downstream node, readjusting the upstream and downstream identifications; the timer is reset if a connection maintenance message is received from the downstream node. If a plurality of destination core nodes are connected to the destination node, the node with the smallest link cost is selected to transmit, and a transmission path is formed, so that a multi-core multicast shared tree is constructed (as shown in fig. 3).
C. The multicast packet is distributed with a virtual channel reserved slice cache region, so that the full self-adaption performance of the multicast route is improved, and the deadlock phenomenon is prevented;
(1) if the destination node in the multicast tree has only one output port, transmitting information along the port; if the destination node in the multicast tree has two output ports, the information is transmitted along the port with the least congestion. By allocating the virtual channel reserved slice buffer to the multicast packet, as shown in fig. 4, if all the information in link a is sent to link B, there is a free virtual channel in link a, and there is inevitably one information in link D that can be successfully sent. Therefore, the link D has an idle virtual channel, the information in the link C can be sent to the link D, and all the information is sent in sequence, so that the deadlock phenomenon is avoided.
(2) If all the virtual channels in the link A are occupied, dividing the network into a plurality of areas according to the current position of the information, searching the preferential output port of the information reaching each area, and calculating the utilization function of the link bandwidth:
Figure BDA0001814275380000061
μsfor bandwidth allocation of path s, Vs(μs) Is a cost function of bandwidth allocation, Cs(μs) Is a cost function paid by the network for the use of information in link I, R is the number of paths, L is the number of links, s0Is the number of paths, s, through all linkslIs the number of paths through link I. Thereby improving the efficiency of link bandwidth usage. There is a message in link a that can reach the destination node, thus creating a new idle virtual channel. Therefore, other link information can be transmitted in sequence, and deadlock is prevented from occurring.
D. And the multicast transmission delay is slowed down by a self-adaptive data packet copying method, and the video transmission optimization of the meat product production safety monitoring system is completed.
If the number of destination nodes for data transmission increases, the transmission path is extended, which results in transmission delay. And C, dividing the network into a plurality of areas according to the step C, when a data packet enters the network, the node self-adaptively copies the data packet according to the number of the idle ports, and the number of the idle ports is at least two. If the destination node is located in different areas, the intermediate node copies the data packet according to the number of the data packets processed currently, the distribution of the destination node and the priority of the idle port. The priority of the idle output port depends on the load of the port, the lower the load, the higher the priority. And the multicast transmission delay is slowed down by a self-adaptive data packet copying method, so that the video transmission optimization of the meat product production safety monitoring system is completed.
In conclusion, the video transmission optimization method of the meat product production safety supervision system is completed. The method has strong expandability and fault tolerance, effectively utilizes the buffering resources of the network, improves the network performance, reduces the network overhead, avoids the occurrence of network congestion and even deadlock, and provides the transmission quality of the video.

Claims (2)

1. A video transmission optimization method of a meat product production safety supervision system is characterized by comprising the following steps: selecting a core node to construct a multi-core multicast shared tree, and performing transmission optimization by preventing deadlock and slowing transmission delay, wherein the method comprises the following steps:
A. respectively selecting core nodes according to a source node and a destination node in a video transmission network of the meat product production safety monitoring system; the step A comprises the following steps:
(1) all monitoring equipment of meat product production safety monitoring system are used as source nodes n of video transmission networksSelecting a source core node n in the video transmission network of the meat product production safety monitoring system according to the minimum value of the sum of the distances d between the source node and the core nodescNamely:
Figure FDA0002818598950000011
wherein f is the condition of selecting the core node, N is the monitored quantity in the meat product production safety monitoring system,
Figure FDA0002818598950000012
representing the ith source node;
(2) selecting a node N having at least N paths with a source core noder：
R(nr，nsc)≥N
Selecting a destination node n from the nodesdThe nodes with the distance between the nodes less than the parameter threshold value epsilon are taken as target core nodes ndc：
d(ndc，nd)≤ε；
B. Setting an upstream node and a downstream node by performing reverse path forwarding check on a core node, and constructing a multi-core multicast shared tree; the step B comprises the following steps:
taking a source core node as a multicast tree root, searching a path set of each node, and setting an upstream node and a downstream node by executing reverse path forwarding check on the source core node and a destination core node; setting a timing device to time the message processing, and if the time is out, sending a message to an upstream node; otherwise, resetting the timer; if receiving the message of disconnecting from the downstream node, readjusting the upstream and downstream identifications; if a message for maintaining connection is received from a downstream node, resetting the timer; if a plurality of destination core nodes are connected to the destination nodes, selecting the node with the minimum link cost for transmission to form a transmission path, thereby constructing a multi-core multicast shared tree;
C. the multicast packet is distributed with a virtual channel reserved slice cache region, so that the full self-adaption performance of the multicast route is improved, and the deadlock phenomenon is prevented; the step C comprises the following steps:
(1) if the destination node in the multicast tree has only one output port, transmitting information along the port; if the destination node in the multicast tree has two output ports, the information is transmitted along the port with the least congestion; by allocating a virtual channel to the multicast data packet to reserve a slice cache region, if all information in the link A is sent to the link B, a free virtual channel exists in the link A, and the information in the link D can be sent successfully, so that the free virtual channel exists in the link D, the information in the link C can be sent to the link D, and all the information is sent in sequence, thereby avoiding the deadlock phenomenon;
(2) if all the virtual channels in the link A are occupied, dividing the network into a plurality of areas according to the current position of the information, searching the preferential output port of the information reaching each area, and calculating the utilization function of the link bandwidth:
Figure FDA0002818598950000021
μsfor bandwidth allocation of path s, Vs(μs) Is a cost function of bandwidth allocation, Cs(μs) Is a cost function paid by the network for the use of information in link I, R is the number of paths, L is the number of links, s0Is the number of paths, s, through all linkslThe number of paths passing through the link I is increased, so that the use efficiency of the link bandwidth is improved, one piece of information in the link A can reach a destination node, and a new idle virtual channel is generated, so that other pieces of link information can be transmitted in sequence, and the deadlock phenomenon is prevented;
D. and the multicast transmission delay is slowed down by a self-adaptive data packet copying method, and the video transmission optimization of the meat product production safety monitoring system is completed.
2. The meat product production safety supervision system video transmission optimization method of claim 1, characterized in that: the step D comprises the following steps:
if the number of destination nodes for data transmission is increased, the transmission path is prolonged to cause transmission delay, the network is divided into a plurality of areas according to the step C, when a data packet enters the network, the nodes are used for copying the data packet in a self-adaptive mode according to the number of idle ports, the number of the idle ports is at least two, if the destination nodes are located in different areas, the intermediate nodes are used for copying the data packet according to the number of the data packets processed currently, the distribution of the destination nodes and the priority of the idle ports, the priority of the idle output ports depends on the load capacity of the ports, the smaller the load is, the higher the priority is, the multicast transmission delay is relieved through a self-adaptive data packet copying method, and therefore video transmission optimization of the meat product production safety monitoring system.
CN201811133976.0A 2018-09-27 2018-09-27 Video transmission optimization method of meat product production safety monitoring system Active CN109150732B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201811133976.0A CN109150732B (en) 2018-09-27 2018-09-27 Video transmission optimization method of meat product production safety monitoring system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201811133976.0A CN109150732B (en) 2018-09-27 2018-09-27 Video transmission optimization method of meat product production safety monitoring system

Publications (2)

Publication Number Publication Date
CN109150732A CN109150732A (en) 2019-01-04
CN109150732B true CN109150732B (en) 2021-05-28

Family

ID=64813050

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201811133976.0A Active CN109150732B (en) 2018-09-27 2018-09-27 Video transmission optimization method of meat product production safety monitoring system

Country Status (1)

Country Link
CN (1) CN109150732B (en)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101170516A (en) * 2007-11-29 2008-04-30 杭州华三通信技术有限公司 Status self-adapted method and device for non RPF interface
CN103729331A (en) * 2013-11-26 2014-04-16 西安电子科技大学 On-chip network communication deadlock avoiding method, router and communication network
US20150146603A1 (en) * 2013-11-27 2015-05-28 Architecture Technology Corporation Adaptive multicast network communications
CN105376161A (en) * 2014-08-28 2016-03-02 杭州华三通信技术有限公司 Multicast distribution tree switching method and device
US9319347B1 (en) * 2009-12-10 2016-04-19 Juniper Networks, Inc. Deadlock-resistant fabric tree replication in a network device

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101170516A (en) * 2007-11-29 2008-04-30 杭州华三通信技术有限公司 Status self-adapted method and device for non RPF interface
US9319347B1 (en) * 2009-12-10 2016-04-19 Juniper Networks, Inc. Deadlock-resistant fabric tree replication in a network device
CN103729331A (en) * 2013-11-26 2014-04-16 西安电子科技大学 On-chip network communication deadlock avoiding method, router and communication network
US20150146603A1 (en) * 2013-11-27 2015-05-28 Architecture Technology Corporation Adaptive multicast network communications
CN105376161A (en) * 2014-08-28 2016-03-02 杭州华三通信技术有限公司 Multicast distribution tree switching method and device

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
"Whole packet forwarding: Efficient design of fully adaptive routing algorithms for networks-on-chip";Sheng Ma，等;《IEEE International Symposium on High-Performance Comp Architecture》;20120315;全文 *
"一种基于气泡流控的改进多播路由算法";娄辉，等;《计算机工程与科学 2015年02期》;20150228;第2部分 *
"双码流传输的研究及其在审讯监控指挥***中的应用";王春梅;《中国优秀硕士学位论文全文数据库 信息科技辑 2008年第04期》;20080415;第3-5章 *

Also Published As

Publication number Publication date
CN109150732A (en) 2019-01-04

Similar Documents

Publication Publication Date Title
CN107241179B (en) Method for generating time-triggered service static scheduling table
US8717875B2 (en) Condensed core-energy-efficient architecture for WAN IP backbones
CN108206790B (en) SDN joint routing selection and resource allocation method based on network slice
CN111181873B (en) Data transmission method, data transmission device, storage medium and electronic equipment
Bjurefors et al. Congestion avoidance in a data-centric opportunistic network
CN108989148B (en) Relay multi-path flow distribution method with minimized transmission delay
CN109787910A (en) A kind of flow managing method, system and knit shape network processing unit
CN104639437A (en) Forwarding method and apparatus of broadcast messages in stack system
CN111132236B (en) Multi-unmanned aerial vehicle self-organizing network MPR node selection method based on improved OLSR protocol
WO2023142937A1 (en) Network congestion control method and related apparatus
CN112825512A (en) Load balancing method and device
CN102857440A (en) Data processing method and switchboard
CN109150732B (en) Video transmission optimization method of meat product production safety monitoring system
CN115134304B (en) Self-adaptive load balancing method for avoiding data packet disorder of cloud computing data center
Wang et al. Traffic load balancing based on probabilistic routing in data center networks
WO2018040916A1 (en) Message forwarding method and device
CN106533796B (en) Service quality wave propagation control method based on packet traffic flows community structure
Xiong et al. Study on communication architecture design of wide-area measurement system
CN115499343B (en) Time delay analysis method, system, equipment and storage medium based on effective competitive stream
JP6281347B2 (en) Packet switching apparatus and packet switching method
CN103701622A (en) IRF (intelligent resilient framework)-system-based multicast processing method and device
CN110445634B (en) Power communication network vulnerability area discovery method based on area flow density
CN103001869A (en) Method and system of cloud route data processing based on port deflection
Zhao et al. Low-delay transmission technology in 5G distribution network differential protection
CN113395362B (en) Service chain grouping and reforming method for mobile edge computing

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
TA01 Transfer of patent application right

Effective date of registration: 20210508

Address after: 9 Guanxian North Road, Aoshan village, Huangpu town, Zhongshan City, Guangdong Province 528429

Applicant after: Guangdong Rong Yip Food Co.,Ltd.

Address before: No. 3203, block C, Range Rover mansion, No. 588, Gangcheng East Street, Laishan District, Yantai City, Shandong Province, 264003

Applicant before: SHANDONG HENGHAO INFORMATION TECHNOLOGY Co.,Ltd.

TA01 Transfer of patent application right
GR01 Patent grant
GR01 Patent grant