CN103166823B - Be applied to the alternative space method of family - Google Patents
Be applied to the alternative space method of family Download PDFInfo
- Publication number
- CN103166823B CN103166823B CN201210186345.1A CN201210186345A CN103166823B CN 103166823 B CN103166823 B CN 103166823B CN 201210186345 A CN201210186345 A CN 201210186345A CN 103166823 B CN103166823 B CN 103166823B
- Authority
- CN
- China
- Prior art keywords
- node
- frame
- territory
- host node
- priority
- 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
Abstract
The invention discloses a kind of alternative space method being applied to family, distribute frame from node ID that to extract host node be id information from peer distribution, the queue of host node scanning limit priority, judge in the queue scanned, whether there are valid data, if so, host node sends downlink data frame; If not, host node realizes transmitting uplink data, after the queue of all priority has all scanned, and new round scanning from the queue of limit priority again.The present invention adopts host node to control to divide from the ID of node, the transmission of upstream data and downlink data is carried out according to the ID from node and the priority from node, thus the access of 6 kinds of business and 64 home business terminals can be realized, and realize classification and the flow control of QoS.
Description
Technical field
The present invention relates to token network protocol technology field, be specifically related to a kind of alternative space method being applied to family.
Background technology
Power line spreads all over city and rural area, and its coverage rate is that any network is incomparable, is conducive to the popularization of power line communication (PLC, PowerLineCommunication) network.PLC, by power line transmission data, does not need to set up more circuit and equipment, only modulator-demodulator need be inserted power receptacle and just can communicate, and uses simple, with low cost, is conducive to information resources share and realizes the easy online of household electrical appliances.PLC, except the clear superiority in construction, also there is advantage in average price.Along with the development in market, power line communications PLC price relatively high is in the past in decline progressively, current PLC is suitable in speed with xDSL, cable modem on single line cost, and power line communications, through 14Mbps, 85Mbps, has welcome the epoch of 200Mbps at present.The requirement such as safe, education, amusement of digital home after the bandwidth of 200Mbps is enough to meet is the desirable backbone network of digital home.
Bus-type ethernet communication protocol for low-voltage power line can adopt token network protocol technology.
Token bus network agreement is on physical bus, set up a logic box.Token bus network transmits data must be undertaken by loop, and token bus network transmits data because there being direct path, therefore time of delay is short.Token bus looped network is compared with contention bus net, and when load is light, expense all increases with the traffic increase of network.During due to heavy duty, the time that token-bus network transmits mark is constant, and the conflict of contention bus net increases, and overhead increases thereupon, and system effectiveness declines rapidly.The process receiving token due to website is order, therefore fair access is had to weigh to all websites, token-bus network has the high advantage of utilance under Lothrus apterus and heavy duty, very simple when normal running, is widely used in the control system that application requires in real time.
At digital home network, there is multiple business, such as: phone, online, medical treatment, security protection etc., each business may have multiple terminal, in order to realize service quality (QOS, QualityofService) guarantee, present inventors have proposed a kind of Logic token agreement being applied to family.
Summary of the invention
The embodiment of the present invention provides a kind of alternative space method being applied to family.
Be applied to an alternative space method for family, comprise: arbitrary from node power on backward host node sending node ID apply for frame;
After described host node receives described node ID application frame, described host node distributes frame to described from node sending node ID, and described node ID distribution frame carries mac domain information and is the described id information from peer distribution;
Describedly receive after described node ID that described host node sends distributes frame from node, obtain the mac domain information that described node ID distribution frame carries, by described mac domain information and the described MAC information match from node, if described mac domain information and the described MAC information match from node self, describedly distribute from node from described node ID frame that to extract described host node be the described id information from peer distribution;
The queue of described host node scanning limit priority, described queue is formed by from node, judges, in the queue scanned, whether to there are valid data, and what if so, described host node existed valid data in queue sends downlink data frame from node; If not, described host node sends Data Control frame to what scanning from node, scanning described in inquiry from node the need of transmission data;
All from nodes listen circuit, scanning described in arbitrary receive described transmission Data Control frame from node after, id information is obtained from described transmission Data Control frame, by the id information obtained from described transmission Data Control frame and described arbitrary described in scanning match from the ID value of node self, if coupling, then described arbitrary described in the Data Control acknowledgement frame that sends from node to described host node that scanning respond;
After described host node receives described transmission Data Control acknowledgement frame, described arbitrary described in scanning from node send uplink data frames;
Described host node judges whether the queue of current scanline is lowest priority, if so, described host node new round scanning from the queue of limit priority again; If not, described host node scans the queue of next priority again, after the queue of all priority has all scanned, and new round scanning from the queue of limit priority again.
The embodiment of the present invention adopts host node to control to divide from the ID of node, the transmission of upstream data and downlink data is carried out according to the ID from node and the priority from node, thus the access of 6 kinds of business and 64 home business terminals can be realized, and realize classification and the flow control of QoS.
Accompanying drawing explanation
Fig. 1 is the flow chart that ID distributes;
Fig. 2 is the flow chart that host node is retrieved as the id information from peer distribution;
Fig. 3 is queue structure's schematic diagram of host node;
Fig. 4 is queue processing process flow diagram.
Embodiment
The embodiment of the present invention provides a kind of alternative space method being applied to family, is below described in detail.
In this alternative space method, each from the owned priority of node, the MAC Address whole world is unique, and determine during production equipment, priority is according to type of service determination default value, and user can be arranged, and host node priority is fixed as 0.It should be noted that, in digital home network, host node is home gateway, is the various application terminal be connected with home gateway of household internal, such as: computer, telephone set, television set, game machine, security device, integrated reading device etc. of checking meter from node.
The mark (ID, IDentity) from node that this alternative space method can realize being controlled by home gateway divides; Realize the access of 6 kinds of business (maximum easily extensible is 16 kinds of business) and 64 home business terminals; Realize classification and the flow control of QoS.
Different types of service is mapped as different priority, and supporting 16 priority at most, is namely 16 kinds of business.In the present embodiment, 0 is that priority is the highest, 15 is that priority is minimum, six kinds of business of definition, corresponding priority registration is respectively: the priority that the priority that priority is 8, game service is corresponding that the priority that the priority that the priority that television services is corresponding is 2, telephone service is corresponding is 4, security protection business is corresponding is 6, business of checking meter is corresponding is 10, business of networking is corresponding is 15.
In the present embodiment, the frame format adopted is as shown in the table,
| Frame head territory | ID territory | Type field | Data field | Verification territory |
| 1 byte | 1 byte | 1 byte | Maximum 1496 bytes | 1 byte |
Wherein,
(1) 1 byte representation in frame head territory, is fixed as 0x7E.In intraframe data territory part, need to be converted to 0x7D0x5E if run into 0x7E during encapsulation, need to be converted to 0x7D0x5E if run into 0x7D; Reverse operating is carried out during decapsulation.
(2) 1 byte representation in ID territory, for identifying user address, design support 64 users at present.
(3) type field 1 byte representation, maximum definable 256 kinds of frame types.
Devise the frame of 6 types at present, its title and effect are respectively:
Node ID application frame: for from node to host node application from node ID;
Node ID distributes frame: for host node to from peer distribution from node ID;
Send Data Control frame: control to send data from node for host node;
Send Data Control acknowledgement frame: " send Data Control frame " for response;
Downlink data frame: for transmitting host node to the data from node;
Uplink data frames: for transmitting the data from node to host node.
(4) with regard to data field, this alternative space is carried on Ethernet, ethernet layer adopts the encapsulation format of RFC894 definition, payload data length is 1500 bytes to the maximum, in the present embodiment, payload data length maximum is designated as Lmax, Lmax=Ethernet payload data length maximum-frame head length of field-type field length-ID length of field-byte-1 byte-1 byte-1 byte-1 byte=1496, verification length of field=1500 byte, namely in the present embodiment, payload data length maximum is 1496 bytes.
When physical layer provides the bandwidth of 50Mbps, transmitting a frame length is 1518 byte ethernet frame times be designated as tmax, tmax=frame length/bandwidth=(1518 byte × 8)/50 Gigabits per second=243 × 10-6 seconds, namely transmit 1518 byte frames and only need 243 microseconds.
If host node is to from the inquiry cycle of node, only send a frame data frame from node at every turn, suppose that " uplink data frames " frame length is maximum 1500 byte, then poll one-period is consuming time maximum, " transmission Data Control frame " and " sending Data Control acknowledgement frame " frame length are all 5 bytes, now in 64 number of users situations, the time that the whole poll of all users is one time is designated as t, then t=number of users × (transmitting the longest frame time+transmission Data Control frame time+transmission Data Control acknowledgement frame time)=64 × [243 × 10-6 second+(5 byte × 8)/50 Gigabits per second+(5 byte × 8)/50 Gigabits per second]=15.65 milliseconds.
According to ETSI statistics, voice data maximum delay is 20 milliseconds, game maximum delay is 20 milliseconds, audio and video streams maximum delay is 100 milliseconds, and other business time delays are substantially at about 200 milliseconds.
First select frame length to be 500 bytes to reduce each service delay, time delay is 5.2ms.
(5) verify 1 byte representation in territory, adopt CRC8 School Affairs.
As previously mentioned, this alternative space method devises six kinds of frame types at present, is specially: node ID application frame, node ID are distributed frame, send Data Control, sent Data Control acknowledgement frame, downlink data frame and uplink data frames, specifically describe as follows:
(1) the frame type territory of node ID application frame is 0x02, and the frame format of node ID application frame is:
| Frame head territory | ID territory | Type field | Mac domain | Priority field | Verification territory |
| 1 byte | 1 byte | 1 byte | 6 bytes | 1 byte | 1 byte |
Wherein ID territory is used for filling in host node ID; MAC (MediaAccessControl) territory is used for filling in from node self MAC value; Priority field is used for filling in from node own priority value;
Node ID application frame is sent to host node by from node, needs host node to respond, for from node to host node application from node ID.
(2) node ID distributes the type field of frame is 0x03, and the frame format that node ID distributes frame is:
| Frame head territory | ID territory one | Type field | Mac domain | ID territory two | Verification territory |
| 1 byte | 1 byte | 1 byte | 6 bytes | 1 byte | 1 byte |
Wherein, ID territory one is for filling in host node ID; Mac domain is used for filling in target from node M AC value; ID territory two is for extending this as the ID value of target from peer distribution.Node ID is distributed frame and is sent to from node by host node, does not need from node response, for host node to from peer distribution from node ID.
(3) type field sending Data Control frame is 0x04, and the frame format sending Data Control frame is:
| Frame head territory | ID territory | Type field | Control command territory | Verification territory |
| 1 byte | 1 byte | 1 byte | 1 byte | 1 byte |
Wherein, ID territory is used for filling in target from node ID; When being in the state the need of transmission data, 0x00 is filled in control command territory, and when being in the state stopping sending data, 0x01 is filled in control command territory.
Sending the effect of Data Control frame is sent to from node by host node, needs from node response, controls to send data from node for host node.
(4) type field sending Data Control acknowledgement frame is 0x05, and the frame format sending Data Control acknowledgement frame is:
| Frame head territory | ID territory | Type field | Control command territory | Verification territory |
| 1 byte | 1 byte | 1 byte | 1 byte | 1 byte |
Wherein ID territory is used for filling in host node ID; When being in the state needing to send data, 0x00 is filled in control command territory, and when being in the state not needing to send data, 0x01 is filled in control command territory.
Send Data Control acknowledgement frame and be sent to host node by from node, do not need host node to respond.Send Data Control acknowledgement frame to be used for " sending Data Control frame " from node response.
(5) type field of downlink data frame is 0x06, and the frame format of downlink data frame is:
| Frame head territory | ID territory | Type field | Payload data territory | Verification territory |
| 1 byte | 1 byte | 1 byte | Maximum 1496 bytes | 1 byte |
Wherein, ID territory is used for filling in host node ID; Downlink data frame is sent to from node by host node, does not need to respond from node.Downlink data frame is used for host node and sends data to from node.
(6) type field of uplink data frames is 0x07, and the frame format of uplink data frames is;
| Frame head territory | ID territory | Type field | Data field | Verification territory |
| 1 byte | 1 byte | 1 byte | Maximum 1496 bytes | 1 byte |
Wherein, ID territory is used for filling in host node ID; Uplink data frames is sent to host node by from node, does not need host node to respond.Uplink data frames is used for sending data from node to host node.
See Fig. 1, below by with regard to host node to from the ID allocation flow of node, host node and from the downlink data handling process between node, host node be described in detail from the transmitting uplink data flow process between node.
1) host node is to the ID allocation flow from node
101, arbitrary from node power on backward host node sending node ID apply for frame.
102, after host node receives node ID application frame, host node distributes frame to this from node sending node ID, and this node ID distribution frame carries mac domain information and is this id information from peer distribution.
103, after the node ID distribution frame of host node transmission should being received from node, the mac domain information that this node ID distribution frame carries was obtained,
If the mac domain information that 104 these node ID distribution frames carry and the MAC information match from node self, should extract host node distribution frame from node from this node ID is the id information distributed from node N.
2) host node and from the downlink data handling process between node and upstream data handling process
Adopt the mode of broadcast to transmit for downlink data (host node to from the control frame of node and Frame), adopt the mode of clean culture to transmit for upstream data (control frame from node to host node and Frame).
In host node according to type of service (priority) by all queues being created as respective numbers from node, the signal of the queue structure of host node is as shown in Figure 2.Downlink data is stored in respective queue successively according to type of service.Host node according to priority scans individual queue in descending order successively, after high-priority queue process completes, then scans next priority query.After the queue of all priority has all scanned, new round scanning from highest-priority queue again.
Optionally, when scanning beginning, opening timing device, when timer t (the being defined as 20 milliseconds at present) time arrives, present scan terminates, and again scans from limit priority.This mechanism is used for ensureing when bandwidth is not enough, the implementation of high-priority service.
Queue processing process comprises: upstream data and downlink data process.
Downlink data in queue is directly sent, until no longer comprise valid data in queue; The node of the corresponding priority of inquiry, realizes transmitting uplink data successively.
The queue processing process flow of host node is as follows:
105, the queue of host node scanning limit priority;
106, in the queue that judgement is scanning, whether there are valid data, if so, perform step 107, if not, perform step 108;
107, in the queue scanned, there are valid data, host node to exist valid data from node send downlink data frame;
108, in the queue scanned, there are not valid data, host node carries out poll to what scanning from node, carries out transmitting uplink data;
109, after step 108, host node judges whether the queue of current scanline is lowest priority, if so, performs step 105, if not, performs step 110;
110, the queue of current scanline is not lowest priority, and host node scans next priority query again.After the queue of all priority has all scanned, new round scanning from highest-priority queue again.
In a step 102, it is id information from peer distribution that the node ID that host node the sends ID territory distributed in frame contains host node, and host node self first will be retrieved as the id information from peer distribution.See Fig. 3, host node is retrieved as from the process of the id information of peer distribution as follows:
The id information of host node is 0x00, safeguards id information table at host node, and id information table is that major key stores item of information from small to large with ID.Have 8bit from the ID of node, Gao Siwei determines by from node priority, and low four are distributed successively from 0.
201, after host node receives node ID application frame, from node ID application frame, priority value is extracted;
202, in id information table, search whether to there is high four of ID be the list item of this priority value, if there is not high four of ID in id information table is the list item of this priority value, perform step 203; If there is high four of ID in id information table is the list item of this priority value, perform step 204;
203, there is not high four of ID in id information table is the list item of this priority value, and host node increases ID list item in id information table, and high four of the ID list item newly increased is this priority value, and low four is 0;
204, there is high four of ID in id information table is the list item of this priority value, judges whether low four figures value the maximum of this list item equals 15, if be not equal to 15, performs step 205, if equal 15, performs step 206;
205, low four figures value the maximum of this list item is not equal to 15, and host node increases ID list item in id information table, the ID list item newly increased high four for this priority value, low four is low 4-digit number the maximum of this list item aforesaid;
206, low four figures value the maximum of this list item equals 15, and the priority value extracted in node ID application frame is updated to the value after adding;
207, after step 206, then judge whether the priority value after upgrading equals 15, if be not equal to 15, then re-executes step 202, and the step that step 202 is later; If equal 15, then perform step 208;
208, the priority value after upgrading equals 15, and host node carries out abnormality processing.
Concrete, suppose that the priority from node 1 that host node extracts from node ID application frame is 2, then from the ID of node 1 high four be 2.Host node retrieval id information table, finding high four of ID is the list item of 2, and this list item ID low four figures value the maximum is m.Host node judges whether m equals 15, if m equals 15, the priority value that host node extracts from node ID application frame is updated to the value after adding, obtain m1, m1=2+1=3, judge whether m1 equals 15 again, if m1 is not equal to 15, host node retrieval id information table, finding high four of ID is the list item of 3, and high four of this ID be ID low four figures value the maximum in the list item of 3 is m2, if m2 is not equal to 15, host node adds list item in id information table, and the Gao Siwei of the new list item added is m1, and low four is m2+1.
See Fig. 4, in step 108, when there are not valid data in the queue scanned, host node carries out poll to what scanning from node, realizes transmitting uplink data, is specially:
301, host node sends Data Control frame to what scanning from node, inquires from node the need of transmission data;
302, all from nodes listen circuit, arbitrary scanning receive send Data Control frame from node after, from transmission Data Control frame, obtain id information, this id information and the ID value of self matched.
If 303 couplings, then send Data Control acknowledgement frame to host node and respond;
304, after host node receives and sends Data Control acknowledgement frame, what respond with it sends uplink data frames from node.
Optionally, host node, at every turn to during from node polls, allows to send Data Control frame to sending multiframe from node.
Optionally, in transmitting uplink data process, once timer then, then host node is to sending from node " sending Data Control frame ", orders from node end data transmission immediately.
The embodiment of the present invention adopts host node to control to divide from the ID of node, the transmission of upstream data and downlink data is carried out according to the ID from node and the priority from node, thus the access of 6 kinds of business and 64 home business terminals can be realized, and realize classification and the flow control of QoS.
One of ordinary skill in the art will appreciate that all or part of step in the various methods of above-described embodiment is that the hardware that can carry out instruction relevant by program has come, this program can be stored in a computer-readable recording medium, and storage medium can comprise: ROM, RAM, disk or CD etc.
Above the alternative space method being applied to family that the embodiment of the present invention provides is described in detail, apply specific case herein to set forth principle of the present invention and execution mode, the explanation of above embodiment just understands method of the present invention and core concept thereof for helping; Meanwhile, for one of ordinary skill in the art, according to thought of the present invention, all will change in specific embodiments and applications, in sum, this description should not be construed as limitation of the present invention.
Claims (9)
1. be applied to an alternative space method for family, it is characterized in that, comprising:
Arbitrary from node power on backward host node sending node ID apply for frame;
After described host node receives described node ID application frame, described host node distributes frame to described from node sending node ID, and described node ID distribution frame carries mac domain information and is the described id information from peer distribution;
Describedly receive after described node ID that described host node sends distributes frame from node, obtain the mac domain information that described node ID distribution frame carries, by described mac domain information and the described MAC information match from node, if described mac domain information and the described MAC information match from node self, describedly distribute from node from described node ID frame that to extract described host node be the described id information from peer distribution;
The queue of described host node scanning limit priority, described queue is formed by from node, judges, in the queue scanned, whether to there are valid data, and what if so, described host node existed valid data in queue sends downlink data frame from node; If not, described host node sends Data Control frame to what scanning from node, scanning described in inquiry from node the need of transmission data;
All from nodes listen circuit, scanning described in arbitrary receive described transmission Data Control frame from node after, id information is obtained from described transmission Data Control frame, by the id information obtained from described transmission Data Control frame and described arbitrary described in scanning match from the ID value of node self, if coupling, then described arbitrary described in the Data Control acknowledgement frame that sends from node to described host node that scanning respond;
After described host node receives described transmission Data Control acknowledgement frame, described arbitrary described in scanning from node send uplink data frames;
Described host node judges whether the queue of current scanline is lowest priority, if so, described host node new round scanning from the queue of limit priority again; If not, described host node scans the queue of next priority again, after the queue of all priority has all scanned, and new round scanning from the queue of limit priority again.
2. alternative space method according to claim 1, it is characterized in that, the id information of described host node is 0x00, id information table is safeguarded at described host node, described id information table is that major key stores item of information from small to large with ID, and the described ID from node has 8bit, and the Gao Siwei of the described ID from node is determined by the described priority from node, low four of the described ID from node are distributed successively from 0
After described host node receives described node ID application frame, described host node distributes frame to described from node sending node ID, and described node ID is distributed frame and carried mac domain information and the step for the described id information from peer distribution, is specially:
After described host node receives described node ID application frame, from described node ID application frame, extract priority value;
Described host node searches in described id information table whether to there is high four of ID be the list item of described priority value;
If there is not high four of ID in described id information table is the list item of described priority value, described host node increases ID list item in described id information table, and high four of the ID list item newly increased is described priority value, and low four is 0;
If there is high four of ID in described id information table is the list item of described priority value, judge high four of described ID is whether low four figures value the maximum of the list item of described priority value equals 15;
If be not equal to 15, described host node increases ID list item in described id information table, the ID list item newly increased high four for described priority value, low four be high four of described ID is low four figures value the maximum of the list item of described priority value;
If equal 15, the priority value extracted from described node ID application frame is updated to the value after adding by described host node; Judge whether the priority value after upgrading equals 15 again, if be not equal to 15, described host node searches in described id information table whether to there is high four of ID be the list item of priority value after described renewal again, if equal 15, host node carries out abnormality processing;
Described host node distributes frame to described from node sending node ID, and described node ID distribution frame carries mac domain information and is the described id information from peer distribution.
3. alternative space method according to claim 2, is characterized in that,
Described host node sends Data Control frame, can send multiframe and send Data Control frame.
4. alternative space method according to claim 3, is characterized in that,
For downlink data, adopt the mode of broadcast to transmit, for upstream data, adopt the mode of clean culture to transmit.
5. the alternative space method according to claim 3 or 4, is characterized in that,
Described node ID application frame comprises frame head territory, ID territory, type field, mac domain, Priority field and verification territory, the ID territory of described node ID application frame is used for filling in host node ID, the mac domain of described node ID application frame is used for filling in described from node self MAC value, the Priority field of described node ID application frame is used for filling in described from node own priority value, and the frame type territory of described node ID application frame is 0x02.
6. the alternative space method according to claim 3 or 4, is characterized in that,
Described node ID is distributed frame and is comprised frame head territory, ID territory one, type field, mac domain, ID territory two and verification territory, described node ID distributes the ID territory one of frame for filling in the ID of described host node, described node ID distributes the mac domain of frame for filling in the MAC value of target from node, described node ID distributes the ID territory two of frame for extending this as the ID value of target from peer distribution, and the type field that described node ID distributes frame is 0x03.
7. the alternative space method according to claim 3 or 4, is characterized in that,
Described transmission Data Control frame comprises frame head territory, ID territory, type field, control command territory and verification territory, the ID territory of described transmission Data Control frame is for filling in the ID of target from node, when being in the state the need of transmission data, 0x00 is filled in the control command territory of described transmission Data Control frame, when being in the state stopping sending data, 0x01 is filled in the control command territory of described transmission Data Control frame, and the type field of described transmission Data Control frame is 0x04.
8. the alternative space method according to claim 3 or 4, is characterized in that,
Described transmission Data Control acknowledgement frame comprises frame head territory, ID territory, type field, control command territory and verification territory, the ID territory of described transmission Data Control acknowledgement frame is for filling in the ID of described host node, when being in the state needing to send data, 0x00 is filled in the control command territory of described transmission Data Control acknowledgement frame, when being in the state not needing to send data, 0x01 is filled in the control command territory of described transmission Data Control acknowledgement frame, and the type field of described transmission Data Control acknowledgement frame is 0x05.
9. the alternative space method according to claim 3 or 4, is characterized in that,
Described downlink data frame comprises frame head territory, ID territory, type field, payload data territory and verification territory, and the ID territory of described downlink data frame is for filling in the ID of described host node, and the type field of described downlink data frame is 0x06; Described uplink data frames comprises frame head territory, ID territory, type field, data field and verification territory, and the ID territory of described uplink data frames is for filling in the ID of described host node, and the type field of described uplink data frames is 0x07.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210186345.1A CN103166823B (en) | 2012-06-07 | 2012-06-07 | Be applied to the alternative space method of family |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210186345.1A CN103166823B (en) | 2012-06-07 | 2012-06-07 | Be applied to the alternative space method of family |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103166823A CN103166823A (en) | 2013-06-19 |
| CN103166823B true CN103166823B (en) | 2015-11-25 |
Family
ID=48589575
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210186345.1A Active CN103166823B (en) | 2012-06-07 | 2012-06-07 | Be applied to the alternative space method of family |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103166823B (en) |
Families Citing this family (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP3706364B1 (en) * | 2013-09-23 | 2021-04-21 | Samsung Electronics Co., Ltd. | Security management method and security management device in home network system |
| CN103580967A (en) * | 2013-11-08 | 2014-02-12 | 广东广联电子科技有限公司 | Token passing method applied to digital home network |
| CN105530207A (en) * | 2015-12-11 | 2016-04-27 | 中国航空工业集团公司西安航空计算技术研究所 | Switch port arbitration circuit and method in support of multi-type data frames |
| CN106656268B (en) * | 2017-03-14 | 2020-10-02 | 西安电子科技大学 | Monitoring equipment utilizing power line carrier technology and monitoring method thereof |
| CN108123863B (en) * | 2017-12-18 | 2020-11-24 | 合肥华凌股份有限公司 | Communication system and communication method of household appliance and household appliance |
| CN108123862A (en) * | 2017-12-18 | 2018-06-05 | 合肥华凌股份有限公司 | Communication system, communication means and the household electrical appliance of household electrical appliance |
| CN110121181B (en) * | 2018-02-06 | 2021-12-31 | 上海诺基亚贝尔股份有限公司 | Method for transmitting QoS information, base station, terminal device and computer readable storage medium |
| EP3857955A4 (en) * | 2018-09-27 | 2022-01-26 | Apple Inc. | Uplink in-order delivery for qos flow offloaded in 5gc multi-rat dual connectivity |
| CN113783763A (en) * | 2021-01-26 | 2021-12-10 | 青岛鼎信通讯股份有限公司 | Method for improving data transmission efficiency of medium-voltage carrier communication centralized scheduling system |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101247297A (en) * | 2007-02-16 | 2008-08-20 | 华为技术有限公司 | Device, system and method for automatically configuring application terminal in family network |
| CN101605057A (en) * | 2009-07-02 | 2009-12-16 | 中兴通讯股份有限公司 | A kind of home gateway is realized the method and system of downlink Qos |
| EP2159961A1 (en) * | 2008-09-01 | 2010-03-03 | Alcatel, Lucent | Method, device and module for optimising the remote management of home network devices |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8180735B2 (en) * | 2006-12-29 | 2012-05-15 | Prodea Systems, Inc. | Managed file backup and restore at remote storage locations through multi-services gateway at user premises |
-
2012
- 2012-06-07 CN CN201210186345.1A patent/CN103166823B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101247297A (en) * | 2007-02-16 | 2008-08-20 | 华为技术有限公司 | Device, system and method for automatically configuring application terminal in family network |
| EP2159961A1 (en) * | 2008-09-01 | 2010-03-03 | Alcatel, Lucent | Method, device and module for optimising the remote management of home network devices |
| CN101605057A (en) * | 2009-07-02 | 2009-12-16 | 中兴通讯股份有限公司 | A kind of home gateway is realized the method and system of downlink Qos |
Non-Patent Citations (1)
| Title |
|---|
| 基于多令牌环调度的家庭网络QOS控制方案;董炜等;《北京邮电大学》;20061031;第11-14页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103166823A (en) | 2013-06-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103166823B (en) | Be applied to the alternative space method of family | |
| CN102223412B (en) | Machine type communication method and device | |
| CN101212371B (en) | Channel access parameter configuration method, access point, server, and communication system | |
| CN103765917A (en) | A method of providing end-to-end connection in a unified optical and coaxial network | |
| EP2577887A2 (en) | Nas-based signaling protocol for overload protection of random access in massive machine type communication | |
| CN105659683A (en) | System and Method for Setting Cyclic Prefix Length | |
| CN107086934A (en) | The collocation method and gateway of networking equipment | |
| CN102196591A (en) | Mobile terminal and data parallel transmission method thereof | |
| CN103533653A (en) | Method and device for solving the problem of hidden nodes in local area network | |
| CN104158712A (en) | Time division working method for local area network | |
| CN105306417B (en) | A kind of network data distributing method and network system based on super router | |
| CN102255782B (en) | Channel management method for digital television and digital home network system | |
| CN109510743A (en) | A kind of mobile grouping method of intelligent sound box system | |
| CN102281334B (en) | A kind of management control method of catv terminal and system and access server | |
| CN103812707A (en) | Forwarding processing method of line identity messages | |
| CN101436953B (en) | Management method and processing module for on-line announcement message of network appliance | |
| CN102742317B (en) | Communication system, communication method and communication apparatus | |
| CN101174976A (en) | Point-to-multipoint coaxial cable Ethernet transmission method, system and transmission apparatus | |
| CN105591866A (en) | Method and system for sharing WIFI, household gateway, and local area network gateway | |
| CN101517971A (en) | Wireless network with contention and contention-free periods | |
| CN103259713A (en) | Message exchange system and method | |
| CN103118441A (en) | Terminal expanding device and system and method | |
| CN102223366A (en) | Multimedia advertisement propelling system and method thereof based on power utilization information acquisition system | |
| CN107249017A (en) | A kind of method and server that HLS contents are obtained by CDN | |
| CN202094928U (en) | Multimedia advertising recommending system based on electricity information acquisition system |
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 | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20191113 Address after: B353, building 13, No. 232, Waihuan East Road, Xiaoguwei street, Panyu District, Guangzhou City, Guangdong Province Patentee after: Guangdong Guanglian Electronic Co., Ltd. Address before: 510006 Guangdong city of Guangzhou province Panyu District Xiaoguwei Street Outer Ring Road No. 232 building 13 B350 Co-patentee before: Guangzhou Guanglian Digital Home Industry Technology Research Institute Patentee before: Guangdong Guanglian Electronic Co., Ltd. |
|
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20210420 Address after: 050081 No. 589 West Zhongshan Road, Qiaoxi District, Hebei, Shijiazhuang Patentee after: NO.54 INSTITUTE OF CHINA ELECTRONICS SCIENCE & TECHNOLOGY Group Address before: B353, building 13, No. 232, Waihuan East Road, Xiaoguwei street, Panyu District, Guangzhou City, Guangdong Province Patentee before: GUANGDONG GUANGLIAN ELECTRONIC TECHNOLOGY Co.,Ltd. |
|
| TR01 | Transfer of patent right |