CN115277538A - Cross-domain message publishing method and system based on routing computation - Google Patents
Cross-domain message publishing method and system based on routing computation Download PDFInfo
- Publication number
- CN115277538A CN115277538A CN202210843322.7A CN202210843322A CN115277538A CN 115277538 A CN115277538 A CN 115277538A CN 202210843322 A CN202210843322 A CN 202210843322A CN 115277538 A CN115277538 A CN 115277538A
- Authority
- CN
- China
- Prior art keywords
- domain
- message
- user
- cross
- routing
- 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.)
- Pending
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/12—Shortest path evaluation
- H04L45/123—Evaluation of link 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/124—Shortest path evaluation using a combination of metrics
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L51/00—User-to-user messaging in packet-switching networks, transmitted according to store-and-forward or real-time protocols, e.g. e-mail
- H04L51/07—User-to-user messaging in packet-switching networks, transmitted according to store-and-forward or real-time protocols, e.g. e-mail characterised by the inclusion of specific contents
- H04L51/18—Commands or executable codes
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a cross-domain message issuing method based on routing computation, which belongs to the technical field of inter-domain resource transmission and solves the technical problem that the prior art only supports users in the same central domain to directly send messages to each other; judging whether an available path to a target domain exists or not, judging whether an available path with all sufficient line bandwidth resources exists or not, calculating an optimal routing path by using four dimensions of bandwidth size, relay times, line weight and connection state stability, and sending a message to a receiver through the optimal routing path. The invention also discloses a cross-domain message issuing system based on the routing computation. The invention can communicate the information communication among domains, is convenient for cooperation in different areas, and has optimal routing path for sending messages.
Description
Technical Field
The invention relates to the technical field of inter-domain resource transmission, in particular to a cross-domain message issuing method and a cross-domain message issuing system based on routing computation.
Background
The adjacent near video is transmitted by using a local area network, a domain is formed, video transmission is generally performed between the domains through a private network or a public network, and transmission between the two domains is called cross-domain. The prior art only supports users in the same central domain to directly send messages to each other, and can not directly send messages to each other under the condition that the network of the source domain and the network of the target domain can not be directly communicated.
Disclosure of Invention
The present invention aims to solve the technical problem of the prior art, and an object of the present invention is to provide a cross-domain message distribution method based on routing computation, so as to implement sending and receiving messages through a relay domain under the condition that source and target domain networks cannot be directly connected, and the method is suitable for a situation that each domain has its own user resource, and after cross-domain networking, users can arbitrarily share the situation that the messages are sent across domains.
The invention also aims to provide a cross-domain message issuing system based on routing computation.
In order to achieve the above object, the present invention provides a cross-domain message publishing method based on routing computation, which includes a cross-domain message publishing process:
s1, acquiring a user list;
s2, selecting a user according to the user list and sending a message;
s3, carrying out message persistence on the sent message;
s4, judging whether the user is the user in the local domain, and if the user is the user in the local domain, skipping to the S15;
s5, acquiring all routing rules;
s6, judging whether an available path to the target domain exists or not, and if not, jumping to the step S18;
s7, judging whether available paths with all sufficient line bandwidth resources exist or not, and if not, skipping to the S18;
and S8, screening the available path with the least relay.
S9, if a plurality of available paths with the least relays exist, screening the available path with the maximum comprehensive weight from the available paths with the least relays;
s10, screening an available path with the most stable comprehensive connection state from the available paths with the maximum comprehensive weight if the available paths with the maximum comprehensive weight exist;
s11, if the available path does not exist, jumping to the S18;
s12, sending a message to a next domain according to the available path;
s13, judging whether the current domain where the message is located is a relay domain, and if yes, skipping to the S12;
s14, carrying out message persistence on the sent message in a target domain;
step S15, judging whether the message receiver is forbidden or deleted, if so, skipping to step S18;
s16, judging whether the message receiver is on line, and if not, jumping to the S18;
s17, sending the message to a receiver through mqtt, prompting the sender of success information, and ending;
and S18, prompting failure information of the sender and ending.
As a further improvement, the inter-domain routes are configured according to the superior-subordinate relationship or independent routes are configured for networking, and after the routing relationship is configured, each routing node can check the connection state of nodes directly connected with the routing node; each domain comprises a signal source pool, a service core module and a video coding, decoding and distributing module.
Furthermore, each domain can synchronize its own resource data to a superior domain or a subordinate domain; the resource data to be synchronized includes 5 types: domain information, gateway information for the domain, user details, sharing group, and sharing user information.
Further, checking the connection status between domains includes: the method comprises the steps that real-time monitoring and updating of inter-domain connection states are achieved by accessing domains related to an access domain and a routing rule to a specific theme of mqtt;
when each domain accesses the mqtt, the unique theme/link/< domain ID > of the domain is connected, other associated domains monitor the topic, and once the connection is interrupted, the connection state of the domain is updated, and relevant event notification is triggered.
Further, the process of message publishing in the domain is as follows: the message sender sends the message to the service module, and the service module sends the message to the message receiver.
Furthermore, the single domain comprises a user module, an authentication module, a message module, a domain management module and a routing module;
the message module is used for message single-sending, group-sending, historical message display of receiving, display of instant message, unread message reminding, and display of sending state and read state;
the message issuing permits to send messages to the offline user, and after the user logs in again, the messages are prompted according to the unread number and the unread state;
the message receiver is forbidden or deleted when the message is sent, and failure information of the sender is prompted;
the message status comprises failure in sending, success in sending and not reading, success in sending and reading, unread receiving and read receiving.
Further, the method also comprises a cross-domain message confirmation flow:
s101, checking unread messages;
s102, clicking to view details of the message;
s103, asynchronously changing the state of the message;
s104, judging whether the sender is a local user, and if the sender is the local user, jumping to S107;
s105, calculating a route to a next node;
s106, judging whether the current domain is a relay domain, and if so, skipping to the S105;
step S107, the state of the message is changed to be read by the user.
Further, the method also comprises a user operation message deleting flow:
step S201, obtaining history information;
s202, clicking to delete the history message;
s203, logically deleting the history message;
and S204, judging whether the association number of the historical message is 0, if so, physically deleting the historical message and the associated information.
Further, the method also comprises the following steps:
s201, acquiring a user to be deleted;
s202, clicking to delete the user;
s203, logically deleting all messages of the user;
and S204, judging whether the association number of the messages is 0 or not one by one, and if so, physically deleting the messages and the associated information.
In order to achieve the second objective, the present invention provides a cross-domain message publishing system based on routing computation, which includes: at least one processor, a memory communicatively coupled to at least one of the processors;
the memory stores instructions executable by the processor for execution by the processor to implement one of the above-described cross-domain message distribution methods based on routing computations.
Advantageous effects
Compared with the prior art, the invention has the advantages that:
1. the invention can communicate the information communication among domains, and is convenient for the cooperation of different areas.
2. The computation of the present invention can interwork domain messages that are unreachable by two networks.
3. The invention can dynamically select the line with better network quality based on the bandwidth utilization rate, the inter-domain connection state stability and the line weight of the line.
4. The users in each domain can configure the sharing group according to the needs, and then select the specific user to send the message.
Drawings
FIG. 1 is a diagram of a networking architecture for multiple domains;
FIG. 2 is a diagram illustrating inter-domain connection status detection;
FIG. 3 is a single domain message publishing flow diagram;
FIG. 4 is a cross-domain publish message flow diagram;
FIG. 5 is a cross-domain message acknowledgement flow diagram;
FIG. 6 is a flow chart of user operation message deletion;
fig. 7 is a delete user flow diagram.
Detailed Description
The invention will be further described with reference to specific embodiments shown in the drawings.
Referring to fig. 1 to 7, a cross-domain message publishing method based on routing computation includes a cross-domain message publishing process:
s1, acquiring a user list;
s2, selecting a user according to the user list and sending a message;
s3, carrying out message persistence on the sent message, wherein the message persistence is to store the message content in a disk stored in a database, and aims to check and process the message at any time without being lost due to server crash or power failure;
s4, judging whether the user is the user in the local domain, and if the user is the user in the local domain, skipping to the S15;
s5, acquiring all routing rules;
s6, judging whether an available path to the target domain exists or not, and if not, jumping to the step S18;
s7, judging whether available paths with all sufficient line bandwidth resources exist or not, and if not, skipping to the S18;
and S8, screening the available path with the least relay.
S9, if a plurality of available paths with the fewest relays exist, screening available paths with the maximum comprehensive weight from the available paths with the fewest relays;
s10, screening an available path with the most stable comprehensive connection state from the available paths with the maximum comprehensive weight if the available paths with the maximum comprehensive weight exist;
s11, if the available path does not exist, jumping to S18;
s12, sending a message to a next domain according to the available path;
s13, judging whether the current domain where the message is located is a relay domain, and if the current domain is the relay domain, skipping to S12;
s14, carrying out message persistence on the sent message in a target domain, wherein for the target domain, a database of the message sending domain cannot be directly accessed, so that the message needs to be persisted to the database in the target domain, and the message can be conveniently checked in the target domain at any time;
step S15, judging whether the message receiver is forbidden or deleted, if so, skipping to step S18;
s16, judging whether the message receiver is on line, and if not, jumping to the S18;
s17, sending the message to a receiver through the mqtt, prompting the sender of successful information, and ending;
and S18, prompting failure information of the sender and ending.
And configuring the route or configuring an independent route for networking between domains according to the superior-subordinate relationship. As shown in fig. 1, the a domain is a top-level domain, and the lower configuration includes B1, B2, and B3; the B1 subordinate domain is C1, the B2 subordinate domain is C2, the B3 subordinate domain is C3, and the C3 subordinate domain is D3. Planned route connection relation: b1- > D3, B2- > D3. After configuring the routing relationship, each routing node checks the connection status (whether connectable) of the nodes directly connected to it. If the B domain detects the connection state with the A domain, the connection state of the D3 domain and the C3 domain, the B1 domain and the B2 domain. Each domain comprises a signal source pool, a service core module and a video coding, decoding and distributing module. The routing rule configuration supports line weight and bandwidth size configuration, and an optimal routing path can be calculated based on four dimensions of available bandwidth size, relay times, line weight and connection state stability when a connection path is selected.
Each domain can synchronize own resource data to a superior domain or a subordinate domain; the resource data to be synchronized includes 5 types: domain information, gateway information for the domain, user details, sharing group, and sharing user information.
The inter-domain connection state comprises the relationship between the upper and lower access domains and the configuration of an independent routing rule, and the checking of the inter-domain connection state comprises the following steps: and real-time monitoring and updating of the inter-domain connection state are realized by accessing the access domain and the domain associated with the routing rule to a specific theme of mqtt.
When each domain accesses the mqtt, the unique theme/link/< domain ID > of the domain is connected, other associated domains monitor the topic (theme), and once the connection is interrupted, the connection state of the domain is updated, and relevant event notification is triggered. As shown in fig. 2, the upper domain is configured as the B domain in the a domain, that is, the a domain accesses to the B domain, and after configuration is successful, the a domain connects to topic of mqtt: /link/A, and listen for topic: a/link/B; in the lower domain management of the B domain, the A domain is received as the lower domain, and after the operation is successful, the B domain is connected with topic of mqtt: /link/B, and listen for topic: a/link/A; in the route configuration page of the A domain, the route rule configured to the C domain: A-C, after configuration is successful, se:Sub>A C domain synchronously increases se:Sub>A routing rule C-A; and adding a monitor topic in the A domain: /link/C, C domain connected to topic of mqtt: the/link/C, and listen to topic: a/link/A; if the A domain is disconnected, the connection of the domain mqtt is interrupted, and the domain B and the domain C are informed by the mqtt, and the connection state and the connection stability of the domain A are updated. And the mqtt of different domains forwards the message in real time in a bridging configuration mode.
As shown in fig. 3, the process of publishing the message in the local domain is as follows: the message sender sends the message to the service module, and the service module sends the message to the message receiver.
The single domain comprises a user module, an authentication module, a message module, a domain management module and a routing module. The message module is used for message single sending, group sending, historical message display of receiving, instant message display, unread message reminding, and display of sending state and read state. And the message issuing permits to send messages to the offline users, and after the users log in again, the messages are prompted according to the unread number and the unread state. The message receiver is disabled or deleted at the time of message sending, and the sender is prompted for failure information. The message status comprises failure in sending, success in sending and not reading, success in sending and reading, unread receiving and read receiving.
As shown in fig. 5, the method further includes a cross-domain message confirmation procedure:
s101, checking unread messages;
s102, clicking to view details of the message;
step S103, asynchronously changing the state of the message, wherein due to the fact that a link for changing the state of the message in a cross-domain mode is long, the front-end response time is possibly long due to the fact that the state of the message is synchronously changed, the operation experience of a client is influenced, and therefore asynchronous execution is usually carried out in the background;
s104, judging whether the sender is the local domain user, and if the sender is the local domain user, skipping to S107;
s105, calculating a route to a next node;
s106, judging whether the current domain is a relay domain, and if so, skipping to S105;
step S107, the state of the message is changed to be read by the user.
When a user checks the details of an unread message, the read state of the received message needs to be changed, the state in the database can be directly changed for the message of which the sender is a user in the local domain, and for the message of which the sender is a cross-domain user, the message needs to be sent to the message module of the corresponding domain for processing through routing calculation.
As shown in fig. 6, the method further includes a user operation message deletion process:
s201, acquiring a history message;
s202, clicking to delete the history message;
s203, logically deleting the history message;
and S204, judging whether the association number of the historical message is 0, if so, physically deleting the historical message and the associated information.
As shown in fig. 7, the method further includes deleting the user flow:
s201, acquiring a user to be deleted;
s202, clicking to delete the user;
s203, logically deleting all messages of the user;
and S204, judging whether the association number of the messages is 0 or not one by one, if so, deleting the messages and the associated information physically until all the messages are judged.
In the case of no association of historical messages, the messages need to be cleared in time to avoid leaving dirty data, and when a message is logically deleted first, the messages are physically deleted when all the associations are not available.
A cross-domain message distribution system based on routing computation, comprising: at least one processor, a memory communicatively coupled to at least one of the processors;
the memory stores instructions executable by the processor for execution by the processor to implement a route computation based cross-domain message distribution method as described above.
The present specification defines abbreviations and key terms:
the stream media forwarding gateway: and the video data of a certain streaming media address is transferred out through a certain network card of the forwarding gateway.
Cross-domain: the adjacent video is transmitted by using a local area network, a domain is formed, video transmission is performed between the domains through a private network or a public network, and the transmission between the two domains is called cross-domain.
The above is only a preferred embodiment of the present invention, and it should be noted that it is obvious to those skilled in the art that several variations and modifications can be made without departing from the structure of the present invention, which will not affect the effect of the implementation of the present invention and the utility of the patent.
Claims (10)
1. A cross-domain message publishing method based on routing computation is characterized by comprising a cross-domain message publishing flow:
s1, acquiring a user list;
s2, selecting a user according to the user list and sending a message;
s3, carrying out message persistence on the sent message;
s4, judging whether the user is the user in the local domain, and if the user is the user in the local domain, skipping to the S15;
s5, acquiring all routing rules;
s6, judging whether an available path to the target domain exists or not, and if not, jumping to the step S18;
s7, judging whether an available path with sufficient line bandwidth resources exists or not, and if not, jumping to the step S18;
and S8, screening the available path with the least relay.
S9, if a plurality of available paths with the least relays exist, screening the available path with the maximum comprehensive weight from the available paths with the least relays;
s10, screening an available path with the most stable comprehensive connection state from the available paths with the maximum comprehensive weight if the available paths with the maximum comprehensive weight exist;
s11, if the available path does not exist, jumping to S18;
s12, sending a message to a next domain according to the available path;
s13, judging whether the current domain where the message is located is a relay domain, and if the current domain is the relay domain, skipping to S12;
s14, carrying out message persistence on the sent message in a target domain;
step S15, judging whether the message receiver is forbidden or deleted, if so, skipping to step S18;
s16, judging whether the message receiver is on line, and if not, jumping to the S18;
s17, sending the message to a receiver through mqtt, prompting the sender of success information, and ending;
and S18, prompting failure information of the sender and ending.
2. The method for issuing the cross-domain message based on the routing computation of claim 1, wherein the inter-domain is configured with routes according to the superior and inferior relation or is configured with independent routes for networking, and after the routing relation is configured, each routing node checks the connection state of the nodes directly connected with the routing node; each domain comprises a signal source pool, a service core module and a video coding, decoding and distributing module.
3. The cross-domain message distribution method based on routing computation of claim 2, wherein each domain can synchronize its own resource data to a superior domain or a subordinate domain; the resource data to be synchronized includes 5 types: domain information, gateway information for the domain, user details, sharing group, and sharing user information.
4. The method of claim 2, wherein checking the connection status between domains comprises: the method comprises the steps that real-time monitoring and updating of inter-domain connection states are achieved by accessing domains related to an access domain and a routing rule to a specific theme of mqtt;
when each domain accesses the mqtt, the unique theme/link/< domain ID > of the domain is connected, other associated domains monitor the topic, and once the connection is interrupted, the connection state of the domain is updated, and relevant event notification is triggered.
5. The method for publishing cross-domain message based on routing computation of claim 2, wherein the process of publishing message in the local domain is as follows: the message sender sends the message to the service module, and the service module sends the message to the message receiver.
6. The method of claim 2, wherein the single domain comprises a user module, an authentication module, a message module, a domain management module, and a routing module;
the message module is used for message single-sending, group-sending, historical message display of receiving, display of instant message, unread message reminding, and display of sending state and read state;
the message publishing allows the message to be sent to the offline user, and after the user logs in again, the message is prompted according to the unread number and the unread state;
the message receiver is forbidden or deleted when the message is sent, and failure information of the sender is prompted;
the message status comprises failure in sending, success in sending and not reading, success in sending and reading, unread receiving and read receiving.
7. The method for issuing the cross-domain message based on the routing computation of claim 1, further comprising a cross-domain message confirmation procedure:
s101, checking unread messages;
s102, clicking to view details of the message;
s103, asynchronously changing the state of the message;
s104, judging whether the sender is a local user, and if the sender is the local user, jumping to S107;
s105, calculating a route to a next node;
s106, judging whether the current domain is a relay domain, and if so, skipping to S105;
step S107, the state of the message is changed to be read by the user.
8. The method for distributing cross-domain messages based on routing computation of claim 1, further comprising a user operation message deletion process:
s201, acquiring a history message;
s202, clicking to delete the history message;
s203, logically deleting the history message;
and S204, judging whether the association number of the historical message is 0, if so, physically deleting the historical message and the associated information.
9. The method for distributing cross-domain messages based on routing computation of claim 1, further comprising deleting a user flow:
s201, acquiring a user to be deleted;
s202, clicking to delete the user;
s203, logically deleting all messages of the user;
and S204, judging whether the association number of the messages is 0 or not one by one, and if so, physically deleting the messages and the associated information.
10. A cross-domain message distribution system based on routing computation, comprising: at least one processor, a memory communicatively coupled to at least one of the processors;
the memory stores instructions executable by the processor to implement a cross-domain message distribution method based on routing computations of any of claims 1-9.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210843322.7A CN115277538A (en) | 2022-07-18 | 2022-07-18 | Cross-domain message publishing method and system based on routing computation |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210843322.7A CN115277538A (en) | 2022-07-18 | 2022-07-18 | Cross-domain message publishing method and system based on routing computation |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115277538A true CN115277538A (en) | 2022-11-01 |
Family
ID=83768546
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210843322.7A Pending CN115277538A (en) | 2022-07-18 | 2022-07-18 | Cross-domain message publishing method and system based on routing computation |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115277538A (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102938768A (en) * | 2012-11-13 | 2013-02-20 | 浙江宇视科技有限公司 | Method and device for cross-domain login and cross-domain monitoring service of roaming user |
| CN105007220A (en) * | 2015-04-20 | 2015-10-28 | 中国电信股份有限公司 | Inter-domain route management system, inter-domain route management method, domain adapters and transmission network |
| WO2018107556A1 (en) * | 2016-12-16 | 2018-06-21 | 邦彦技术股份有限公司 | Cross-domain instant messaging method and system based on ims architecture |
| CN113259394A (en) * | 2021-07-05 | 2021-08-13 | 北京小鸟科技股份有限公司 | Cross-domain user authentication method, system and equipment based on routing computation |
| CN113382453A (en) * | 2021-08-12 | 2021-09-10 | 北京小鸟科技股份有限公司 | Cross-domain graph transmission method and system based on enhanced static routing calculation and source return |
-
2022
- 2022-07-18 CN CN202210843322.7A patent/CN115277538A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102938768A (en) * | 2012-11-13 | 2013-02-20 | 浙江宇视科技有限公司 | Method and device for cross-domain login and cross-domain monitoring service of roaming user |
| CN105007220A (en) * | 2015-04-20 | 2015-10-28 | 中国电信股份有限公司 | Inter-domain route management system, inter-domain route management method, domain adapters and transmission network |
| WO2018107556A1 (en) * | 2016-12-16 | 2018-06-21 | 邦彦技术股份有限公司 | Cross-domain instant messaging method and system based on ims architecture |
| CN113259394A (en) * | 2021-07-05 | 2021-08-13 | 北京小鸟科技股份有限公司 | Cross-domain user authentication method, system and equipment based on routing computation |
| CN113382453A (en) * | 2021-08-12 | 2021-09-10 | 北京小鸟科技股份有限公司 | Cross-domain graph transmission method and system based on enhanced static routing calculation and source return |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102656922B (en) | Utilize for using swarm intelligence to carry out the system and method for the framework of information router at large scale distributed system | |
| CN100559770C (en) | Accelerate the method and apparatus of border gateway protocol convergence | |
| CN100505696C (en) | System, method and user terminal for realizing video live broadcast in media distributing network | |
| CN101616311B (en) | Video monitoring method and video monitoring server | |
| JP4555337B2 (en) | Connection determination method and apparatus in multi-domain virtual private network | |
| CN101495997B (en) | Techniques for one-way synchronization of routing information among intermediate nodes | |
| CN100413290C (en) | Method for setting up notification function for route selection according to border gateway protocol | |
| US7676812B2 (en) | Large scale event notification system | |
| CN101390321A (en) | Techniques for detecting loop-free paths that cross routing information boundaries | |
| CN102177690A (en) | Methods, systems, and computer readable media for providing sedation service in a telecommunications network | |
| US8619628B2 (en) | Enhanced reliability routing protocol | |
| CN102164097A (en) | Data storage method and mail relay method of storage system in mail system | |
| CN101406006B (en) | Information communication system, information communication method, and node apparatus included in information communication system | |
| CN103188153A (en) | Bidirectional forwarding detection (BFD) message sending method and equipment on broadcast network link | |
| CN103581011B (en) | Return path implementation method and device in content network | |
| JP4391960B2 (en) | Resource management apparatus, system and method | |
| CN115277538A (en) | Cross-domain message publishing method and system based on routing computation | |
| CN109412942B (en) | Cloud network transmission routing method and system | |
| CN113382453B (en) | Cross-domain graph transmission method and system based on enhanced static routing calculation and source return | |
| JP2000101642A (en) | Method and system for stream distribution | |
| CN113098750A (en) | Site interconnection method, system and transfer equipment | |
| JP2004201201A (en) | Wap terminal, communication method and communication program | |
| CN106034106A (en) | Networking method, networking management method, networking device, networking management device and networking system | |
| JP3395703B2 (en) | Point-to-point communication network system and communication control method therefor | |
| US6747980B1 (en) | Methods, apparatuses and systems for managing multiple signaling end points in a signaling system 7 network |
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 |