CN109743264A - A kind of compression of dispatch list, data forwarding method and device - Google Patents
A kind of compression of dispatch list, data forwarding method and device Download PDFInfo
- Publication number
- CN109743264A CN109743264A CN201811565560.6A CN201811565560A CN109743264A CN 109743264 A CN109743264 A CN 109743264A CN 201811565560 A CN201811565560 A CN 201811565560A CN 109743264 A CN109743264 A CN 109743264A
- Authority
- CN
- China
- Prior art keywords
- list
- time
- forwarding
- real
- list item
- 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
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present invention discloses a kind of compression of dispatch list, data forwarding method and device；The dispatch list compression method includes: to obtain dispatch list to be compressed；The dispatch list includes a plurality of list item, and each list item includes: serial number, real time data traffic identifier；It determines the serial number minimum list item in the corresponding list item of each real time data traffic identifier, and deletes in the corresponding list item of each real time data traffic identifier, other list items in addition to serial number minimum list item.Using scheme provided by the invention, storage resource consumption is considerably reduced.
Description
Technical field
The present invention relates to the communications fields, in particular to a kind of compression of dispatch list, data forwarding method and device.
Background technique
Industrial Ethernet is by using ethernet technology and related protocol in industrial control condition, is Industry Control system
System provides real-time and a kind of deterministic network technology.Industrial Ethernet technology is compatible with ethernet standard IEEE 802.3.
Compared with traditional field bus technique, with network communication speed is fast, development and production are at low cost, be easily integrated and with it is existing
The network equipment has the characteristics that more preferable compatibility, is widely used in the fields such as aerospace, rail traffic and industry manufacture.
Real-time ethernet technology is the basis of Industrial Ethernet, is the transmission channel of industrial control data and application data.
Two kinds of data types: real time data (Time-Triggered, TT) and non-real-time data (Best- are defined in real-time ethernet
Effort,BE).Real time data has determining packet long and transmission cycle, and requires to reach mesh in given propagation delay time
Node；Non-real-time data is used for transmission the application data insensitive to reliability and timeliness.For real time data, in real time with
Too net, according to the transmission demand of real time data, is calculated by offline mode before the network operation and meets its transmission demand
Dispatch list.In the course of network operation, the real-time ethernet stringent time point according to as defined in dispatch list carries out real time data
Forwarding, to realize the real-time and certainty of industrial network.
Since real time data usually has different transmission cycles, existing dispatching algorithm is macro based on whole real time datas
Period (least common multiple in period) is scheduled.To be directed to each real time data in the dispatch list of real-time exchange machine
A plurality of scheduling list item may be stored.As real time data number increases the increase with the macro period, the quantity of list item can in dispatch list
Can increase at double, cause the problem of storage resource deficiency, the transmission of industrial application be unable to satisfy so as to cause real-time ethernet
Demand.
Summary of the invention
The present invention provides a kind of compression of dispatch list, data forwarding method and device, existing in the prior art to overcome
At least one problem.
In order to achieve the above objectives, the present invention provides a kind of dispatch list compression methods, comprising: obtains scheduling to be compressed
Table；The dispatch list includes a plurality of list item, and each list item includes: serial number, real time data traffic identifier；Determine each real time data traffic identifier
Serial number minimum list item in corresponding list item, and delete in the corresponding list item of each real time data traffic identifier, except serial number minimum table
Other list items except.
Optionally, other in deleting the corresponding list item of each real time data traffic identifier, in addition to serial number minimum list item
After list item, further includes: to the serial number serial number again for retaining list item.
In order to achieve the above objectives, the present invention also provides a kind of data forwarding methods, comprising: compression dispatch list is obtained,
In, which is the compression dispatch list obtained according to dispatch list compression method；When system time reaches compression scheduling
In table when the forwarding time point of each list item, the real time data in corresponding list item is forwarded to identify matched real-time stream.
Optionally, when reaching the forwarding time point of each list item in the compression dispatch list when system time, respective table is forwarded
Real time data in identifies before matched real-time stream, further includes: according to the sequence that serial number is ascending, by the compression
Each list item in dispatch list is inserted into the tail portion of scheduling chained list one by one.
Optionally, when system time reaches the forwarding time point of each list item in the compression dispatch list, corresponding list item is forwarded
In real time data identify matched real-time stream, comprising: by the forwarding time of system time and the scheduling chain heading node
Point compares；When system time reaches the forwarding time point of first node, the real time data of first node in forwarding scheduling chained list
Identify matched real-time stream；It updates the scheduling chained list and obtains new first node.
Optionally, it updates the scheduling chained list and obtains new first node, comprising: when according to the current forwarding of the real-time stream
Between put and the transmission cycle of the data flow calculates the point of forwarding time next time of the real-time stream；According to the real-time stream
The real time data of forwarding time point and real-time stream mark generates new node next time；By the new node according to forwarding time
The rule of point ascending sort is inserted into the scheduling chained list；Time point the smallest node is forwarded by being inserted into the scheduling chained list after new node
As new first node.
In order to achieve the above objectives, the present invention also provides a kind of dispatch list compression sets, comprising: first obtains module, uses
In the dispatch list that acquisition is to be compressed；The dispatch list includes a plurality of list item, and each list item includes: serial number, real time data traffic identifier；It deletes
Module for determining the serial number minimum list item in the corresponding list item of each real time data traffic identifier, and deletes each real time data
Other list items in the corresponding list item of traffic identifier, in addition to serial number minimum list item.
Optionally, dispatch list compression set, further includes: number module, for continuously being compiled again to the serial number for retaining list item
Number.
In order to achieve the above objectives, the present invention also provides a kind of data forwarding devices, comprising: second obtains module, is used for
Obtain compression dispatch list, wherein the compression dispatch list is the compression dispatch list obtained according to dispatch list compression method；Forward mould
Block forwards real-time in corresponding list item when for reaching the forwarding time point of each list item in the compression dispatch list when system time
The matched real-time stream of Data Identification.
Optionally, data forwarding device, further includes: the first insertion module will for the sequence ascending according to serial number
Each list item in the compression dispatch list is inserted into the tail portion of scheduling chained list one by one；Forwarding time point monitoring modular is used for system
The forwarding time point of time and the scheduling chain heading node compares；The forwarding module is specifically used for: when system time reaches
When the forwarding time point of first node, the real time data of first node identifies matched real-time stream in forwarding scheduling chained list；It calculates
Module, for calculating the real-time stream according to the current forwarding time point of the real-time stream and the transmission cycle of the data flow
The point of forwarding time next time；New node generation module, for according to the point of forwarding time next time of the real-time stream and this
The real time data mark of real-time stream generates new node；Second insertion module, is used for the new node according to forwarding time point
The rule of ascending sort is inserted into the scheduling chained list；Determining module, for forwarding time in the scheduling chained list after new node will to be inserted into
The smallest node of point is determined as new first node.
Beneficial effects of the present invention are as follows: the sequence in the corresponding list item of each real time data traffic identifier is determined in dispatch list
Number minimum list item, and delete in the corresponding list item of each real time data traffic identifier, other list items in addition to serial number minimum list item；
A scheduling list item is only stored in dispatch list since the present invention is directed to each real time data, considerably reduces storage money
Source consumption.
Detailed description of the invention
In order to more clearly explain the embodiment of the invention or the technical proposal in the existing technology, to embodiment or will show below
There is attached drawing needed in technical description to be briefly described, it should be apparent that, the accompanying drawings in the following description is only this
Some embodiments of invention for those of ordinary skill in the art without creative efforts, can be with
It obtains other drawings based on these drawings.
Fig. 1 shows the flow chart of dispatch list compression method according to an embodiment of the present invention；
Fig. 2 shows the flow charts of data forwarding method according to an embodiment of the present invention；
Fig. 3 shows another flow chart of data forwarding method according to an embodiment of the present invention；
Fig. 4 shows the structural schematic diagram of dispatch list compression set according to an embodiment of the present invention；
Fig. 5 shows the structural schematic diagram of data forwarding device according to an embodiment of the present invention.
Specific embodiment
Following will be combined with the drawings in the embodiments of the present invention, and technical solution in the embodiment of the present invention carries out clear, complete
Site preparation description, it is clear that described embodiments are only a part of the embodiments of the present invention, instead of all the embodiments.It is based on
Embodiment in the present invention, those of ordinary skill in the art are obtained every other under that premise of not paying creative labor
Embodiment shall fall within the protection scope of the present invention.
Core of the invention thought is, first dispatch list of every real time data is only retained in existing dispatch list
, and compressed list item is restored by the list item retained in dispatch list in scheduling process, to realize and original tune
It is of equal value to spend table.
Specifically, the present invention is divided into two stages, is dispatching poor compression stage, the dispatch list generated based on off-line calculation
(that is, dispatch list or dispatch list referred to as to be compressed before compression), and delete the redundancy list item in offline dispatch list.It is directed to
Each real-time stream, this method only retains first scheduling list item of the real-time stream in dispatch list, to reduce
Consumption of the dispatch list to storage resource.In data transfer phae, during scheduling, according to the forwarding of the scheduling list item of reservation
Time point, real time data transmission cycle and current system time, calculate the point of forwarding time next time of the real time data.
To restore compressed dispatch list list item, to realize of equal value with the dispatch list before compression.
Fig. 1 shows the flow chart of dispatch list compression method according to an embodiment of the present invention.
As shown in Figure 1, dispatch list compression method according to an embodiment of the present invention includes:
S101 obtains dispatch list to be compressed；The dispatch list includes a plurality of list item, and each list item includes: serial number, real time data
Traffic identifier.
In the specific implementation, when every list item of dispatch list to be compressed includes serial number, real time data traffic identifier ID, forwarding
Between five point, transmission cycle and long data packet fields.Sequence number field identifies which list item that every list item is dispatch list.In real time
Data flow id field identifies the ID of data flow associated with the list item, and only the matched real-time stream of id field, which is just deferred to, works as
Preceding list item is scheduled.Real time data forwarding time as defined in the forwarding time point field identification list item, when system time arrives
When up to forwarding time, real-time ethernet interchanger is forwarded the matched data of id field.The transmission cycle field identification table
The data of the real time data of item scheduling generate the period.Packet length field identifies the data packet of the real time data of list item scheduling
Size.
Table 1 shows the dispatch list before a compression according to an embodiment of the present invention.
The offline dispatch list example of table 1
In upper table, first scheduling list item identify real-time ethernet interchanger system time be 10000ns when pair
The data packet that real-time stream id field is 1 is scheduled forwarding, and the data of the data packet generate period and long data packet difference
For 2ms and 64byte.It should be noted that offline dispatch list is based on since real time data usually has different transmission cycles
The macro period is scheduled, thus every real-time stream may there are a plurality of scheduling list items in offline dispatch list.Upper table
The macro period is 8ms, and there are 4 list items, period 4ms in dispatch list for the real time data (real time data ID is 1) that the period is 2ms
Real time data (real time data ID be 2) there are 2 list items in dispatch list, the period for 8ms real time data (real time data ID
For 3) there are 1 list items in dispatch list.
S102 determines the serial number minimum list item in the corresponding list item of each real time data traffic identifier, and deletes each real-time
Other list items in the corresponding list item of stream identification, in addition to serial number minimum list item.
In the specific implementation, the quantity and meaning for each field that compression dispatch list includes can be identical as offline dispatch list.
Unlike offline dispatch list, compression dispatch list is directed to every real-time stream and only stores a list item in dispatch list,
And the list item is the smallest scheduling list item of sequence number field of the data flow in offline dispatch list.
In deleting the corresponding list item of each real time data traffic identifier, other list items in addition to serial number minimum list item it
It afterwards, can also include: to the serial number serial number again for retaining list item.
Table 2 shows the compressed dispatch list of table 1 according to an embodiment of the present invention.
Table 2 compresses dispatch list example
| Serial number | Real time data stream ID | Forwarding time point (ns) | Transmission cycle (ms) | Long data packet (byte) |
| 1 | 1 | 10000 | 2 | 64 |
| 2 | 2 | 20000 | 4 | 512 |
| 3 | 3 | 30000 | 8 | 1024 |
In table 2, there is only a list items in compression dispatch list for the data that real time data id field is 1 and 2.
Using the scheme of the embodiment of the present invention, it is directed to each real time data and only stores a dispatch list in dispatch list
, considerably reduce storage resource consumption.
Fig. 2 shows the flow charts of data forwarding method according to an embodiment of the present invention.
As shown in Fig. 2, data forwarding method according to an embodiment of the present invention includes:
S201 obtains compression dispatch list, wherein the compression dispatch list is the pressure obtained according to above-mentioned dispatch list compression method
Contracting dispatch list.
S202 is forwarded in corresponding list item when system time reaches the forwarding time of each list item in the compression dispatch list
Real time data identifies matched real-time stream.
In the specific implementation, when system time reaches the forwarding time of each list item in the compression dispatch list, phase is forwarded
It can also include: the sequence ascending according to serial number before answering the real time data in list item to identify matched real-time stream,
Each list item in the compression dispatch list is inserted into the tail portion of scheduling chained list one by one.
In the specific implementation, when system time reaches the forwarding time of each list item in the compression dispatch list, forwarding is corresponding
Real time data in list item identifies matched real-time stream, may include: by system time and the scheduling chain heading node
Forwarding time compares；When system time reaches the forwarding time of first node, first node is real-time in forwarding scheduling chained list
The matched real-time stream of Data Identification；It updates the scheduling chained list and obtains new first node.
In the specific implementation, it updates the scheduling chained list and obtains new first node, may include: according to the real-time stream
The transmission cycle of current forwarding time and the data flow calculates the forwarding time next time of the real-time stream；According to the real-time number
New node is generated according to the forwarding time next time of stream and the real time data mark of the real-time stream；By the new node according to forwarding
The rule of time ascending sort is inserted into the scheduling chained list；Forwarding time the smallest node in the scheduling chained list after new node will be inserted into
As new first node.
Using the scheme of the embodiment of the present invention, only stored since the present invention is directed to each real time data in dispatch list
One scheduling list item, therefore the completion that can be simple and efficient is directed to the modification operation of real time data scheduling list item, thus also
Original goes out compressed dispatch list list item, realizes of equal value with the dispatch list before compression.
Fig. 3 shows another flow chart of data forwarding method according to an embodiment of the present invention.
As shown in figure 3, data forwarding method according to an embodiment of the present invention includes:
Step 1, scheduling list item compression
Based on existing offline dispatch list, the duplicate scheduling list item of real time data id field in offline dispatch list is deleted, is
Every real-time stream only retains the smallest list item of serial number, generates compression dispatch list.Meanwhile this method is in compression dispatch list
Sequence number field is redistributed since 1, to ensure the continuity of sequence number field.
Step 2, system initialization
After hardware-initiated, real-time ethernet interchanger is initialized, and downloads compression dispatch list.
Step 3, initialization scheduling chained list
The dispatching sequence for dispatching linked list maintenance real time data and forwarding time are real-time ethernet interchangers to real-time number
According to the basis being scheduled.The each node for dispatching chained list includes real time data id field and forwarding time field.Every in real time
Data one and only one node in scheduling chained list is corresponding to it.Chained list carries out ascending sort according to forwarding time field.By
List item in compaction table be according to forwarding time field ascending sort, so be scheduled chained list initialization when, according to sequence
Every scheduling list item is inserted into the tail portion of chained list by number ascending sequence of field one by one.
Step 4, monitoring forwarding time
When carrying out network scheduling, real-time ethernet interchanger needs the moment to monitor whether that real time data reaches regulation
Forwarding time.Since scheduling chained list identifies the sequence of real time data scheduling, interchanger is only needed system time and dispatch list
The forwarding time of first node carries out circulation comparison.When system time reaches the forwarding time of first node, step 5. is carried out
Step 5, forwarding data
Real-time ethernet interchanger is according to the real time data id field for dispatching first node in chained list, to matched real time data
Stream is forwarded.
Step 6 calculates new forwarding time
After completing real time data forwarding, this method needs to calculate the defined forwarding time next time of the real time data.
The calculation method of data forwarding time is the transmission cycle for current forwarding time adding data next time.
Step 7 updates scheduling chained list
Due to the first node finishing scheduling in scheduling chained list, scheduling chained list needs be updated could complete it is subsequent
Scheduling operation.Firstly, scheduling chained list deletes the first node of finishing scheduling.Then, chained list is dispatched according to the new forwarding of calculating
Time and real time data id field generate new node.Finally, scheduling chained list is by newly-generated node according to forwarding time liter
The rule of sequence sequence is inserted into scheduling chained list, completes the update operation of scheduling chained list.
Using the scheme of the embodiment of the present invention, one is only stored in dispatch list due to being directed to each real time data
Dispatch list item, therefore completions that can be simple and efficient be directed to real time data scheduling list item modification operate, thus restore by
The dispatch list list item of compression is realized of equal value with the dispatch list before compression.
Fig. 4 shows the structural schematic diagram of dispatch list compression set according to an embodiment of the present invention.
As shown in figure 4, dispatch list compression set 400 according to an embodiment of the present invention includes: the first acquisition module 401, use
In the dispatch list that acquisition is to be compressed；The dispatch list includes a plurality of list item, and each list item includes: serial number, real time data traffic identifier；It deletes
Module 402 for determining the serial number minimum list item in the corresponding list item of each real time data traffic identifier, and deletes each real-time number
According to other list items in the corresponding list item of traffic identifier, in addition to serial number minimum list item.
Optionally, dispatch list compression set can also include: number module, for connecting again to the serial number for retaining list item
The number of sequeling.
Using the scheme of the embodiment of the present invention, it is directed to each real time data and only stores a dispatch list in dispatch list
, considerably reduce storage resource consumption.
Fig. 5 shows the structural schematic diagram of data forwarding device according to an embodiment of the present invention.
As shown in figure 5, data forwarding device 500 according to an embodiment of the present invention includes: the second acquisition module 501, it is used for
Obtain compression dispatch list, wherein the compression dispatch list is the compression dispatch list obtained according to dispatch list compression method；Forwarding module
502, for forwarding the real-time number in corresponding list item when system time reaches the forwarding time of each list item in the compression dispatch list
According to the matched real-time stream of mark.
Optionally, data forwarding device can also include: the first insertion module, for according to ascending suitable of serial number
Each list item in the compression dispatch list is inserted into the tail portion of scheduling chained list by sequence one by one；Forwarding time monitoring modular, for that will be
System time and the forwarding time of the scheduling chain heading node compare；The forwarding module is specifically used for: when system time reaches
When the forwarding time of first node, the real time data of first node identifies matched real-time stream in forwarding scheduling chained list；Calculate mould
Block, for being calculated under the real-time stream according to the current forwarding time of the real-time stream and the transmission cycle of the data flow
Forwarding time；New node generation module, for according to the real-time stream forwarding time next time and the real time data
The real time data mark of stream generates new node；Second insertion module, for by the new node according to forwarding time ascending sort
Rule is inserted into the scheduling chained list；Determining module, for forwarding time the smallest node in the scheduling chained list after new node will to be inserted into
It is determined as new first node.
Using the scheme of the embodiment of the present invention, one is only stored in dispatch list due to being directed to each real time data
Dispatch list item, therefore completions that can be simple and efficient be directed to real time data scheduling list item modification operate, thus restore by
The dispatch list list item of compression is realized of equal value with the dispatch list before compression.
Those of ordinary skill in the art will appreciate that: attached drawing is the schematic diagram of one embodiment, module in attached drawing or
Process is not necessarily implemented necessary to the present invention.
Those of ordinary skill in the art will appreciate that: the module in device in embodiment can describe to divide according to embodiment
It is distributed in the device of embodiment, corresponding change can also be carried out and be located in one or more devices different from the present embodiment.On
The module for stating embodiment can be merged into a module, can also be further split into multiple submodule.
Finally, it should be noted that the above embodiments are merely illustrative of the technical solutions of the present invention, rather than its limitations；Although
Present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that: it still may be used
To modify to technical solution documented by previous embodiment or equivalent replacement of some of the technical features；And
These are modified or replaceed, the spirit and model of technical solution of the embodiment of the present invention that it does not separate the essence of the corresponding technical solution
It encloses.
Claims (10)
1. a kind of dispatch list compression method characterized by comprising
Dispatch list to be compressed is obtained, the dispatch list includes a plurality of list item, and each list item includes: serial number, real time data traffic identifier；
It determines the serial number minimum list item in the corresponding list item of each real time data traffic identifier, and deletes each real time data traffic identifier
Other list items in corresponding list item, in addition to serial number minimum list item.
2. dispatch list compression method according to claim 1, which is characterized in that deleting each real time data traffic identifier pair
After other list items in the list item answered, in addition to serial number minimum list item, further includes:
To the serial number serial number again for retaining list item.
3. a kind of data forwarding method characterized by comprising
Obtain compression dispatch list, wherein the compression dispatch list is the dispatch list compression side according to claims 1 or 2
The compression dispatch list that method obtains；
When system time reaches the forwarding time point of each list item in the compression dispatch list, the real-time number in corresponding list item is forwarded
According to the matched real-time stream of mark.
4. data forwarding method according to claim 3, which is characterized in that reach the compression scheduling when system time
In table when the forwarding time point of each list item, before forwarding the real time data in corresponding list item to identify matched real-time stream, also
Include:
According to the sequence that serial number is ascending, each list item in the compression dispatch list is inserted into the tail of scheduling chained list one by one
Portion.
5. data forwarding method according to claim 4, which is characterized in that when system time reaches the compression dispatch list
In each list item forwarding time point when, forward real time data in corresponding list item to identify matched real-time stream, comprising:
The forwarding time point of system time and the scheduling chain heading node is compared；
When system time reaches the forwarding time point of first node, the real time data of first node identifies matching in forwarding scheduling chained list
Real-time stream；
It updates the scheduling chained list and obtains new first node.
6. data forwarding method according to claim 5, which is characterized in that update the scheduling chained list and obtain new first knot
Point, comprising:
The real time data is calculated according to the current forwarding time point of the real-time stream and the transmission cycle of the data flow
The point of forwarding time next time of stream；
It is generated according to the real time data of the point of forwarding time next time of the real-time stream and real-time stream mark new
Node；
The new node is inserted into the scheduling chained list according to the rule of forwarding time point ascending sort；
Forwarding time point the smallest node will be inserted into the scheduling chained list after new node as first node newly.
7. a kind of dispatch list compression set characterized by comprising
First obtains module, for obtaining dispatch list to be compressed；The dispatch list includes a plurality of list item, and each list item includes: sequence
Number, real time data traffic identifier；
Removing module for determining the serial number minimum list item in the corresponding list item of each real time data traffic identifier, and is deleted each
Other list items in the corresponding list item of real time data traffic identifier, in addition to serial number minimum list item.
8. dispatch list compression set according to claim 7, which is characterized in that further include:
Number module, for the serial number to reservation list item again serial number.
9. a kind of data forwarding device characterized by comprising
Second obtains module, for obtaining compression dispatch list, wherein the compression dispatch list is according to institute in claims 1 or 2
The compression dispatch list that the dispatch list compression method stated obtains；
Forwarding module, for when system time reaches the forwarding time point of each list item in the compression dispatch list, forwarding to be corresponding
Real time data in list item identifies matched real-time stream.
10. data forwarding device according to claim 9, which is characterized in that further include:
First insertion module inserts each list item in the compression dispatch list for the sequence ascending according to serial number one by one
Enter to the tail portion of scheduling chained list；
Forwarding time point monitoring modular, for carrying out pair the forwarding time point of system time and the scheduling chain heading node
Than；
The forwarding module is specifically used for: first in forwarding scheduling chained list when system time reaches the forwarding time point of first node
The real time data of node identifies matched real-time stream；
Computing module, for being calculated according to the current forwarding time point of the real-time stream and the transmission cycle of the data flow
The point of forwarding time next time of the real-time stream；
New node generation module, for according to the point of forwarding time next time of the real-time stream and the real-time stream
Real time data mark generates new node；
Second insertion module, for the new node to be inserted into the scheduling chain according to the rule of forwarding time point ascending sort
Table；
Determining module is determined as new first knot for that will be inserted into forwarding time point the smallest node in the scheduling chained list after new node
Point.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811565560.6A CN109743264B (en) | 2018-12-20 | 2018-12-20 | Scheduling table compression method, scheduling table compression device, scheduling table data forwarding method, scheduling table compression device and scheduling table data forwarding device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811565560.6A CN109743264B (en) | 2018-12-20 | 2018-12-20 | Scheduling table compression method, scheduling table compression device, scheduling table data forwarding method, scheduling table compression device and scheduling table data forwarding device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109743264A true CN109743264A (en) | 2019-05-10 |
| CN109743264B CN109743264B (en) | 2021-02-26 |
Family
ID=66360911
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811565560.6A Active CN109743264B (en) | 2018-12-20 | 2018-12-20 | Scheduling table compression method, scheduling table compression device, scheduling table data forwarding method, scheduling table compression device and scheduling table data forwarding device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109743264B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101854309A (en) * | 2010-06-18 | 2010-10-06 | 中兴通讯股份有限公司 | Method and apparatus for managing message output |
| US20110268132A1 (en) * | 2010-04-28 | 2011-11-03 | Yoshiharu Kobatake | Device and method for transmission of tdm signal over asynchronous network |
| CN103517331A (en) * | 2012-06-20 | 2014-01-15 | 中兴通讯股份有限公司 | Method and device for obtaining removal bit masks |
| CN103780491A (en) * | 2012-10-23 | 2014-05-07 | 上海博达数据通信有限公司 | Method for realizing IPv6 fast route lookup |
-
2018
- 2018-12-20 CN CN201811565560.6A patent/CN109743264B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20110268132A1 (en) * | 2010-04-28 | 2011-11-03 | Yoshiharu Kobatake | Device and method for transmission of tdm signal over asynchronous network |
| CN101854309A (en) * | 2010-06-18 | 2010-10-06 | 中兴通讯股份有限公司 | Method and apparatus for managing message output |
| CN103517331A (en) * | 2012-06-20 | 2014-01-15 | 中兴通讯股份有限公司 | Method and device for obtaining removal bit masks |
| CN103780491A (en) * | 2012-10-23 | 2014-05-07 | 上海博达数据通信有限公司 | Method for realizing IPv6 fast route lookup |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109743264B (en) | 2021-02-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110084378A (en) | A kind of distributed machines learning method based on local learning strategy | |
| CN103036653B (en) | A kind of method of OpenFlow network being carried out to network code | |
| CN109450936A (en) | A kind of adaptation method and device of the hetero-com-munication agreement based on Kafka | |
| CN103812949A (en) | Task scheduling and resource allocation method and system for real-time cloud platform | |
| CN108848146A (en) | A kind of method for optimizing scheduling based on time trigger communication service | |
| CN110990140B (en) | Method for scheduling distributed machine learning flow in photoelectric switching network | |
| CN107172187A (en) | A kind of SiteServer LBS and method | |
| CN105072194B (en) | A kind of storage data in distributed file system repair structure and restorative procedure | |
| CN104852813B (en) | The on-demand loading method and system of TR069 Parameter nodes in family gateway equipment | |
| CN103036792A (en) | Transmitting and scheduling method for maximizing minimal equity multiple data streams | |
| CN110351286A (en) | Link flood attack detects response mechanism in a kind of software defined network | |
| CN104579977A (en) | Bandwidth constraint multipath routing method and system for SDN controller | |
| CN107194056A (en) | The method that system diagram is verified with threedimensional model Auto-matching in pipe design | |
| CN105959224B (en) | High speed route lookup device and method based on bit vectors | |
| CN103326916B (en) | Intelligent substation automatically divides and optimizes the system and method for VLAN | |
| CN105207825B (en) | A kind of network element Fast synchronization system and network element fast synchronization method | |
| CN104184678A (en) | Method for dropping frame duplicates to achieve highly-reliable seamless redundancy ring network | |
| CN104767664A (en) | Ring communication network slave node increasing and decreasing method, device and system | |
| CN109743264A (en) | A kind of compression of dispatch list, data forwarding method and device | |
| CN112217652B (en) | Network topology device and method based on central communication mode | |
| CN105553841A (en) | High-efficiency distributed intelligent routing method capable of effectively preventing signaling storm | |
| CN103686668B (en) | Data-updating method, system and equipment | |
| CN101938420B (en) | Cluster topological collection method and device | |
| CN105634938B (en) | A kind of data dual path backup transmission method for software defined network | |
| CN103246497B (en) | A kind of real time data method for parallel processing based on Data Placement |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |