CN110719208B - Method for implementing new generation network based on shortest path - Google Patents
Method for implementing new generation network based on shortest path Download PDFInfo
- Publication number
- CN110719208B CN110719208B CN201911015522.8A CN201911015522A CN110719208B CN 110719208 B CN110719208 B CN 110719208B CN 201911015522 A CN201911015522 A CN 201911015522A CN 110719208 B CN110719208 B CN 110719208B
- Authority
- CN
- China
- Prior art keywords
- name
- router
- interface
- equal
- 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.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/14—Network analysis or design
- H04L41/145—Network analysis or design involving simulating, designing, planning or modelling of a network
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides a new generation network realization method based on shortest path, which is characterized in that the network is composed of more than two nodes and more than two routers; each router is provided with more than two upstream interfaces and more than two downstream interfaces, each upstream interface is connected with other routers, and each downstream interface is connected with a node; each node has an interface, which is connected with a router; the user can quickly acquire data through the new generation network implementation method provided by the invention, thereby effectively shortening the delay and cost for acquiring service data and improving the service quality.
Description
Technical Field
The invention relates to an implementation method, in particular to a new generation network implementation method based on shortest path.
Background
In recent years, much research effort has been devoted to new generation networks so that network services can be rapidly acquired through the new generation networks. With the development of new generation networks, the new generation networks will become a mode for providing services in the future.
At present, the realization mode of the new generation network is realized by broadcasting, so that the delay and the cost are both large, and the network service performance is reduced. Therefore, how to reduce the delay and cost of providing data by new generation networks becomes a hot issue of research in recent years.
Disclosure of Invention
The purpose of the invention is as follows: the invention aims to solve the technical problem of providing a new generation network implementation method based on the shortest path aiming at the defects of the prior art.
The technical scheme is as follows: the invention discloses a new generation network realization method based on shortest path, wherein the network is composed of more than two nodes and more than two routers;
each router is provided with more than two upstream interfaces and more than two downstream interfaces, each upstream interface is connected with other routers, and each downstream interface is connected with a node;
each node has an interface, which is connected with a router;
each interface is uniquely identified by an interface ID, and the interface with the interface ID of t is marked as an interface t;
one data is uniquely defined by a name, each router having unique coordinates;
the node can acquire the coordinates of the router through the electronic map; the electronic map is preset and comprises coordinates of all routers;
a message is defined by the message type, as shown in the following table:
the router stores a forwarding table, and a forwarding table item comprises a coordinate domain, an interface ID, a name and a life cycle;
a node and a router respectively store a data table, wherein one data table comprises a name, a data value and a life cycle;
the registration message contains a message type, a name and a data value;
under the condition that the node N1 can provide the data DA1, the data DA1 is defined by the name NA1, and the node N1 is connected to the router R1, the node N1 periodically performs the following operations:
step 101: starting;
step 102: the node N1 creates a data table entry, the name of the data table entry is NA1, the data value is DA1, the life cycle is the maximum value, a registration message is sent, the message type of the registration message is 1, the name is NA1, and the data value is DA 1; the life cycle value range is 500ms-1000 ms;
step 103: the router R1 checks the forwarding table after receiving the registration message from the interface f1, if there is a forwarding table entry, the interface ID of the forwarding table entry is equal to f1 and the name field value is equal to the name field value of the registration message, then step 104 is executed, otherwise step 105 is executed;
step 104: the router R1 selects a forwarding table entry, the interface ID of which is equal to f1 and the name domain value of which is equal to the name domain value of the registration message, sets the lifetime of the forwarding table entry to the maximum value, and executes step 106;
step 105: the router R1 creates a forwarding table entry, the interface ID of the forwarding table entry is equal to f1, the name domain value is equal to the name domain value of the registration message, the coordinate domain value is null, and the life cycle is set to the maximum value;
step 106: the router R1 looks up the data table, if there is a data table entry whose name field value is equal to the name field value of the registration message, then step 107 is executed, otherwise step 108 is executed;
step 107: the router R1 selects a data entry whose name field value is equal to the name field value of the registration message, sets the lifetime of the data entry to the maximum value, and performs step 109;
step 108: router R1 creating a data entry having a name field value equal to the name field value of the registration message, a data value equal to the data value of the registration message, setting the lifetime to a maximum value;
step 109: finishing;
the nodes execute the registration operation through the process so as to establish a forwarding table and a data table in the connected router, so that the router can forward the message to the destination node through a correct interface through the forwarding table, and meanwhile, the router can directly provide data for the nodes through the data table, thereby reducing the data communication delay and the cost.
In the method of the invention, a router stores a neighbor table, and a neighbor table item comprises coordinates, an interface ID and a life cycle;
one neighbor table entry contains a message type and coordinates;
the router R1 periodically performs the following operations:
step 201: starting;
step 202: the router R1 sends a neighbor message from each upstream interface, the neighbor message having a message type value of 2 and having the coordinates of the router R1;
step 203: the neighbor router receives the neighbor message from the interface f2 and then checks the neighbor table, if there is a neighbor table entry, the coordinate of the neighbor table entry is equal to the coordinate of the neighbor message, then step 204 is executed, otherwise step 205 is executed;
step 204: the neighbor router receiving the neighbor message from the interface f2 selects a neighbor table entry, the coordinate of which is equal to the coordinate of the neighbor message, updates the interface ID of the neighbor table entry to f2, sets the life cycle to the maximum value, and executes step 206;
step 205: the neighbor router receiving the neighbor message from the interface f2 creates a neighbor table entry, the coordinates of the neighbor table entry are equal to the coordinates of the neighbor message, the interface ID is equal to f2, and the life cycle is set to be the maximum value;
step 206: finishing;
the router establishes the neighbor table through the process, so that the router can acquire the coordinates of the neighbor router and select the optimal neighbor router as the next hop so as to establish the optimal routing path to the destination node, and meanwhile, the router can acquire the interface ID connected with the neighbor router, so that the correct forwarding of the message is realized, and the correctness of the communication is ensured.
In the method of the invention, the forwarding message comprises a message type, a name set and a coordinate;
after the router R1 establishes the data table, the following operations are periodically performed:
step 301: starting;
step 302: the router R1 sets a name set parameter np1, the initial value of the parameter np1 is null; the router R1 looks at the data table, and for each data table entry, the router R1 performs the following operations: the router R1 judges whether the name of the data table entry is contained in the parameter np1, if so, the router R1 does not do any operation, otherwise, the router R1 adds the name of the data table entry into the parameter np 1;
step 303: the router R1 sends a forwarding message from each upstream interface, the message type of the forwarding message has a value of 3, the name set is the parameter np1, and the coordinate is the coordinate of the router R1;
step 304: the other routers receive the forwarded message from interface x1, and for each name NA1 in the name set of the forwarded message, the router performs the following operations: if the router has a forwarding table entry, the name of the forwarding table entry is equal to NA1, the coordinate is equal to the coordinate of the forwarding message, the interface ID is equal to x1, and the lifetime is greater than the threshold TH1, execute step 309, otherwise execute step 305; the threshold TH1 is set to 90% -95% of the maximum life cycle, the larger the threshold is, the higher the update frequency of the forwarding table entry is, the smaller the threshold is, the lower the update frequency is;
step 305: the router receiving the forwarding message from interface x1 determines whether there is a forwarding table entry, the name of the forwarding table entry is equal to NA1, and the coordinate is equal to the coordinate of the forwarding message, if yes, step 306 is executed, otherwise step 307 is executed;
step 306: the router receiving the forwarding message from the interface x1 selects a forwarding table, the name of the forwarding table is equal to NA1, the coordinate is equal to the coordinate of the forwarding message, the interface ID of the forwarding table is set to x1, the life cycle is set to the maximum value, and step 308 is executed;
step 307: the router receiving the forwarding message from the interface x1 creates a forwarding table entry, the name of the forwarding table entry is equal to NA1, the coordinate is equal to the coordinate of the forwarding message, the interface ID is equal to x1, and the life cycle is set to the maximum value;
step 308: the router receiving the forwarding message from interface x1 forwards the forwarding message from each upstream interface except interface x1, executing step 304;
step 309: finishing;
the router establishes a forwarding table through the above process, the router closest to the router can be selected to provide data through a coordinate domain of the forwarding table, correct forwarding of messages can be realized through an interface ID of the forwarding table so as to realize correct data communication, and required data can be acquired from the correct router through the name of the forwarding table; the forwarding table establishes an optimal path between the two routers, so that the delay and cost of data communication are reduced.
In the method of the invention, each router stores a path table, and one path table contains an interface ID and a name;
the request message contains a message type and a name;
the response message contains a message type, a name, a data value and coordinates;
the node N2 is connected with the router R2, the data DA1 is defined by a name NA1, and the node N2 acquires the data DA1 through the following processes:
step 401: starting;
step 402: node N2 sends a request message with a message type value of 4 and name NA 1; the router R2 checks the data table after receiving the request message from the interface y1, determines whether there is a data table entry, the name of the data table entry is equal to the name of the request message, if yes, step 403 is executed, otherwise, step 404 is executed;
step 403: router R2 selects a data table entry having a name equal to the name of the request message, router R2 creates a response message having a message type value of 5, a name equal to the name of the request message, a data value equal to the data value of the data table entry, and coordinates equal to the coordinates of router R2, router R2 sends the response message from interface y1, go to step 420;
step 404: the router R2 checks the path table, determines whether there is a path table entry, the name of which is equal to the name of the received request message and the interface ID is equal to y1, if so, performs step 420, otherwise performs step 405;
step 405: the router R2 checks the path table, determines whether there is a path table entry whose name is equal to the name of the received request message, if so, performs step 406, otherwise performs step 407;
step 406: the router R2 creates a path table entry with the name equal to the name of the received request message and the interface ID equal to y1, performs step 420;
step 407: the router R2 creates a path table entry with the name equal to the name of the received request message and the interface ID equal to y 1; the router R2 determines whether there is a forwarding table entry, the name of which is equal to the name of the request message and the coordinate is null, if yes, step 408 is executed, otherwise step 409 is executed;
step 408: the router R2 selects a forwarding table entry, the name of which is equal to the name of the request message and the coordinates of which are null, forwards the request message from the interface identified by the interface ID of the forwarding table entry, and executes step 410;
step 409: the router R2 selects all forwarding table entries with the name equal to the name of the request message, the router R2 selects one forwarding table entry from the forwarding table entries, the coordinate of the forwarding table entry is closest to the coordinate of the router R2, and the request message is forwarded from the interface identified by the interface ID of the selected forwarding table entry;
step 410: if the node receives the request message, step 419 is performed, otherwise step 411 is performed;
step 411: the router receives the request message from the interface y2 and checks the data table, if there is a data table entry whose name is equal to the name of the request message, then step 412 is executed, otherwise step 413 is executed;
step 412: the router receiving the request message from interface y2 selects a data table entry having a name equal to the name of the request message, the router receiving the request message from interface y2 creates a response message having a message type value of 5, a name equal to the name of the request message, a data value equal to the data value of the data table entry, and coordinates equal to the coordinates of the router, sends the response message from interface y2, and performs step 420;
step 413: the router receiving the request message from interface y2 looks up the path table, if there is a path table entry whose name is equal to the name of the received request message and interface ID is equal to y2, then step 420 is executed, otherwise step 414 is executed;
step 414: the router receiving the request message from the interface y2 looks up the path table, if there is a path table entry whose name is equal to the name of the received request message, then step 415 is executed, otherwise step 416 is executed;
step 415: the router receiving the request message from interface y2 creates a path table entry with the name equal to the name of the received request message and the interface ID equal to y2, performs step 420;
step 416: the router receiving the request message from interface y2 creates a path table entry with the name equal to the name of the request message and the interface ID equal to y 2; the router judges whether a forwarding table item exists, the name of the forwarding table item is equal to the name of the request message, and the coordinate is null, if yes, step 417 is executed, otherwise, step 418 is executed;
step 417: the router receiving the request message from interface y2 selects a forwarding table with a name equal to the name of the request message and a null coordinate, forwards the request message from the interface identified by the interface ID of the forwarding table, and executes step 410;
step 418: the router receiving the request message from interface y2 selects all forwarding table entries with names equal to the name of the request message, selects one forwarding table entry from the forwarding table entries from the router receiving the request message from interface y2, the coordinate of the forwarding table entry is closest to the coordinate of the router, forwards the request message from the interface identified by the interface ID of the selected forwarding table entry, and executes step 410;
step 419: after receiving the request message, the node selects a data table entry, the name of the data table entry is equal to the name of the request message, the node sends a response message, the message type of the response message has a value of 5, the name is equal to the name of the request message, the data value is equal to the data value of the data table entry, and the coordinate is equal to the coordinate of a router connected with the node;
step 420: if the other node receives the response message, executing step 427, otherwise executing step 421;
step 421: after receiving the response message, the router selects all path table entries with the name domain value equal to the name of the response message, and for each selected path table entry E1, the router performs the following operations: if there is a forwarding table entry, the name and interface ID of the forwarding table entry are respectively equal to the name and interface ID of the path table entry E1, and the coordinates are equal to the coordinates of the response message, go to step 422, otherwise go to step 423;
step 422: the router receiving the response message selects a forwarding table entry, the name and the interface ID of which are respectively equal to the name and the interface ID of the path table entry E1 and the coordinate of which is equal to the coordinate of the response message, sets the life cycle of the forwarding table entry to the maximum value, and executes step 424;
step 423: the router receiving the response message creates a forwarding table entry, the name and the interface ID of the forwarding table entry are respectively equal to the name and the interface ID of the path table entry E1, and the coordinate is equal to the coordinate of the response message, and then the life cycle of the forwarding table entry is set to be the maximum value;
step 424: the router receiving the response message judges that the interface identified by the interface ID of the path table entry E1 is a downstream interface of the router, if yes, step 425 is executed, otherwise, step 426 is executed;
step 425: the router receiving the response message checks the data table, and if a data table item exists and the name of the data table item is equal to the name of the response message, the life cycle of the data table item is set to be the maximum value; otherwise, the router creates a data table item, the name of the data table item is equal to the name of the response message, the data value is equal to the data value of the response message, and the life cycle is set to be the maximum value;
step 426: the router receiving the response message forwards the response message from the interface identified by the interface ID of the path table entry E1, deletes the path table entry E1, and performs step 420;
step 427: after receiving the response message, the node creates a data table entry, the name of the data table entry is equal to the name of the response message, the data value is equal to the data value of the response message, and the life cycle is set to be the maximum value;
step 428: and (6) ending.
In addition, the above process realizes the aggregation of request messages through the path table, so that the nodes can share data from the intermediate router, namely more than two nodes can acquire data through one data communication process, thereby further reducing the data communication delay and the cost.
Has the advantages that: the invention provides a new generation network implementation method based on the shortest path, and a user can quickly acquire data through the new generation network implementation method provided by the invention, so that the delay and cost for acquiring service data are effectively shortened, the service quality is improved, the method can be applied to the fields of road condition monitoring, vehicle management and the like, and has wide application prospect.
Drawings
The foregoing and/or other advantages of the invention will become further apparent from the following detailed description of the invention when taken in conjunction with the accompanying drawings.
Fig. 1 is a schematic diagram of a registration process according to the present invention.
Fig. 2 is a schematic flow chart of establishing a neighbor table according to the present invention.
Fig. 3 is a schematic diagram of a process for establishing a forwarding table according to the present invention.
Fig. 4 is a schematic diagram of a data communication process according to the present invention.
The specific implementation mode is as follows:
the invention provides a new generation network implementation method based on the shortest path, and a user can quickly acquire data through the new generation network implementation method provided by the invention, so that the delay and cost for acquiring service data are effectively shortened, the service quality is improved, the method can be applied to the fields of road condition monitoring, vehicle management and the like, and has wide application prospect.
Fig. 1 is a schematic diagram of a registration process according to the present invention. The network is composed of more than two nodes and more than two routers; each router is provided with more than two upstream interfaces and more than two downstream interfaces, each upstream interface is connected with other routers, and each downstream interface is connected with a node; each node has an interface, which is connected with a router; each interface is uniquely identified by an interface ID, and the interface with the interface ID of t is marked as an interface t; one data is uniquely defined by a name, each router having unique coordinates; the node can acquire the coordinates of the router through the electronic map; the electronic map is preset and comprises coordinates of all routers; a message is defined by the message type, as shown in the following table:
the router stores a forwarding table, and one forwarding table item comprises a coordinate field, an interface ID, a name and a life cycle. A node and a router respectively store a data table, wherein one data table comprises a name, a data value and a life cycle; the registration message contains a message type, a name and a data value; under the condition that the node N1 can provide the data DA1, the data DA1 is defined by the name NA1, and the node N1 is connected to the router R1, the node N1 periodically performs the following operations:
step 101: starting;
step 102: the node N1 creates a data table entry, the name of the data table entry is NA1, the data value is DA1, the life cycle is the maximum value, a registration message is sent, the message type of the registration message is 1, the name is NA1, and the data value is DA 1; the life cycle value range is 500ms-1000 ms;
step 103: the router R1 checks the forwarding table after receiving the registration message from the interface f1, if there is a forwarding table entry, the interface ID of the forwarding table entry is equal to f1 and the name field value is equal to the name field value of the registration message, then step 104 is executed, otherwise step 105 is executed;
step 104: the router R1 selects a forwarding table entry, the interface ID of which is equal to f1 and the name domain value of which is equal to the name domain value of the registration message, sets the lifetime of the forwarding table entry to the maximum value, and executes step 106;
step 105: the router R1 creates a forwarding table entry, the interface ID of the forwarding table entry is equal to f1, the name domain value is equal to the name domain value of the registration message, the coordinate domain value is null, and the life cycle is set to the maximum value;
step 106: the router R1 looks up the data table, if there is a data table entry whose name field value is equal to the name field value of the registration message, then step 107 is executed, otherwise step 108 is executed;
step 107: the router R1 selects a data entry whose name field value is equal to the name field value of the registration message, sets the lifetime of the data entry to the maximum value, and performs step 109;
step 108: router R1 creating a data entry having a name field value equal to the name field value of the registration message, a data value equal to the data value of the registration message, setting the lifetime to a maximum value;
step 109: and (6) ending.
The nodes execute the registration operation through the process so as to establish a forwarding table and a data table in the connected router, so that the router can forward the message to the destination node through a correct interface through the forwarding table, and meanwhile, the router can directly provide data for the nodes through the data table, thereby reducing the data communication delay and the cost.
Fig. 2 is a schematic flow chart of establishing a neighbor table according to the present invention. A router stores a neighbor table, and a neighbor table item comprises coordinates, an interface ID and a life cycle; one neighbor table entry contains a message type and coordinates; the router R1 periodically performs the following operations:
step 201: starting;
step 202: the router R1 sends a neighbor message from each upstream interface, the neighbor message having a message type value of 2 and having the coordinates of the router R1;
step 203: the neighbor router receives the neighbor message from the interface f2 and then checks the neighbor table, if there is a neighbor table entry, the coordinate of the neighbor table entry is equal to the coordinate of the neighbor message, then step 204 is executed, otherwise step 205 is executed;
step 204: the neighbor router receiving the neighbor message from the interface f2 selects a neighbor table entry, the coordinate of which is equal to the coordinate of the neighbor message, updates the interface ID of the neighbor table entry to f2, sets the life cycle to the maximum value, and executes step 206;
step 205: the neighbor router receiving the neighbor message from the interface f2 creates a neighbor table entry, the coordinates of the neighbor table entry are equal to the coordinates of the neighbor message, the interface ID is equal to f2, and the life cycle is set to be the maximum value;
step 206: and (6) ending.
The router establishes the neighbor table through the process, so that the router can acquire the coordinates of the neighbor router and select the optimal neighbor router as the next hop so as to establish the optimal routing path to the destination node, and meanwhile, the router can acquire the interface ID connected with the neighbor router, so that the correct forwarding of the message is realized, and the correctness of the communication is ensured.
Fig. 3 is a schematic diagram of a process for establishing a forwarding table according to the present invention. The forwarding message comprises a message type, a name set and coordinates; after the router R1 establishes the data table, the following operations are periodically performed:
step 301: starting;
step 302: the router R1 sets a name set parameter np1, the initial value of the parameter np1 is null; the router R1 looks at the data table, and for each data table entry, the router R1 performs the following operations: the router R1 judges whether the name of the data table entry is contained in the parameter np1, if so, the router R1 does not do any operation, otherwise, the router R1 adds the name of the data table entry into the parameter np 1;
step 303: the router R1 sends a forwarding message from each upstream interface, the message type of the forwarding message has a value of 3, the name set is the parameter np1, and the coordinate is the coordinate of the router R1;
step 304: the other routers receive the forwarded message from interface x1, and for each name NA1 in the name set of the forwarded message, the router performs the following operations: if the router has a forwarding table entry, the name of the forwarding table entry is equal to NA1, the coordinate is equal to the coordinate of the forwarding message, the interface ID is equal to x1, and the lifetime is greater than the threshold TH1, execute step 309, otherwise execute step 305; the threshold TH1 is set to 90% -95% of the maximum life cycle, the larger the threshold is, the higher the update frequency of the forwarding table entry is, the smaller the threshold is, the lower the update frequency is;
step 305: the router receiving the forwarding message from interface x1 determines whether there is a forwarding table entry, the name of the forwarding table entry is equal to NA1, and the coordinate is equal to the coordinate of the forwarding message, if yes, step 306 is executed, otherwise step 307 is executed;
step 306: the router receiving the forwarding message from the interface x1 selects a forwarding table, the name of the forwarding table is equal to NA1, the coordinate is equal to the coordinate of the forwarding message, the interface ID of the forwarding table is set to x1, the life cycle is set to the maximum value, and step 308 is executed;
step 307: the router receiving the forwarding message from the interface x1 creates a forwarding table entry, the name of the forwarding table entry is equal to NA1, the coordinate is equal to the coordinate of the forwarding message, the interface ID is equal to x1, and the life cycle is set to the maximum value;
step 308: the router receiving the forwarding message from interface x1 forwards the forwarding message from each upstream interface except interface x1, executing step 304;
step 309: and (6) ending.
The router establishes a forwarding table through the above process, the router closest to the router can be selected to provide data through a coordinate domain of the forwarding table, correct forwarding of messages can be realized through an interface ID of the forwarding table so as to realize correct data communication, and required data can be acquired from the correct router through the name of the forwarding table; the forwarding table establishes an optimal path between the two routers, so that the delay and cost of data communication are reduced.
Fig. 4 is a schematic diagram of a data communication process according to the present invention. Each router stores a path table, and each path table item comprises an interface ID and a name; the request message contains a message type and a name; the response message contains a message type, a name, a data value and coordinates; the node N2 is connected with the router R2, the data DA1 is defined by a name NA1, and the node N2 acquires the data DA1 through the following processes:
step 401: starting;
step 402: node N2 sends a request message with a message type value of 4 and name NA 1; the router R2 checks the data table after receiving the request message from the interface y1, determines whether there is a data table entry, the name of the data table entry is equal to the name of the request message, if yes, step 403 is executed, otherwise, step 404 is executed;
step 403: router R2 selects a data table entry having a name equal to the name of the request message, router R2 creates a response message having a message type value of 5, a name equal to the name of the request message, a data value equal to the data value of the data table entry, and coordinates equal to the coordinates of router R2, router R2 sends the response message from interface y1, go to step 420;
step 404: the router R2 checks the path table, determines whether there is a path table entry, the name of which is equal to the name of the received request message and the interface ID is equal to y1, if so, performs step 420, otherwise performs step 405;
step 405: the router R2 checks the path table, determines whether there is a path table entry whose name is equal to the name of the received request message, if so, performs step 406, otherwise performs step 407;
step 406: the router R2 creates a path table entry with the name equal to the name of the received request message and the interface ID equal to y1, performs step 420;
step 407: the router R2 creates a path table entry with the name equal to the name of the received request message and the interface ID equal to y 1; the router R2 determines whether there is a forwarding table entry, the name of which is equal to the name of the request message and the coordinate is null, if yes, step 408 is executed, otherwise step 409 is executed;
step 408: the router R2 selects a forwarding table entry, the name of which is equal to the name of the request message and the coordinates of which are null, forwards the request message from the interface identified by the interface ID of the forwarding table entry, and executes step 410;
step 409: the router R2 selects all forwarding table entries with the name equal to the name of the request message, the router R2 selects one forwarding table entry from the forwarding table entries, the coordinate of the forwarding table entry is closest to the coordinate of the router R2, and the request message is forwarded from the interface identified by the interface ID of the selected forwarding table entry;
step 410: if the node receives the request message, step 419 is performed, otherwise step 411 is performed;
step 411: the router receives the request message from the interface y2 and checks the data table, if there is a data table entry whose name is equal to the name of the request message, then step 412 is executed, otherwise step 413 is executed;
step 412: the router receiving the request message from interface y2 selects a data table entry having a name equal to the name of the request message, the router receiving the request message from interface y2 creates a response message having a message type value of 5, a name equal to the name of the request message, a data value equal to the data value of the data table entry, and coordinates equal to the coordinates of the router, sends the response message from interface y2, and performs step 420;
step 413: the router receiving the request message from interface y2 looks up the path table, if there is a path table entry whose name is equal to the name of the received request message and interface ID is equal to y2, then step 420 is executed, otherwise step 414 is executed;
step 414: the router receiving the request message from the interface y2 looks up the path table, if there is a path table entry whose name is equal to the name of the received request message, then step 415 is executed, otherwise step 416 is executed;
step 415: the router receiving the request message from interface y2 creates a path table entry with the name equal to the name of the received request message and the interface ID equal to y2, performs step 420;
step 416: the router receiving the request message from interface y2 creates a path table entry with the name equal to the name of the request message and the interface ID equal to y 2; the router judges whether a forwarding table item exists, the name of the forwarding table item is equal to the name of the request message, and the coordinate is null, if yes, step 417 is executed, otherwise, step 418 is executed;
step 417: the router receiving the request message from interface y2 selects a forwarding table with a name equal to the name of the request message and a null coordinate, forwards the request message from the interface identified by the interface ID of the forwarding table, and executes step 410;
step 418: the router receiving the request message from interface y2 selects all forwarding table entries with names equal to the name of the request message, selects one forwarding table entry from the forwarding table entries from the router receiving the request message from interface y2, the coordinate of the forwarding table entry is closest to the coordinate of the router, forwards the request message from the interface identified by the interface ID of the selected forwarding table entry, and executes step 410;
step 419: after receiving the request message, the node selects a data table entry, the name of the data table entry is equal to the name of the request message, the node sends a response message, the message type of the response message has a value of 5, the name is equal to the name of the request message, the data value is equal to the data value of the data table entry, and the coordinate is equal to the coordinate of a router connected with the node;
step 420: if the other node receives the response message, executing step 427, otherwise executing step 421;
step 421: after receiving the response message, the router selects all path table entries with the name domain value equal to the name of the response message, and for each selected path table entry E1, the router performs the following operations: if there is a forwarding table entry, the name and interface ID of the forwarding table entry are respectively equal to the name and interface ID of the path table entry E1, and the coordinates are equal to the coordinates of the response message, go to step 422, otherwise go to step 423;
step 422: the router receiving the response message selects a forwarding table entry, the name and the interface ID of which are respectively equal to the name and the interface ID of the path table entry E1 and the coordinate of which is equal to the coordinate of the response message, sets the life cycle of the forwarding table entry to the maximum value, and executes step 424;
step 423: the router receiving the response message creates a forwarding table entry, the name and the interface ID of the forwarding table entry are respectively equal to the name and the interface ID of the path table entry E1, and the coordinate is equal to the coordinate of the response message, and then the life cycle of the forwarding table entry is set to be the maximum value;
step 424: the router receiving the response message judges that the interface identified by the interface ID of the path table entry E1 is a downstream interface of the router, if yes, step 425 is executed, otherwise, step 426 is executed;
step 425: the router receiving the response message checks the data table, and if a data table item exists and the name of the data table item is equal to the name of the response message, the life cycle of the data table item is set to be the maximum value; otherwise, the router creates a data table item, the name of the data table item is equal to the name of the response message, the data value is equal to the data value of the response message, and the life cycle is set to be the maximum value;
step 426: the router receiving the response message forwards the response message from the interface identified by the interface ID of the path table entry E1, deletes the path table entry E1, and performs step 420;
step 427: after receiving the response message, the node creates a data table entry, the name of the data table entry is equal to the name of the response message, the data value is equal to the data value of the response message, and the life cycle is set to be the maximum value;
step 428: and (6) ending.
In addition, the above process realizes the aggregation of request messages through the path table, so that the nodes can share data from the intermediate router, namely more than two nodes can acquire data through one data communication process, thereby further reducing the data communication delay and the cost.
Example 1
Based on the simulation parameters of table 1, this embodiment simulates a method for implementing a next generation network based on a shortest path in the present invention, after the network is started, each node executes step 101 and 109 to establish a data table and a forwarding table, so that a router connected to the node can obtain an interface connected to the node through the forwarding table, and can provide target data through the data table, for example, the router creates a forwarding table entry and a data table entry, where the forwarding table entry has a coordinate field of (120,31), an interface ID of 3, a name of temperature, a life cycle of 500ms, a name of the data table entry of temperature, a data value of 20 degrees celsius, and a life cycle of 500 ms. Then, each router executes step 201 and 206 to establish a neighbor table, so that the router can record the coordinates of the connected neighbor routers and the interface IDs through the neighbor table, for example, the coordinates of the neighbor routers are (122,29), the interface IDs are 1, and the lifetime is 500 ms. Each router executes step 301 and 309 to establish a forwarding table, so that the router can acquire data that can be provided by all routers through step 301 and 309, thereby executing a correct routing forwarding operation, for example, coordinates of a forwarding table entry are (130,20), a name is humidity, and a life cycle is 500 ms. After the router establishes the forwarding table, the node N2 obtains the data DA2 by performing steps 401 and 428. Firstly, the node ND1 sends a request message to the connected router R2, if the router R2 holds the data table entry of the data DA2, a response message is returned, otherwise, the router R2 determines whether the request message requesting the data DA2 has been forwarded by checking the path table, if the request message requesting the data DA2 has been forwarded, the router R2 waits for the response message, otherwise, the router R2 creates the path table entry and forwards the request message by using the forwarding table; the router receiving the request message judges whether a data table entry of the data DA2 is stored, if so, a response message is returned, otherwise, the router judges whether the request message of the request data DA2 is forwarded by checking a path table, if the request message of the data DA2 is forwarded, the router waits for the response message, otherwise, the router creates the path table entry and continues to forward the request message by using a forwarding table, the process is repeated until the request message reaches one router, and the router returns the response message. Then, the router returns a response message through the interface receiving the request message, the router receiving the request message selects all path table entries having a name field value equal to the name of the response message, forwards the response message from the interface identified by the interface ID of the path table entry, and updates the forwarding table entry according to the path table entry, thereby obtaining the latest forwarding information to ensure the correctness of data communication, the router creates a data table entry to cache data so that the node can obtain the data from the nearest router, and the router repeats the above process until all nodes requesting the data DA2 receive the data DA 2. The node can acquire data from the nearest router through executing step 401-428 and simultaneously acquire data through one data communication process, thereby effectively reducing data communication delay and cost and improving data communication success rate.
The performance analysis was as follows: the data communication cost is reduced when the number of nodes requesting the data DA2 is increased, and the data communication cost is increased when the number of nodes requesting the data DA2 is decreased. The average cost of data acquisition was 4.3.
TABLE 1 simulation parameters
The present invention provides a new generation network implementation method based on shortest path, and the method and the way for implementing the technical solution are many, and the above description is only a preferred embodiment of the present invention, it should be noted that, for those skilled in the art, without departing from the principle of the present invention, several improvements and embellishments can be made, and these improvements and embellishments should also be regarded as the protection scope of the present invention. The components not specified in this embodiment can be implemented by the prior art.
Claims (2)
1. A new generation network implementation method based on shortest path is characterized in that the network is composed of more than two nodes and more than two routers;
each router is provided with more than two upstream interfaces and more than two downstream interfaces, each upstream interface is connected with other routers, and each downstream interface is connected with a node;
each node has an interface, which is connected with a router;
each interface is uniquely identified by an interface ID, and the interface with the interface ID of t is marked as an interface t;
one data is uniquely defined by a name, each router having unique coordinates;
the node can acquire the coordinates of the router through the electronic map;
a message is defined by the message type, as shown in the following table:
The router stores a forwarding table, and a forwarding table item comprises a coordinate domain, an interface ID, a name and a life cycle;
a node and a router respectively store a data table, wherein one data table comprises a name, a data value and a life cycle;
the registration message contains a message type, a name and a data value;
under the condition that the node N1 can provide the data DA1, the data DA1 is defined by the name NA1, and the node N1 is connected to the router R1, the node N1 periodically performs the following operations:
step 101: starting;
step 102: the node N1 creates a data table entry, the name of the data table entry is NA1, the data value is DA1, the life cycle is the maximum value, a registration message is sent, the message type of the registration message is 1, the name is NA1, and the data value is DA 1;
step 103: the router R1 checks the forwarding table after receiving the registration message from the interface f1, if there is a forwarding table entry, the interface ID of the forwarding table entry is equal to f1 and the name field value is equal to the name field value of the registration message, then step 104 is executed, otherwise step 105 is executed;
step 104: the router R1 selects a forwarding table entry, the interface ID of which is equal to f1 and the name domain value of which is equal to the name domain value of the registration message, sets the lifetime of the forwarding table entry to the maximum value, and executes step 106;
step 105: the router R1 creates a forwarding table entry, the interface ID of the forwarding table entry is equal to f1, the name domain value is equal to the name domain value of the registration message, the coordinate domain value is null, and the life cycle is set to the maximum value;
step 106: the router R1 looks up the data table, if there is a data table entry whose name field value is equal to the name field value of the registration message, then step 107 is executed, otherwise step 108 is executed;
step 107: the router R1 selects a data entry whose name field value is equal to the name field value of the registration message, sets the lifetime of the data entry to the maximum value, and performs step 109;
step 108: router R1 creating a data entry having a name field value equal to the name field value of the registration message, a data value equal to the data value of the registration message, setting the lifetime to a maximum value;
step 109: finishing;
a router stores a neighbor table, and a neighbor table item comprises coordinates, an interface ID and a life cycle;
one neighbor table entry contains a message type and coordinates;
the router R1 periodically performs the following operations:
step 201: starting;
step 202: the router R1 sends a neighbor message from each upstream interface, the neighbor message having a message type value of 2 and having the coordinates of the router R1;
step 203: the neighbor router receives the neighbor message from the interface f2 and then checks the neighbor table, if there is a neighbor table entry, the coordinate of the neighbor table entry is equal to the coordinate of the neighbor message, then step 204 is executed, otherwise step 205 is executed;
step 204: the neighbor router receiving the neighbor message from the interface f2 selects a neighbor table entry, the coordinate of which is equal to the coordinate of the neighbor message, updates the interface ID of the neighbor table entry to f2, sets the life cycle to the maximum value, and executes step 206;
step 205: the neighbor router receiving the neighbor message from the interface f2 creates a neighbor table entry, the coordinates of the neighbor table entry are equal to the coordinates of the neighbor message, the interface ID is equal to f2, and the life cycle is set to be the maximum value;
step 206: finishing;
the forwarding message comprises a message type, a name set and coordinates;
after the router R1 establishes the data table, the following operations are periodically performed:
step 301: starting;
step 302: the router R1 sets a name set parameter np1, the initial value of the parameter np1 is null; the router R1 looks at the data table, and for each data table entry, the router R1 performs the following operations: the router R1 judges whether the name of the data table entry is contained in the parameter np1, if so, the router R1 does not do any operation, otherwise, the router R1 adds the name of the data table entry into the parameter np 1;
step 303: the router R1 sends a forwarding message from each upstream interface, the message type of the forwarding message has a value of 3, the name set is the parameter np1, and the coordinate is the coordinate of the router R1;
step 304: the other routers receive the forwarded message from interface x1, and for each name NA1 in the name set of the forwarded message, the router performs the following operations: if the router has a forwarding table entry, the name of the forwarding table entry is equal to NA1, the coordinate is equal to the coordinate of the forwarding message, the interface ID is equal to x1, and the lifetime is greater than the threshold TH1, execute step 309, otherwise execute step 305;
step 305: the router receiving the forwarding message from interface x1 determines whether there is a forwarding table entry, the name of the forwarding table entry is equal to NA1, and the coordinate is equal to the coordinate of the forwarding message, if yes, step 306 is executed, otherwise step 307 is executed;
step 306: the router receiving the forwarding message from the interface x1 selects a forwarding table, the name of the forwarding table is equal to NA1, the coordinate is equal to the coordinate of the forwarding message, the interface ID of the forwarding table is set to x1, the life cycle is set to the maximum value, and step 308 is executed;
step 307: the router receiving the forwarding message from the interface x1 creates a forwarding table entry, the name of the forwarding table entry is equal to NA1, the coordinate is equal to the coordinate of the forwarding message, the interface ID is equal to x1, and the life cycle is set to the maximum value;
step 308: the router receiving the forwarding message from interface x1 forwards the forwarding message from each upstream interface except interface x1, executing step 304;
step 309: and (6) ending.
2. The method of claim 1, wherein the shortest path is used to implement a next generation network,
each router stores a path table, and each path table item comprises an interface ID and a name;
the request message contains a message type and a name;
the response message contains a message type, a name, a data value and coordinates;
the node N2 is connected with the router R2, the data DA1 is defined by a name NA1, and the node N2 acquires the data DA1 through the following processes:
step 401: starting;
step 402: node N2 sends a request message with a message type value of 4 and name NA 1; the router R2 checks the data table after receiving the request message from the interface y1, determines whether there is a data table entry, the name of the data table entry is equal to the name of the request message, if yes, step 403 is executed, otherwise, step 404 is executed;
step 403: router R2 selects a data table entry having a name equal to the name of the request message, router R2 creates a response message having a message type value of 5, a name equal to the name of the request message, a data value equal to the data value of the data table entry, and coordinates equal to the coordinates of router R2, router R2 sends the response message from interface y1, go to step 420;
step 404: the router R2 checks the path table, determines whether there is a path table entry, the name of which is equal to the name of the received request message and the interface ID is equal to y1, if so, performs step 420, otherwise performs step 405;
step 405: the router R2 checks the path table, determines whether there is a path table entry whose name is equal to the name of the received request message, if so, performs step 406, otherwise performs step 407;
step 406: the router R2 creates a path table entry with the name equal to the name of the received request message and the interface ID equal to y1, performs step 420;
step 407: the router R2 creates a path table entry with the name equal to the name of the received request message and the interface ID equal to y 1; the router R2 determines whether there is a forwarding table entry, the name of which is equal to the name of the request message and the coordinate is null, if yes, step 408 is executed, otherwise step 409 is executed;
step 408: the router R2 selects a forwarding table entry, the name of which is equal to the name of the request message and the coordinates of which are null, forwards the request message from the interface identified by the interface ID of the forwarding table entry, and executes step 410;
step 409: the router R2 selects all forwarding table entries with the name equal to the name of the request message, the router R2 selects one forwarding table entry from the forwarding table entries, the coordinate of the forwarding table entry is closest to the coordinate of the router R2, and the request message is forwarded from the interface identified by the interface ID of the selected forwarding table entry;
step 410: if the node receives the request message, step 419 is performed, otherwise step 411 is performed;
step 411: the router receives the request message from the interface y2 and checks the data table, if there is a data table entry whose name is equal to the name of the request message, then step 412 is executed, otherwise step 413 is executed;
step 412: the router receiving the request message from interface y2 selects a data table entry having a name equal to the name of the request message, the router receiving the request message from interface y2 creates a response message having a message type value of 5, a name equal to the name of the request message, a data value equal to the data value of the data table entry, and coordinates equal to the coordinates of the router, sends the response message from interface y2, and performs step 420;
step 413: the router receiving the request message from interface y2 looks up the path table, if there is a path table entry whose name is equal to the name of the received request message and interface ID is equal to y2, then step 420 is executed, otherwise step 414 is executed;
step 414: the router receiving the request message from the interface y2 looks up the path table, if there is a path table entry whose name is equal to the name of the received request message, then step 415 is executed, otherwise step 416 is executed;
step 415: the router receiving the request message from interface y2 creates a path table entry with the name equal to the name of the received request message and the interface ID equal to y2, performs step 420;
step 416: the router receiving the request message from interface y2 creates a path table entry with the name equal to the name of the request message and the interface ID equal to y 2; the router judges whether a forwarding table item exists, the name of the forwarding table item is equal to the name of the request message, and the coordinate is null, if yes, step 417 is executed, otherwise, step 418 is executed;
step 417: the router receiving the request message from interface y2 selects a forwarding table with a name equal to the name of the request message and a null coordinate, forwards the request message from the interface identified by the interface ID of the forwarding table, and executes step 410;
step 418: the router receiving the request message from interface y2 selects all forwarding table entries with names equal to the name of the request message, selects one forwarding table entry from the forwarding table entries from the router receiving the request message from interface y2, the coordinate of the forwarding table entry is closest to the coordinate of the router, forwards the request message from the interface identified by the interface ID of the selected forwarding table entry, and executes step 410;
step 419: after receiving the request message, the node selects a data table entry, the name of the data table entry is equal to the name of the request message, the node sends a response message, the message type of the response message has a value of 5, the name is equal to the name of the request message, the data value is equal to the data value of the data table entry, and the coordinate is equal to the coordinate of a router connected with the node;
step 420: if the other node receives the response message, executing step 427, otherwise executing step 421;
step 421: after receiving the response message, the router selects all path table entries with the name domain value equal to the name of the response message, and for each selected path table entry E1, the router performs the following operations: if there is a forwarding table entry, the name and interface ID of the forwarding table entry are respectively equal to the name and interface ID of the path table entry E1, and the coordinates are equal to the coordinates of the response message, go to step 422, otherwise go to step 423;
step 422: the router receiving the response message selects a forwarding table entry, the name and the interface ID of which are respectively equal to the name and the interface ID of the path table entry E1 and the coordinate of which is equal to the coordinate of the response message, sets the life cycle of the forwarding table entry to the maximum value, and executes step 424;
step 423: the router receiving the response message creates a forwarding table entry, the name and the interface ID of the forwarding table entry are respectively equal to the name and the interface ID of the path table entry E1, and the coordinate is equal to the coordinate of the response message, and then the life cycle of the forwarding table entry is set to be the maximum value;
step 424: the router receiving the response message judges that the interface identified by the interface ID of the path table entry E1 is a downstream interface of the router, if yes, step 425 is executed, otherwise, step 426 is executed;
step 425: the router receiving the response message checks the data table, and if a data table item exists and the name of the data table item is equal to the name of the response message, the life cycle of the data table item is set to be the maximum value; otherwise, the router creates a data table item, the name of the data table item is equal to the name of the response message, the data value is equal to the data value of the response message, and the life cycle is set to be the maximum value;
step 426: the router receiving the response message forwards the response message from the interface identified by the interface ID of the path table entry E1, deletes the path table entry E1, and performs step 420;
step 427: after receiving the response message, the node creates a data table entry, the name of the data table entry is equal to the name of the response message, the data value is equal to the data value of the response message, and the life cycle is set to be the maximum value;
step 428: and (6) ending.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911015522.8A CN110719208B (en) | 2019-10-24 | 2019-10-24 | Method for implementing new generation network based on shortest path |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911015522.8A CN110719208B (en) | 2019-10-24 | 2019-10-24 | Method for implementing new generation network based on shortest path |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110719208A CN110719208A (en) | 2020-01-21 |
| CN110719208B true CN110719208B (en) | 2021-10-01 |
Family
ID=69214175
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911015522.8A Active CN110719208B (en) | 2019-10-24 | 2019-10-24 | Method for implementing new generation network based on shortest path |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110719208B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111711691B (en) * | 2020-06-16 | 2021-10-01 | 常熟理工学院 | Safe intelligent monitoring system implementation method based on Internet of things cloud |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101087240A (en) * | 2006-06-07 | 2007-12-12 | 华为技术有限公司 | Route selection method and device in minimum path priority protocol |
Family Cites Families (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2008095539A1 (en) * | 2007-02-08 | 2008-08-14 | Telefonaktiebolaget Lm Ericsson (Publ) | Network router and method of configuring a network router |
| CN107317890B (en) * | 2017-08-28 | 2019-08-30 | 常熟理工学院 | A kind of data transmission realizing method of intelligent vehicle support grid |
| CN108881021B (en) * | 2018-05-08 | 2020-08-04 | 常熟理工学院 | Efficient and reliable Internet of things implementation method |
| CN109246785B (en) * | 2018-08-13 | 2020-07-28 | 常熟理工学院 | Method for realizing future mobile network |
| CN109462549B (en) * | 2018-10-24 | 2020-11-27 | 常熟理工学院 | Method for implementing new generation wireless mobile network |
| CN110113264B (en) * | 2019-05-14 | 2021-06-22 | 常熟理工学院 | Method for realizing cache and route of named data network |
| CN110138663B (en) * | 2019-05-14 | 2021-01-26 | 常熟理工学院 | Method for implementing new generation network using data as center |
| CN110233889B (en) * | 2019-06-11 | 2021-09-14 | 常熟理工学院 | Network data communication implementation method based on cache mechanism |
-
2019
- 2019-10-24 CN CN201911015522.8A patent/CN110719208B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101087240A (en) * | 2006-06-07 | 2007-12-12 | 华为技术有限公司 | Route selection method and device in minimum path priority protocol |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110719208A (en) | 2020-01-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106792978B (en) | Cloud-based intelligent Internet of vehicles data communication method | |
| CN109257789B (en) | Vehicle-mounted network data communication method based on multi-hop cluster | |
| CN110113264B (en) | Method for realizing cache and route of named data network | |
| CN110138663B (en) | Method for implementing new generation network using data as center | |
| CN106993321B (en) | Network data communication method based on cluster | |
| CN109150723B (en) | Routing communication implementation method of Internet of things | |
| CN109246785B (en) | Method for realizing future mobile network | |
| CN110149274B (en) | Named data network comprehensive routing method based on position information and content push | |
| CN109462549B (en) | Method for implementing new generation wireless mobile network | |
| CN110138658B (en) | Network routing communication method based on cluster | |
| CN109088778B (en) | Data communication implementation method for future mobile network | |
| CN107508927B (en) | Future Internet of vehicles data communication method based on cloud | |
| CN109089241B (en) | Data communication implementation method for vehicle-mounted network | |
| CN110719208B (en) | Method for implementing new generation network based on shortest path | |
| CN111277497B (en) | Method for realizing network service deployment and discovery based on distribution | |
| CN110401911B (en) | Vehicle-mounted cloud implementation method based on named data network | |
| CN111245725B (en) | Future network implementation method based on distribution | |
| CN110233889B (en) | Network data communication implementation method based on cache mechanism | |
| CN110769479B (en) | High-efficiency new-generation wireless network communication method | |
| CN109089293B (en) | Route communication realization method for future mobile network | |
| CN108696838B (en) | Vehicle-mounted data routing method based on position information | |
| CN111416773B (en) | Quick big data network implementation method | |
| CN111050374B (en) | Method for realizing low-delay new-generation information network | |
| CN109039901B (en) | High-efficiency data network routing implementation method | |
| CN108770030B (en) | Data communication method of next generation wireless 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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |