CN107896200A - Message scheduling method compatible with virtual link and packet switching mechanism - Google Patents
Message scheduling method compatible with virtual link and packet switching mechanism Download PDFInfo
- Publication number
- CN107896200A CN107896200A CN201711089689.XA CN201711089689A CN107896200A CN 107896200 A CN107896200 A CN 107896200A CN 201711089689 A CN201711089689 A CN 201711089689A CN 107896200 A CN107896200 A CN 107896200A
- Authority
- CN
- China
- Prior art keywords
- message
- class
- stream
- queue
- bandwidth
- 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.)
- Pending
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/50—Queue scheduling
- H04L47/62—Queue scheduling characterised by scheduling criteria
- H04L47/6215—Individual queue per QOS, rate or priority
-
- 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/215—Flow control; Congestion control using token-bucket
-
- 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/22—Traffic shaping
- H04L47/225—Determination of shaping rate, e.g. using a moving window
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/60—Queue scheduling implementing hierarchical scheduling
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/62—Queue scheduling characterised by scheduling criteria
- H04L47/625—Queue scheduling characterised by scheduling criteria for service slots or service orders
- H04L47/6275—Queue scheduling characterised by scheduling criteria for service slots or service orders based on priority
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention relates to a message scheduling method compatible with a virtual link and a packet switching mechanism. The network service is divided into a flow message with a fine-grained QoS management requirement and a class message with a coarse-grained QoS management requirement, the flow message and the class message can automatically coordinate and share the bandwidth of a network outlet node, and different types of messages are dispatched by using different types of queues, so that the QoS requirements with different granularities are realized. The QoS management method of the invention can meet the QoS requirements of different levels and different granularities of a plurality of current services, and is convenient for realizing the expansion of QoS management on new services.
Description
Technical field
The present invention relates to computer communication technology field, and in particular to a kind of compatible virtual link and the report of packet switch mechanism
Literary dispatching method.
Background technology
In recent years, the scale of network application is presented explosive growth, types of applications to the demand such as bandwidth of network, prolong
Late, Loss Rate etc. is all different.In order to meet the needs of different application, network service quality (Quality of as far as possible
Service, QoS) manage the focus turned into network research.Network QoS management is exactly on certain network infrastructure, is led to
All kinds of services that certain strategy and mechanism management network provide are crossed, provide the user higher-quality network service.
Integrated service (IntServ) model and Differentiated Services (DiffServ) model that IETF is specified are exactly to solve QoS
Major technique.Integrated service provides required end-to-end service for application, and applied business data separation is different types of
Stream, the network service of corresponding level is obtained for different stream by the way of resource reservation, and flow data passes through between end node
The virtual link of foundation is transmitted, it is ensured that service quality is protected.Differentiated service is a relatively easy granularity
QoS Controlling models, use business is classified, connectionless thought.By being carried out in network Border Node to business
Different types of grouped data Differentiated Services in a network are realized in classification.It is integrated to service as a kind of service model based on stream,
Fine-grained network service quality management can be realized, but implementation complexity is higher.And Differentiated Services are a kind of class-based
Service model, implementation complexity is low, and is used for the model of Service Quality Management in most of networks at present, but its institute can be real
Existing network service management granularity is limited.
To realize above-mentioned Network Service Model, the network equipment needs the dispatching message mode for supporting above-mentioned mechanism.Due to
Major networks service model is Differentiated Services at present, is adjusted for the scheduling mode such as polling dispatching, strict priority of Differentiated Services
The packet switch dispatching algorithms such as degree can not the compatible integrated service based on virtual link, so as to which the service model energy can not be utilized
Support the advantage of fine-grained services quality management.
The content of the invention
Current method for dispatching message reasonably can not meet Virtual Channel and the Network QoS need of packet switch simultaneously
Ask, for this problem, the present invention proposes solution below.
The present invention proposes a kind of compatible virtual link and the method for dispatching message of packet switch mechanism, and the method for dispatching message is simultaneously
Row supports virtual link and packet switch, realizes the bandwidth for coordinating shared network exit node, avoids the waste of interface bandwidth；In fact
Existing mechanism is as follows：
(1) delineation of activities
(a) the stream business based on Virtual Channel transmission；
(b) the class business based on packet switch；
The priority ranking of two kinds of business is (a)>(b), i.e., stream business has limit priority, and class business has minimum preferential
Level.Stream business does not subdivide priority, but stream business can be subdivided into numerous streams, every stream according to required QoS
Possess an independent stream ID (encoding in heading), it is assumed that quantity Mas, there is identical priority between variant stream.
Class business can further discriminate between different priority, it is assumed that the number N of the priority of BE classes subdivisionbe；
(2) queue tissue
(a) flow queue：Cache flow service message, all stream packets share a queue；
(b) Class Queue：Cache class service message, each class priority possess a single queue, i.e. the number of Class Queue is
Nbe；
(3) dispatching message
(a) message is assigned：According to the type belonging to service attribute field (1bit) differentiated service in heading, if message is stream
Message, then (it is used to distinguish various messages, the stream ID of message is represented if stream packet, class message represents according to message attribute field
The priority of message, field length are maximum number of digits needed for encoding stream ID and class priority) independent token bucket is used to message
Speed limit is carried out, i.e., every stream uses single limiting speed of token bucket, and class message is then directly entered scheduling queue；
(b) message rate-limiting：According to resource reservation protocol, every stream packet preengages corresponding network bandwidth resources, according to reservation
The generating rate of bandwidth token in token bucket corresponding to network entry point configuration, token bucket carry out speed limit to stream packet, surpassed
Go out reserved bandwidth stream packet will be labeled after be converted into the class message with lowest priority, the stream packet normally sent is then
It is cached in stream packet queue and waits scheduling；
(c) queue scheduling：Class message and the stream packet after speed limit wait scheduling output, queue scheduling point in respective queue
For two-stage, first order queue scheduling is the queue scheduling of class message part, and this grade of queue scheduling is using weighting deficit polling dispatching
Algorithm ensures the fairness of the fairness of the scheduling of message and bandwidth partition.The second level be scheduling to stream packet and class message it
Between scheduling, the bandwidth of both shared network exit nodes；Because the priority of stream packet is higher than the priority of class message, thus
Second level scheduling uses strict priority scheduling algorithm, it is ensured that stream packet can preferentially be sent；So when the bandwidth of stream packet needs
When increase or reduction, the output bandwidth of class message then can be reduced or increased accordingly, and bandwidth between the two can be automatically
Coordinate to share, can provide maximum bandwidth for class message on the premise of meeting that stream packet is preferential, avoid the band of network exit node
Width wastes.Such as the reserved bandwidth of stream packet only has the a% of link bandwidth, if the actual a width of b% (b of band taken of stream packet<
A), then class message can seize the bandwidth resources a%-b% that stream packet is reserved；And when stream packet is preengage and actual transmissions
Bandwidth increase to b% (b>A), then the bandwidth resources of class message reduce b%-a% automatically.
Beneficial effect：A kind of compatible virtual link proposed by the present invention and the method for dispatching message of packet switch mechanism, by net
Network traffic differentiation is stream packet and the class message of coarseness QoS regulatory requirements with fine granularity QoS regulatory requirements, and both can be certainly
The dynamic bandwidth for coordinating shared network exit node, dispatching message is implemented using different types of queue to different types of message,
So as to realize varigrained QoS demand.The QoS management methods of the present invention can meet that current numerous business different levels are different
The QoS demand of granularity, it is again convenient to realize the extension that QoS management is carried out to new business.
Brief description of the drawings
Fig. 1 is the scheduling structure schematic diagram of the present invention；
Fig. 2 is the queue scheduling flow chart of the present invention.
Embodiment
The embodiment of the present invention is described in detail with reference to Figure of description.
As shown in figure 1, a kind of compatible virtual link proposed by the present invention and the method for dispatching message of packet switch mechanism, its scheduling are patrolled
Five submodules can be subdivided into by collecting：Message assigns (101 in Fig. 1), speed limit (102 in Fig. 1), queue management (103 in Fig. 1), one
Level scheduling (104 in Fig. 1) and second-level dispatching (105 in Fig. 1).Specific implementation details are as follows：
1st, message is assigned：Message dispatch logic distinguishes type of message and various messages is divided according to message classification field
Group.Message classification field definition is as follows：Message classification field is used to distinguish type of message, includes two parts, the business category of 1 bit
Property field：0 represents stream packet, and 1 represents class message；The message attribute field definition of n-bit is：If service attribute field is 0,
Then the n-bit represents the ID of stream packet, if service attribute field is 1, the n-bit represents the priority of class message, wherein n
=max { log2Mas+1,log2Nbe+1}；
2nd, speed limit：The bandwidth resources that the Virtual Channel that speed limit logic is transmitted according to stream packet is preengage when establishing carry out speed limit to stream packet
Control, specific Control for Speed Limitation are realized using token bucket.The corresponding single token bucket of each Virtual Channel for streaming
Speed limit is carried out, the generating rate of token is configured to the bandwidth of stream packet reservation in each token bucket.This is patrolled for the speed limit of stream packet
Collecting need to only dispose in network edge node, i.e., the Ingress node for entering network in stream packet carries out speed limit, network middle node
Point to stream packet without making carry out speed limit again.In network edge node, the token bucket number of each node deployment can be according to net
The scale for the stream business that network scale and needs are supported determines, also can simply be defined as：Mas/ network edge node number；
3rd, queue management：Queue management logic is responsible for the caching message to be scheduled such as after assignment, according to the classification of message, report
Literary buffer queue also divides into stream packet queue and class message queue, and wherein stream packet queue is shared queue, each Virtual Channel
In stream packet be all buffered in stream packet queue, without distinguishing stream ID.Class message queue is separate queue, i.e., every kind of priority
There is corresponding queue to cache packet message, the mapping relations of class message priority and Class Queue are reflected using one-to-one
Penetrate；
4th, schedule level one：Schedule level one module is responsible for being scheduled class message, and the scheduling logic is used based on weighting deficit wheel
The dispatching algorithm of inquiry is that class message is scheduled.Ensure the fairness of dispatching message and the fairness of bandwidth partition.It is each preferential
The byte number that can be transmitted when level message queue is by configuring different weights to control each polling dispatching, so as to realize difference
Bandwidth proportional assignment between priority packet queue；
5th, second-level dispatching：Scheduling of the second-level dispatching between stream packet and class message, the bandwidth of both shared network exit nodes,
The scheduling logic uses the scheduling strategy based on strict priority.Because the service of stream packet belongs to the service of ensuring, it is necessary to strict
Realize that message forwards by reserved bandwidth, thus compared with class message there is higher priority.Adjusted by using strict priority
Spend algorithm, it is ensured that stream packet can preferentially be sent.When stream packet needs the bandwidth increase or reduction that take, the output of class message
Bandwidth then can be reduced or increased accordingly, and bandwidth between the two can automatically be coordinated to share, and meet that stream packet is preferential
Under the premise of can provide maximum bandwidth for class message, avoid the bandwidth waste of network exit node.
The specific implementation stream of a kind of compatible virtual link provided by the present invention and the method for dispatching message of packet switch mechanism
Journey is as shown in Figure 2：After message arrival, traffic differentiation is carried out according to service attribute field in heading first.If message is
The stream packet transmitted by Virtual Channel, then message is assigned to the token bucket of corresponding stream ID, token bucket according to message attribute field
Speed limit is carried out to the stream packet in the Virtual Channel according to the bandwidth of reservation, after being then labeled for the message more than rate limit
The class message with lowest priority is converted into, to ensure that stream packet is transmitted in strict accordance with reserved bandwidth, while in network
The utilization rate of network bandwidth can be also improved in the case that bandwidth resources are abundant, and the message within speed can then be sent stream report
Scheduling output is waited in literary queue；If message is by the class message of packet transmission, message is divided according to message attribute field
Send in the class message queue of corresponding priority and wait scheduling output.The stream packet being buffered in stream packet queue passes through the second level
Strict priority scheduling is exportable；And the class message being buffered in class message queue then needs by first order polling dispatching and
It is just exportable after the strict priority scheduling of the second level；Stream packet coordinates the bandwidth of shared network exit node with class message.
In summary embodiment, the coordination virtual link and the method for dispatching message of packet switch that the embodiment of the present invention proposes can
To take into account the advantage of integrated service and differentiated service, there is provided take into account service granularity and possess the QoS clothes of scalability
Business.Obviously, those skilled in the art can be conceived with the technique according to the invention carries out various changes and deformation to the present invention, and
These modification and variation belong within the scope of the claims in the present invention and equivalent technologies, then should all belong to the claims in the present invention
Protection domain.
Claims (2)
1. a kind of compatible virtual link and the method for dispatching message of packet switch mechanism, Network is divided into fine granularity
The stream packet of QoS regulatory requirements and the class message of coarseness QoS regulatory requirements, both automatic synchronizations share network exit node
Bandwidth, dispatching message is implemented using different types of queue to different types of message, realizes varigrained QoS demand, its
It is characterised by, realization mechanism is as follows：
(1) delineation of activities
(a) the stream business based on Virtual Channel transmission；
(b) the class business based on packet switch；
The priority ranking of two kinds of business is a>B, that is, flowing business has limit priority, and class business has lowest priority, stream
Business does not subdivide priority, but stream business can be subdivided into numerous streams according to required QoS, and every stream possesses one
Individual independent stream ID, it is assumed that quantity Mas, there is identical priority between variant stream, class business can further discriminate between not
Same priority, it is assumed that the number N of the priority of BE classes subdivisionbe；
(2) queue tissue
(a) flow queue：Cache flow service message, all stream packets share a queue；
(b) Class Queue：Cache class service message, each class priority possess a single queue, i.e. the number of Class Queue is
Nbe；
(3) dispatching message
(a) message is assigned：According to the type belonging to service attribute field differentiated service in heading, if message is stream packet,
Speed limit is then carried out to message using independent token bucket according to message attribute field, i.e., every stream is limited using single token bucket
Speed, and class message is then directly entered scheduling queue；
(b) message rate-limiting：According to resource reservation protocol, every stream packet preengages corresponding network bandwidth resources, according to reservation
The generating rate of bandwidth token in token bucket corresponding to network entry point configuration, token bucket carry out speed limit to stream packet, surpassed
Go out reserved bandwidth stream packet will be labeled after be converted into the class message with lowest priority, the stream packet normally sent is then
It is cached in stream packet queue and waits scheduling；
(c) queue scheduling：Class message and the stream packet after speed limit wait scheduling output, queue scheduling point in respective queue
For two-stage, first order queue scheduling is the queue scheduling of class message part, and this grade of queue scheduling is using weighting deficit polling dispatching
Algorithm ensures the fairness of the fairness of the scheduling of message and bandwidth partition, the second level be scheduling to stream packet and class message it
Between scheduling, the bandwidth of both shared network exit nodes；Because the priority of stream packet is higher than the priority of class message, thus
Second level scheduling uses strict priority scheduling algorithm, it is ensured that stream packet can preferentially be sent；So when the bandwidth of stream packet needs
When increase or reduction, the output bandwidth of class message then can be reduced or increased accordingly, and bandwidth between the two can be automatically
Coordinate to share, can provide maximum bandwidth for class message on the premise of meeting that stream packet is preferential, avoid the band of network exit node
Width wastes, as the reserved bandwidth of stream packet only has the a% of link bandwidth, if actual the band a width of b%, b taken of stream packet<A,
Then class message can seize the bandwidth resources a%-b% that stream packet is reserved；And when stream packet is preengage and actual transmissions
Bandwidth increases to b%, b>A, then the bandwidth resources of class message reduce b%-a% automatically.
2. a kind of compatible virtual link according to claim 1 and the method for dispatching message of packet switch mechanism, its feature exist
In the message attribute field refers to for distinguishing various messages, the stream ID of message is represented if stream packet, class message represents message
Priority, field length is maximum number of digits needed for encoding stream ID and class priority.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711089689.XA CN107896200A (en) | 2017-11-08 | 2017-11-08 | Message scheduling method compatible with virtual link and packet switching mechanism |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711089689.XA CN107896200A (en) | 2017-11-08 | 2017-11-08 | Message scheduling method compatible with virtual link and packet switching mechanism |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN107896200A true CN107896200A (en) | 2018-04-10 |
Family
ID=61804250
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711089689.XA Pending CN107896200A (en) | 2017-11-08 | 2017-11-08 | Message scheduling method compatible with virtual link and packet switching mechanism |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107896200A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108768886A (en) * | 2018-05-30 | 2018-11-06 | 无锡知更鸟网络科技有限公司 | A kind of SaaS data access increased quality method |
| CN110493824A (en) * | 2019-08-28 | 2019-11-22 | 京信通信系统（中国）有限公司 | Data dispatching method, device, access network equipment and storage medium based on QoS |
| CN110995796A (en) * | 2019-11-20 | 2020-04-10 | 中国建设银行股份有限公司 | Data transmission method and device based on private line |
| CN114430362A (en) * | 2021-12-28 | 2022-05-03 | 东莞市李群自动化技术有限公司 | Link switching method, FPGA chip, device and storage medium |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050094643A1 (en) * | 2003-11-05 | 2005-05-05 | Xiaolin Wang | Method of and apparatus for variable length data packet transmission with configurable adaptive output scheduling enabling transmission on the same transmission link(s) of differentiated services for various traffic types |
| CN1722704A (en) * | 2004-12-31 | 2006-01-18 | 杭州华为三康技术有限公司 | Method for implementing resource reservation on packet ring |
| US20070002750A1 (en) * | 2005-07-01 | 2007-01-04 | Nec Laboratories America, Inc. | Generic Real Time Scheduler for Wireless Packet Data Systems |
| CN101964758A (en) * | 2010-11-05 | 2011-02-02 | 南京邮电大学 | Differentiated service-based queue scheduling method |
| CN103888379A (en) * | 2013-12-03 | 2014-06-25 | 江苏达科信息科技有限公司 | Improved queue scheduling algorithm based on trusted scheduling |
| CN105163393A (en) * | 2015-09-28 | 2015-12-16 | 上海理工大学 | Wireless link resource management method for use in intelligent traffic |
-
2017
- 2017-11-08 CN CN201711089689.XA patent/CN107896200A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050094643A1 (en) * | 2003-11-05 | 2005-05-05 | Xiaolin Wang | Method of and apparatus for variable length data packet transmission with configurable adaptive output scheduling enabling transmission on the same transmission link(s) of differentiated services for various traffic types |
| CN1722704A (en) * | 2004-12-31 | 2006-01-18 | 杭州华为三康技术有限公司 | Method for implementing resource reservation on packet ring |
| US20070002750A1 (en) * | 2005-07-01 | 2007-01-04 | Nec Laboratories America, Inc. | Generic Real Time Scheduler for Wireless Packet Data Systems |
| CN101964758A (en) * | 2010-11-05 | 2011-02-02 | 南京邮电大学 | Differentiated service-based queue scheduling method |
| CN103888379A (en) * | 2013-12-03 | 2014-06-25 | 江苏达科信息科技有限公司 | Improved queue scheduling algorithm based on trusted scheduling |
| CN105163393A (en) * | 2015-09-28 | 2015-12-16 | 上海理工大学 | Wireless link resource management method for use in intelligent traffic |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108768886A (en) * | 2018-05-30 | 2018-11-06 | 无锡知更鸟网络科技有限公司 | A kind of SaaS data access increased quality method |
| CN110493824A (en) * | 2019-08-28 | 2019-11-22 | 京信通信系统（中国）有限公司 | Data dispatching method, device, access network equipment and storage medium based on QoS |
| CN110493824B (en) * | 2019-08-28 | 2022-11-01 | 京信网络系统股份有限公司 | Data scheduling method and device based on QoS, access network equipment and storage medium |
| CN110995796A (en) * | 2019-11-20 | 2020-04-10 | 中国建设银行股份有限公司 | Data transmission method and device based on private line |
| CN114430362A (en) * | 2021-12-28 | 2022-05-03 | 东莞市李群自动化技术有限公司 | Link switching method, FPGA chip, device and storage medium |
| CN114430362B (en) * | 2021-12-28 | 2024-04-12 | 东莞市李群自动化技术有限公司 | Link switching method, FPGA chip, equipment and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101009655B (en) | Traffic scheduling method and device | |
| CN101406023B (en) | Method and system for implementing multi-protocol label switching network differential service flux engineering | |
| JP4115703B2 (en) | Method for multilevel scheduling of multiple packets in a communication network | |
| CN103430486B (en) | Optimal dynamic bandwidth scheduler | |
| CN107896200A (en) | Message scheduling method compatible with virtual link and packet switching mechanism | |
| EP2302843A1 (en) | Method and device for packet scheduling | |
| CN114051715B (en) | Control device, switching device and method | |
| JP3306705B2 (en) | Packet transfer control device and scheduling method thereof | |
| CN110808920B (en) | Satellite communication flow control method with coexistence of CCSDS frame and IP message | |
| CN101217495A (en) | Traffic monitoring method and device applied under T-MPLS network environment | |
| CN102387076B (en) | Shaping-combined hierarchical queue scheduling method | |
| CN102647760B (en) | Multi-service-network-based efficient service resource management method | |
| CN102868638A (en) | Method and system for dynamically regulating bandwidth | |
| CN109618375A (en) | UAV ad hoc network timeslot scheduling algorithm based on service priority and channel interruption probability | |
| CN101120612A (en) | Radio base station, control apparatus, and wireless communication method | |
| CN102932275A (en) | Priority message forwarding method applied to allowed time delay network | |
| CN109831393B (en) | Multi-granularity QoS control method for network virtualization | |
| CN102098217B (en) | Probability-based multipriority queue scheduling method | |
| CN101478486B (en) | Method, equipment and system for switch network data scheduling | |
| CN105099947B (en) | Spatial network cut-in method and device | |
| CN110247859B (en) | Data sending method and device based on AIRT-ROS node | |
| CN104022966B (en) | ONU internal scheduling method for guaranteeing QoS in PON based on NC | |
| CN102769566A (en) | Method and device for configuring multilevel scheduling system, and method and device for changing configuration of multilevel scheduling system | |
| Chen et al. | Packet Scheduling Algorithm Based on Priority Adjustment in Wireless Sensor Networks | |
| KR100446794B1 (en) | A traffic control technology in home network through adaptive priority control |
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 | ||
| WD01 | Invention patent application deemed withdrawn after publication | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20180410 |