CN1234226C - Method for packet transmission service quality dispatch by using remained life period in packet head - Google Patents
Method for packet transmission service quality dispatch by using remained life period in packet head Download PDFInfo
- Publication number
- CN1234226C CN1234226C CNB031450938A CN03145093A CN1234226C CN 1234226 C CN1234226 C CN 1234226C CN B031450938 A CNB031450938 A CN B031450938A CN 03145093 A CN03145093 A CN 03145093A CN 1234226 C CN1234226 C CN 1234226C
- Authority
- CN
- China
- Prior art keywords
- grouping
- packet
- ttl
- network
- node
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
- 238000000034 method Methods 0.000 title claims abstract description 29
- 230000005540 biological transmission Effects 0.000 title claims abstract description 28
- 238000012546 transfer Methods 0.000 claims description 11
- 230000015572 biosynthetic process Effects 0.000 claims description 9
- 230000009191 jumping Effects 0.000 claims description 6
- 230000000052 comparative effect Effects 0.000 claims description 2
- 238000004891 communication Methods 0.000 abstract description 10
- 238000005516 engineering process Methods 0.000 description 5
- 238000012545 processing Methods 0.000 description 2
- 238000011160 research Methods 0.000 description 2
- 101100172132 Mus musculus Eif3a gene Proteins 0.000 description 1
- 238000013459 approach Methods 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 230000002950 deficient Effects 0.000 description 1
- 239000003814 drug Substances 0.000 description 1
- 238000010187 selection method Methods 0.000 description 1
- 230000009466 transformation Effects 0.000 description 1
Images
Abstract
The present invention relates to a method for dispatching the service quality of the packet transmission and selecting routes by using the TTL (Time-to-Live) in a packet head. The method realizes the end-to-end time-delay guarantee of the packet during the transmission in the communication network, makes various receiving nodes in the communication network to choose routes and speed up the forwarding dispatch according to the recognized TTL value by a TTL field in the packet of the existing communication network. The method firstly judges whether a proper rout which satisfies the end-to-end time delay guarantee exists or not; TTL value is used as weight for forwarding dispatch under the condition of the existing of the route, so the efficiency and the stability of the transmission of the packet in the network can be ensured. At the same time of ensuring packet transmission time delay, the network load is reduced to the maximum extent.
Description
Technical field
The present invention relates to a kind of technical field that guarantees packet transfer delay.Be particularly related to packet scheduling and route selection method that a kind of method, especially realization that utilizes the residue lifetime (TTL) in the packets headers to carry out the scheduling of packet transmission service quality is grouped in time delay guarantee end to end in the communication network transmission course.
Background technology
We know that the scale of IP network is enlarging day by day, and the application of support is also increasing, and IP network is extensively admitted as the net that converges of miscellaneous service.But those bring rosy prospect to IP network, use in real time such as VoIP, video conference, remote teaching, tele-medicine etc., to the loose structure of IP network, simply service and controlling mechanism have been brought serious challenge.How to satisfy the propagation delay time that is grouped on IP network, think that real-time application provides service quality guarantee, become the problem that presses for solution that Internet faces.
As far back as the eighties, the research work of real time communication just begins, and successively in the multiple network structure, comprises that research postpones the assurance problem on CSMA/CD, token ring, FDDI, slotted ring, DQDB, ATM and the point to point network.The connection of a real-time application is exactly the relation between application and the network, and application need provides the Business Stream characteristic information to network in real time on the one hand, and network will provide its desired service quality to this real-time application on the other hand.Extendible connection access control is the key technology that realizes connection-oriented real time communication.
IETF IntServ system has proposed a whole set of based on the access control that connects and the systems approach of packet scheduling.By the strict control of access control, by the strict control of scheduling mechanism, the state information of each connection need be kept on each node that passes through in the path each stream in connecting the term of validity at establishment stage, and access control and scheduling all are join dependencys.Therefore, the express network core router usually is forced to safeguard, dispatch ten hundreds of connections; Along with the increase of number of connection, connection is set up and the overhead in the stage of release also will increase.The defective of IntServ poor expandability directly causes it to be difficult in the large-scale high speed internet network and implements.
The DiffServ system has overcome the shortcoming of poor expandability, can be fit to large scale network easily.From user's angle, DiffServ connects the user and is divided into the different classifications that pre-defines, and wrapping in the network of each class served according to class-based scheduling strategy.Router only is concerned about converging of connection, and each edge router is responsible for single stream is accumulated convergence flow.Therefore, the quantity of DiffServ model and Business Stream is irrelevant, has good expandability.But the DiffServ model is just dispatched according to the type of grouping, whether can arrive destination node by the time requirement as for grouping, and it is irrespective.So this method can not solve the problem that is grouped in the propagation delay time in the network fully.
Summary of the invention
For ensureing that in view of existing technology grouping transmits the deficiency on the real-time, main purpose of the present invention is to provide a kind of and utilizes the residue lifetime in the packets headers to carry out the method that the packet transmission service quality is dispatched, and particularly guarantees the method for packet network thing transmission real-time.This method can provide the grouping end-to-end quality of service to guarantee with above-mentioned other method.This method also can alleviate network load to a certain extent.
A kind ofly utilize residue lifetime in the packets headers to advance quality scheduling of (TTL:Time-to-Live) row packet transmission service and method of routing.Method realizes being grouped in time delay guarantee end to end in the communication network transmission course, utilize the ttl field of dividing into groups in the existing communication network, make each receiving node in the communication network carry out Route Selection according to the ttl value of identification and quicken to transmit scheduling, at first judge whether to exist the suitable route that end-to-end time delay guarantees that satisfies, utilize ttl value to transmit scheduling under the situation about existing, thereby guarantee is grouped in validity and the stability of transmitting in the network for weight.When guaranteeing packet transfer delay, alleviate network load to greatest extent.
The present invention realizes by the following technical solutions:
A kind ofly utilize residue lifetime in the packets headers to carry out scheduling of packet transmission service quality and method of routing, it is characterized in that, the residue lifetime ttl field of the network layer packet that utilization is transmitted in network, after residue jumping figure that itself and grouping are reached the destination compares, comparative result is carried out the foundation of transmitted in packets priority and best packet selection of transmission paths as weight, and preferentially transmit in view of the above, thereby the end that guarantees transmitted in packets alleviates network load to time delay.
The intermediate node that receives grouping also will calculate after the calculating of finishing ttl value and send packets to the stay of two nights from intermediate node 1 and how long minimumly also need, this time, can be that the grouping jumping figure that will pass through is minimum also have what or to transmit grouping on the best transfer path need through how long, this time can be an abstract value, we are called T1, node need be differentiated the size of the ttl value and the T1 of grouping, takes the Route Selection and scheduling treatment measures of appointment then.
If the ttl value that obtains after the process computing is less than T1, the transfer delay that shows grouping can't meet the demands, at this moment intermediate node should be with grouping from this knot removal, also just mean and from network, removed grouping, and respond an error notification message to the information source of posting a letter and divide into groups, the grouping of telling information source to send can't correctly send to the stay of two nights through this node, can also effectively alleviate the load of network like this.
If the ttl value of the grouping that calculates during more than or equal to T1, show grouping on request time delay send to the stay of two nights, at this moment, intermediate node 1 will be sent to grouping and transmit scheduler and Route Selection control assembly.
Sent to the route control assembly when grouping and carried out Route Selection when handling, the route control assembly will be selected the path that can satisfy the requirement of grouping TTL transfer delay at random according to routing table, then grouping being handed to corresponding output port transmits, the selection in this path can be that local node is made separately, also can be that local node and adjacent other node are united and made one's options.
The transmission packets path selected fixed after, grouping will be carried out dispatching management by transmitting scheduler handler, this time, transmitting scheduler will be according to the size of ttl value, and the respective priority formation etc. of grouping being delivered to corresponding output port is to be sent, at this moment, ttl value is more little, the life span that shows grouping is short more, for guaranteeing the real-time requirement, just grouping need be delivered to the high formation that sends priority more.
After grouping is handed to and is transmitted scheduler handler, scheduler handler can also be according to the size of ttl value, the respective priority formation that corresponding output port is delivered in the judgement grouping sends how long need wait, if this time adds behind the T1 greater than TTL, so just grouping is abandoned, and to information source loopback one error messages of posting a letter, the grouping of telling information source to send can't correctly send to the stay of two nights through this node.
Description of drawings
Fig. 1 is the transmission figure that is grouped in the network;
Fig. 2 is the node structure figure that realizes related Route Selection of TTL and scheduling;
Fig. 3 is IP packets headers figure.
Embodiment
As shown in fig. 1, information source sends to grouping in the network.Grouping is transmitted according to relevant treatment information handle the back by the relevant intermediate node in the network, is ultimately delivered to the stay of two nights.In existing communication network,, just grouping is abandoned if find to be grouped in during the TTL lifetime field of intermediate node handles grouping when life cycle in the network being zero.Otherwise routinely by after the road route selection algorithm carries out Route Selection, forward the packet to next intermediate node towards the destination stay of two nights.We now will node to the residue lifetime TTL handling process of grouping in except original TTL handles, also will increase following processing capacity (is example with intermediate node shown in Figure 1 1):
1) intermediate node 1 after the calculating of finishing ttl value, also to calculate from intermediate node 1 send packets to the stay of two nights also need minimum how long (for example the jumping figure of process is minimum what also have, or to transmit grouping on the best transfer path need through how long, that is to say that this time is on the logical meaning), this time be when in many transmission paths of the stay of two nights, transmitting grouping on the selected optimal transmission paths according to present node the required time calculate and obtain, we claim that this time is T1, differentiate the ttl value of grouping and the size of T1, take following processing then:
A) if TTL less than T1, the transfer delay that shows grouping can't meet the demands, at this moment intermediate node should be with grouping from this knot removal (also promptly having removed grouping) from network, and respond an error notification message to information source and divide into groups, the grouping of telling information source to send can't correctly send to the stay of two nights through this node.Can also effectively alleviate the load of network like this.
B) if the grouping TTL more than or equal to T1, show grouping on request time delay send to the stay of two nights.At this moment, intermediate node 1 will be handled forwarding scheduler and route control assembly that grouping is sent in as shown in Figure 2 the node.
2) sent to the route control assembly when grouping and carry out Route Selection when handling, the route control assembly will be according to selecting one can satisfy the path that grouping TTL transfer delay requires at random in many reachable paths that routing table provided.The selection in this path can be that local node is made separately, also can be that local node and adjacent other node are united and made.
3) the transmission packets path selected fixed after, grouping will be carried out dispatching management by transmitting scheduler handler, in this time, transmitting scheduler will be according to the size of ttl value, the respective priority formation etc. of grouping being delivered to corresponding output port is to be sent.At this moment, ttl value is more little, shows that the life span of grouping is short more, for guaranteeing the real-time requirement, just grouping need be delivered to the high formation that sends priority more.
4) after grouping is handed to and is transmitted scheduler handler, scheduler handler can also be according to the size of ttl value, the respective priority formation that corresponding output port is delivered in the judgement grouping sends how long need wait, if this time adds behind the T1 greater than TTL, so just grouping is abandoned, and to information source loopback one error messages of posting a letter, the grouping of telling information source to send can't correctly send to the stay of two nights through this node.
Fig. 2 has provided the node system structure that can satisfy above-mentioned requirements.
During said method is realized ttl value be set with several different methods:
1, adopt the method for designing of traditional ttl value, just TTL shows the maximum node number that the jumping figure that is grouped in the network promptly can pass through.Its form in grouping can be IP grouping as shown in Figure 3, also can be the ttl value in the label in the MPLS multiprotocol label switching net, can also be the TTL in the packet format that adopts of other network technology.
2, ttl value can be a timing value of predesignating, and is distributed to a value of grouping when for example grouping sends by information source, and this value is every through subtracting 1 or deduct other certain numerical value after a while automatically in network.Its specific implementation can realize by revising associated the Internet protocol.
Foregoing invention itself can realize guaranteeing to be grouped in the end-to-end time delay that transmits in the network separately, also can guarantee the real-time that grouping transmits by integrating the common guarantee network with existing other technology.
Any equivalent transformation according to inventive concept all should belong to protection scope of the present invention.
Claims (7)
1. one kind is utilized the residue lifetime in the packets headers to carry out scheduling of packet transmission service quality and method of routing, it is characterized in that, the residue lifetime ttl field of the network layer packet that utilization is transmitted in network, after residue jumping figure that itself and grouping are reached the destination compares, comparative result is carried out the foundation of transmitted in packets priority and best packet selection of transmission paths as weight, and preferentially transmit in view of the above, thereby the end that guarantees transmitted in packets alleviates network load to time delay.
2. according to claim 1ly a kind ofly utilize residue lifetime in the packets headers to carry out scheduling of packet transmission service quality and method of routing, it is characterized in that, the intermediate node that receives grouping also will calculate after the calculating of finishing ttl value and send packets to the stay of two nights from intermediate node 1 and how long minimumly also need, this time, can be that the grouping jumping figure that will pass through is minimum also have what, or to transmit grouping on the best transfer path need through how long, this time can be an abstract value, we claim that the back time is T1, node need be differentiated the size of the ttl value and the T1 of grouping, takes the Route Selection and scheduling treatment measures of appointment then.
3. according to claim 1ly a kind ofly utilize residue lifetime in the packets headers to carry out scheduling of packet transmission service quality and method of routing, it is characterized in that, if the ttl value that obtains after the process computing is less than T1, the transfer delay that shows grouping can't meet the demands, at this moment intermediate node should be with grouping from this knot removal, also just mean and from network, removed grouping, and respond an error notification message to the information source of posting a letter and divide into groups, the grouping of telling information source to send can't correctly send to the stay of two nights through this node, can also effectively alleviate the load of network like this.
4. according to claim 1ly a kind ofly utilize residue lifetime in the packets headers to carry out scheduling of packet transmission service quality and method of routing, it is characterized in that, if the ttl value of the grouping that calculates is during more than or equal to T1, show grouping on request time delay send to the stay of two nights, at this moment, intermediate node 1 will be sent to grouping and transmit scheduler and Route Selection control assembly.
5. according to claim 1ly a kind ofly utilize residue lifetime in the packets headers to carry out scheduling of packet transmission service quality and method of routing, it is characterized in that, sent to the route control assembly when grouping and carried out Route Selection when handling, the route control assembly will be selected the path that can satisfy the requirement of grouping TTL transfer delay at random according to routing table, then grouping being handed to corresponding output port transmits, the selection in this path can be that local node is made separately, also can be that local node and adjacent other node are united and made one's options.
6. according to claim 1ly a kind ofly utilize residue lifetime in the packets headers to carry out scheduling of packet transmission service quality and method of routing, it is characterized in that, the transmission packets path selected fixed after, grouping will be carried out dispatching management by transmitting scheduler handler, this time, transmitting scheduler will be according to the size of ttl value, respective priority formation of grouping being delivered to corresponding output port etc. is to be sent, at this moment, ttl value is more little, the life span that shows grouping is short more, for guaranteeing the real-time requirement, just grouping need be delivered to the high formation that sends priority more.
7. according to claim 1ly a kind ofly utilize residue lifetime in the packets headers to carry out scheduling of packet transmission service quality and method of routing, it is characterized in that, after grouping is handed to and is transmitted scheduler handler, scheduler handler can also be according to the size of ttl value, the respective priority formation that corresponding output port is delivered in the judgement grouping sends how long need wait, if this time adds behind the T1 greater than TTL, so just grouping is abandoned, and to information source loopback one error messages of posting a letter, the grouping of telling information source to send can't correctly send to the stay of two nights through this node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB031450938A CN1234226C (en) | 2003-06-27 | 2003-06-27 | Method for packet transmission service quality dispatch by using remained life period in packet head |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB031450938A CN1234226C (en) | 2003-06-27 | 2003-06-27 | Method for packet transmission service quality dispatch by using remained life period in packet head |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1472937A CN1472937A (en) | 2004-02-04 |
| CN1234226C true CN1234226C (en) | 2005-12-28 |
Family
ID=34155866
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB031450938A Expired - Fee Related CN1234226C (en) | 2003-06-27 | 2003-06-27 | Method for packet transmission service quality dispatch by using remained life period in packet head |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN1234226C (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1937619A (en) | 2005-09-23 | 2007-03-28 | 华为技术有限公司 | Method for realizing TPSM under carrier's carrier condition |
| CN101674177B (en) * | 2009-10-21 | 2012-03-07 | 北京九合创胜网络科技有限公司 | Method and device for detecting transparent proxy |
| US10185550B2 (en) | 2016-09-28 | 2019-01-22 | Mcafee, Inc. | Device-driven auto-recovery using multiple recovery sources |
| WO2018125989A2 (en) | 2016-12-30 | 2018-07-05 | Intel Corporation | The internet of things |
| CN111510396B (en) * | 2020-06-30 | 2020-10-27 | 腾讯科技（深圳）有限公司 | Message sending method and related device |
| CN116028398B (en) * | 2022-11-01 | 2023-10-31 | 中科计算技术西部研究院 | Interconnection network arbitration system, device, method and storage medium |
-
2003
- 2003-06-27 CN CNB031450938A patent/CN1234226C/en not_active Expired - Fee Related
Also Published As
| Publication number | Publication date |
|---|---|
| CN1472937A (en) | 2004-02-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CA2379594C (en) | Label distribution protocol supporting multiple classes of service in a multi protocol label switching (mpls) network, methods and mpls network using thereof | |
| CN100349443C (en) | Method and apparatus for scheduling message processing | |
| CN101779198B (en) | Stream reservation protocol for bridged networks | |
| CN101478483B (en) | Method for implementing packet scheduling in switch equipment and switch equipment | |
| CN104994033A (en) | Method for guaranteeing QoS (quality of service) of SDN (software defined network) by means of dynamic resource management | |
| JPH11163854A (en) | Data communication method | |
| CN101325538A (en) | Apparatus and method for implementing margin gateway total system QoS | |
| CN102469019B (en) | Device and method for allocating aggregated link bandwidth in packet-switched network | |
| CN107948103A (en) | A kind of interchanger PFC control methods and control system based on prediction | |
| CN101958847A (en) | Selection method of distributed QOS (Quality of Service) routes | |
| WO2022037266A1 (en) | Method, apparatus, and system for communication in data centre | |
| CN109889779A (en) | A kind for the treatment of method and apparatus of packet out-ordering | |
| CN1234226C (en) | Method for packet transmission service quality dispatch by using remained life period in packet head | |
| CN114398174A (en) | Dynamic energy-saving scheduling method and system for data center network in SDN environment | |
| CN101087257B (en) | Method for realizing service quality for VPN traffic based on Ethernet interface | |
| CN101771553B (en) | Method for transmitting multimedia multicasting service | |
| CN1738294A (en) | Method for applying service quality technology in intelligent virtual switching | |
| CN101764732A (en) | Method, network and node device for establishing Ethernet virtual connection | |
| CN100486219C (en) | A method to realize the end-to-end stream transmission | |
| CN1870575A (en) | Method for raising transmission reliability in virtual exchange system | |
| CN1219386C (en) | Transmission time-delay scheduling method utilizing TTL in packet head and service type field | |
| Hua et al. | A DTN congestion mechanism based on Distributed Storage | |
| Lu et al. | Contention reduction in core optical packet switches through electronic traffic smoothing and scheduling at the network edge | |
| Zou et al. | Dynamic load balancing based on roulette wheel selection | |
| CN100450078C (en) | Method and system of handling queue QoS |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| EE01 | Entry into force of recordation of patent licensing contract |
Assignee: Beijing Zhongke Jingshang Technology Co., Ltd. Assignor: Institute of Computing Technology, Chinese Academy of Sciences Contract record no.: 2011110000143 Denomination of invention: Method for packet transmission service quality dispatch by using remained life period in packet head Granted publication date: 20051228 License type: Exclusive License Open date: 20040204 Record date: 20110823 |
|
| EC01 | Cancellation of recordation of patent licensing contract |
Assignee: Beijing Zhongke Polytron Technologies Inc Assignor: Institute of Computing Technology, Chinese Academy of Sciences Contract record no.: 2011110000143 Date of cancellation: 20181212 |
|
| EC01 | Cancellation of recordation of patent licensing contract | ||
| EM01 | Change of recordation of patent licensing contract |
Change date: 20181212 Contract record no.: 2011110000143 Assignee after: Beijing Zhongke Polytron Technologies Inc Assignee before: Beijing Zhongke Jingshang Technology Co., Ltd. |
|
| EM01 | Change of recordation of patent licensing contract | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20051228 Termination date: 20190627 |