CN106130824A - Integration of three networks broadband access priority polling control method and system - Google Patents
Integration of three networks broadband access priority polling control method and system Download PDFInfo
- Publication number
- CN106130824A CN106130824A CN201610584038.7A CN201610584038A CN106130824A CN 106130824 A CN106130824 A CN 106130824A CN 201610584038 A CN201610584038 A CN 201610584038A CN 106130824 A CN106130824 A CN 106130824A
- Authority
- CN
- China
- Prior art keywords
- service
- node
- frame
- data
- information
- 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.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/20—Traffic policing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
- H04L12/2854—Wide area networks, e.g. public data networks
- H04L12/2856—Access arrangements, e.g. Internet access
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/10—Active monitoring, e.g. heartbeat, ping or trace-route
- H04L43/103—Active monitoring, e.g. heartbeat, ping or trace-route with adaptive polling, i.e. dynamically adapting the polling rate
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/24—Traffic characterised by specific attributes, e.g. priority or QoS
- H04L47/2425—Traffic characterised by specific attributes, e.g. priority or QoS for supporting services specification, e.g. SLA
- H04L47/2433—Allocation of priorities to traffic types
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Health & Medical Sciences (AREA)
- Cardiology (AREA)
- General Health & Medical Sciences (AREA)
- Small-Scale Networks (AREA)
Abstract
The present invention relates to a kind of integration of three networks broadband access priority polling control method and system, specifically by the Internet, telecommunications network and Broadcasting Cable Network three macroreticular field.The Frame of different service types in system is respectively provided with and makes a distinction with different control frame marks by the present invention, judge to select the priority type of current data frame conveying by the HM_QoS flag bit of frame, the system node subsequently into respective priority carries out information transmission by corresponding service regulation.In the data information transfer service system of system node, use the mode of polling system, system interior joint be divided into four classes by transmission priority, be respectively limit (k=1) service, limit (k=2) service, limit (k=3) service and limit (k=4) service.By the transmission carrying out data message that the judgement to polling system flag of frame position is the most orderly between inhomogeneous node, and the information block number of inhomogeneity node can be serviced respectively by the service regulation of different priorities when the information of transmission.
Description
Technical field
The present invention relates to a kind of integration of three networks broadband access priority polling control method and system, relate to the Internet, electricity
Letter net and Broadcasting Cable Network three macroreticular field.
Background technology
The integration of three networks refers to that the Internet, telecommunications network and Broadcasting Cable Network three macroreticular make it merge into each other by improvement technology,
Realize sharing the functions such as resource, voice call and online.At present, the integration of three networks is universal to the whole nation energetically from pilot phase pushes away
The wide stage strides forward, and this just requires in the qualitative leap to be had of core technology aspect and breakthrough.And access network technology to be always three big
The key that network promotes after melting mutually, therefore the performance improving access network serves key work to the development promoting triple play technology
With, in access network technology, China uses HINOC(HIgh performance Network Over Coax) technical bid
Standard, at present, HINOC1.0 technology is the most issued standard, and HINOC2.0 standard is in just in conceptual phase.
HINOC system is to be called for short HB by HINOC Bridge() and HINOC Modem(abbreviation HM) constitute, so-called HINOC
Access network refers to last hundred meters of transmission ranges of fiber-to-the-subscriber, and broadband reasonable distribution is given an individual system of each HM.
HINOC broadband technology high performance communication require MAC(Medium Access Control) agreement have differentiation different business preferential
The multipriority system security function of level, so the multipriority that the scheduling mechanism improving MAC layer realizes system has reality meaning
Justice.
HINOC MAC protocol have employed the mode of polling system, distinguish priority and can meet delay sensitive business
Demand.Restriction k=N service system in polling system can well control system information send time delay service quality, at this
In by the different values of N (the most different k value represent different COS) are distinguished different priority, N value is the biggest, one
Secondary transmission data volume is the biggest, and priority is the highest, thus reaches the control mode of multipriority.Such as, in actual applications, often
There is the time delay service quality etc. that the different business information requirements in same system are different, those are carried and contains much information and right
The data that requirement of real-time is high, need the several data of disposable many transmissions, so can send in the way of using priority high；
Quantity of information for carrying is relatively fewer and allows the data of certain time-delay then to can use relatively low priority to send；And for
It is little that some carry quantity of information, it is allowed to the data of relatively long delay alternatively even select the mode number the most only sending data
According to transmission.In sum, the service strategy distinguishing multipriority control mode can meet miscellaneous service diversity demand, simultaneously
The efficiency of HINOC access technology can be improved again.
Summary of the invention
It is an object of the invention to provide a kind of integration of three networks broadband access priority polling control method and system, by
One HINOC system distinguishes four class priority service with four class Limited service strategies, thus realizes with this multipriority
The mode controlled meets the different business information different transmission demands to service quality such as time delays in actual applications, thus excellent
Change and the broadband access of the business of lifting.
For achieving the above object, a kind of integration of three networks of present invention broadband access priority polling control method and the side of system
Case includes: system uses HINOC mac-layer protocol, is respectively provided with the Frame of different service types in system with different controls
Flag of frame processed makes a distinction, and judges to select the priority type of current data frame conveying by the HM_QoS flag bit of frame,
System node subsequently into respective priority carries out information transmission by corresponding service regulation；
The mode of polling system is used in the data information transfer service system of system node, system interior joint is excellent by transmission
First level is divided into four classes, is respectively and limits (k=1) and service, limit (k=2) and service, limit (k=3) and service and limit (k=4) service；
By the transmission carrying out data message that the judgement to polling system flag of frame position is the most orderly between inhomogeneous node, and
The information block number making inhomogeneity node can be serviced by the service regulation of different priorities respectively when the information of transmission,
Ensure for different service types information providing system multipriority function, when meeting the transmission of different pieces of information information, system is distinguished
The demand of multipriority, final optimization pass and the broadband access improving business.
Integration of three networks broadband access priority polling system system, including:
For netinit, it is the mould that different priorities controls flag bit by system different service types Frame relative set
Block；
Flag bit for decision node selects respective service rule to carry out the module of information transmission；
For sending the data processing module carrying out the information block number serviced by restriction (k=1) service regulation；
For sending the data processing module carrying out the information block number serviced by restriction (k=2) service regulation；
For sending the data processing module carrying out the information block number serviced by restriction (k=3) service regulation；
For sending the data processing module carrying out the information block number serviced by restriction (k=4) service regulation；
For turning to the next HM of inquiry and judging that HM polling list the most all receives the module of service.
Described system HINOC mac-layer protocol uses stelliform connection topology configuration, with central node for controlling node HB, is then similar to
The HINOC MAC protocol of the MAC layer PCF point coordination function P of IEEE802.11, uses mode CF(Point that multipriority controls
Coordinator Function) central access point AP；In HINOC1.0, a HB can be connected with 32 HM, and HM receives HB
The signal transmitted, the frame received becomes downlink frame；HB receives HM and transmits the signal come up, and the frame received becomes up
Frame, can not communicate between each HM；HB is connected to the end of light device, and the other end is connected with HM again, its both connecing as optical signal
Mouth can control the node whole HINOC system order of control as center again and run efficiently, by coaxial cable, HM says that HB sets
It is standby that terminal is connected with user's TV, PC etc.；HB sends frame according to the set time of agreement and carrys out the distribution of regulation next one channel to HM
Scheme, the channel cycle that MAP frame is planned is called MAP cycle.
Described integration of three networks broadband access priority polling control method, comprises the steps:
(1) each MAP cycle is initialized: now will send R frame report current queue situation and ensuing periodic channel to HB by HM
Operational version, HB is to the HM broadcast frame i.e. channel allocation plan of next cycle；
(2) judging that MAP authorizes: judge that HM has obtained the mandate of HB by R frame, if authorized, HM then adds poll row
Table, otherwise continues to send R frame report queue situation until obtaining the channel right to use；
(3) each HM adds polling list: enter the preparation acceptance service of existing polling list by obtaining the HM authorized；
Each ethernet frame transmits in the channel: by HINOC systemic-function, and each ethernet frame is fragmented/recombinates, packing/unpacking
After obtain HIMAC Frame and transmit in the channel；
(4) HM_QoS flag bit is judged: the inhomogeneity data of different control frame marks are serviced by restriction (k=1), limited respectively
(k=2) service, limit (k=3) and service and limit (k=4) and service four kinds of different service regulation transmitting data informations.
(5) Frame of different service types in system be respectively provided with make a distinction with different control frame marks,
Judge to select the service regulation of current data frame conveying by the HM_QoS flag bit of frame, then enter by corresponding service regulation
Row information is transmitted.
(6) by limiting (k=N) service regulation transfer data information period: intercept channel, according to whether receive control frame
Come whether decision node carries out data transmission.If receiving without control frame, then the inquiry service to this node of jumping out turns under inquiry
One node；If there being control frame to receive, then and then judge whether this node has data to send, i.e. whether node internal information packet count is
Zero.If this node internal information packet count is not zero, then carry out sending out by limiting k=N service regulation to the information block number in this node
Sending, after being sent completely, the inquiry service to this node of jumping out turns to inquiry next node；If this node internal information packet count is
Zero, then the inquiry service to this node of jumping out turns to inquiry next node.
The described service regulation limiting (k=N) Service Polling System as:
N number of information block in each non-empty queue is serviced successively by server according to rule, and at most services N number of every time
Information block.
Turn to the next HM of inquiry: to the information block in polling list successively poll, until the polling list of HM is whole
Serviced.
Judge that HM polling list the most all receives service: whole process enters ensuing MAP cycle after terminating.
The each MAP cycle of described initialization is particularly as follows: first MAP frame distributes channel according to the report of R frame, and HB licenses to
HM, carries information according to HIMAC frame afterwards and the Frame of identical services is packaged into respective priority query, the most laggard
Enter the channel that R frame distributed to be transmitted to respective queue.
Described intercept the period method particularly includes: node enters after intercepting the period, arrange and start correspondence when intercepting the period
Between timer T2, activate be in the state of intercepting.
The described transmission period method particularly includes: if node has data to need to send, then randomly generate one at time window
Back off time, node is to one back off time of channel sense；After intercepting end, if node listens to the flag bit of oneself correspondence,
The data then with respective service rule, this node being carried out information block send, and data send to jump out after terminating and look into this node
Inquiry service turns to inquiry next node；
If node does not has data to need to send, then node is the most then jumped out the inquiry service to this node and is turned to next joint of inquiry
Point, this node send the period terminate.
In described system, the priority of different service types Frame and the selection sort method of COS are: at poll
In system specialization (K=N) service, limit (K=1) service and can meet data transmission real-time and reliability requirement, limit (K=2)
Service is taken second place, the like, in the COS limiting (K=N), numerical value its data transmission delay the biggest of N is the biggest, transmission
Quantity of information the least；Therefore (K=1) service of restriction can be considered as the data transport service with limit priority by descriptive system
Type, takes second place and services for restriction (K=2), and third priority is for limiting (K=3) service, and the priority that restriction (k=4) services is minimum.
The present invention proposes a kind of new HINOC MAC protocol, uses the mode that multipriority controls, by different in system
The Frame of type of service is respectively provided with and makes a distinction with different control frame marks, is sentenced by the HM_QoS flag bit of frame
The disconnected priority type selecting current data frame conveying, the system node subsequently into respective priority presses corresponding service regulation
The information of carrying out transmission.In the data information transfer service system of system node, use the mode of polling system, will system save
Press transmission priority and be divided into four classes, be respectively and limit (k=1) and service, limit (k=2) and service, limit (k=3) and service and limit
(k=4) service.Data message is carried out by the most orderly to the judgement of polling system flag of frame position between inhomogeneous node
Transmission, and the information block number of inhomogeneity node can be advised respectively by the service of different priorities when the information of transmission
Then service.
The present invention provides the multipriority control mode of new HINOC MAC layer, it is achieved that in actual applications, by one
Plant simple mode different service types information providing system multipriority function is ensured, thus meet different pieces of information information and pass
Time defeated, system is distinguished the demand of multipriority, final optimization pass and the broadband access improving business.
Accompanying drawing explanation
Fig. 1 is HINOC building-block of logic in the present invention；
Fig. 2 is MAP cycle figure in the present invention；
Fig. 3 is data frame format figure in the present invention；
Fig. 4 is interior joint conversion in type schematic diagram of the present invention；
Fig. 5 is present system work process schematic flow sheet；
Fig. 6 is restriction k=N service module work process schematic flow sheet in the present invention；
Fig. 7 is to only have No. 1 node to have data to the FPGA hardware analogous diagram in the case of sending during present system work；
FPGA hardware analogous diagram in the case of No. 2 and No. 3 nodes have data to transmission when Fig. 8 is present system work；
FPGA hardware analogous diagram in the case of No. 3 nodes only have 1 data to send when Fig. 9 is present system work；
When Figure 10 is present system work, 4 nodes all have data to the FPGA hardware analogous diagram in the case of sending.
Detailed description of the invention
The present invention will be further described in detail below in conjunction with the accompanying drawings:
One integration of three networks broadband access priority polling control method of the present invention, comprises the steps:
Initialize each MAP cycle: now HM sends R frame report current queue situation and ensuing periodic channel user to HB
Case, HB is to the HM broadcast frame i.e. channel allocation plan of next cycle.
Judging that MAP authorizes: judge that HM has obtained the mandate of HB by R frame, if authorized, HM then adds poll row
Table, otherwise continues to send R frame report queue situation until obtaining the channel right to use.
Each HM adds polling list: enter the preparation acceptance service of existing polling list by obtaining the HM authorized.
Each ethernet frame transmits in the channel: by HINOC systemic-function, and each ethernet frame is fragmented/recombinates, and packing/
Obtain HIMAC Frame after unpacking to transmit in the channel.
Judge HM_QoS flag bit: the inhomogeneity data of different control frame marks are serviced by restriction (k=1), limited respectively
(k=2) service, limit (k=3) and service and limit (k=4) and service four kinds of different service regulation transmitting data informations.
The Frame of different service types in system is respectively provided with and makes a distinction with different control frame marks, pass through
The HM_QoS flag bit of frame judges to select the service regulation of current data frame conveying, then carries out letter by corresponding service regulation
Breath transmission.
By limiting (k=N) service regulation transfer data information period: intercept channel, sentence according to whether receive control frame
Whether disconnected node carries out data transmission.If receiving without control frame, then the inquiry service to this node of jumping out turns to next joint of inquiry
Point；If there being control frame to receive, then and then judge whether this node has data to send, i.e. whether node internal information packet count is zero.
If this node internal information packet count is not zero, then the information block number in this node is transmitted by limiting k=N service regulation,
After being sent completely, the inquiry service to this node of jumping out turns to inquiry next node；If this node internal information packet count is zero, then
The inquiry service to this node of jumping out turns to inquiry next node.
Limit the service regulation of (k=N) Service Polling System as:
N number of information block in each non-empty queue is serviced successively by server according to rule, and at most services N number of every time
Information block.
Turn to the next HM of inquiry: to the information block in polling list successively poll, until the polling list of HM is whole
Serviced.
Judge that HM polling list the most all receives service: whole process enters ensuing MAP cycle after terminating.
The each MAP cycle of described initialization is particularly as follows: first MAP frame distributes channel according to the report of R frame, and HB licenses to
HM, carries information according to HIMAC frame afterwards and the Frame of identical services is packaged into respective priority query, the most laggard
Enter the channel that R frame distributed to be transmitted to respective queue.
Intercept the period method particularly includes:
Node enters after intercepting the period, arranges and starts correspondence and intercept the timer T2 of period of time, activates and be in the state of intercepting.
Send the period method particularly includes:
If node has data to need to send, then randomly generating a back off time at time window, channel sense one is moved back by node
Keep away the time；After intercepting end, if node listens to the flag bit of oneself correspondence, then this node is carried out letter with respective service rule
The data of breath packet send, and data transmission is jumped out the inquiry service to this node after terminating and turned to inquiry next node；
If node does not has data to need to send, then node is the most then jumped out the inquiry service to this node and is turned to next joint of inquiry
Point, this node send the period terminate.
In system, the priority of different service types Frame and the selection sort method of COS are: in polling system
Limit in (K=N) service, limit (K=1) service and can meet data transmission real-time and reliability requirement, limit (K=2) service
Take second place, the like, in the COS limiting (K=N), numerical value its data transmission delay the biggest of N is the biggest, the letter of transmission
Breath amount is the least.Therefore (K=1) service of restriction can be considered as in system described herein the data transmission with limit priority
COS, takes second place for limiting (K=2) service, and third priority, for limiting (K=3) service, limits the priority that (k=4) services
Minimum.So, those are carried and contains much information and the data message high to requirement of real-time, just can be masked as Gao You
First level, is transmitted with the method for service of restriction (K=1), in order to can guarantee that the integrity of data message, accuracy and real-time；
Quantity of information for carrying is relatively fewer and allows the data of certain time-delay then can be masked as time high priority, to limit
(K=2) method of service is transmitted；Quantity of information for carrying is few and allows the data of relatively long delay then can be indicated
For third priority, it is transmitted with the method for service of restriction (K=3)；Quantity of information is carried little finally, for some, it is allowed to time
Bigger time delay between real-time is not had hard requirement data we just optional be masked as lowest priority, with limit
The method of service of fixed (k=4) is transmitted.The most just the priority to different service types Frame and COS are achieved
Selection sort.
A kind of integration of three networks broadband access priority polling system system, including:
For netinit, it is the mould that different priorities controls flag bit by system different service types Frame relative set
Block；
Flag bit for decision node selects respective service rule to carry out the module of information transmission；
For sending the data processing module carrying out the information block number serviced by restriction (k=1) service regulation；
For sending the data processing module carrying out the information block number serviced by restriction (k=2) service regulation；
For sending the data processing module carrying out the information block number serviced by restriction (k=3) service regulation；
For sending the data processing module carrying out the information block number serviced by restriction (k=4) service regulation；
For turning to the next HM of inquiry and judging that HM polling list the most all receives the module of service.
If Fig. 1 is HINOC building-block of logic in the present invention, HINOC mac-layer protocol uses stelliform connection topology configuration, with center
Node is for controlling the MAC layer PCF point coordination function PCF(Point Coordinator of the similar IEEE802.11 of node (HB)
Function) central access point AP.In HINOC1.0, a HB can be connected with 32 HM, and HM receives the letter that HB transmits
Number, the frame received becomes downlink frame；HB receives HM and transmits the signal come up, and the frame received becomes uplink frame, between each HM
Can not communicate.For macroscopically, HB is connected to the end of light device, and the other end is connected with HM again, its both connecing as optical signal
Mouth can control the node whole HINOC system order of control as center again and run efficiently, by coaxial cable, HM says that HB sets
It is standby that terminal is connected with user's TV, PC etc..
HB sends frame according to the set time of agreement and carrys out regulation next one channel assignment scheme to HM, and a MAP frame is advised
The channel cycle drawn is called MAP cycle, and if Fig. 2 is MAP cycle figure in the present invention, concrete order is: MAP frame is first according to R
The report of frame distributes channel, and HB licenses to HM, the Frame of equal priority is packaged into respective priority query, finally
Packing transmission.
If Fig. 3 is data frame format in the present invention, stem, subframe head set, each subframe, filling and five portions of CRC check
Being grouped into HINOC2.0 Frame, stem comprises the mark of each HM, extends each subframe leader will, number of subframes and in order to identify
First and the burst information of last position ethernet frame.The HM_PRI two priority classes field of addition one 8 in the stem of frame, 1 ~
2 limit priorities representing that flag bit is " 00 ", use and limit k=1 service strategy；3 ~ 4 represent that flag bit is the secondary of " 01 "
High priority, uses and limits k=2 service strategy；5 ~ 6 third priority representing that flag bit is " 10 ", use and limit k=3 clothes
Business strategy；7 ~ 8 lowest priorities representing that flag bit is " 11 ", use and limit k=4 service strategy.
If table 1 is grid polling list polling table, initializing each MAP cycle stage, first MAP frame comes according to the report of R frame
Distribution channel, HB licenses to HM, carries information according to HIMAC frame afterwards and is packaged into the Frame of identical services each
Priority query, finally enters the channel that R frame distributed and is transmitted to respective queue.Judge that HM has obtained HB by R frame
Mandate, if authorized, HM then adds polling list, will obtain authorize HM enter existing polling list prepare accept
Service.
Table 1 is grid polling list polling table in the present invention；
As can be seen from the table, system accesses each node the most successively, can be simply to the poll in model
Mechanism is done as described below:
At initial phase, first distributing channel according to the report of R frame, HB licenses to HM, carries letter according to HIMAC frame afterwards
Cease the Frame to identical services and be packaged into respective priority query, it is judged that HM has obtained the mandate of HB by R frame,
If authorized, HM then adds polling list, enters the preparation acceptance service of existing polling list by obtaining the HM authorized.
In 1.1 systems, each category node indicates its search order with 1,2,3,4 respectively.
Data in category node each in system are collected, merge by polling mode by 1.2 wireless networks, its information
Transmission uses the more rules service strategy of many Time Continuous.
If Fig. 2 is system interior nodes conversion in type schematic diagram；Fig. 3 is system work process schematic flow sheet.The present invention is
A kind of improvement based on a kind of integration of three networks broadband access priority polling control method, each category node in system is at Life Cycle
The mode of polling dispatching is used in phase.One cycle period need successively four category nodes to be conducted interviews and to each category node by
Corresponding service regulation carries out information transmission, is specifically introduced below:
Each MAP cycle is initialized, it is judged that HM adds polling list after authorizing, and system is in work afterwards after 2.1 system start-up work
During access each category node the most successively, only listen to the polling system frame of this category node when requiring to intercept simultaneously every time
Time this category node just enter service state, the inquiry service to this node of otherwise jumping out turns to inquiry next node.
If the HM_QoS flag bit of current queries is judged as " 00 " by 2.2, then enters and limit k=1 method of service,
To service information block number by the rule limiting k=1 service in this inquiry service process, i.e. server is according to rule
Successively 1 information block in each non-empty queue is serviced, and the most at most one information block of service.Current site
Service completes rear steering inquiry next node, continues collection information.
If the HM_QoS flag bit of current queries is judged as " 01 " by 2.3, then enters and limit k=2 method of service,
To service information block number by the rule limiting k=2 service in this inquiry service process, i.e. server is according to rule
Successively 2 information block in each non-empty queue are serviced, and the most at most two information block of service.Current site
Service completes rear steering inquiry next node, continues collection information.
If the HM_QoS flag bit of current queries is judged as " 10 " by 2.4, then enters and limit k=3 method of service,
To service information block number by the rule limiting k=3 service in this inquiry service process, i.e. server is according to rule
Successively 3 information block in each non-empty queue are serviced, and the most at most three information block of service.Current site
Service completes rear steering inquiry next node, continues collection information.
If the HM_QoS flag bit of current queries is judged as " 11 " by 2.5, then enters and limit k=4 method of service,
To service information block number by the rule limiting k=4 service in this inquiry service process, i.e. server is according to rule
Successively 4 information block in each non-empty queue are serviced, and the most at most four information block of service.Current site
Service completes rear steering inquiry next node, continues collection information.
2.6 within a HM working cycle by according to 1 in search order access system successively, 2,3,4 four category nodes, one
Secondary inquiry service terminate after on the next HM working cycle starts and repeats a HM periodic process, visit successively according to search order
Asking 1 in system, 2,3,4 four category nodes, so work is gone down, until HM polling list all receives service, just power cut-off.
In order to preferably understand this control method, we are worked by the system shown in Fig. 7, Fig. 8, Fig. 9 and Figure 10
What FPGA hardware analogous diagram was actual analyzes the control method the most of the present invention concrete condition when system works.
In 3.1 systems shown herein work FPGA hardware analogous diagram, system detection pulse clk rising edge is effective, on this
Rise along represent the poll frame of each category node in system；T1 represents the restriction k=1 COS that control frame flag bit is " 00 "
Node carry out data transmission, it is that " 01 " limits the node of k21 COS and carries out data to control frame flag bit that t2 represents
Transmission, it be that " 10 " limit the node of k=3 COS and carry out data transmission to control frame flag bit that t3 represents, and t4 representative is to control
Flag of frame position processed is that the node of the restriction k=4 COS of " 11 " carries out data transmission.
Em1 represents has no data to need transmission in each node that flag bit is " 00 ", and em1 is that 0 interval scale has data to need
Transmitting, em1 is that 1 interval scale no data needs transmission；Em2 represents has no data to need to pass in each node that flag bit is " 01 "
Defeated, and em2 be 0 interval scale have data need transmission, em2 be 1 interval scale no data need transmission；Em3 represents flag bit
Having no data to need transmission in each node of " 10 ", and em3 is that 0 interval scale has data to need transmission, em3 is that 1 interval scale is countless
Transmit according to needs；Em4 represents has no data to need transmission in each node that flag bit is " 11 ", and em4 is that 0 interval scale has data
Needing transmission, em4 is that 1 interval scale no data needs transmission.Wherein, em1 in actual applications, being given of em2, em3, em4 should
Be given by intra-node system.
3.1.1 for limiting in each node that k=1 services, if no data, i.e. information block number n1 in node during detection
Be 0, then em1 is 1；If there being data, i.e. during detection, the information block number n1 in node is not 0, then em1 is 0, now node domestic demand
With certain internal processes n1 is changed thus controls the saltus step of em1, namely sent a data then n1 and become
0, em1 saltus step is 1 then.
3.1.2 for limiting in each node that k=2 services, if no data, i.e. information block number n2 in node during detection
Be 0, then em2 is 1；If there being data, i.e. during detection, the information block number n2 in node is not 0, then em2 is 0, now node domestic demand
With certain internal processes n2 is changed thus controls the saltus step of em2, namely sent a data then n2 and subtracted 1,
If n2 becomes 0 after subtracting 1, then em2 saltus step is 1, if n2 is not 0 after subtracting 1, then continues to retransmit a data relief n2 and becomes 0, continue
And em2 saltus step is 1.
3.1.3 for limiting in each node that k=3 services, if no data, i.e. information block number n3 in node during detection
Be 0, then em3 is 1；If there being data, i.e. during detection, the information block number n3 in node is not 0, then em3 is 0, now node domestic demand
With certain internal processes n3 is changed thus controls the saltus step of em3, namely sent a data then n3 and subtracted 1,
If n3 becomes 0 after subtracting 1, then em3 saltus step is 1, if n3 is not 0 after subtracting 1, then continues to retransmit second data, and n3 subtracts again therewith
1, if n3 becomes 0 after subtracting 1 again, then em3 saltus step is 1, if n3 is not 0 after subtracting 1 again, then continues to send the 3rd data relief n3 and becomes
Being 0, em3 saltus step is 1 then.
3.1.4 for limiting in each node that k=4 services, if no data, i.e. information block number n4 in node during detection
Be 0, then em4 is 1；If there being data, i.e. during detection, the information block number n4 in node is not 0, then em4 is 0, now node domestic demand
With certain internal processes n4 is changed thus controls the saltus step of em4, namely sent a data then n4 and subtracted 1,
If n4 becomes 0 after subtracting 1, then em4 saltus step is 1, if n4 is not 0 after subtracting 1, then continues to retransmit second data, and n4 subtracts again therewith
1, if n4 becomes 0 after subtracting 1 again, then em4 saltus step is 1, if n4 is not 0 after subtracting 1 again, then continues to send the 3rd data, then n4
Third time subtracts 1, if n4 third time becomes 0 after subtracting 1, then em4 saltus step is 1, if n4 third time is not 0 after subtracting 1, then continues to retransmit
Fourth data relief n4 becomes 0, and em4 saltus step is 1 then.
3.2 as it is shown in fig. 7, after system starts, carried out inquiry service successively by search order to four category nodes.When
First detects in the effective impulse that em1 is zero (i.e. control frame flag bit is to have data latency to transmit inside the node of " 00 ")
Rise along coming interim, be transmitted (being reflected as t1 the most in the drawings and having one by limiting k=1 service regulation to data in No. 1 node
The data transmission time is not zero)；Next category node is inquired about, due to the 2nd, 3,4 class joints when first kind node serve completes rear steering
Point does not all have data send, therefore after system three the inquiry conversion time, an end cycle of system.
3.3 as shown in Figure 8, after system starts, four category nodes carries out by search order inquiry service successively.One
Information Number in number node is zero always, therefore first node being detected data is No. 2 nodes, when first detects
Em2 is that the effective impulse rising edge of zero (i.e. control frame flag bit is to have data latency to transmit inside the node of " 01 ") comes interim,
It is transmitted (being reflected as t2 the most in the drawings and having two data transmission times by limiting k=2 service regulation to data in No. 2 nodes
It is not zero)；Next category node is inquired about, when second detects that em3 is zero (i.e. to control when Equations of The Second Kind node serve completes rear steering
Flag of frame position is to have data latency to transmit inside the node of " 10 ") effective impulse rising edge come interim, to data in No. 3 nodes
It is transmitted (being reflected as t3 the most in the drawings has three data transmission times to be not zero), when the 3rd by limiting k=3 service regulation
Category node service completes rear steering and inquires about next category node, and in No. 4 nodes, data are zero, do not have data to be transmitted, therefore one
After the inquiry conversion time, an end cycle of system.
3.4 as it is shown in figure 9, after system starts, carried out inquiry service successively by search order to four category nodes.Figure
Shown in system in No. 1 and No. 2 nodes data to be sent be zero, therefore first node being detected data is No. 3
Node (see having been added the wide line position of a blueness/Lycoperdon polymorphum Vitt in FPGA analogous diagram 9 No. three node serve periods, this color line
Bar only for auxiliary display explanation with), when first detects that em3 is that zero (i.e. control frame flag bit is to have inside the node of " 10 "
Data latency transmits) effective impulse rising edge come interim, data in No. 3 nodes are transmitted by limiting k=3 service regulation,
Due to only 1 data to be sent in No. 3 nodes, therefore the data just terminating this node after having sent 1 data are transmitted (now
Be reflected as t3 in the drawings to have 1 data to send the time to be not zero), due in No. 4 nodes without data to be transmitted, a therefore inquiry turn
After changing the time, an end cycle of system.
3.5 as shown in Figure 10, after system starts, four category nodes carries out by search order inquiry service successively.When
First detects in the effective impulse that em1 is zero (i.e. control frame flag bit is to have data latency to transmit inside the node of " 00 ")
Rise along coming interim, be transmitted (being reflected as t1 the most in the drawings and having one by limiting k=1 service regulation to data in No. 1 node
The data transmission time is not zero)；Next category node is inquired about, when second detects when first kind node serve completes rear steering
Em2 is that the effective impulse rising edge of zero (i.e. control frame flag bit is to have data latency to transmit inside the node of " 01 ") comes interim,
It is transmitted (being reflected as t2 the most in the drawings and having two data transmission times by limiting k=2 service regulation to data in No. 2 nodes
It is not zero)；Next category node is inquired about, when the 3rd detects that em3 is zero (i.e. to control when Equations of The Second Kind node serve completes rear steering
Flag of frame position is to have data latency to transmit inside the node of " 10 ") effective impulse rising edge come interim, to data in No. 3 nodes
It is transmitted (being reflected as t3 the most in the drawings has three data transmission times to be not zero) by limiting k=3 service regulation；When the 3rd
Category node service completes rear steering and inquires about next category node, when the 4th detects and em4 be zero (i.e. control frame flag bit is " 11 "
Node inside have data latency to transmit) effective impulse rising edge come interim, to data in No. 4 nodes by limiting k=4 service
Rule is transmitted (being reflected as t4 the most in the drawings has four data transmission times to be not zero), so far, a cycle of system
Terminate.
Claims (8)
1. an integration of three networks broadband access priority polling control method and system, it is characterised in that system uses HINOC
Mac-layer protocol, is respectively provided with the Frame of different service types in system and makes a distinction with different control frame marks, logical
Cross the HM_QoS flag bit of frame and judge to select the priority type of current data frame conveying, subsequently into respective priority be
System node carries out information transmission by corresponding service regulation；Poll is used in the data information transfer service system of system node
The mode controlled, is divided into four classes by system interior joint by transmission priority, is respectively restriction (k=1) and services, limits (k=2) clothes
Business, restriction (k=3) service and limit (k=4) service；By the judgement to polling system flag of frame position between inhomogeneous node
The most orderly transmission carrying out data message, and the information block number of inhomogeneity node can be divided when the information of transmission
Do not service by the service regulation of different priorities, protect for different service types information providing system multipriority function
Barrier, distinguishes the demand of multipriority, final optimization pass and the broadband improving business to system when meeting the transmission of different pieces of information information
Access.
Integration of three networks broadband access priority polling control method the most according to claim 1 and system, it is characterised in that
Integration of three networks broadband access priority polling system system, including:
For netinit, it is the mould that different priorities controls flag bit by system different service types Frame relative set
Block；
Flag bit for decision node selects respective service rule to carry out the module of information transmission；
For sending the data processing module carrying out the information block number serviced by restriction (k=1) service regulation；
For sending the data processing module carrying out the information block number serviced by restriction (k=2) service regulation；
For sending the data processing module carrying out the information block number serviced by restriction (k=3) service regulation；
For sending the data processing module carrying out the information block number serviced by restriction (k=4) service regulation；
For turning to the next HM of inquiry and judging that HM polling list the most all receives the module of service.
Integration of three networks broadband access priority polling control method the most according to claim 1 and 2 and system, its feature exists
Use stelliform connection topology configuration in described system HINOC mac-layer protocol, with central node for controlling node HB, be then similar to
The HINOC MAC protocol of the MAC layer PCF point coordination function P of IEEE802.11, uses mode CF(Point that multipriority controls
Coordinator Function) central access point AP；In HINOC1.0, a HB can be connected with 32 HM, and HM receives HB
The signal transmitted, the frame received becomes downlink frame；HB receives HM and transmits the signal come up, and the frame received becomes up
Frame, can not communicate between each HM；HB is connected to the end of light device, and the other end is connected with HM again, its both connecing as optical signal
Mouth can control the node whole HINOC system order of control as center again and run efficiently, by coaxial cable, HM says that HB sets
It is standby that terminal is connected with user's TV, PC etc.；HB sends frame according to the set time of agreement and carrys out the distribution of regulation next one channel to HM
Scheme, the channel cycle that MAP frame is planned is called MAP cycle.
Integration of three networks broadband access priority polling control method the most according to claim 1 and 2 and system, its feature exists
In described integration of three networks broadband access priority polling control method, comprise the steps:
(1) each MAP cycle is initialized: now will send R frame report current queue situation and ensuing periodic channel to HB by HM
Operational version, HB is to the HM broadcast frame i.e. channel allocation plan of next cycle；
(2) judging that MAP authorizes: judge that HM has obtained the mandate of HB by R frame, if authorized, HM then adds poll row
Table, otherwise continues to send R frame report queue situation until obtaining the channel right to use；
(3) each HM adds polling list: enter the preparation acceptance service of existing polling list by obtaining the HM authorized；
Each ethernet frame transmits in the channel: by HINOC systemic-function, and each ethernet frame is fragmented/recombinates, packing/unpacking
After obtain HIMAC Frame and transmit in the channel；
(4) HM_QoS flag bit is judged: the inhomogeneity data of different control frame marks are serviced by restriction (k=1), limited respectively
(k=2) service, limit (k=3) and service and limit (k=4) and service four kinds of different service regulation transmitting data informations;
(5) Frame of different service types in system is respectively provided with makes a distinction with different control frame marks, pass through
The HM_QoS flag bit of frame judges to select the service regulation of current data frame conveying, then carries out letter by corresponding service regulation
Breath transmission;
(6) by limiting (k=N) service regulation transfer data information period: intercept channel, sentence according to whether receive control frame
Whether disconnected node carries out data transmission;If receiving without control frame, then the inquiry service to this node of jumping out turns to next joint of inquiry
Point；If there being control frame to receive, then and then judge whether this node has data to send, i.e. whether node internal information packet count is zero;
If this node internal information packet count is not zero, then the information block number in this node is transmitted by limiting k=N service regulation,
After being sent completely, the inquiry service to this node of jumping out turns to inquiry next node；If this node internal information packet count is zero, then
The inquiry service to this node of jumping out turns to inquiry next node.
Integration of three networks broadband access priority polling control method the most according to claim 1 and system, it is characterised in that
The described service regulation limiting (k=N) Service Polling System as: server according to rule N number of in each non-empty queue successively
Information block services, and at most services N number of information block every time;Turn to the next HM of inquiry: to the letter in polling list
Breath is grouped poll successively, until the polling list of HM is all serviced;Judge that HM polling list the most all receives service: whole
Process enters ensuing MAP cycle after terminating;The each MAP cycle of described initialization is particularly as follows: MAP frame is first according to the report of R frame
Accusing and distribute channel, HB licenses to HM, carries information according to HIMAC frame afterwards and is packaged into the Frame of identical services
Each priority query, finally enters the channel that R frame distributed and is transmitted to respective queue.
Integration of three networks broadband access priority polling control method the most according to claim 1 and system, it is characterised in that
Described intercept the period method particularly includes: node enters after intercepting the period, arranges and starts correspondence and intercepts the timing of period of time
Device T2, activates and is in the state of intercepting.
Integration of three networks broadband access priority polling control method the most according to claim 1 and system, it is characterised in that
The described transmission period method particularly includes: if node has data to need to send, then randomly generate a back off time at time window,
Node is to one back off time of channel sense；After intercepting end, if node listens to the flag bit of oneself correspondence, then to this node
The data carrying out information block with respective service rule send, and data transmission is jumped out the inquiry service to this node after terminating and turned to
Inquiry next node；If node does not has data to need to send, then node is the most then jumped out the inquiry service to this node and is turned to and look into
Asking next node, this node transmission period terminates.
Integration of three networks broadband access priority polling control method the most according to claim 1 and system, it is characterised in that
In described system, the priority of different service types Frame and the selection sort method of COS are: limit in polling system
(K=N), in service, limit (K=1) service and can meet data transmission real-time and reliability requirement, limit (K=2) service time
It, the like, in the COS limiting (K=N), numerical value its data transmission delay the biggest of N is the biggest, the information of transmission
Measure the least；Therefore (K=1) service of restriction can be considered as the data transport service type with limit priority by descriptive system, secondary
For limiting (K=2) service, third priority, for limiting (K=3) service, limits (k=4) priority of servicing minimum.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610584038.7A CN106130824B (en) | 2016-07-22 | 2016-07-22 | Integration of three networks broadband access priority polling control method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610584038.7A CN106130824B (en) | 2016-07-22 | 2016-07-22 | Integration of three networks broadband access priority polling control method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106130824A true CN106130824A (en) | 2016-11-16 |
| CN106130824B CN106130824B (en) | 2019-04-30 |
Family
ID=57290329
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610584038.7A Active CN106130824B (en) | 2016-07-22 | 2016-07-22 | Integration of three networks broadband access priority polling control method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106130824B (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109873723A (en) * | 2019-02-28 | 2019-06-11 | 武汉晟联智融微电子科技有限公司 | Bandwidth on-demand distribution method based on node traffic priority |
| CN111865750A (en) * | 2020-06-30 | 2020-10-30 | 北京瀚诺半导体科技有限公司 | Message transmission method and system based on two-layer network |
| CN111901252A (en) * | 2020-06-16 | 2020-11-06 | 北京瀚诺半导体科技有限公司 | Method and system for transmitting network management message |
| CN112996045A (en) * | 2021-02-04 | 2021-06-18 | 深圳市吉祥腾达科技有限公司 | Method and system for forwarding dimension link packet of mesh multi-frequency networking path |
| CN113438743A (en) * | 2021-06-11 | 2021-09-24 | 杨志军 | Self-adaptive multi-server polling access control method and system |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101431811A (en) * | 2008-12-19 | 2009-05-13 | 西安电子科技大学 | Cross-layer structure for guaranteeing QoS in WiMAX and QoS combination control method |
| CN103248675A (en) * | 2013-04-23 | 2013-08-14 | 浪潮电子信息产业股份有限公司 | Polling method for monitoring state of server hardware |
| CN103269239A (en) * | 2013-04-10 | 2013-08-28 | 云南电网公司 | Smart power grid power transmission line wireless access method |
-
2016
- 2016-07-22 CN CN201610584038.7A patent/CN106130824B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101431811A (en) * | 2008-12-19 | 2009-05-13 | 西安电子科技大学 | Cross-layer structure for guaranteeing QoS in WiMAX and QoS combination control method |
| CN103269239A (en) * | 2013-04-10 | 2013-08-28 | 云南电网公司 | Smart power grid power transmission line wireless access method |
| CN103248675A (en) * | 2013-04-23 | 2013-08-14 | 浪潮电子信息产业股份有限公司 | Polling method for monitoring state of server hardware |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109873723A (en) * | 2019-02-28 | 2019-06-11 | 武汉晟联智融微电子科技有限公司 | Bandwidth on-demand distribution method based on node traffic priority |
| CN109873723B (en) * | 2019-02-28 | 2022-02-18 | 武汉晟联智融微电子科技有限公司 | On-demand bandwidth allocation method based on node service priority |
| CN111901252A (en) * | 2020-06-16 | 2020-11-06 | 北京瀚诺半导体科技有限公司 | Method and system for transmitting network management message |
| CN111865750A (en) * | 2020-06-30 | 2020-10-30 | 北京瀚诺半导体科技有限公司 | Message transmission method and system based on two-layer network |
| CN111865750B (en) * | 2020-06-30 | 2022-04-05 | 北京瀚诺半导体科技有限公司 | Message transmission method and system based on two-layer network |
| CN112996045A (en) * | 2021-02-04 | 2021-06-18 | 深圳市吉祥腾达科技有限公司 | Method and system for forwarding dimension link packet of mesh multi-frequency networking path |
| CN112996045B (en) * | 2021-02-04 | 2022-11-29 | 深圳市吉祥腾达科技有限公司 | Method and system for forwarding dimension link packet of mesh multi-frequency networking path |
| CN113438743A (en) * | 2021-06-11 | 2021-09-24 | 杨志军 | Self-adaptive multi-server polling access control method and system |
| CN113438743B (en) * | 2021-06-11 | 2022-07-08 | 杨志军 | Self-adaptive multi-server polling access control method and system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106130824B (en) | 2019-04-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106130824A (en) | Integration of three networks broadband access priority polling control method and system | |
| Cheng et al. | A study on distributed/centralized scheduling for wireless mesh network | |
| KR100585327B1 (en) | Method for adaptively reassigning addresses of nodes according to changes in volumn of wireless network | |
| CN1333563C (en) | Medium-access control protocol hierarchical module and method for transmitting and receiving frame of medium-access control protocol hierarchical module | |
| CN103501236B (en) | Network control plane logical topology generates method and device | |
| CN101253781A (en) | Media access control architecture | |
| CN100571464C (en) | In network, carry out the method for effectively switching | |
| CN107566235A (en) | A kind of packet data transmission method, apparatus and electric automobile | |
| CN102905335A (en) | Network management and device communication support in wireless network | |
| CN103402269A (en) | Efficient wireless transmission opportunity handoff | |
| CN103533584B (en) | A kind of water sound sensor network multichannel media access control method | |
| CN101715209A (en) | Method and system for multilink transmission data | |
| CN105022717A (en) | Network on chip resource arbitration method and arbitration unit of additional request number priority | |
| CN101984598A (en) | Message forwarding method and deep packet inspection (DPI) device | |
| CN103354528B (en) | Method and device for multi-stream synchronization | |
| CN102957616A (en) | Method and system for transferring TRILL (transparent interconnection of lots of links) network messages in an ASIC(application specific integrated circuit ) | |
| CN103298137A (en) | Underwater sensor network media access control method based on state | |
| CN106060955B (en) | wireless sensor network MAC protocol polling control method based on three types of services | |
| CN109510785A (en) | A kind of method and apparatus of mirror image message | |
| WO2023005041A1 (en) | Intention-driven multi-modal dikw content transmission method | |
| CN106685735A (en) | EPA (ethemet for plant automation) on-chip system, EPA communication system and EPA communication method | |
| CN106533871A (en) | Release subscription method and system based on AFDX bus | |
| CN109246189A (en) | Network data distributing method and device, storage medium, server-side | |
| Coronado et al. | Modeling and simulation of the IEEE 802.11 e wireless protocol with hidden nodes using Colored Petri Nets | |
| DK1781061T5 (en) | Method for communication between multiple sensor nodes in a sensor network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20221114 Address after: Room 608-609, Floor 7, Building K, Galaxy Modern Smart Agriculture Science and Technology Innovation Demonstration Park, No. 168, Yunjing Road, Chunman Community, Luoyang Sub district Office, Kunming Free Trade Pilot Zone, Yunnan 650500 Patentee after: Youbei Technology Co.,Ltd. Address before: Educational Science Research Institute of Yunnan Provincial Department of Education, No. 2, Xuefu Road, Kunming, Yunnan 650223 Patentee before: Yang Zhijun |
|
| TR01 | Transfer of patent right |