CN107948342B - Big data network implementation method - Google Patents
Big data network implementation method Download PDFInfo
- Publication number
- CN107948342B CN107948342B CN201711274367.2A CN201711274367A CN107948342B CN 107948342 B CN107948342 B CN 107948342B CN 201711274367 A CN201711274367 A CN 201711274367A CN 107948342 B CN107948342 B CN 107948342B
- Authority
- CN
- China
- Prior art keywords
- node
- address
- interface
- neighbor table
- request 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
- H04L61/00—Network arrangements, protocols or services for addressing or naming
- H04L61/50—Address allocation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/74—Address processing for routing
- H04L45/745—Address table lookup; Address filtering
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L61/00—Network arrangements, protocols or services for addressing or naming
- H04L61/50—Address allocation
- H04L61/5092—Address allocation by self-assignment, e.g. picking addresses at random and testing if they are already in use
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
- H04L69/08—Protocols for interworking; Protocol conversion
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Security & Cryptography (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides a big data network implementation method, wherein the network is composed of nodes, each node is configured with X interfaces, X is a positive integer larger than 1, each interface is uniquely identified by an interface ID f, f takes a value of 1-X, and the interface with the interface ID f is abbreviated as interface f; each interface supports a protocol, and each interface of the node is connected with an interface link supporting the same protocol of a neighboring node; each interface of one node is configured with an address, the address is composed of an i-bit abscissa, an i-bit ordinate and a j-bit hardware ID, and i and j are positive integers; each node in the big data network can quickly acquire data through the network implementation method provided by the invention, thereby greatly improving the service performance. The invention can be applied to various fields such as traffic road condition detection and control, agricultural engineering and the like, and has wide application prospect.
Description
Technical Field
The invention relates to an implementation method, in particular to a big data network implementation method.
Background
The communication between nodes in the big data network is realized by forwarding and routing of intermediate nodes, so one of the key technologies to be solved for realizing the big data network is to reduce data transmission delay so as to enable users to quickly acquire network services. With the development of network technology, big data networks will become a mode for providing services in the future.
At present, the implementation mode of the big data network is realized through broadcasting, so that both delay and cost are large, and the network service performance is reduced. Therefore, how to reduce the delay and cost of providing services by a big data network 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 big data network implementation method aiming at the defects of the prior art.
The technical scheme is as follows: the invention discloses a big data network implementation method, wherein the network is composed of nodes, each node is configured with X interfaces, X is a positive integer larger than 1, each interface is uniquely identified by an interface ID f, f takes a value of 1-X, and the interface with the interface ID f is abbreviated as interface f; each interface supports a protocol, such as IEEE 802.11 or IEEE802.3, and each interface of a node is connected to an interface link supporting the same protocol of a neighboring node;
each interface of a node is configured with an address which is composed of an abscissa of i bits, an ordinate of i bits and a hardware ID of j bits, i and j being powers of 2, for example 32;
after a node with X interfaces is started, the following processes are executed to obtain addresses for each interface:
step 101: starting;
step 102: the node sets a variable y1 with an initial value of 1;
step 103: if the variable y1 is greater than X, then go to step 106, otherwise go to step 104;
step 104: the node creates an address, the abscissa of the address is the abscissa of the current geographical position of the node, the ordinate is the ordinate of the current geographical position, the hardware ID is the media access control address (MAC address) of the interface with the interface ID equal to the variable y1, and then the address is marked as the address of the interface with the interface ID equal to the variable y 1;
step 105: the node increments the variable y1 by 1, and executes step 103;
step 106: the node broadcasts a beacon message from each interface periodically, and the source address of the beacon message is the address of the interface which sends the beacon message;
step 107: and (6) ending.
The node can rapidly configure the address through the process so as to correctly and rapidly acquire the data.
In the method, each node stores a neighbor table, and a neighbor table item comprises an interface ID domain, an address domain and a life cycle domain; each node is configured with X interfaces, after the node receives a beacon message from an interface f1 with an interface ID equal to f1, f1 takes values from 1 to X, and the following processes are executed to establish a neighbor table:
step 201: starting;
step 202: the node checks the neighbor table, if a neighbor table entry exists, the hardware ID of the address field of the neighbor table entry is equal to the hardware ID of the source address of the received beacon message, step 204 is executed, otherwise, step 203 is executed;
step 203: the node creates a neighbor table entry, the interface ID domain value of the neighbor table entry is equal to f1, the address domain value is equal to the source address of the received beacon message, the life cycle is set as the maximum life cycle, the value is equal to 1.5T, T is the time interval for continuously sending two beacon messages by the interface f1, and step 205 is executed;
step 204: the node selects a neighbor table entry of which the hardware ID of the address field is equal to the hardware ID of the source address of the received beacon message, updates the address field value of the neighbor table entry into the source address of the received beacon message, and sets the life cycle field value as the maximum life cycle;
step 205: finishing;
if the node detects that the life cycle attenuation of one neighbor table entry is 0, the node deletes the neighbor table entry.
The nodes can quickly establish the neighbor table through the process so as to accurately and quickly acquire data.
In the method of the invention, a node is provided with an X interface, and for each interface, the node maintains a forwarding queue for storing the messages waiting for forwarding;
after a node creates or receives a message, if the bit length of the message is smThen the node calculates the weight of each interface by the following process:
step 301: starting;
step 302: setting a variable z by a node, wherein the initial value of the variable z is 1;
step 303: the node calculates the weight w of the interface z through the formula (1)zIn the formula (1), bzFor the bandwidth of interface z, YzTotal number of all messages in the forwarding queue, s, for interface z[z,q]The length of the qth message in the forwarding queue for interface z;
step 304: the node increments the variable z by 1, if the variable z is larger than X, step 305 is executed, otherwise step 303 is executed;
step 305: and (6) ending.
In the method of the present invention, any node in the network has an X interface, and under the condition that the network physical environment is relatively stable, for example, the packet loss rate is less than 5%, the node S realizes the communication with the node D through the following processes:
step 401: starting;
step 402: the node S checks the neighbor table, if the neighbor table entry of the hardware ID of the address domain equal to the hardware ID of the address of the node D exists, the step 403 is executed, otherwise, the step 404 is executed;
step 403: the node S randomly selects a neighbor table item of which the hardware ID of the address domain is equal to the hardware ID of the address of the node D, creates a request message, the source address of the request message is the address of the interface domain of the selected neighbor table item, the destination address is the address domain value of the selected neighbor table item, and the load is the address of the node D; the node S sends the created request message through the selected interface of the neighbor table entry, and executes step 408;
step 404: the node S creates a request message, the source address of the request message is a random number with the bit length of 2i + j, the destination address is also a random number with the bit length of 2i + j, and the load is a random number with the bit length of 2i + j; the node S checks the X interface of the node S, executes the steps 301-305 to calculate the weight of each interface, selects the interface with the minimum weight and records the interface as an interface f 2; then the node S checks a neighbor table, selects all neighbor table entries with the interface domain value equal to f2, calculates the distance between the coordinates of the address domain of each selected neighbor table entry and the coordinates of the address of the node D, selects the neighbor table entry with the minimum distance, updates the source address of the created request message into the address of the interface f2, updates the destination address into the address domain value of the neighbor table entry with the minimum distance, updates the load into the address of the node D, and sends the updated request message through the interface f 2;
step 405: the node receives the request message through an interface, which is denoted as an interface f3, if a neighbor table entry exists, the hardware ID of the address domain of which is equal to the hardware ID of the address in the load of the received request message, step 406 is executed, otherwise step 407 is executed;
step 406: the node receiving the request message randomly selects a neighbor table entry of which the hardware ID of the address domain is equal to the hardware ID of the address in the load of the received request message, updates the destination address of the received request message to the address domain value of the neighbor table entry, sends the updated request message through the interface of the neighbor table entry, and executes step 408;
step 407: the node receiving the request message checks the X interface of the node, executes the steps 301-305 to calculate the weight of each interface, selects the interface with the minimum weight and records as the interface f 4; then the node receiving the request message checks the neighbor table, selects all neighbor table entries with the interface domain value equal to f4, the node receiving the request message calculates the distance between the coordinate of the address domain of each selected neighbor table entry and the coordinate of the address in the load of the received request message, selects the neighbor table entry with the minimum distance, updates the destination address of the received request message to the address domain value of the neighbor table entry with the minimum distance, sends the updated request message through the interface f4, and executes the step 405;
step 408: the node D checks the neighbor table after receiving the request message; if the hardware ID of the address domain is equal to the neighbor table entry of the hardware ID of the source address of the received request message, executing the step 409, otherwise executing the step 410;
step 409: the node D randomly selects a neighbor table item of which the hardware ID of an address domain is equal to the hardware ID of the source address of the received request message, and creates a response message, wherein the source address of the response message is the address in the load of the received request message, the destination address is the address domain value of the selected neighbor table item, and the load is the source address and the response data of the received request message; the node D sends the created response message through the selected interface of the neighbor table entry, and executes the step 414;
step 410: the node D creates a response message, the source address of the response message is the address in the load of the received request message, the destination address is a random number with the bit length of 2i + j, and the load is the source address and the response data of the received request message; the node D checks the X interface of the node D, executes the steps 301-305 to calculate the weight of each interface, selects the interface with the minimum weight and records the interface as an interface f 5; then the node D checks the neighbor table, selects all neighbor table entries with the interface domain value equal to f5, calculates the distance between the coordinate of the address domain of each selected neighbor table entry and the coordinate of the source address of the received request message, selects the neighbor table entry with the minimum distance, updates the destination address of the created response message to the address domain value of the neighbor table entry with the minimum distance, and sends the updated response message through the interface f 5;
step 411: the node receives the response message through an interface, which is denoted as f6, if there is a neighbor entry whose hardware ID of the address field is equal to the hardware ID of the address in the received response message payload, then step 412 is executed, otherwise step 413 is executed;
step 412: the node receiving the response message randomly selects a neighbor table entry of which the hardware ID of the address domain is equal to the hardware ID of the address in the load of the received response message, updates the destination address of the received response message to the address domain value of the neighbor table entry, sends the updated response message through the interface of the neighbor table entry, and executes step 414;
step 413: the node receiving the response message checks the X interface of the node, executes the steps 301-305 to calculate the weight of each interface, selects the interface with the minimum weight and records as the interface f 7; then the node receiving the response message checks the neighbor table, selects all neighbor table entries whose interface domain values are equal to f7, the node receiving the response message calculates the distance between the coordinate of the address domain of each selected neighbor table entry and the coordinate of the address in the load of the received response message, selects the neighbor table entry with the smallest distance, updates the destination address of the received response message to the address domain value of the neighbor table entry with the smallest distance, sends the updated response message through the interface f7, and executes step 411;
step 414: after receiving the response message, the node S stores the response data in the response message;
step 415: and (6) ending.
The node can acquire data rapidly through the process.
In the method of the present invention, any node in the network has an X interface, and under the condition that the network physical environment is unstable, for example, the packet loss rate is greater than 5%, the node S realizes communication with the node D through the following processes:
step 501: starting;
step 502: the node S creates a random number r and checks a neighbor table, if a neighbor table entry with the hardware ID of the address domain equal to the hardware ID of the address of the node D exists, step 503 is executed, otherwise step 504 is executed;
step 503: the node S selects neighbor table entries of which the hardware IDs of all address fields are equal to the hardware ID of the address of the node D, and for each selected neighbor table entry, the node S executes the following operations: the node S creates a request message, the source address of the request message is the address of the interface domain of the selected neighbor table entry, the destination address is the address domain value of the selected neighbor table entry, the load is the random number r and the address of the node D, the node S sends the created request message through the interface of the neighbor table entry, and the step 510 is executed;
step 505: after the node receives the request message through the interface n3, if the node has received a request message and the source address, the destination address and the load of the request message are the same as those of the received request message, execute step 506, otherwise execute step 507;
step 506: the node receiving the request message discards the request message, and performs step 510;
step 507: the node receiving the request message judges whether a neighbor table entry of the hardware ID of the address domain equal to the hardware ID of the address in the load of the received request message exists, if not, step 508 is executed, otherwise, step 509 is executed;
step 508: the node receiving the request message selects neighbor table entries of which the hardware IDs of all address domains are equal to the hardware ID of the address in the load of the received request message, and for each selected neighbor table entry, the node executes the following operations: updating the destination address of the received request message to the address field value of the neighbor table entry, sending the updated request message through the interface of the neighbor table entry, and executing step 510;
step 509, the node receiving the request message checks the X interface of the node and executes the steps 301 to 305 to calculate the weight of each interface, selects the interface with the minimum weight and marks as an interface n4, then the node receiving the request message checks the neighbor table, selects all neighbor table items with the interface domain value equal to n4, and executes the following operations on the node receiving the request message for each selected neighbor table item, namely calculating the distance L1 between the coordinates of the address domain of the neighbor table item and the coordinates of the address in the received request message load, if the distance L1 is smaller than the distance between the node receiving the request message and the coordinates of the address in the received request message load, updating the destination address of the received request message to the address domain value of the neighbor table item, sending the updated request message through the interface n4, and executing the step 505;
step 510: after receiving the request message, the node D increases the value of a random number r in the load of the request message by 1; if the node D has received a request message, the source address, the destination address and the load of the request message are the same as those of the received request message, execute step 511, otherwise execute step 512;
step 511: the node D discards the received request message, and performs step 520;
step 512: the node D checks the neighbor table to judge whether a neighbor table entry with the hardware ID of the address domain equal to the hardware ID of the source address of the received request message exists, if so, the step 513 is executed, otherwise, the step 514 is executed;
step 513: the node D selects neighbor table entries of which the hardware IDs of all address domains are equal to the hardware ID of the source address of the received request message, and for each selected neighbor table entry, the node D executes the following operations: creating a response message, wherein the source address of the response message is the address in the load of the received request message, the destination address is the address field value of the neighbor table entry, the load is the random number r, the source address of the received request message and the response data, the node D sends the created response message through the interface of the neighbor table entry, and the step 520 is executed;
step 515: the node receives the response message through an interface, which is denoted as n6, if the node has received a response message, and the source address, destination address and load of the response message are the same as those of the received response message, step 516 is executed, otherwise step 517 is executed;
step 516: the node receiving the response message discards the response message, and performs step 520;
517: the node receiving the response message checks the neighbor table, if the hardware ID of the address field is equal to the neighbor table entry of the hardware ID of the address in the load of the received response message, the step 518 is executed, otherwise, the step 519 is executed;
step 518: the node receiving the response message selects the neighbor table entries of which the hardware IDs of all address domains are equal to the hardware ID of the address in the load of the received response message, and for each selected neighbor table entry, the node executes the following operations: updating the destination address of the received response message to the address field value of the neighbor table entry, sending the updated response message through the interface of the neighbor table entry, and executing step 520;
step 519, the node receiving the response message checks the X interface of the node and executes the steps 301-305 to calculate the weight of each interface, the interface with the minimum weight is selected and is marked as an interface n7, then the node receiving the response message checks a neighbor table, all neighbor table items with the interface domain value equal to n7 are selected, and for each selected neighbor table item, the node receiving the response message executes the following operations of calculating the distance between the coordinate of the address domain of the neighbor table item and the coordinate of the address in the received response message load L3, if the distance L3 is smaller than the distance between the coordinate of the node receiving the response message and the coordinate of the address in the received response message load, updating the destination address of the received response message to the address domain value of the neighbor table item, sending the updated response message through the interface n7, and executing step 515;
step 520: the node S receives the response message, if the node S has received a response message, and the source address, the destination address and the load of the response message are the same as those of the received response message, the step 521 is executed, otherwise, the step 522 is executed;
step 521: the node S discards the received response message, and performs step 523;
step 522: the node S stores the response data in the response message;
step 523: and (6) ending.
The node can acquire data rapidly through the process.
Has the advantages that: the invention provides a big data network implementation method, and each node in the big data network can rapidly acquire data through the network implementation method provided by the invention, so that the service performance is greatly improved. The invention can be applied to various fields such as traffic road condition detection and control, agricultural engineering 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 view of an address configuration process according to the present invention.
Fig. 2 is a schematic diagram of a process for establishing a neighbor table according to the present invention.
FIG. 3 is a flow chart illustrating a process of calculating a weight according to the present invention.
Fig. 4 is a schematic diagram of a data communication flow under a stable environment condition according to the present invention.
Fig. 5 is a schematic diagram of a data communication flow under the unstable environment condition according to the present invention.
The specific implementation mode is as follows:
the invention provides a big data network implementation method, and each node in the big data network can rapidly acquire data through the network implementation method provided by the invention, so that the service performance is greatly improved. The invention can be applied to various fields such as traffic road condition detection and control, agricultural engineering and the like, and has wide application prospect.
Fig. 1 is a schematic view of an address configuration process according to the present invention. The network is composed of nodes, each node is provided with X interfaces, X is a positive integer larger than 1, each interface is uniquely identified by an interface ID f, f takes a value of 1-X, and the interface with the interface ID f is abbreviated as the interface f; each interface supports a protocol, such as IEEE 802.11 or IEEE802.3, and each interface of a node is connected to an interface link supporting the same protocol of a neighboring node;
each interface of a node is configured with an address, the address is composed of an abscissa of i bits, an ordinate of i bits and a hardware ID of j bits, i and j are positive integers, i and j are powers of 2, such as 32;
after a node with X interfaces is started, the following processes are executed to obtain addresses for each interface:
step 101: starting;
step 102: the node sets a variable y1 with an initial value of 1;
step 103: if the variable y1 is greater than X, then go to step 106, otherwise go to step 104;
step 104: the node creates an address, the abscissa of the address is the abscissa of the current geographical position of the node, the ordinate is the ordinate of the current geographical position, the hardware ID is the media access control address (MAC address) of the interface with the interface ID equal to the variable y1, and then the address is marked as the address of the interface with the interface ID equal to the variable y 1;
step 105: the node increments the variable y1 by 1, and executes step 103;
step 106: the node broadcasts a beacon message from each interface periodically, and the source address of the beacon message is the address of the interface which sends the beacon message;
step 107: and (6) ending.
Fig. 2 is a schematic diagram of a process for establishing a neighbor table according to the present invention. Each node stores a neighbor table, and one neighbor table item comprises an interface ID domain, an address domain and a life cycle domain; each node is configured with X interfaces, after the node receives a beacon message from an interface f1 with an interface ID equal to f1, f1 takes values from 1 to X, and the following processes are executed to establish a neighbor table:
step 201: starting;
step 202: the node checks the neighbor table, if a neighbor table entry exists, the hardware ID of the address field of the neighbor table entry is equal to the hardware ID of the source address of the received beacon message, step 204 is executed, otherwise, step 203 is executed;
step 203: the node creates a neighbor table entry, the interface ID domain value of the neighbor table entry is equal to f1, the address domain value is equal to the source address of the received beacon message, the life cycle is set as the maximum life cycle, the value is equal to 1.5T, T is the time interval for continuously sending two beacon messages by the interface f1, and step 205 is executed;
step 204: the node selects a neighbor table entry of which the hardware ID of the address field is equal to the hardware ID of the source address of the received beacon message, updates the address field value of the neighbor table entry into the source address of the received beacon message, and sets the life cycle field value as the maximum life cycle;
step 205: finishing;
if the node detects that the life cycle attenuation of one neighbor table entry is 0, the node deletes the neighbor table entry.
FIG. 3 is a flow chart illustrating a process of calculating a weight according to the present invention. A node has X interfaces, and for each interface, the node maintains a forwarding queue for storing messages waiting to be forwarded;
after a node creates or receives a message, if the bit length of the message is smThen the node calculates the weight of each interface by the following process:
step 301: starting;
step 302: setting a variable z by a node, wherein the initial value of the variable z is 1;
step 303: the node calculates the weight w of the interface z through the formula (1)zIn the formula (1), bzFor the bandwidth of interface z, YzTotal number of all messages in the forwarding queue, s, for interface z[z,q]The length of the qth message in the forwarding queue for interface z;
step 304: the node increments the variable z by 1, if the variable z is larger than X, step 305 is executed, otherwise step 303 is executed;
step 305: and (6) ending.
Fig. 4 is a schematic diagram of a data communication flow under a stable environment condition according to the present invention. Any node in the network has an X interface, and under the condition that the network physical environment is relatively stable, for example, the packet loss rate is less than 5%, the node S realizes communication with the node D through the following processes:
step 401: starting;
step 402: the node S checks the neighbor table, if the neighbor table entry of the hardware ID of the address domain equal to the hardware ID of the address of the node D exists, the step 403 is executed, otherwise, the step 404 is executed;
step 403: the node S randomly selects a neighbor table item of which the hardware ID of the address domain is equal to the hardware ID of the address of the node D, creates a request message, the source address of the request message is the address of the interface domain of the selected neighbor table item, the destination address is the address domain value of the selected neighbor table item, and the load is the address of the node D; the node S sends the created request message through the selected interface of the neighbor table entry, and executes step 408;
step 404: the node S creates a request message, the source address of the request message is a random number with the bit length of 2i + j, the destination address is also a random number with the bit length of 2i + j, and the load is a random number with the bit length of 2i + j; the node S checks the X interface of the node S, executes the steps 301-305 to calculate the weight of each interface, selects the interface with the minimum weight and records the interface as an interface f 2; then the node S checks a neighbor table, selects all neighbor table entries with the interface domain value equal to f2, calculates the distance between the coordinates of the address domain of each selected neighbor table entry and the coordinates of the address of the node D, selects the neighbor table entry with the minimum distance, updates the source address of the created request message into the address of the interface f2, updates the destination address into the address domain value of the neighbor table entry with the minimum distance, updates the load into the address of the node D, and sends the updated request message through the interface f 2;
step 405: the node receives the request message through an interface, which is denoted as an interface f3, if a neighbor table entry exists, the hardware ID of the address domain of which is equal to the hardware ID of the address in the load of the received request message, step 406 is executed, otherwise step 407 is executed;
step 406: the node receiving the request message randomly selects a neighbor table entry of which the hardware ID of the address domain is equal to the hardware ID of the address in the load of the received request message, updates the destination address of the received request message to the address domain value of the neighbor table entry, sends the updated request message through the interface of the neighbor table entry, and executes step 408;
step 407: the node receiving the request message checks the X interface of the node, executes the steps 301-305 to calculate the weight of each interface, selects the interface with the minimum weight and records as the interface f 4; then the node receiving the request message checks the neighbor table, selects all neighbor table entries with the interface domain value equal to f4, the node receiving the request message calculates the distance between the coordinate of the address domain of each selected neighbor table entry and the coordinate of the address in the load of the received request message, selects the neighbor table entry with the minimum distance, updates the destination address of the received request message to the address domain value of the neighbor table entry with the minimum distance, sends the updated request message through the interface f4, and executes the step 405;
step 408: the node D checks the neighbor table after receiving the request message; if the hardware ID of the address domain is equal to the neighbor table entry of the hardware ID of the source address of the received request message, executing the step 409, otherwise executing the step 410;
step 409: the node D randomly selects a neighbor table item of which the hardware ID of an address domain is equal to the hardware ID of the source address of the received request message, and creates a response message, wherein the source address of the response message is the address in the load of the received request message, the destination address is the address domain value of the selected neighbor table item, and the load is the source address and the response data of the received request message; the node D sends the created response message through the selected interface of the neighbor table entry, and executes the step 414;
step 410: the node D creates a response message, the source address of the response message is the address in the load of the received request message, the destination address is a random number with the bit length of 2i + j, and the load is the source address and the response data of the received request message; the node D checks the X interface of the node D, executes the steps 301-305 to calculate the weight of each interface, selects the interface with the minimum weight and records the interface as an interface f 5; then the node D checks the neighbor table, selects all neighbor table entries with the interface domain value equal to f5, calculates the distance between the coordinate of the address domain of each selected neighbor table entry and the coordinate of the source address of the received request message, selects the neighbor table entry with the minimum distance, updates the destination address of the created response message to the address domain value of the neighbor table entry with the minimum distance, and sends the updated response message through the interface f 5;
step 411: the node receives the response message through an interface, which is denoted as f6, if there is a neighbor entry whose hardware ID of the address field is equal to the hardware ID of the address in the received response message payload, then step 412 is executed, otherwise step 413 is executed;
step 412: the node receiving the response message randomly selects a neighbor table entry of which the hardware ID of the address domain is equal to the hardware ID of the address in the load of the received response message, updates the destination address of the received response message to the address domain value of the neighbor table entry, sends the updated response message through the interface of the neighbor table entry, and executes step 414;
step 413: the node receiving the response message checks the X interface of the node, executes the steps 301-305 to calculate the weight of each interface, selects the interface with the minimum weight and records as the interface f 7; then the node receiving the response message checks the neighbor table, selects all neighbor table entries whose interface domain values are equal to f7, the node receiving the response message calculates the distance between the coordinate of the address domain of each selected neighbor table entry and the coordinate of the address in the load of the received response message, selects the neighbor table entry with the smallest distance, updates the destination address of the received response message to the address domain value of the neighbor table entry with the smallest distance, sends the updated response message through the interface f7, and executes step 411;
step 414: after receiving the response message, the node S stores the response data in the response message;
step 415: and (6) ending.
Fig. 5 is a schematic diagram of a data communication flow under the unstable environment condition according to the present invention. Any node in the network has an X interface, and when the physical environment of the network is unstable, for example, the packet loss rate is greater than 5%, the node S communicates with the node D through the following process:
step 501: starting;
step 502: the node S creates a random number r and checks a neighbor table, if a neighbor table entry with the hardware ID of the address domain equal to the hardware ID of the address of the node D exists, step 503 is executed, otherwise step 504 is executed;
step 503: the node S selects neighbor table entries of which the hardware IDs of all address fields are equal to the hardware ID of the address of the node D, and for each selected neighbor table entry, the node S executes the following operations: the node S creates a request message, the source address of the request message is the address of the interface domain of the selected neighbor table entry, the destination address is the address domain value of the selected neighbor table entry, the load is the random number r and the address of the node D, the node S sends the created request message through the interface of the neighbor table entry, and the step 510 is executed;
step 504, a node S creates a request message, the source address of the request message is a random number with the bit length of 2i + j, the destination address is also a random number with the bit length of 2i + j, the load is a random number r and a random number with the bit length of 2i + j, the node S looks up the X interface of the node S and executes the steps 301-305 to calculate the weight value of each interface, an interface n2 with the minimum weight value is selected, then the node S looks up a neighbor table, all the interface domain values are equal to n2, for each selected neighbor table, the node S executes the following operations that the node S calculates the distance L between the coordinates of the address domain of the neighbor table and the coordinates of the address of the node D, if the distance L is smaller than the distance between the node S and the node D, the node S updates the source address of the created request message to the address of the interface n2, the destination address domain value of the neighbor table is updated by the destination address, the load is updated to the random number r and the address of the node D, and the node S sends the updated request message through the interface n 2;
step 505: after the node receives the request message through the interface n3, if the node has received a request message and the source address, the destination address and the load of the request message are the same as those of the received request message, execute step 506, otherwise execute step 507;
step 506: the node receiving the request message discards the request message, and performs step 510;
step 507: the node receiving the request message judges whether a neighbor table entry of the hardware ID of the address domain equal to the hardware ID of the address in the load of the received request message exists, if not, step 508 is executed, otherwise, step 509 is executed;
step 508: the node receiving the request message selects neighbor table entries of which the hardware IDs of all address domains are equal to the hardware ID of the address in the load of the received request message, and for each selected neighbor table entry, the node executes the following operations: updating the destination address of the received request message to the address field value of the neighbor table entry, sending the updated request message through the interface of the neighbor table entry, and executing step 510;
step 509, the node receiving the request message checks the X interface of the node and executes the steps 301 to 305 to calculate the weight of each interface, selects the interface with the minimum weight and marks as an interface n4, then the node receiving the request message checks the neighbor table, selects all neighbor table items with the interface domain value equal to n4, and executes the following operations on the node receiving the request message for each selected neighbor table item, namely calculating the distance L1 between the coordinates of the address domain of the neighbor table item and the coordinates of the address in the received request message load, if the distance L1 is smaller than the distance between the node receiving the request message and the coordinates of the address in the received request message load, updating the destination address of the received request message to the address domain value of the neighbor table item, sending the updated request message through the interface n4, and executing the step 505;
step 510: after receiving the request message, the node D increases the value of a random number r in the load of the request message by 1; if the node D has received a request message, the source address, the destination address and the load of the request message are the same as those of the received request message, execute step 511, otherwise execute step 512;
step 511: the node D discards the received request message, and performs step 520;
step 512: the node D checks the neighbor table to judge whether a neighbor table entry with the hardware ID of the address domain equal to the hardware ID of the source address of the received request message exists, if so, the step 513 is executed, otherwise, the step 514 is executed;
step 513: the node D selects neighbor table entries of which the hardware IDs of all address domains are equal to the hardware ID of the source address of the received request message, and for each selected neighbor table entry, the node D executes the following operations: creating a response message, wherein the source address of the response message is the address in the load of the received request message, the destination address is the address field value of the neighbor table entry, the load is the random number r, the source address of the received request message and the response data, the node D sends the created response message through the interface of the neighbor table entry, and the step 520 is executed;
step 515: the node receives the response message through an interface, which is denoted as n6, if the node has received a response message, and the source address, destination address and load of the response message are the same as those of the received response message, step 516 is executed, otherwise step 517 is executed;
step 516: the node receiving the response message discards the response message, and performs step 520;
517: the node receiving the response message checks the neighbor table, if the hardware ID of the address field is equal to the neighbor table entry of the hardware ID of the address in the load of the received response message, the step 518 is executed, otherwise, the step 519 is executed;
step 518: the node receiving the response message selects the neighbor table entries of which the hardware IDs of all address domains are equal to the hardware ID of the address in the load of the received response message, and for each selected neighbor table entry, the node executes the following operations: updating the destination address of the received response message to the address field value of the neighbor table entry, sending the updated response message through the interface of the neighbor table entry, and executing step 520;
step 519, the node receiving the response message checks the X interface of the node and executes the steps 301-305 to calculate the weight of each interface, the interface with the minimum weight is selected and is marked as an interface n7, then the node receiving the response message checks a neighbor table, all neighbor table items with the interface domain value equal to n7 are selected, and for each selected neighbor table item, the node receiving the response message executes the following operations of calculating the distance between the coordinate of the address domain of the neighbor table item and the coordinate of the address in the received response message load L3, if the distance L3 is smaller than the distance between the coordinate of the node receiving the response message and the coordinate of the address in the received response message load, updating the destination address of the received response message to the address domain value of the neighbor table item, sending the updated response message through the interface n7, and executing step 515;
step 520: the node S receives the response message, if the node S has received a response message, and the source address, the destination address and the load of the response message are the same as those of the received response message, the step 521 is executed, otherwise, the step 522 is executed;
step 521: the node S discards the received response message, and performs step 523;
step 522: the node S stores the response data in the response message;
step 523: and (6) ending.
Example 1
Based on the simulation parameters in table 1, the present embodiment simulates the big data network implementation method in the present invention, and the performance analysis is as follows: when the number of interfaces increases, the delay of data transmission decreases, and when the number of interfaces decreases, the delay of data transmission increases, and the average delay of data acquisition is 1.2 s.
TABLE 1 simulation parameters
The present invention provides a method for implementing a big data network, and a plurality of methods and approaches for implementing the technical solution, and the above description is only a preferred embodiment of the present invention, and it should be noted that, for those skilled in the art, a plurality of modifications and decorations can be made without departing from the principle of the present invention, and these modifications and decorations 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 big data network implementation method is characterized in that the network is composed of nodes, each node is configured with X interfaces, X is a positive integer larger than 1, each interface is uniquely identified by an interface ID f, f takes a value of 1-X, and the interface with the interface ID f is abbreviated as the interface f; each interface supports a protocol, and each interface of the node is connected with an interface link supporting the same protocol of a neighboring node;
each interface of one node is configured with an address, the address is composed of an i-bit abscissa, an i-bit ordinate and a j-bit hardware ID, and i and j are positive integers;
after a node with X interfaces is started, the following processes are executed to obtain addresses for each interface:
step 101: starting;
step 102: the node sets a variable y1 with an initial value of 1;
step 103: if the variable y1 is greater than X, then go to step 106, otherwise go to step 104;
step 104: the node creates an address, the abscissa of the address is the abscissa of the current geographical position of the node, the ordinate is the ordinate of the current geographical position, the hardware ID is the media access control address (MAC address) of the interface with the interface ID equal to the variable y1, and then the address is marked as the address of the interface with the interface ID equal to the variable y 1;
step 105: the node increments the variable y1 by 1, and executes step 103;
step 106: the node broadcasts a beacon message from each interface periodically, and the source address of the beacon message is the address of the interface which sends the beacon message;
step 107: finishing;
each node stores a neighbor table, and one neighbor table item comprises an interface ID domain, an address domain and a life cycle domain; each node is configured with X interfaces, after the node receives a beacon message from an interface f1 with an interface ID equal to f1, f1 takes values from 1 to X, and the following processes are executed to establish a neighbor table:
step 201: starting;
step 202: the node checks the neighbor table, if a neighbor table entry exists, the hardware ID of the address field of the neighbor table entry is equal to the hardware ID of the source address of the received beacon message, step 204 is executed, otherwise, step 203 is executed;
step 203: the node creates a neighbor table entry, the interface ID domain value of the neighbor table entry is equal to f1, the address domain value is equal to the source address of the received beacon message, the life cycle is set as the maximum life cycle, the value is equal to 1.5T, T is the time interval for continuously sending two beacon messages by the interface f1, and step 205 is executed;
step 204: the node selects a neighbor table entry of which the hardware ID of the address field is equal to the hardware ID of the source address of the received beacon message, updates the address field value of the neighbor table entry into the source address of the received beacon message, and sets the life cycle field value as the maximum life cycle;
step 205: finishing;
if the node detects that the life cycle attenuation of one neighbor table entry is 0, the node deletes the neighbor table entry;
a node has X interfaces, and for each interface, the node maintains a forwarding queue for storing messages waiting to be forwarded;
after a node creates or receives a message, if the bit length of the message is smThen the node calculates the weight of each interface by the following process:
step 301: starting;
step 302: setting a variable z by a node, wherein the initial value of the variable z is 1;
step 303: the node calculates the weight w of the interface z through the formula (1)zIn the formula (1), bzFor the bandwidth of interface z, YzTotal number of all messages in the forwarding queue, s, for interface z[z,q]The length of the qth message in the forwarding queue for interface z;
step 304: the node increments the variable z by 1, if the variable z is larger than X, step 305 is executed, otherwise step 303 is executed;
step 305: finishing;
any node in the network has an X interface, and under the condition that the physical environment of the network is relatively stable, the node S realizes the communication with the node D through the following processes:
step 401: starting;
step 402: the node S checks the neighbor table, if the neighbor table entry of the hardware ID of the address domain equal to the hardware ID of the address of the node D exists, the step 403 is executed, otherwise, the step 404 is executed;
step 403: the node S randomly selects a neighbor table item of which the hardware ID of the address domain is equal to the hardware ID of the address of the node D, creates a request message, the source address of the request message is the address of the interface domain of the selected neighbor table item, the destination address is the address domain value of the selected neighbor table item, and the load is the address of the node D; the node S sends the created request message through the selected interface of the neighbor table entry, and executes step 408;
step 404: the node S creates a request message, the source address of the request message is a random number with the bit length of 2i + j, the destination address is also a random number with the bit length of 2i + j, and the load is a random number with the bit length of 2i + j; the node S checks the X interface of the node S, executes the steps 301-305 to calculate the weight of each interface, selects the interface with the minimum weight and records the interface as an interface f 2; then the node S checks a neighbor table, selects all neighbor table entries with the interface domain value equal to f2, calculates the distance between the coordinates of the address domain of each selected neighbor table entry and the coordinates of the address of the node D, selects the neighbor table entry with the minimum distance, updates the source address of the created request message into the address of the interface f2, updates the destination address into the address domain value of the neighbor table entry with the minimum distance, updates the load into the address of the node D, and sends the updated request message through the interface f 2;
step 405: the node receives the request message through an interface, which is denoted as an interface f3, if a neighbor table entry exists, the hardware ID of the address domain of which is equal to the hardware ID of the address in the load of the received request message, step 406 is executed, otherwise step 407 is executed;
step 406: the node receiving the request message randomly selects a neighbor table entry of which the hardware ID of the address domain is equal to the hardware ID of the address in the load of the received request message, updates the destination address of the received request message to the address domain value of the neighbor table entry, sends the updated request message through the interface of the neighbor table entry, and executes step 408;
step 407: the node receiving the request message checks the X interface of the node, executes the steps 301-305 to calculate the weight of each interface, selects the interface with the minimum weight and records as the interface f 4; then the node receiving the request message checks the neighbor table, selects all neighbor table entries with the interface domain value equal to f4, the node receiving the request message calculates the distance between the coordinate of the address domain of each selected neighbor table entry and the coordinate of the address in the load of the received request message, selects the neighbor table entry with the minimum distance, updates the destination address of the received request message to the address domain value of the neighbor table entry with the minimum distance, sends the updated request message through the interface f4, and executes the step 405;
step 408: the node D checks the neighbor table after receiving the request message; if the hardware ID of the address domain is equal to the neighbor table entry of the hardware ID of the source address of the received request message, executing the step 409, otherwise executing the step 410;
step 409: the node D randomly selects a neighbor table item of which the hardware ID of an address domain is equal to the hardware ID of the source address of the received request message, and creates a response message, wherein the source address of the response message is the address in the load of the received request message, the destination address is the address domain value of the selected neighbor table item, and the load is the source address and the response data of the received request message; the node D sends the created response message through the selected interface of the neighbor table entry, and executes the step 414;
step 410: the node D creates a response message, the source address of the response message is the address in the load of the received request message, the destination address is a random number with the bit length of 2i + j, and the load is the source address and the response data of the received request message; the node D checks the X interface of the node D, executes the steps 301-305 to calculate the weight of each interface, selects the interface with the minimum weight and records the interface as an interface f 5; then the node D checks the neighbor table, selects all neighbor table entries with the interface domain value equal to f5, calculates the distance between the coordinate of the address domain of each selected neighbor table entry and the coordinate of the source address of the received request message, selects the neighbor table entry with the minimum distance, updates the destination address of the created response message to the address domain value of the neighbor table entry with the minimum distance, and sends the updated response message through the interface f 5;
step 411: the node receives the response message through an interface, which is denoted as f6, if there is a neighbor entry whose hardware ID of the address field is equal to the hardware ID of the address in the received response message payload, then step 412 is executed, otherwise step 413 is executed;
step 412: the node receiving the response message randomly selects a neighbor table entry of which the hardware ID of the address domain is equal to the hardware ID of the address in the load of the received response message, updates the destination address of the received response message to the address domain value of the neighbor table entry, sends the updated response message through the interface of the neighbor table entry, and executes step 414;
step 413: the node receiving the response message checks the X interface of the node, executes the steps 301-305 to calculate the weight of each interface, selects the interface with the minimum weight and records as the interface f 7; then the node receiving the response message checks the neighbor table, selects all neighbor table entries whose interface domain values are equal to f7, the node receiving the response message calculates the distance between the coordinate of the address domain of each selected neighbor table entry and the coordinate of the address in the load of the received response message, selects the neighbor table entry with the smallest distance, updates the destination address of the received response message to the address domain value of the neighbor table entry with the smallest distance, sends the updated response message through the interface f7, and executes step 411;
step 414: after receiving the response message, the node S stores the response data in the response message;
step 415: and (6) ending.
2. The big data network implementation method of claim 1,
any node in the network has an X interface, and under the condition that the physical environment of the network is unstable, the node S realizes the communication with the node D through the following processes:
step 501: starting;
step 502: the node S creates a random number r and checks a neighbor table, if a neighbor table entry with the hardware ID of the address domain equal to the hardware ID of the address of the node D exists, step 503 is executed, otherwise step 504 is executed;
step 503: the node S selects neighbor table entries of which the hardware IDs of all address fields are equal to the hardware ID of the address of the node D, and for each selected neighbor table entry, the node S executes the following operations: the node S creates a request message, the source address of the request message is the address of the interface domain of the selected neighbor table entry, the destination address is the address domain value of the selected neighbor table entry, the load is the random number r and the address of the node D, the node S sends the created request message through the interface of the neighbor table entry, and the step 510 is executed;
step 504, a node S creates a request message, the source address of the request message is a random number with the bit length of 2i + j, the destination address is also a random number with the bit length of 2i + j, the load is a random number r and a random number with the bit length of 2i + j, the node S looks up the X interface of the node S and executes the steps 301-305 to calculate the weight value of each interface, an interface n2 with the minimum weight value is selected, then the node S looks up a neighbor table, all neighbor table items with the interface domain value equal to n2 are selected, for each selected neighbor table item, the node S executes the following operations that the node S calculates the distance L between the coordinates of the address domain of the neighbor table item and the coordinates of the address of the node D, if the distance L is smaller than the distance between the node S and the node D, the source address of the created request message is updated to the address of the interface n2, the destination address is updated to the address domain value of the neighbor table item, the load is updated to the random number r and the address of the node D, and the node S sends the updated request message through the interface;
step 505: after the node receives the request message through the interface n3, if the node has received a request message and the source address, the destination address and the load of the request message are the same as those of the received request message, execute step 506, otherwise execute step 507;
step 506: the node receiving the request message discards the request message, and performs step 510;
step 507: the node receiving the request message judges whether a neighbor table entry of the hardware ID of the address domain equal to the hardware ID of the address in the load of the received request message exists, if so, step 508 is executed, otherwise, step 509 is executed;
step 508: the node receiving the request message selects neighbor table entries of which the hardware IDs of all address domains are equal to the hardware ID of the address in the load of the received request message, and for each selected neighbor table entry, the node executes the following operations: updating the destination address of the received request message to the address field value of the neighbor table entry, sending the updated request message through the interface of the neighbor table entry, and executing step 510;
step 509, the node receiving the request message checks the X interface of the node and executes the steps 301 to 305 to calculate the weight of each interface, selects the interface with the minimum weight and marks as an interface n4, then the node receiving the request message checks the neighbor table, selects all neighbor table items with the interface domain value equal to n4, and executes the following operations on the node receiving the request message for each selected neighbor table item, namely calculating the distance L1 between the coordinates of the address domain of the neighbor table item and the coordinates of the address in the received request message load, if the distance L1 is smaller than the distance between the node receiving the request message and the coordinates of the address in the received request message load, updating the destination address of the received request message to the address domain value of the neighbor table item, sending the updated request message through the interface n4, and executing the step 505;
step 510: after receiving the request message, the node D increases the value of a random number r in the load of the request message by 1; if the node D has received a request message, the source address, the destination address and the load of the request message are the same as those of the received request message, execute step 511, otherwise execute step 512;
step 511: the node D discards the received request message, and performs step 520;
step 512: the node D checks the neighbor table to judge whether a neighbor table entry with the hardware ID of the address domain equal to the hardware ID of the source address of the received request message exists, if so, the step 513 is executed, otherwise, the step 514 is executed;
step 513: the node D selects neighbor table entries of which the hardware IDs of all address domains are equal to the hardware ID of the source address of the received request message, and for each selected neighbor table entry, the node D executes the following operations: creating a response message, wherein the source address of the response message is the address in the load of the received request message, the destination address is the address field value of the neighbor table entry, the load is the random number r, the source address of the received request message and the response data, the node D sends the created response message through the interface of the neighbor table entry, and the step 520 is executed;
step 514, the node D creates a response message, the source address of the response message is the address in the load of the received request message, the destination address is a random number with the bit length of 2i + j, the load is a random number r, the source address of the received request message and response data, the node D checks the X interface of the node D and executes the steps 301-305 to calculate the weight of each interface, selects the interface with the minimum weight and marks as an interface n5, then the node D checks a neighbor table, selects all neighbor table items with the interface domain value equal to n5, and executes the following operations for each selected neighbor table item, namely calculating the distance L2 between the coordinate of the address domain of the neighbor table item and the coordinate of the source address of the received request message, if the distance L2 is smaller than the distance between the node D and the coordinate of the source address of the received request message, the node D updates the destination address of the created response message to the address domain value of the neighbor table item, and sends the updated response message through the interface n 5;
step 515: the node receives the response message through an interface, which is denoted as n6, if the node has received a response message, and the source address, the destination address and the load of the response message are the same as those of the received response message, step 516 is executed, otherwise step 517 is executed;
step 516: the node receiving the response message discards the response message, and performs step 520;
517: the node receiving the response message checks the neighbor table, if the hardware ID of the address field is equal to the neighbor table entry of the hardware ID of the address in the load of the received response message, the step 518 is executed, otherwise, the step 519 is executed;
step 518: the node receiving the response message selects the neighbor table entries of which the hardware IDs of all address domains are equal to the hardware ID of the address in the load of the received response message, and for each selected neighbor table entry, the node executes the following operations: updating the destination address of the received response message to the address field value of the neighbor table entry, sending the updated response message through the interface of the neighbor table entry, and executing step 520;
step 519, the node receiving the response message checks the X interface of the node and executes the steps 301-305 to calculate the weight of each interface, the interface with the minimum weight is selected and is marked as an interface n7, then the node receiving the response message checks a neighbor table, all neighbor table items with the interface domain value equal to n7 are selected, and for each selected neighbor table item, the node receiving the response message executes the following operations of calculating the distance between the coordinate of the address domain of the neighbor table item and the coordinate of the address in the received response message load L3, if the distance L3 is smaller than the distance between the coordinate of the node receiving the response message and the coordinate of the address in the received response message load, updating the destination address of the received response message to the address domain value of the neighbor table item, sending the updated response message through the interface n7, and executing step 515;
step 520: the node S receives the response message, if the node S has received a response message, the source address, the destination address and the load of the response message are the same as those of the received response message, step 521 is executed, otherwise step 522 is executed;
step 521: the node S discards the received response message, and performs step 523;
step 522: the node S stores the response data in the response message;
step 523: and (6) ending.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711274367.2A CN107948342B (en) | 2017-12-06 | 2017-12-06 | Big data network implementation method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711274367.2A CN107948342B (en) | 2017-12-06 | 2017-12-06 | Big data network implementation method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107948342A CN107948342A (en) | 2018-04-20 |
| CN107948342B true CN107948342B (en) | 2020-07-31 |
Family
ID=61944938
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711274367.2A Active CN107948342B (en) | 2017-12-06 | 2017-12-06 | Big data network implementation method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107948342B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108882144B (en) * | 2018-05-30 | 2020-07-31 | 常熟理工学院 | Internet of things construction method |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102694689A (en) * | 2012-06-06 | 2012-09-26 | 杭州华三通信技术有限公司 | Method and device for discovering network topology |
| CN103001788A (en) * | 2011-09-19 | 2013-03-27 | 盛科网络（苏州）有限公司 | Method and system for implementing automatic configuration and installation of network equipment |
| CN103281674A (en) * | 2013-06-25 | 2013-09-04 | 常熟理工学院 | Method for configuring wireless sensor network address based on locating information |
| CN106101009A (en) * | 2016-06-24 | 2016-11-09 | 杭州华三通信技术有限公司 | The electoral machinery of a kind of Protocol Independent Multicast PIM and device |
-
2017
- 2017-12-06 CN CN201711274367.2A patent/CN107948342B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103001788A (en) * | 2011-09-19 | 2013-03-27 | 盛科网络（苏州）有限公司 | Method and system for implementing automatic configuration and installation of network equipment |
| CN102694689A (en) * | 2012-06-06 | 2012-09-26 | 杭州华三通信技术有限公司 | Method and device for discovering network topology |
| CN103281674A (en) * | 2013-06-25 | 2013-09-04 | 常熟理工学院 | Method for configuring wireless sensor network address based on locating information |
| CN106101009A (en) * | 2016-06-24 | 2016-11-09 | 杭州华三通信技术有限公司 | The electoral machinery of a kind of Protocol Independent Multicast PIM and device |
Non-Patent Citations (1)
| Title |
|---|
| ＮＤＮ中基于相交路径的多径数据传输策略;黄胜等;《计算机工程与设计》;20160331;第37卷(第3期);ＮＤＮ中基于相交路径的多径数据传输策略 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107948342A (en) | 2018-04-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Yi et al. | Evaluation of routing protocol for low power and Lossy Networks: LOADng and RPL | |
| CN110113264B (en) | Method for realizing cache and route of named data network | |
| CN109150723B (en) | Routing communication implementation method of Internet of things | |
| CN109714274B (en) | Method for acquiring corresponding relation and routing equipment | |
| CN109088778B (en) | Data communication implementation method for future mobile network | |
| CN109257789B (en) | Vehicle-mounted network data communication method based on multi-hop cluster | |
| CN106993321B (en) | Network data communication method based on cluster | |
| US8665782B2 (en) | Loop-detection in moving networks | |
| CN106941449B (en) | A kind of network data communication method based on on-demand mechanism | |
| CN109005567B (en) | Mobile network implementation method based on cluster | |
| CN110691379A (en) | Active routing communication method suitable for wireless ad hoc network | |
| CN101102283A (en) | A method and device for optimizing unknown unicast forward at wireless access point | |
| CN109981470A (en) | Message transmission control method and device | |
| CN105119828A (en) | Fast wireless network routing achievement method | |
| CN109089241B (en) | Data communication implementation method for vehicle-mounted network | |
| CN107948342B (en) | Big data network implementation method | |
| WO2015074423A1 (en) | Data packet forwarding processing method in access gateway | |
| CN107949000B (en) | Low-delay opportunistic network implementation method | |
| CN108494595B (en) | High-efficiency new-generation big data network implementation method | |
| CN109768893B (en) | High-efficiency big data network data communication implementation method | |
| CN110401911B (en) | Vehicle-mounted cloud implementation method based on named data network | |
| CN108055204B (en) | Big data network communication implementation method | |
| CN114040407B (en) | Method for detecting and positioning worm hole attack based on routing loop | |
| Patel et al. | Detection and avoidance of malicious node in MANET | |
| CN110380971B (en) | Network data communication method based on buffer mechanism |
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 |