CN116232979A - Optimal path streaming method under multi-level multi-fork tree-shaped complex media networking structure - Google Patents

Optimal path streaming method under multi-level multi-fork tree-shaped complex media networking structure Download PDF

Info

Publication number
CN116232979A
CN116232979A CN202211649352.0A CN202211649352A CN116232979A CN 116232979 A CN116232979 A CN 116232979A CN 202211649352 A CN202211649352 A CN 202211649352A CN 116232979 A CN116232979 A CN 116232979A
Authority
CN
China
Prior art keywords
sip
sip signaling
node
routing
message
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.)
Granted
Application number
CN202211649352.0A
Other languages
Chinese (zh)
Other versions
CN116232979B (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.)
Beijing Jyd Digital System Technology Co ltd
Original Assignee
Beijing Jyd Digital System Technology 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 Beijing Jyd Digital System Technology Co ltd filed Critical Beijing Jyd Digital System Technology Co ltd
Priority to CN202211649352.0A priority Critical patent/CN116232979B/en
Priority claimed from CN202211649352.0A external-priority patent/CN116232979B/en
Publication of CN116232979A publication Critical patent/CN116232979A/en
Application granted granted Critical
Publication of CN116232979B publication Critical patent/CN116232979B/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/12—Shortest path evaluation
    • 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/74—Address processing for routing
    • H04L45/745—Address table lookup; Address filtering

Landscapes

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

Abstract

The invention discloses an optimal path streaming method under a multi-stage multi-fork tree-shaped complex media networking structure, which comprises the steps of establishing a routing pool at each stage of SIP signaling node of the multi-stage multi-fork tree-shaped complex media networking structure, updating the routing pool by adopting a pre-expanded SIP protocol, acquiring an optimal communicable path based on the SIP address of a target node in the routing pool, forwarding an INVITE message to the SIP signaling routing node of the optimal communicable path, acquiring the source IP address and the port of the former stage of SIP signaling routing node based on a socket communication process, performing trusted verification, and completing streaming of media streams. The invention improves the success rate of streaming of the video system under the multi-stage multi-fork tree complex network structure, and reduces the loads of processing and forwarding the SIP signaling and streaming media by all levels of signaling control nodes and media distribution nodes.

Description

Optimal path streaming method under multi-level multi-fork tree-shaped complex media networking structure
Technical Field
The invention relates to the technical field of streaming media transmission, in particular to an optimal path streaming method under a multistage multi-fork tree-shaped complex media networking structure.
Background
SIP (SessionInitiationProtocol) is a session layer signaling control protocol, has extremely strong expandability, and can be used for creating, modifying and releasing sessions involving two or more parties, and is applied to VOIP, internet multimedia conferences and the like.
The video standard technical specifications of the national education examination online inspection system (NEEA-0001 version 2007) and (JY/T-KS-JS-2017-1 version 2017) introduce an SIP mechanism into the national education examination online inspection system through the expansion of the SIP protocol and the new definition of message load. However, the standards have certain defects such as step-by-step transmission of signaling and media streams, a multi-stage registration mechanism of a framework and the like, so that the success rate of stream acquisition of an online inspection system in national education examination is low, and the loads of signaling control nodes and media distribution nodes at different levels are large.
Disclosure of Invention
Aiming at the defects in the prior art, the invention provides an optimal path streaming method under a multi-stage multi-fork tree-shaped complex media networking structure.
In order to achieve the aim of the invention, the invention adopts the following technical scheme:
an optimal path streaming method under a multi-level multi-fork tree-shaped complex media networking structure comprises the following steps:
s1, establishing a routing pool at each stage of SIP signaling node of a multi-stage multi-fork tree-shaped complex media networking structure, and taking an SIP address as a unique identifier of each routing record;
s2, a first timer is established at each stage of SIP signaling node of the multi-stage multi-fork tree-shaped complex media networking structure, a pre-expanded SIP protocol with the capability of carrying a plurality of SIP signaling routing addresses and ports is adopted to send service addresses and ports of the stage and all superior SIP signaling nodes to the subordinate SIP signaling node at adjustable first time intervals, and the service addresses and ports of all the SIP signaling nodes in the subordinate and the area governed by the subordinate are required to be directly updated to a routing pool;
s3, establishing a second timer at each stage of SIP signaling node of the multi-stage multi-fork tree-shaped complex media networking structure, adopting a pre-expanded SIP protocol with SIP service state sniffing capability to sniff the SIP service state to all SIP signaling nodes in the own stage of routing pool at adjustable second time intervals, and updating the SIP service state into the routing pool;
s4, responding to an INVIE media stream request initiated by a source SIP signaling node, acquiring an optimal communicable path based on the SIP address of a target node in a routing pool, and forwarding an INVITE message to the SIP signaling routing node of the optimal communicable path;
s5, responding to the INVITE message received by the SIP signaling routing node, acquiring the source IP address and the port of the former-stage SIP signaling routing node based on the socket communication process, and performing the trusted verification to finish the media stream fetching.
Optionally, each route record in the route pool of step S1 includes a number, a SIP address, and IP, port, status, and hierarchy information.
Optionally, in step S2, the SIP protocol with the capability of carrying multiple SIP signaling routing addresses and ports, which is pre-extended, is specifically:
expanding the load of Message information in the SIP protocol, and defining the type and format of the new information load;
sending Message information requests of the extended SIP protocol from the current SIP signaling node to other SIP signaling nodes to obtain a route list, wherein the load information of the Message information requests comprises the type, format and SIP address of a load;
responding to Message requests received by other SIP signaling nodes, analyzing load information of the Message requests, and judging whether the SIP address in the load information is the same as that of the SIP signaling nodes; if yes, inquiring first response information of the SIP signaling node and the SIP signaling node under jurisdiction from a local database, and generating Message response of the extended SIP protocol to the current SIP signaling node, wherein load information of the Message response comprises load type, format and first response information; otherwise, the Message request is forwarded to the subordinate SIP signaling node.
Optionally, the first response information includes a SIP address, a SIP signaling node name, an IP address of an external service, a port, and a hierarchy to which the SIP signaling node name belongs.
Optionally, the SIP protocol with the SIP service state sniffing capability pre-extended in step S3 is specifically:
expanding the load of Message information in the SIP protocol, and defining the type and format of the new information load;
sending Message information requests of the extended SIP protocol from the current SIP signaling node to other SIP signaling nodes to acquire the working state of a routing list, wherein the load information of the Message information requests comprises the type, format and SIP address of a load;
responding to Message requests received by other SIP signaling nodes, analyzing load information of the Message requests, and judging whether the SIP address in the load information is the same as that of the SIP signaling nodes; if yes, inquiring second response information of the SIP signaling node and the SIP signaling node under jurisdiction from a local database, and generating Message response of the extended SIP protocol to be responded to the current SIP signaling node, wherein load information of the Message response comprises load type, format and second response information; otherwise, the Message request is forwarded to the subordinate SIP signaling node.
Optionally, the second response information includes a SIP address and operating state information.
Optionally, in step S4, obtaining the optimal communicable path based on the SIP address of the target node in the routing pool specifically includes:
acquiring all communication paths from a source SIP signaling node to a target SIP signaling node;
sequencing all the communication paths according to the path step length from small to large;
the paths with the same step length are ordered according to the hierarchy of the SIP signaling node of the next stage in each path from high to low;
and determining the optimal communicable path according to the path sequence after sequencing all the communication paths.
Optionally, the trusted verification in step S4 is specifically:
inquiring whether a source IP address and a port of a previous stage SIP signaling routing node exist in a routing table; if yes, the credibility verification is passed; otherwise, the trusted verification is not passed.
The invention has the following beneficial effects:
according to the invention, through pre-expanding the loads of the SIPMESSAGE request message and the response message and the working mechanism thereof, the optimal path from the source SIP signaling node to the target SIP signaling node under the multi-stage multi-fork tree-shaped complex media networking structure is obtained, so that the success rate of streaming of the video system under the multi-stage multi-fork tree-shaped complex network structure is improved, and the loads of all stages of signaling control nodes and media distribution nodes for processing and forwarding the SIP signaling and streaming media are reduced.
Drawings
FIG. 1 is a schematic flow chart of an optimal path streaming method under a multi-level multi-fork tree-shaped complex media networking structure;
FIG. 2 is a schematic diagram of a path selection according to the present invention and the prior art;
FIG. 3 is a schematic diagram of the optimal path according to the present invention and the prior art.
Detailed Description
The following description of the embodiments of the present invention is provided to facilitate understanding of the present invention by those skilled in the art, but it should be understood that the present invention is not limited to the scope of the embodiments, and all the inventions which make use of the inventive concept are protected by the spirit and scope of the present invention as defined and defined in the appended claims to those skilled in the art.
As shown in fig. 1, the embodiment of the invention provides an optimal path streaming method under a multi-level multi-fork tree-shaped complex media networking structure, which comprises the following steps S1 to S5:
s1, establishing a routing pool at each stage of SIP signaling node of a multi-stage multi-fork tree-shaped complex media networking structure, and taking an SIP address as a unique identifier of each routing record;
in an alternative embodiment of the invention, each route record in the route pool includes a number, a SIP address, and IP, port, state, and level information.
S2, a first timer is established at each stage of SIP signaling node of the multi-stage multi-fork tree-shaped complex media networking structure, a pre-expanded SIP protocol with the capability of carrying a plurality of SIP signaling routing addresses and ports is adopted to send service addresses and ports of the stage and all superior SIP signaling nodes to the subordinate SIP signaling node at adjustable first time intervals, and the service addresses and ports of all the SIP signaling nodes in the subordinate and the area governed by the subordinate are required to be directly updated to a routing pool;
in an optional embodiment of the present invention, the SIP protocol with the capability of carrying multiple SIP signaling routing addresses and ports, which is pre-extended, is specifically:
expanding the load of Message information in the SIP protocol, and defining the type and format of the new information load;
sending Message information requests of the extended SIP protocol from the current SIP signaling node to other SIP signaling nodes to obtain a route list, wherein the load information of the Message information requests comprises the type, format and SIP address of a load;
responding to Message requests received by other SIP signaling nodes, analyzing load information of the Message requests, and judging whether the SIP address in the load information is the same as that of the SIP signaling nodes; if yes, inquiring first response information of the SIP signaling node and the SIP signaling node under jurisdiction from a local database, and generating Message response of the extended SIP protocol to the current SIP signaling node, wherein load information of the Message response comprises load type, format and first response information; otherwise, the Message request is forwarded to the subordinate SIP signaling node. The first response information comprises an SIP address, an SIP signaling node name, an IP address of external service, a port and an affiliated hierarchy.
Specifically, the embodiment expands the load of Message in the SIP protocol, and defines the type and format of the new Message load, so that both the Message load and the 200OK response Message have the capability of carrying multiple SIP signaling routing addresses and ports.
The format Application/RTLP (Routing List Protocol) of the new definition SIP message body (message body) is as follows, when a routing list is obtained from a certain SIP routing node, the format of a request message and the format of a response message are as follows:
request:
Content-Type:Application/RTLP\r\n
\r\n
RTLIST[SIP_URI]RTLP/1.0
parameter description:
sip_uri: SIP domain name/address
Response:
Content-Type:Application/RTLP\r\n
\r\n
KSLP/1.0200OK\r\n
\r\n
SIP_URI NAME IP PORT LEVEL
parameter description:
sip_uri: SIP domain name/address
NAME: node name
IP: IP address of node external service
PORT: port for external service of node
LEVEL, the LEVEL to which the node belongs
If the node a obtains the routing list from the node B, the node a sends a Message of SIP protocol to the node B, the Content-Type is Application/RTLP, the Message body Content is in the above request format, and the sip_uri fills in the sip_uri (which may be a domain name or an address) of the node B. After receiving the request of the A node, the node B analyzes the type and the content of the message body, if the request SIP_URI is the same as the SIP_URI of the node B, the node B queries the information of the SIP domain name/address, the node name, the external service IP address, the port, the belonging hierarchy and the like of the node B and the node B from a local database, generates a 200OK response message in the response format, responds to the A node B, and otherwise forwards the SIP message downwards.
Taking the example that the city-level SIP routing module requests the county-level SIP routing module for routing node information, the city-level SIP routing module sends routing list request signaling to the county-level SIP routing module every 1 hour, and the signaling interaction process is as follows:
the city level SIP routing module sends a Message request to the county level SIP routing module, and the load information is as follows:
Content-Type:Application/RTLP\r\n\r\n
RTLIST sip:xjjy.sjjy.sjjy.cnjy@202.101.100.1RTLP/1.0\r\n
after receiving the request message of the city level SIP routing node, the county level SIP routing node queries a local database to generate a 200OK response message, and the query result (the SIP_URI, node name, address, port, level and other information of 4 SIP nodes of the own and the administered first school, second school, third school and sixth school) is put into the message body as follows:
Content-Type:Application/RTLP\r\n\r\n
RTLP/1.0200OK\r\n\r\n
sip, xjjy.sjy.sjjy.cnjy@202.101.100.1 some county 202.101.100.199024\r\n
sip: yz.xjy.sjy.sjy.cnjy@202.101.100.101 first school 202.101.100.10199025\r\n
sip: ez.xjy.sjy.sjy.cnjy@202.101.100.102 second middle school 202.101.100.10299025\r\n
sip, sz.xjjy.sjy.sjy.cnjy@202.101.100.103 third university 202.101.100.10399025\r\n
sip: lz.xjy.sjy.sjy.cnjy@202.101.100.106 sixth intermediate school 202.101.100.10699025\r\n
After receiving the response message of the county-level SIP routing node, the city-level SIP routing node updates the local routing pool as follows:
Figure BDA0004011264390000081
Figure BDA0004011264390000091
the embodiment can automatically collect and update the service addresses and ports on the upper and lower links of the SIP signaling node by newly defining the load and the working mechanism of a SIP MESSAGE request message and a response message, thereby completing the establishment of the SIP routing pool.
S3, establishing a second timer at each stage of SIP signaling node of the multi-stage multi-fork tree-shaped complex media networking structure, adopting a pre-expanded SIP protocol with SIP service state sniffing capability to sniff the SIP service state to all SIP signaling nodes in the own stage of routing pool at adjustable second time intervals, and updating the SIP service state into the routing pool;
in an optional embodiment of the present invention, the SIP protocol with the capability of sniffing SIP service status that is pre-extended in this embodiment is specifically:
expanding the load of Message information in the SIP protocol, and defining the type and format of the new information load;
sending Message information requests of the extended SIP protocol from the current SIP signaling node to other SIP signaling nodes to acquire the working state of a routing list, wherein the load information of the Message information requests comprises the type, format and SIP address of a load;
responding to Message requests received by other SIP signaling nodes, analyzing load information of the Message requests, and judging whether the SIP address in the load information is the same as that of the SIP signaling nodes; if yes, inquiring second response information of the SIP signaling node and the SIP signaling node under jurisdiction from a local database, and generating Message response of the extended SIP protocol to be responded to the current SIP signaling node, wherein load information of the Message response comprises load type, format and second response information; otherwise, the Message request is forwarded to the subordinate SIP signaling node. Wherein the second response information includes a SIP address and operating state information.
Specifically, the embodiment expands the load of Message messages in the SIP protocol, and defines the type and format of the new Message load, so that the Message load has the capability of sniffing the SIP service state.
The format Application/RTSTP (Routing Status Protocol) of the newly defined SIP message body (message body) is as follows, when the working state of the routing list is obtained from a certain SIP routing node, the format of the request message and the format of the response message are as follows:
request:
Content-Type:Application/RTSTP\r\n
\r\n
RTST[SIP_URI]RTSTP/1.0
parameter description:
sip_uri: SIP domain name/address
Response:
Content-Type:Application/RTSTP\r\n
\r\n
RTSTP/1.0200OK\r\n
\r\n
SIP_URI STATUS
parameter description:
sip_uri: SIP domain name/address
STATUS: node status (ON/OFF/UNK)
If the node A obtains the working state of the routing list from the node B, the node A sends a Message of the SIP protocol to the node B, the Content-Type is Application/RTSP, the Message body Content is in the above request format, and the SIP_URI fills in the SIP_URI (which can be domain name or address) of the node B. After receiving the request of the A node, the node B analyzes the type and the content of the message body, if the request SIP_URI is the same as the SIP_URI of the node B, the local database is inquired about the SIP domain name/address and the working state information of the node B and the node B under the jurisdiction, a 200OK response message is generated according to the response format, the response is sent to the A node, and otherwise, the SIP message is forwarded downwards.
Taking a city-level SIP routing module as an example to ask for an operation state to each node in a routing pool, the signaling interaction process is as follows:
the city level SIP routing module sends a Message request to the first middle school SIP routing module, and the load information is as follows:
Content-Type:Application/RTSTP\r\n\r\n
RTST sip:yz.xjjy.sjjy.sjjy.cnjy@202.101.100.1RTSTP/1.0\r\n
the first middle school SIP routing module sends a 200OK response message to the municipal SIP routing module, and the load information is as follows:
Content-Type:Application/RTSTP\r\n\r\n
RTSTP/1.0200OK\r\n\r\n
sip:yz.xjjy.sjjy.sjjy.cnjy@202.101.100.101ON\r\n
after receiving the 200OK response message, the municipal SIP routing module analyzes and obtains a status code and updates the status code into a routing pool, and if no response is obtained, the status is unchanged; the update local routing pool is as follows:
Figure BDA0004011264390000111
Figure BDA0004011264390000121
the load of a SIP MESSAGE request message and a response message and the working mechanism thereof are newly defined, so that the communicable state from the source SIP signaling node to the intermediate node through which the target SIP signaling node passes can be sniffed in real time.
S4, responding to an INVIE media stream request initiated by a source SIP signaling node, acquiring an optimal communicable path based on the SIP address of a target node in a routing pool, and forwarding an INVITE message to the SIP signaling routing node of the optimal communicable path;
in an optional embodiment of the present invention, the obtaining, in the routing pool, the optimal communicable path based on the SIP address of the target node specifically includes:
acquiring all communication paths from a source SIP signaling node to a target SIP signaling node;
sequencing all the communication paths according to the path step length from small to large;
the paths with the same step length are ordered according to the hierarchy of the SIP signaling node of the next stage in each path from high to low;
and determining the optimal communicable path according to the path sequence after sequencing all the communication paths.
Specifically, taking a national-level SIP routing module as a source SIP signaling node and a calibration-level SIP routing module as a target SIP signaling node as an example, it is assumed that five-level SIP signaling nodes in each sub-graph can be mutually communicated, as shown in fig. 2:
when the interconnection method of 2007 video technical specification SIP routing is adopted, the transferable path of the INVITE information is as follows:
one strip: 1-2-3-4
When the interconnection method of 2017 video technical specification SIP routing is adopted, the convertable path of the INVITE information is as follows:
three: 1-2-3-4, 1-2-5, 1-6
When the method of the invention is adopted, the transferable path of the INVITE information is as follows:
eight: 5. 1-8, 6-4, 7-10, 1-2-10, 1-9-4, 7-3-4, 1-2-3-4
Aiming at the condition assumption that SIP signaling nodes in each subgraph have faults and the condition assumption that networks cannot be intercommunicated two by two, the invention is superior to the interconnection method adopting 2007/2017 video technology to standardize SIP routing in all aspects of communication path strategy, node communication success rate, node load reduction and the like, and is suitable for the process of any SIP signaling node searching for the next hop SIP signaling node.
S5, responding to the INVITE message received by the SIP signaling routing node, acquiring the source IP address and the port of the former-stage SIP signaling routing node based on the socket communication process, and performing the trusted verification to finish the media stream fetching.
In an optional embodiment of the present invention, the trust verification performed by this embodiment is specifically:
inquiring whether a source IP address and a port of a previous stage SIP signaling routing node exist in a routing table; if yes, the credibility verification is passed; otherwise, the trusted verification is not passed.
Specifically, the SIP signaling routing node that receives the INVITE message may use the source IP address and PORT of the previous SIP signaling routing node that are known based on the socket communication process, by querying whether the IP and PORT exist in the routing table, as a trusted basis for whether to receive and process the INVITE message. And completing subsequent flow taking work according to the media flow request and closing flow defined in the national education examination on-line inspection system video standard technical Specification.
As shown in FIG. 3, the signaling of the streaming media request and the transmission path of the media stream under the national education examination network inspection system video standard technical specification or other multi-level multi-branch tree complex network structures are shown as black solid lines in the graph I, and the possibility of the signaling of the streaming media request and the transmission path of the media stream by adopting the method is shown as black broken lines in the graph I, and the solid circles represent the streaming units.
The present invention is described 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 flow and/or block of the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
The principles and embodiments of the present invention have been described in detail with reference to specific examples, which are provided to facilitate understanding of the method and core ideas of the present invention; meanwhile, as those skilled in the art will have variations in the specific embodiments and application scope in accordance with the ideas of the present invention, the present description should not be construed as limiting the present invention in view of the above.
Those of ordinary skill in the art will recognize that the embodiments described herein are for the purpose of aiding the reader in understanding the principles of the present invention and should be understood that the scope of the invention is not limited to such specific statements and embodiments. Those of ordinary skill in the art can make various other specific modifications and combinations from the teachings of the present disclosure without departing from the spirit thereof, and such modifications and combinations remain within the scope of the present disclosure.

Claims (8)

1. The optimal path streaming method under the multi-level multi-fork tree-shaped complex media networking structure is characterized by comprising the following steps of:
s1, establishing a routing pool at each stage of SIP signaling node of a multi-stage multi-fork tree-shaped complex media networking structure, and taking an SIP address as a unique identifier of each routing record;
s2, a first timer is established at each stage of SIP signaling node of the multi-stage multi-fork tree-shaped complex media networking structure, a pre-expanded SIP protocol with the capability of carrying a plurality of SIP signaling routing addresses and ports is adopted to send service addresses and ports of the stage and all superior SIP signaling nodes to the subordinate SIP signaling node at adjustable first time intervals, and the service addresses and ports of all the SIP signaling nodes in the subordinate and the area governed by the subordinate are required to be directly updated to a routing pool;
s3, establishing a second timer at each stage of SIP signaling node of the multi-stage multi-fork tree-shaped complex media networking structure, adopting a pre-expanded SIP protocol with SIP service state sniffing capability to sniff the SIP service state to all SIP signaling nodes in the own stage of routing pool at adjustable second time intervals, and updating the SIP service state into the routing pool;
s4, responding to an INVIE media stream request initiated by a source SIP signaling node, acquiring an optimal communicable path based on the SIP address of a target node in a routing pool, and forwarding an INVITE message to the SIP signaling routing node of the optimal communicable path;
s5, responding to the INVITE message received by the SIP signaling routing node, acquiring the source IP address and the port of the former-stage SIP signaling routing node based on the socket communication process, and performing the trusted verification to finish the media stream fetching.
2. The method for optimal path streaming under a multi-level, multi-fork, tree-shaped, complex media networking structure of claim 1, wherein each route record in the routing pool of step S1 includes a number, a SIP address, and IP, port, state, and level information.
3. The method for extracting the optimal path under the multi-level multi-fork tree-shaped complex media networking structure according to claim 1, wherein the pre-extended SIP protocol with the capability of carrying a plurality of SIP signaling routing addresses and ports in step S2 is specifically:
expanding the load of Message information in the SIP protocol, and defining the type and format of the new information load;
sending Message information requests of the extended SIP protocol from the current SIP signaling node to other SIP signaling nodes to obtain a route list, wherein the load information of the Message information requests comprises the type, format and SIP address of a load;
responding to Message requests received by other SIP signaling nodes, analyzing load information of the Message requests, and judging whether the SIP address in the load information is the same as that of the SIP signaling nodes; if yes, inquiring first response information of the SIP signaling node and the SIP signaling node under jurisdiction from a local database, and generating Message response of the extended SIP protocol to the current SIP signaling node, wherein load information of the Message response comprises load type, format and first response information; otherwise, the Message request is forwarded to the subordinate SIP signaling node.
4. A method for extracting an optimal path under a multi-level multi-fork tree-shaped complex media networking structure according to claim 3, wherein the first response information comprises a SIP address, a SIP signaling node name, an IP address of an external service, a port and a hierarchy to which the SIP signaling node name belongs.
5. The method for extracting the optimal path under the multi-level multi-fork tree-shaped complex media networking structure according to claim 1, wherein the SIP protocol with the SIP service state sniffing capability pre-extended in step S3 is specifically:
expanding the load of Message information in the SIP protocol, and defining the type and format of the new information load;
sending Message information requests of the extended SIP protocol from the current SIP signaling node to other SIP signaling nodes to acquire the working state of a routing list, wherein the load information of the Message information requests comprises the type, format and SIP address of a load;
responding to Message requests received by other SIP signaling nodes, analyzing load information of the Message requests, and judging whether the SIP address in the load information is the same as that of the SIP signaling nodes; if yes, inquiring second response information of the SIP signaling node and the SIP signaling node under jurisdiction from a local database, and generating Message response of the extended SIP protocol to be responded to the current SIP signaling node, wherein load information of the Message response comprises load type, format and second response information; otherwise, the Message request is forwarded to the subordinate SIP signaling node.
6. The optimal path streaming method under a multi-level, multi-fork, tree-shaped, complex media networking architecture of claim 5, wherein the second reply information includes SIP address and operational status information.
7. The method for obtaining the optimal path under the multi-level multi-fork tree-shaped complex media networking structure according to claim 1, wherein in step S4, obtaining the optimal communicable path based on the SIP address of the target node in the routing pool is specifically:
acquiring all communication paths from a source SIP signaling node to a target SIP signaling node;
sequencing all the communication paths according to the path step length from small to large;
the paths with the same step length are ordered according to the hierarchy of the SIP signaling node of the next stage in each path from high to low;
and determining the optimal communicable path according to the path sequence after sequencing all the communication paths.
8. The optimal path streaming method under the multi-level multi-fork tree-shaped complex media networking structure according to claim 1, wherein the trusted verification in step S4 is specifically:
inquiring whether a source IP address and a port of a previous stage SIP signaling routing node exist in a routing table; if yes, the credibility verification is passed; otherwise, the trusted verification is not passed.
CN202211649352.0A 2022-12-21 Optimal path streaming method under multi-level multi-fork tree-shaped complex media networking structure Active CN116232979B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202211649352.0A CN116232979B (en) 2022-12-21 Optimal path streaming method under multi-level multi-fork tree-shaped complex media networking structure

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202211649352.0A CN116232979B (en) 2022-12-21 Optimal path streaming method under multi-level multi-fork tree-shaped complex media networking structure

Publications (2)

Publication Number Publication Date
CN116232979A true CN116232979A (en) 2023-06-06
CN116232979B CN116232979B (en) 2024-05-28

Family

ID=

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070253418A1 (en) * 2006-04-27 2007-11-01 D.S.P. Group Ltd. Routing path optimization between sip endpoints
CN101771619A (en) * 2010-03-16 2010-07-07 中国电子科技集团公司第三十研究所 Network system for realizing integrated security services
CN102546418A (en) * 2012-01-16 2012-07-04 东北大学 Overlay-network-multipath-transmission-based Internet protocol multimedia subsystem (IMS) client and media exchange method
CN104823427A (en) * 2012-09-27 2015-08-05 英国电讯有限公司 Application layer session routing

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070253418A1 (en) * 2006-04-27 2007-11-01 D.S.P. Group Ltd. Routing path optimization between sip endpoints
CN101771619A (en) * 2010-03-16 2010-07-07 中国电子科技集团公司第三十研究所 Network system for realizing integrated security services
CN102546418A (en) * 2012-01-16 2012-07-04 东北大学 Overlay-network-multipath-transmission-based Internet protocol multimedia subsystem (IMS) client and media exchange method
CN104823427A (en) * 2012-09-27 2015-08-05 英国电讯有限公司 Application layer session routing

Similar Documents

Publication Publication Date Title
CN104767682B (en) The method and apparatus of method for routing and system and distributing routing information
JP4670604B2 (en) Information distribution system, information processing apparatus, information processing program, and information processing method
CN101243653B (en) Information communication system, information communication method, and node device included in information communication system
WO2006085519A1 (en) Information distribution system, distribution request program, transmission program, distribution program, and others
CN101188643A (en) Contact destination information registration method and program, network system, and node
CN111083179B (en) Internet of things cloud platform, and equipment interaction method and device based on same
TW201006291A (en) Methods and apparatus for discovery of peer-to-peer overlay networks
CN106254244A (en) A kind of merging stream list item method based on SDN
CN113300955A (en) Method, system and equipment for determining paths between nodes in content distribution network
CN109194750A (en) Anti-attack method, the device of block catenary system and block chain super node
US20110246674A1 (en) Information communication system, first information processing device, method for processing information, and computer readable storage medium
CN102404818A (en) Method for generating and updating routing list of satellite network
CN102090028B (en) Multiple tree registration protocol
CN116232979B (en) Optimal path streaming method under multi-level multi-fork tree-shaped complex media networking structure
EP3429139B1 (en) Ingress gateway selection for a shortest path bridging network to support inter domain multicast routing
CN101729351A (en) Method and system for finding topology information, query request device and awaiting query device
US8218455B2 (en) Information communication system, information communication method, node device included in information communication system and recording medium recording information process program
US7543030B2 (en) Peer-to-peer communication for instant messaging between different instant message application types
CN101902347A (en) Anonymous meeting terminal enrollment method and device
US20140244746A1 (en) Systems and Methods for Message Routing Using Link State Information
CN116232979A (en) Optimal path streaming method under multi-level multi-fork tree-shaped complex media networking structure
TW200746717A (en) Improved route determining methods for a network
CN110401911B (en) Vehicle-mounted cloud implementation method based on named data network
CN102694833A (en) Multicast tree building method, and server and node in multicast system
CN103167191B (en) Detection method of speaker in telephone conference based on NDN

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