CN103067284B - Data center's expandable multicasting method and system - Google Patents

Data center's expandable multicasting method and system Download PDF

Info

Publication number
CN103067284B
CN103067284B CN201110317344.1A CN201110317344A CN103067284B CN 103067284 B CN103067284 B CN 103067284B CN 201110317344 A CN201110317344 A CN 201110317344A CN 103067284 B CN103067284 B CN 103067284B
Authority
CN
China
Prior art keywords
multicast group
multicast
data center
hash function
forward table
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.)
Expired - Fee Related
Application number
CN201110317344.1A
Other languages
Chinese (zh)
Other versions
CN103067284A (en
Inventor
李丹
崔恒纲
胡艳
夏勇
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Tsinghua University
NEC China Co Ltd
Original Assignee
Tsinghua University
NEC China Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Tsinghua University, NEC China Co Ltd filed Critical Tsinghua University
Priority to CN201110317344.1A priority Critical patent/CN103067284B/en
Publication of CN103067284A publication Critical patent/CN103067284A/en
Application granted granted Critical
Publication of CN103067284B publication Critical patent/CN103067284B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Landscapes

  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The invention discloses a kind of data center expandable multicasting method and system, relate to Internet technical field, the method comprises: S1: in described data center, each port of switch all arranges a multicast forward table, and arrange total number of categories of multicast group in described data center; S2: the hash function number that in multicast forward table described in the probability calculation occurred by total number of categories and each multicast group of multicast group in described data center, all kinds of multicast group uses, builds data center; S3: the port of described switch mates according to hash function corresponding with its type in described multicast forward table, if the match is successful, then forwards this packet, otherwise abandons this packet.The hash function number that in the probability calculation multicast forward table that the present invention is occurred by each multicast group, all kinds of multicast group uses, make inhomogeneous multicast group can use different hash functions, reduce the rate of false alarm of data center, thus reduce bandwidth waste ratio on the whole.

Description

Data center's expandable multicasting method and system
Technical field
The present invention relates to Internet technical field, particularly a kind of data center expandable multicasting method and system.
Background technology
Cloud computing gains great popularity because of it is safe, reliable, convenient, even almost unlimited multiple application is possible feature, in internet development process, is one of foreseeable inexorable trend.Among numerous technical fields that cloud computing relates to, data center is its core, is the key foundation platform of cloud computing.In the process rapidly implement in cloud computing, developed, want to have more the market competitiveness, capture the larger market share, must provide better service for user, this supports with regard to needing to add data center that is efficient, reliable, low cost.
As the important component part of cloud computing service, data center is among development change always.The power supply that high density is brought and the consumption requirements that radiating requirements, the place demand brought on a large scale, high operation cost are brought etc. these power, none does not promote data center and strides forward.Under existing hardware facility condition now, the Main Bottleneck affecting data center's performance is the network bandwidth.How could utilize the existing network bandwidth more efficiently? cast communication is shown one's talent with features such as its low contributive rate, low burden, saving bandwidth, is used widely in the heart in the data.But in the data in the heart, the quantity of server terminal and multicast group is huge often, and data center generally uses low end router, and internal memory is very limited, will draw data center's internal memory scalability problem like this.The designer trends of modern data center are that to use a large amount of low end router to carry out server interconnected, cost can be reduced like this, but limited space, so how maintained in little memory headroom and potential transmitted the huge challenge becoming data center and face in a large number, the multicast group that design easily extensible forwarding plan adapts to quantity and day by day increases becomes extremely important.
Bloomfilter is the mode that the multicast table in the routers commonly used in recent years carries out compressing, to carry out Hash calculation and the method arranging flag is used as forwarding the foundation judged.But due to the existence of coupling when bloomfilter mates, cause sometimes reporting by mistake, and then produce certain bandwidth waste.
Summary of the invention
(1) technical problem that will solve
The technical problem to be solved in the present invention is: the rate of false alarm how reducing data center, with the data leak rate reduced.
(2) technical scheme
For solving the problems of the technologies described above, the invention provides a kind of data center expandable multicasting method, comprising the following steps:
S1: in described data center, each port of switch all arranges a multicast forward table, and total number of categories of multicast group in described data center is set;
S2: the hash function number that in multicast forward table described in the probability calculation occurred by total number of categories and each multicast group of multicast group in described data center, all kinds of multicast group uses, builds data center according to hash function number, the probability of each multicast group appearance and the total number of categories of multicast group that multicast group all kinds of in described multicast forward table uses;
S3: when the port of described switch receives the packet that certain multicast group sends, described switch judges the type of described multicast group, and mates according to hash function corresponding with its type in described multicast forward table, if the match is successful, then forward this packet, otherwise abandon this packet.
Preferably, when building data center in step S2, undertaken by following steps:
S21: when in described data center during a newly-built current multicast group, the probability occurred by multicast group each in described data center and the number of categories of multicast group calculate the hash function number corresponding to current multicast group, hash function number corresponding to current multicast group judges its type, and joins the address that belongs to this type of multicast group for current multicast component;
S22: described switch judges the type of current multicast group by described address, and the hash function number corresponding according to the current multicast group calculated in step S21, by current multicast group according to the hash function of correspondence stored in described multicast forward table.
Preferably, in step S2 by following formula when data leak rate is minimum, calculate the hash function number that all kinds of multicast group in described multicast forward table uses,
l r = Σ j = 0 S - 1 ( 1 - P j ) { [ 1 - ( 1 - 1 m ) Σ j = 0 S - 1 P j × K j × G ] K j } Σ j = 0 S - 1 P j
Wherein, lr is data leak rate, total number of categories of S multicast group, P jfor the probability that multicast group in jth group occurs, K jfor the number of the hash function that jth group uses, G is the number of each multicast group element, and m is the size of multicast forward table.
Preferably, switch described in step S3 judges its type by the address of described multicast group.
Preferably, in described data center total number of categories of multicast group be greater than 1 integer.
The invention also discloses a kind of data center expandable multicasting system, comprising:
Module is set, for all arranging a multicast forward table for each port of switch in described data center, and total number of categories of multicast group in described data center is set;
Data center builds module, for the hash function number used by all kinds of multicast group in multicast forward table described in total number of categories of multicast group in described data center and the probability calculation of each multicast group appearance, build data center according to hash function number, the probability of each multicast group appearance and the total number of categories of multicast group that multicast group all kinds of in described multicast forward table uses;
Matching module, during for receiving packet that certain multicast group sends when the port of described switch, described switch judges the type of described multicast group, and mate according to hash function corresponding with its type in described multicast forward table, if the match is successful, then forward this packet, otherwise abandon this packet.
Preferably, data center's structure module comprises:
Address assignment submodule, for when in described data center during a newly-built current multicast group, the probability occurred by multicast group each in described data center and the number of categories of multicast group calculate the hash function number corresponding to current multicast group, hash function number corresponding to current multicast group judges its type, and joins the address that belongs to this type of multicast group for current multicast component;
Sub module stored, judged the type of current multicast group by described address for described switch, and the hash function number corresponding according to the current multicast group calculated in the distribution sub module of address, by current multicast group according to the hash function of correspondence stored in described multicast forward table.
Preferably, data center to build in module by following formula when data leak rate is minimum, calculates the hash function number that all kinds of multicast group in described multicast forward table uses,
l r = Σ j = 0 S - 1 ( 1 - P j ) { [ 1 - ( 1 - 1 m ) Σ j = 0 S - 1 P j × K j × G ] K j } Σ j = 0 S - 1 P j
Wherein, lr is data leak rate, total number of categories of S multicast group, P jfor the probability that multicast group in jth group occurs, K jfor the number of the hash function that jth group uses, G is the number of each multicast group element, and m is the size of multicast forward table.
Preferably, switch described in matching module judges its type by the address of described multicast group.
Preferably, in described data center total number of categories of multicast group be greater than 1 integer.
(3) beneficial effect
The hash function number that in the probability calculation multicast forward table that the present invention is occurred by each multicast group, all kinds of multicast group uses, make inhomogeneous multicast group can use different hash functions, reduce the rate of false alarm of data center, thus reduce data leak rate on the whole.
Accompanying drawing explanation
Fig. 1 is the flow chart of the data center's expandable multicasting method according to one embodiment of the present invention;
Fig. 2 is that the multicast forward table that adopts of the present invention and traditional multicast forward table are to the quantity of different element at hash function;
Fig. 3 is when using method of the present invention, the schematic diagram of data leak rate when quantity of classifying, multicast group size change;
Fig. 4 is when using method of the present invention, the schematic diagram of data leak rate when classification quantity, data center's structure change;
Fig. 5 is when using method of the present invention, the schematic diagram of data leak rate when classification quantity, multicast forward table change.
Embodiment
Below in conjunction with drawings and Examples, the specific embodiment of the present invention is described in further detail.Following examples for illustration of the present invention, but are not used for limiting the scope of the invention.
Fig. 1 is data center's expandable multicasting method of the flow chart of the data center's expandable multicasting method according to one embodiment of the present invention, present embodiment, comprises the following steps:
S1: in described data center, each port of switch all arranges a multicast forward table, and total number of categories of multicast group in described data center is set, described multicast forward table is used for storing multicast entry, each multicast entry is all an element in described multicast forward table, uncertain because each multicast group in data center can or can not produce an entry in certain multicast forward table, so can each element appear at no multicast forward table is a concept event, as shown in Figure 2, traditional multicast forward table uses Standardbloomfilter to compress, multicast forward table of the present invention uses multi-classbloomfilter to compress, multi-classbloomfilter (hereinafter referred to as MBF) i.e. multiclass bloomfilter, when the number of categories of MBF is 1, be Standardbloomfilter.
S2: the hash function number that in multicast forward table described in the probability calculation occurred by total number of categories and each multicast group of multicast group in described data center, all kinds of multicast group uses, builds data center according to hash function number, the probability of each multicast group appearance and the total number of categories of multicast group that multicast group all kinds of in described multicast forward table uses;
S3: when the port of described switch receives the packet that certain multicast group sends, described switch judges the type of described multicast group, and mates according to hash function corresponding with its type in described multicast forward table, if the match is successful, then forward this packet, otherwise abandon this packet.
Preferably, when building data center in step S2, undertaken by following steps:
S21: when in described data center during a newly-built current multicast group, the probability occurred by multicast group each in described data center and the number of categories of multicast group calculate the hash function number corresponding to current multicast group, hash function number corresponding to current multicast group judges its type, and joins the address that belongs to this type of multicast group for current multicast component;
S22: described switch judges the type of current multicast group by described address, and the hash function number corresponding according to the current multicast group calculated in step S21, by current multicast group according to the hash function of correspondence stored in described multicast forward table.
Preferably, in step S2 by following formula when data leak rate is minimum, calculate the hash function number that all kinds of multicast group in described multicast forward table uses,
l r = Σ j = 0 S - 1 ( 1 - P j ) { [ 1 - ( 1 - 1 m ) Σ j = 0 S - 1 P j × K j × G ] K j } Σ j = 0 S - 1 P j
Wherein, lr is data leak rate, total number of categories of S multicast group, P jfor the probability that multicast group in jth group occurs, K jfor the number of the hash function that jth group uses, G is the number of each multicast group element, and m is the size (unit is bit) of multicast forward table.
Preferably, switch described in step S3 judges its type by the address of described multicast group.
Preferably, in described data center total number of categories of multicast group be greater than 1 integer.
For verifying the effect of feasibility of the present invention and acquisition, carry out l-G simulation test under the Fat-Tree network first formed at the switch by 48 ports, assess for difference group size, different bloomfilter size, the performance of several situation of heterogeneous networks size to MBF respectively.
Fig. 3 is when using method of the present invention, the schematic diagram of data leak rate when quantity of classifying, multicast group size change.Wherein α is the parameter (its distribution index of coincidence is the power function distribution of α) of multicast group size distribution.As shown in Figure 3, classify more, data leak rate in general will be lower.At that time, class number was greater than after 10, did not just significantly improve; Even in some cases, data leak rate also can increase along with S and slightly improve, and this also can affect result due to combinations different between group in each class, but this situation seldom occurs.Emulation experiment data show, the multicast forwarding based on MBF than the multicast forwarding based on standardbloomfilter, can reduce by the data leak rate of 60%, illustrate and invention achieves expection object.
Fig. 4 is when using method of the present invention, the schematic diagram of data leak rate when classification quantity, data center's structure change.As shown in Figure 4, in the Fat-Tree structure selecting respectively to be made up of the switch of 16,32,48 ports, structure is more complicated, and data leak rate is higher.This is that a packet is larger by the possibility reported by mistake because a switch connects more, and on the other hand, for forwarding, network larger MBF advantage is more obvious.
Fig. 5 is when using method of the present invention, the schematic diagram of data leak rate when classification quantity, multicast forward table change, and multicast forward table increase can cause data leak rate to reduce, this is because less wrong report occurs.We also find simultaneously, and when multicast forwarding table size is less, the data leak rate that MBF causes reduces more obvious.Such as, when multicast forwarding table size is 6000, data leak rate is 20% at Standardbloomfilter, and in MBF, be 8%.This just illustrate when switch deposit soon space very limited time, use MBF is very helpful.
After emulation experiment, we employ again the test bed be made up of 5 main frames and carry out actual test: 1 multicast transmitter, 3 multicast receiver and 1 repeater-transmitter, and every platform main frame is all interconnected with other 4, and transmitter and receiver are in same group.We calculate the cpu load of MBF forwarding engine and bursts dropping ratio, and experimental result shows, MBF does not significantly affect cpu load, and bursts dropping ratio is also very nearly the same with traditional multicast forwarding engine.
Simulation result shows, and compare standardbloomfilter, MBF can significantly reduce data leak rate.
The invention also discloses a kind of data center expandable multicasting system, comprising:
Module is set, for all arranging a multicast forward table for each port of switch in described data center, and total number of categories of multicast group in described data center is set;
Data center builds module, for the hash function number used by all kinds of multicast group in multicast forward table described in total number of categories of multicast group in described data center and the probability calculation of each multicast group appearance, build data center according to hash function number, the probability of each multicast group appearance and the total number of categories of multicast group that multicast group all kinds of in described multicast forward table uses;
Matching module, during for receiving packet that certain multicast group sends when the port of described switch, described switch judges the type of described multicast group, and mate according to hash function corresponding with its type in described multicast forward table, if the match is successful, then forward this packet, otherwise abandon this packet.
Preferably, data center's structure module comprises:
Address assignment submodule, for when in described data center during a newly-built current multicast group, the probability occurred by multicast group each in described data center and the number of categories of multicast group calculate the hash function number corresponding to current multicast group, hash function number corresponding to current multicast group judges its type, and joins the address that belongs to this type of multicast group for current multicast component;
Sub module stored, judged the type of current multicast group by described address for described switch, and the hash function number corresponding according to the current multicast group calculated in the distribution sub module of address, by current multicast group according to the hash function of correspondence stored in described multicast forward table.
Preferably, data center to build in module by following formula when data leak rate is minimum, calculates the hash function number that all kinds of multicast group in described multicast forward table uses,
l r = Σ j = 0 S - 1 ( 1 - P j ) { [ 1 - ( 1 - 1 m ) Σ j = 0 S - 1 P j × K j × G ] K j } Σ j = 0 S - 1 P j
Wherein, lr is data leak rate, total number of categories of S multicast group, P jfor the probability that multicast group in jth group occurs, K jfor the number of the hash function that jth group uses, G is the number of each multicast group element, and m is the size of multicast forward table.
Preferably, switch described in matching module judges its type by the address of described multicast group.
Preferably, in described data center total number of categories of multicast group be greater than 1 integer.
Above execution mode is only for illustration of the present invention; and be not limitation of the present invention; the those of ordinary skill of relevant technical field; without departing from the spirit and scope of the present invention; can also make a variety of changes and modification; therefore all equivalent technical schemes also belong to category of the present invention, and scope of patent protection of the present invention should be defined by the claims.

Claims (8)

1. data center's expandable multicasting method, is characterized in that, comprises the following steps:
S1: in described data center, each port of switch all arranges a multicast forward table, and total number of categories of multicast group in described data center is set;
S2: the hash function number that in multicast forward table described in the probability calculation occurred by total number of categories and each multicast group of multicast group in described data center, all kinds of multicast group uses, builds data center according to hash function number, the probability of each multicast group appearance and the total number of categories of multicast group that multicast group all kinds of in described multicast forward table uses;
S3: when the port of described switch receives the packet that certain multicast group sends, described switch judges the type of described multicast group, and mates according to hash function corresponding with its type in described multicast forward table, if the match is successful, then forward this packet, otherwise abandon this packet;
In described data center total number of categories of multicast group be greater than 1 integer.
2. the method for claim 1, is characterized in that, when building data center in step S2, is undertaken by following steps:
S21: when in described data center during a newly-built current multicast group, the probability occurred by multicast group each in described data center and total number of categories of multicast group calculate the hash function number corresponding to current multicast group, hash function number corresponding to current multicast group judges its type, and joins the address that belongs to this type of multicast group for current multicast component;
S22: described switch judges the type of current multicast group by described address, and the hash function number corresponding according to the current multicast group calculated in step S21, by current multicast group according to the hash function of correspondence stored in described multicast forward table.
3. the method for claim 1, is characterized in that, in step S2 by following formula when data leak rate is minimum, calculate the hash function number that all kinds of multicast group in described multicast forward table uses,
l r = Σ j = 0 S - 1 ( 1 - P j ) { [ 1 - ( 1 - 1 m ) Σ j = 0 S - 1 P j × K j × G ] K j } Σ j = 0 S - 1 P j
Wherein, lr is data leak rate, and S is total number of categories of multicast group, P jfor the probability that multicast group in jth group occurs, K jfor the number of the hash function that jth group uses, G is the number of each multicast group interior element, and m is the size of multicast forward table.
4. method as claimed in claim 3, it is characterized in that, switch described in step S3 judges its type by the address of described multicast group.
5. data center's expandable multicasting system, is characterized in that, comprising:
Module is set, for all arranging a multicast forward table for each port of switch in described data center, and total number of categories of multicast group in described data center is set;
Data center builds module, for the hash function number used by all kinds of multicast group in multicast forward table described in total number of categories of multicast group in described data center and the probability calculation of each multicast group appearance, build data center according to hash function number, the probability of each multicast group appearance and the total number of categories of multicast group that multicast group all kinds of in described multicast forward table uses;
Matching module, during for receiving packet that certain multicast group sends when the port of described switch, described switch judges the type of described multicast group, and mate according to hash function corresponding with its type in described multicast forward table, if the match is successful, then forward this packet, otherwise abandon this packet;
In described data center total number of categories of multicast group be greater than 1 integer.
6. system as claimed in claim 5, is characterized in that, data center builds module and comprises:
Address assignment submodule, for when in described data center during a newly-built current multicast group, the probability occurred by multicast group each in described data center and total number of categories of multicast group calculate the hash function number corresponding to current multicast group, hash function number corresponding to current multicast group judges its type, and joins the address that belongs to this type of multicast group for current multicast component;
Sub module stored, judged the type of current multicast group by described address for described switch, and the hash function number corresponding according to the current multicast group calculated in the distribution sub module of address, by current multicast group according to the hash function of correspondence stored in described multicast forward table.
7. system as claimed in claim 5, is characterized in that, data center to build in module by following formula when data leak rate is minimum, calculates the hash function number that all kinds of multicast group in described multicast forward table uses,
l r = Σ j = 0 S - 1 ( 1 - P j ) { [ 1 - ( 1 - 1 m ) Σ j = 0 S - 1 P j × K j × G ] K j } Σ j = 0 S - 1 P j
Wherein, lr is data leak rate, and S is total number of categories of multicast group, P jfor the probability that multicast group in jth group occurs, K jfor the number of the hash function that jth group uses, G is the number of each multicast group element, and m is the size of multicast forward table.
8. system as claimed in claim 7, it is characterized in that, switch described in matching module judges its type by the address of described multicast group.
CN201110317344.1A 2011-10-18 2011-10-18 Data center's expandable multicasting method and system Expired - Fee Related CN103067284B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201110317344.1A CN103067284B (en) 2011-10-18 2011-10-18 Data center's expandable multicasting method and system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201110317344.1A CN103067284B (en) 2011-10-18 2011-10-18 Data center's expandable multicasting method and system

Publications (2)

Publication Number Publication Date
CN103067284A CN103067284A (en) 2013-04-24
CN103067284B true CN103067284B (en) 2016-01-13

Family

ID=48109752

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201110317344.1A Expired - Fee Related CN103067284B (en) 2011-10-18 2011-10-18 Data center's expandable multicasting method and system

Country Status (1)

Country Link
CN (1) CN103067284B (en)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1801783A (en) * 2006-01-23 2006-07-12 北京交通大学 Multi-domain multicast integration data distributing structure and method based on IP/MPLS/BGP
CN101651622A (en) * 2008-08-14 2010-02-17 丛林网络公司 Scalable security services for multicast in a router having integrated zone-based firewall
CN102136917A (en) * 2010-07-14 2011-07-27 华为技术有限公司 Ethernet multicast method and device
CN102164084A (en) * 2011-04-21 2011-08-24 杭州华三通信技术有限公司 Multicast message forwarding method and equipment thereof

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7570639B2 (en) * 2004-11-30 2009-08-04 Broadcom Corporation Multicast trunking in a network device

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1801783A (en) * 2006-01-23 2006-07-12 北京交通大学 Multi-domain multicast integration data distributing structure and method based on IP/MPLS/BGP
CN101651622A (en) * 2008-08-14 2010-02-17 丛林网络公司 Scalable security services for multicast in a router having integrated zone-based firewall
CN102136917A (en) * 2010-07-14 2011-07-27 华为技术有限公司 Ethernet multicast method and device
CN102164084A (en) * 2011-04-21 2011-08-24 杭州华三通信技术有限公司 Multicast message forwarding method and equipment thereof

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
Exploring Efficient and Scalable Multicast Routing in Future Data Center Networks;Dan Li等;《IEEE INFOCOM 2011》;20110430;1-10 *

Also Published As

Publication number Publication date
CN103067284A (en) 2013-04-24

Similar Documents

Publication Publication Date Title
US11595289B2 (en) Network testing using a programmable packet engine
Madden et al. TAG: A tiny aggregation service for ad-hoc sensor networks
CN104734915B (en) A kind of concurrent dynamic emulation method of Multi net voting of compound multi-process multithreading
CN110265006A (en) Awakening method, master node, slave node and storage medium
Xin et al. Continuously maintaining sliding window skylines in a sensor network
Li et al. Blockchain dividing based on node community clustering in intelligent manufacturing cps
CN102707696B (en) Multi-serial-port data transmission method and transmission center system
US20230042747A1 (en) Message Processing Method and Device, Storage Medium, and Electronic Device
CN104025520B (en) Lookup table creation method and query method, and controller, forwarding device and system therefor
CN102811152A (en) Method for realizing real-time transaction and data exchange of multiple main bus network communication
CN107396414A (en) A kind of mobile terminal communication method, device and mobile terminal
CN101087304B (en) Connection device and method between wireless sensor network and Internet
CN113365233A (en) Cloud service method for short message communication of Beidou communication application system
CN103416026B (en) Network system and packet processing method
CN202385119U (en) Zigbee based multimedia intelligent household network
CN105282045B (en) A kind of distributed computing and storage method based on consistency hash algorithm
CN103067284B (en) Data center's expandable multicasting method and system
CN105281960A (en) Method for managing flow entry in software defined network
CN201048388Y (en) Blade server based kilomega switching blade
CN103176796A (en) Method for achieving mapping from complex data to signal set in AUTOSAR
Qiao et al. Adaptable switch: a heterogeneous switch architecture for network-centric computing
CN106686697B (en) The method of zigbee terminal device node administration
Xiang et al. Impact of multi-query optimization in sensor networks
CN110337096A (en) Wireless communication surveillance control method, system and device
CN203206264U (en) Wireless MoCA terminal

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20160113

Termination date: 20161018