CN1750516A - Method for realizing end-to-end QoS route based on local QoS catagory - Google Patents
Method for realizing end-to-end QoS route based on local QoS catagory Download PDFInfo
- Publication number
- CN1750516A CN1750516A CNA2005101177175A CN200510117717A CN1750516A CN 1750516 A CN1750516 A CN 1750516A CN A2005101177175 A CNA2005101177175 A CN A2005101177175A CN 200510117717 A CN200510117717 A CN 200510117717A CN 1750516 A CN1750516 A CN 1750516A
- Authority
- CN
- China
- Prior art keywords
- qos
- path
- route
- domain
- catagory
- 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
- 238000000034 method Methods 0.000 title claims abstract description 37
- 230000003993 interaction Effects 0.000 claims abstract description 4
- 238000009825 accumulation Methods 0.000 claims description 11
- 238000006116 polymerization reaction Methods 0.000 claims description 5
- 239000012467 final product Substances 0.000 claims description 4
- 238000011144 upstream manufacturing Methods 0.000 description 5
- OPIGMRDAPFQALU-UHFFFAOYSA-N 4-amino-n-(5-propan-2-yl-1,3,4-thiadiazol-2-yl)benzenesulfonamide Chemical compound S1C(C(C)C)=NN=C1NS(=O)(=O)C1=CC=C(N)C=C1 OPIGMRDAPFQALU-UHFFFAOYSA-N 0.000 description 3
- 238000010586 diagram Methods 0.000 description 3
- 230000000694 effects Effects 0.000 description 3
- 230000005540 biological transmission Effects 0.000 description 2
- 238000004364 calculation method Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000004458 analytical method Methods 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
This invention discloses a method for realizing end-to-end QoS route based on local QoS category, which contains obtaining topological structure of polylogic node of whole network, every network subdomain supported local QoS category and unit band width price through information interaction among logic nodes of each category, said logic node pre calculating route list to each destination node, the route in route list arranged according to route cost increased order. In operation process, said logic node obtaining the real time resource state of other logic nodes through route protocol.
Description
Technical field
The present invention relates to a kind of implementation method of network QoS route, in particular one always based on the method for the route implementing of QoS end to end of local QoS catagory.
Background technology
The purpose of QoS route is to seek the network path that satisfies performance requirement for the application with QoS performance requirement, if network node is understood the QoS state of global network, then can choose the path of satisfying qos requirement according to this global state information.But when being on a grand scale of global network, and application request is when a lot, and network has very big dynamic, and node just is difficult to the accurate QoS state of understanding the whole network overall situation.Calculate if each application request is all carried out end-to-end QoS route of overall importance, the inexactness of path computing is very big, and the processing expenditure of calculating is also very big, and very high to the disposal ability requirement of system, this is not a kind of good implementation method.
Usually can consider in the prior art network of global scope is divided into a plurality of little network areas, each regional scale is more suitable, thereby can make things convenient for control and management in the territory, can claim that a such network area is a network sub-domain.For the network of the overall situation, regard each network sub-domain the logical node of a polymerization as, so also just simplified the topological structure of global network, and, then can adopt the routing policy of layering for the end-to-end QoS route of global network.
Summary of the invention
The object of the present invention is to provide a kind of method of the end-to-end QoS route implementing based on local QoS catagory, by adopting sorting to routing table according to the route cost, to non-resource preassignment and pre-allocation of resources mode etc., can realize the layering strategy of the end-to-end QoS route of global network.
Technical scheme of the present invention comprises:
A kind of method of the end-to-end QoS route implementing based on local QoS catagory, it may further comprise the steps:
A, in the starting stage, between the logical node by the topological structure of information interaction with the polymerization logical node that obtains global network, the unit bandwidth price of the local QoS catagory that each network sub-domain is supported and each classification, described logical node calculates its routing table of going to each destination node in advance, and the path in the described routing table increases preface by the route cost and arranges;
B, for the mode of pre-allocation of resources, at run duration, described logical node by Routing Protocol to understand the real-time resource status of other logical node;
C, when the QoS service request arrives, source node is retrieved described routing table according to the order of sequence, article one path of finding accumulation QoS performance to satisfy professional QoS performance requirement, for the preallocated mode of non-resource, this path is institute and asks; Mode for pre-allocation of resources, according to the real-time resource status of each network sub-domain on the path and bandwidth on demand that should business, judge whether each network sub-domain has enough resources to distribute this route table items at the desired local QoS catagory of this network sub-domain; If each network sub-domain all has enough resources to distribute the QoS classification of requirement, then this path is the routed path of being asked; Otherwise continue to search routing table, up to finding article one to satisfy the path that the service feature requirement has enough allowable resources simultaneously, then this path be the institute ask.
Described method, wherein, the real-time resource status of described logical node is meant the volume residual of the network sub-domain of this logical node representative for the bandwidth resources of its adjacent any two each local QoS catagories that logical node distributed.
Described method wherein, also comprises if the route cost in path surpasses this professional unit bandwidth price, then finishes searching routing table; If do not find satisfactory path, then the QoS route finishes, routing failure.
Described method wherein, for the preallocated routing policy of non-resource, only considers that the logical path of all shortest lengths gets final product.
The method of a kind of end-to-end QoS route implementing based on local QoS catagory provided by the present invention, owing to adopted sorting to routing table according to the route cost, to non-resource preassignment and pre-allocation of resources mode etc., realized the layering strategy of the end-to-end QoS route of global network, and can select route to obtain maximum value operator.
Description of drawings
Fig. 1 is the network sub-domain and the local QoS catagory schematic diagram of the inventive method;
Fig. 2 is the routing table structural representation of the inventive method;
Fig. 3 is the end-to-end QoS route computing method schematic diagram of the inventive method;
Fig. 4 is the two-stage route table structural representation of the inventive method;
Fig. 5 is the QoS process schematic diagram of the inventive method.
Embodiment
Below in conjunction with accompanying drawing, will carry out comparatively detailed explanation to each preferred embodiment of the present invention.
The ITU-T of International Telecommunication Association has defined the IP network QoS classification of 6 different performance grades in Y.1541 in recommended standard, the classification of each grade has all been stipulated its QoS performance range end to end, mainly comprise average delay IPTD, delay difference IPDV, loss rate IPLR, four kinds of qos parameters of PER IPER.This QoS class declaration of ITU-T be QoS performance end to end, similar with it, the present invention defines the IP network local QoS catagory of the different performance grade in each network sub-domain to represent the QoS transmittability of this network sub-domain.
Local QoS catagory comprises some qos parameters, and different performance implications is arranged respectively.For example can be Y.1541 the same with ITU-T, comprise average delay IPTD, delay difference IPDV, loss rate IPLR, four kinds of qos parameters of PER IPER, its implication is also Y.1541 consistent with ITU-T.Define what local QoS catagories, qos parameter that each local QoS catagory comprises and corresponding performance span all need further research, can be with reference to the definition of QoS classification end to end in Y.1541.
With source endpoint and purpose end points also respectively as two logical nodes, then the local QoS catagory of network sub-domain always connects two logical nodes adjacent with it, promptly connect and its two adjacent network sub-domain, or connect and its certain adjacent end points (source end or destination) and a network sub-domain, or connect and its adjacent source endpoint and purpose end points.Therefore the local QoS catagory of network sub-domain is also relevant with the logical node of the upstream and downstream of transfer of data, for a network sub-domain, need for its arbitrarily two in abutting connection with using one group of independently resource of local QoS catagory between the logical node, this is because the logical node of different upstream and downstreams has different entrance and exit network nodes usually, therefore can't share identical local QoS catagory resource.
The tentation data transmission is unidirectional, and then local QoS catagory also is unidirectional.Local QoS catagory from A to B is different with the local QoS catagory from B to A in abutting connection with logical node A and B for two of network sub-domain, and they can adopt identical routed path, also can adopt different routed paths.In addition, handle for convenience, the present invention is also included within the QoS performance of the domain-to-domain link between the logical node among the local QoS catagory of its upstream logical node.Network sub-domain and local QoS catagory are as shown in Figure 1.
For network sub-domain, can be the local QoS catagory Resources allocation in advance.Network sub-domain be it any two in abutting connection with resource of distributing each local QoS catagory between the logical node and the routed path in the territory, the strategy that how much depends on this network sub-domain of each local QoS catagory Resources allocation and it and these two are in abutting connection with the SLA that signs between the logical node.A kind of possible way is to adopt the MPLS technology, according to the QoS performance for the local QoS catagory definition, just the span of each qos parameter is determined routed path for each local QoS catagory between these two logical nodes, QoS transmits behavior, thereby and Resources allocation corresponding LSP is set.
The resource quantity of the local QoS catagory of reserving between two logical nodes can be adjusted by network sub-domain as required dynamically, in addition, resource between the different local QoS catagories also can transform mutually according to the resource operating position, just, the part resource that local QoS catagory more than needed is arranged can be converted to the resource of the local QoS catagory of scarcity of resources when if the resource of certain local QoS catagory has the scarcity of resources of more than needed and another local QoS catagory.
Because the QoS performance is the accumulative effect of QoS performance of all network elements of process on the routed path end to end, when network sub-domain adopts local QoS catagory to come the QoS of handle packet to transmit, then end to end the QoS performance be routed path the accumulative effect of the local QoS catagory that adopted of the all-network subdomain of process.The accumulation rule of average delay IPTD is addition, and promptly average delay is the average delay sum of the local QoS catagory of each network sub-domain end to end.The accumulation rule of other qos parameter then needs further research.
Has the business of definite end-to-end QoS performance requirement for certain, its end to end the QoS route also just be converted into following problem: seek the routed path of source end to destination, and the local QoS catagory that each network sub-domain adopted on definite this path, make that the QoS accumulative effect satisfies this professional QoS performance requirement end to end.
By global network being divided into a plurality of network sub-domain, each network sub-domain is aggregated into a logical node, the end-to-end QoS route of global network can adopt the routing policy of layering.Because the local QoS catagory of each network sub-domain all pre-defines, source node only need be understood the network topology of the logical node after the global network polymerization, calculate all possible logical node path of going to certain destination node from source node in advance, that is to say the path of the network sub-domain of leap.For every logical path, the network sub-domain of each logical node is distributed different local QoS catagories, also just can obtain the different accumulation of QoS end to end performances.Notice that if the logical node sequence of two paths is identical, but the local QoS catagory that each logical node adopts is incomplete same, then they belong to different logic routed paths.Logical node sequence with each bar logic routed path, the accumulation QoS performance in this path of local QoS catagory that each logical node adopts and correspondence is formed a route table items, and the combination of the route table items of then all logic routed paths has also just formed the QoS routing table that precalculated Zhang Yuan's node is gone to certain destination node.
Have the business of definite end-to-end QoS performance requirement for certain, according to this professional end-to-end QoS performance requirement, search the QoS routing table, all logic routed paths that meet performance requirement all are that feasible routed path is end to end selected.
The method of the described end-to-end QoS route implementing based on local QoS catagory of the inventive method, if the local QoS catagory of network sub-domain can be chosen arbitrarily, then for a given paths, if each network sub-domain all selects to have the highest grade the local QoS catagory of best QoS performance, then the end-to-end accumulation QoS performance of this logic routed path also is best undoubtedly.But adopt the high more local QoS catagory of performance rate, the local resource of the network sub-domain of its consumption is also many more, and the resource of local network is always limited, therefore needs by certain strategy with the distribution of control for local QoS catagory.
Since the local QoS catagory of different brackets consumes the local resource of varying number, then can give different prices according to the resource quantity that they consume, determine the price of a unit bandwidth for each local QoS catagory.Article one, the logic routed path its end to end the unit bandwidth price then be the summation of the unit bandwidth price of the local QoS catagory that each network sub-domain adopted on this path.This also is that operator adopts this logic routed path to carry out the resources costs price of the required unit bandwidth of paying of route, and the present invention is referred to as the route cost in path.Therefore, the inventive method increases the route cost of every logic routed path in the route table items that calculates before.
And for business with end-to-end QoS performance requirement, too determine the price of a unit bandwidth according to its QoS performance requirement.The user uses certain business, needs to pay for this business accordingly, and the QoS performance of requirement is high more, and the bandwidth of use is many more, and the expense of then paying is high more.The price of the price of local QoS catagory and QoS business need decide according to the strategy between operator self and the different operators, requires further study.
For certain business, the user always needs to pay definite expense, and the route of the QoS end to end difference that operator adopts for this business, its cost of paying is also different, and cost is low more, and then the income of operator is also just high more.And if the cost of operator's expenditure will surpass the expense that the user pays, then operator manages for loss, need avoid this situation, so in this case, operator is with the request of refusing user's to this business.
The inventive method is in the starting stage, between the logical node by the topological structure of information interaction with the polymerization logical node that obtains global network, the unit bandwidth price of the local QoS catagory that each network sub-domain is supported and each classification.According to these information, as mentioned before, logical node calculates its routing table of going to each destination node in advance.Path in the routing table increases preface by the route cost arranges, and then its route cost of path more in front is low more, as shown in Figure 2.Mode for pre-allocation of resources, at run duration, logical node can be by Routing Protocol to understand the real-time resource status of other logical node, and the real-time resource status of said logical node is meant the volume residual of the network sub-domain of this logical node representative for the bandwidth resources of its adjacent any two each local QoS catagories that logical node distributed here.
End-to-end QoS route calculation method as shown in Figure 3.When the QoS service request arrived, source node was retrieved routing table according to the order of sequence, article one path of finding accumulation QoS performance to satisfy professional QoS performance requirement, and for the preallocated mode of non-resource, this path is institute and asks.And for the mode of pre-allocation of resources, also to judge whether each network sub-domain has enough resources to distribute this route table items at the desired local QoS catagory of this network sub-domain according to the real-time resource status of each network sub-domain on the path and bandwidth on demand that should business.If each network sub-domain all has enough resources to distribute the QoS classification of requirement, then this path is the routed path of being asked.Otherwise continue to search routing table, as long as find article one to satisfy the path that the service feature requirement has enough allowable resources simultaneously, then this path be the institute ask.Analysis according to preamble, if the route cost in path surpasses this professional unit bandwidth price, then operator will run at a loss, therefore when the route cost surpasses professional unit bandwidth price, end is searched routing table, if do not find satisfactory path, then the QoS route finishes, routing failure.The path of adopting this method to obtain, it is the minimum path of cost that can satisfy this professional QoS performance requirement in the current network, then operator adopts this path can obtain maximum value.
The described routing table of the inventive method is all set of logic routed path end to end, if the kind of network sub-domain and local QoS catagory is many, then the scale of routing table may be very big.The route cost increases the preface arrangement by path, adopts the mode of linear search may cause efficient too low then, therefore is necessary to seek the better route querying algorithm of efficient.
A kind of way that improves route querying efficient is to adopt the two-stage route table structure, as shown in Figure 4.The first order in routing table, for having the identical end-to-end accumulation QoS performance and the only corresponding same route table items of logical path of route cost, these logical paths with identical QoS performance and route cost then are stored in the second level routing table of this route table items correspondence.If the qos parameter of the local QoS catagory of different network sub-domain is identical with being provided with of route cost, does the scale that just can significantly reduce first order routing table like this, thereby improve route querying efficient.
If find article one to satisfy the route table items of QoS performance requirement in first order routing table, for the preallocated routing policy of non-resource, a certain paths of choosing in the second level routing table of this route table items correspondence gets final product.And for the routing policy of pre-allocation of resources, need choose the path that each network sub-domain has assignable local QoS catagory resource in this second level routing table, if can not find such path, then need to continue to search first order routing table and can satisfy QoS performance and the requirement of route cost to find, and the path with assignable local QoS catagory resource.
Those paths for the route cost maximum in the variant logical path length, they are to occur according to the order that path increases progressively in routing table, promptly in the routing table that increases the preface arrangement by the route cost, what occur at first is the path of the route cost maximum of path minimum, and last appearance is the path (this also is last list item of routing table) of the route cost maximum of path maximum.All can not satisfy QoS performance requirement and the requirement of route cost simultaneously if random length is the logic routed path of N, then random length also all can not satisfy QoS performance requirement and the requirement of route cost simultaneously greater than the logic routed path of N.And routing table increases the preface arrangement according to the route cost, then in the route querying process, from minimum path length, if all search for all logical paths of a certain path N, can not find the routed path (being not) that satisfies QoS performance requirement and the requirement of route cost simultaneously because the interior not enough reason of resource of network sub-domain, then all follow-up paths all can not be satisfied QoS performance requirement and the requirement of route cost simultaneously in the routing table, therefore route querying is unsuccessful, and need not to continue to search routing table.
In addition, if the logical path of a certain non-shortest length can satisfy accumulation QoS performance requirement, then certainly exist the logical path of and accumulation QoS performance better shortest length littler than this path route cost.Therefore for the preallocated routing policy of non-resource, the logical path that only needs to consider all shortest lengths gets final product, and also can reduce the routing table scale so undoubtedly and improve search efficiency.
At last, if what adopt is the teleservice or the QoS classification of type, just Qing Qiu QoS performance requirement and price all pre-defines, then can be each benchmark service or QoS category construction routing table independently end to end, satisfy the logic routed path that QoS performance requirement and route cost be no more than the unit bandwidth price of business or QoS classification by all and form, route table items still increases preface by the route cost and arranges.For the preallocated routing policy of non-resource, article one path of routing table is institute and asks, and for the routing policy of pre-allocation of resources, then chooses the path that each network sub-domain of article one has assignable local QoS catagory resource.For each end to end benchmark service or QoS classification the scale that routing table independently can reduce routing table is set, and because each route table items all is the logical path that satisfies the QoS performance requirement, this also can improve route querying efficient greatly.
The source end of the inventive method carries out then having determined the routed path of logical node after the route calculating end to end, and the local QoS catagory that each network sub-domain adopted.
If network sub-domain has been distributed resource for local QoS catagory in advance, promptly adopt the mode of pre-allocation of resources, for each network sub-domain on the logical path, according to path in the resource of its this local QoS catagory that distributes between logical node for two adjacency of upstream and downstream on this routed path in advance and the territory, can determine the routed path that network sub-domain is interior and distribute bandwidth for this business fast.
The inventive method also can adopt the preallocated mode of non-resource, and then network sub-domain need not to understand by Routing Protocol the real-time resource status of other network sub-domain, and route always selects to satisfy in the routing table QoS of survice performance and the minimum path of route cost.Calculate end to end after the QoS route, for each network sub-domain on the path, also need to calculate and resource reservation according to the QoS route that its local QoS catagory that adopts carries out in the territory, have only each network sub-domain can both obtain the performance of corresponding local QoS catagory, this business could successfully be admitted, otherwise then is rejected.
For the preallocated mode of non-resource, because source node can't be understood each network sub-domain in advance and can be the local QoS catagory of this business support, therefore the path of QoS route calculating end to end can not guarantee that business can be by the admittance of success, and therefore the routing policy of the relative pre-allocation of resources mode of business admission success rate of the routing policy of this mode will hang down.And for each QoS business, each network sub-domain all will be carried out calculating of QoS route and the resource reservation in the territory one time, has also increased computing cost.Its advantage is: satisfy the QoS of survice performance and the minimum path of route cost owing to always adopt, for this business, operator can obtain maximum value.In addition, owing to need not to exchange routing state information between network sub-domain, operate relatively also simpler by Routing Protocol.
Concrete QoS process is as shown in Figure 5: when the business with QoS performance requirement arrived, the source end carried out Route Selection according to previously described end-to-end QoS method for routing.Determined after the logic routed path that the source end is initiated the path along this path and set up process.For each network sub-domain on this path, if adopt the mode of pre-allocation of resources, then according to being this local QoS catagory pre-assigned resource and path between the downstream logic node thereon, determine this business in this network sub-domain routed path and distribute bandwidth.If adopt the preallocated mode of non-resource, then each network sub-domain also needs to calculate and bandwidth reserved according to the QoS route that its local QoS catagory that adopts carries out between the upstream and downstream logical node in the territory.After all successful local QoS catagory that adopts for it of all-network subdomain on the path had been reserved bandwidth, the path that then has end-to-end QoS assurance ability was set up successfully, and transmission can successfully be admitted and begin to business.Otherwise business can not successfully be admitted and is rejected.
Claims (4)
1, a kind of method of the end-to-end QoS route implementing based on local QoS catagory, it may further comprise the steps:
A, in the starting stage, between the logical node by the topological structure of information interaction with the polymerization logical node that obtains global network, the unit bandwidth price of the local QoS catagory that each network sub-domain is supported and each classification, described logical node calculates its routing table of going to each destination node in advance, and the path in the described routing table increases preface by the route cost and arranges;
B, for the mode of pre-allocation of resources, at run duration, described logical node by Routing Protocol to understand the real-time resource status of other logical node;
C, when the QoS service request arrives, source node is retrieved described routing table according to the order of sequence, article one path of finding accumulation QoS performance to satisfy professional QoS performance requirement, for the preallocated mode of non-resource, this path is institute and asks; Mode for pre-allocation of resources, according to the real-time resource status of each network sub-domain on the path and bandwidth on demand that should business, judge whether each network sub-domain has enough resources to distribute this route table items at the desired local QoS catagory of this network sub-domain; If each network sub-domain all has enough resources to distribute the QoS classification of requirement, then this path is the routed path of being asked; Otherwise continue to search routing table, up to finding article one to satisfy the path that the service feature requirement has enough allowable resources simultaneously, then this path be the institute ask.
2, method according to claim 1, it is characterized in that the real-time resource status of described logical node is meant the volume residual of the network sub-domain of this logical node representative for the bandwidth resources of its adjacent any two each local QoS catagories that logical node distributed.
3, method according to claim 1 is characterized in that, also comprises if the route cost in path surpasses this professional unit bandwidth price, then finishes searching routing table; If do not find satisfactory path, then the QoS route finishes, routing failure.
4, method according to claim 1 is characterized in that, for the preallocated routing policy of non-resource, only considers that the logical path of all shortest lengths gets final product.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNA2005101177175A CN1750516A (en) | 2005-11-07 | 2005-11-07 | Method for realizing end-to-end QoS route based on local QoS catagory |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNA2005101177175A CN1750516A (en) | 2005-11-07 | 2005-11-07 | Method for realizing end-to-end QoS route based on local QoS catagory |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN1750516A true CN1750516A (en) | 2006-03-22 |
Family
ID=36605780
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNA2005101177175A Pending CN1750516A (en) | 2005-11-07 | 2005-11-07 | Method for realizing end-to-end QoS route based on local QoS catagory |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN1750516A (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100413263C (en) * | 2006-07-26 | 2008-08-20 | 华为技术有限公司 | Method for end-to-end data business establishment |
| CN101388886B (en) * | 2007-09-14 | 2012-06-06 | 中兴通讯美国公司 | Path service quality reinforcing method and system in multi-hop packet communication network |
| CN101573889B (en) * | 2006-10-03 | 2014-05-14 | 维尔塞特公司 | Web/bulk transfer preallocation of upstream resources in satellite communication system |
| CN105207787A (en) * | 2015-08-28 | 2015-12-30 | 华为技术有限公司 | Business QoS control method and network apparatus |
| CN113852570A (en) * | 2021-09-23 | 2021-12-28 | 北京金山云网络技术有限公司 | Method, device and equipment for generating recommended node bandwidth and computer readable medium |
| WO2023080961A1 (en) * | 2021-11-03 | 2023-05-11 | Qualcomm Incorporated | 5g qos provisioning for an end-to-end connection including non-5g networks |
-
2005
- 2005-11-07 CN CNA2005101177175A patent/CN1750516A/en active Pending
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100413263C (en) * | 2006-07-26 | 2008-08-20 | 华为技术有限公司 | Method for end-to-end data business establishment |
| CN101573889B (en) * | 2006-10-03 | 2014-05-14 | 维尔塞特公司 | Web/bulk transfer preallocation of upstream resources in satellite communication system |
| CN101388886B (en) * | 2007-09-14 | 2012-06-06 | 中兴通讯美国公司 | Path service quality reinforcing method and system in multi-hop packet communication network |
| CN105207787A (en) * | 2015-08-28 | 2015-12-30 | 华为技术有限公司 | Business QoS control method and network apparatus |
| CN105207787B (en) * | 2015-08-28 | 2018-09-11 | 华为技术有限公司 | A kind of QoS of survice control method and the network equipment |
| CN113852570A (en) * | 2021-09-23 | 2021-12-28 | 北京金山云网络技术有限公司 | Method, device and equipment for generating recommended node bandwidth and computer readable medium |
| WO2023080961A1 (en) * | 2021-11-03 | 2023-05-11 | Qualcomm Incorporated | 5g qos provisioning for an end-to-end connection including non-5g networks |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US6785737B2 (en) | Network resource allocation methods and systems | |
| CA2716526C (en) | A method for equitable bandwidth allocation for content distribution networks | |
| CN102571557B (en) | Dynamically generating application-layer traffic optimization protocol maps | |
| CN1287559C (en) | Route determining method for multi-agreement label conversion network | |
| WO2004111775A2 (en) | Static dense multicast path and bandwidth management | |
| CN1529518A (en) | Restriction-Based Shortest Path First Method for Dynamically Switched Optical Transport Networks | |
| CN1254052C (en) | Transmission network restraint path calculating method | |
| CN107135056B (en) | Anycast service resource allocation method for reducing frequency spectrum fragments and time delay | |
| CN1188984C (en) | Selecting method based on path-time delay probability distribution | |
| CN1708947A (en) | Method and arrangement to reserve resources in an IP network | |
| CN101155119A (en) | Method and device for confirming boundary node of autonomous system and its path computing method | |
| WO2023078150A1 (en) | Path calculation method, route calculation device, electronic device, and computer storage medium | |
| CN1750516A (en) | Method for realizing end-to-end QoS route based on local QoS catagory | |
| CN1362806A (en) | Routing and wavelength distributing method for optical wavelength division multiplexing network | |
| CN106533986A (en) | Path allocation method and device for reserving bandwidth resources on basis of time period | |
| CN1756186A (en) | Resource management realizing method | |
| CN100456691C (en) | A method for allocating bearer network resources | |
| Karaman | Constraint-based routing in traffic engineering | |
| CN115473842A (en) | Computing power network information notification and routing decision method, device and medium | |
| CN1735073A (en) | Method for distributing service mass resource according to signing service level | |
| Habib et al. | An adaptive quality of service channel borrowing algorithm for cellular networks | |
| CN1870586A (en) | Optimization route selection method used for bearing network control server | |
| Piruthiviraj et al. | Wavelength Selectivity Using Adaptive Shortest Path Algorithm for Optical Network. | |
| CN1599328A (en) | Selecting method of path in resource supervisor | |
| Lui et al. | Qos multicast routing with heterogeneous receivers |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C12 | Rejection of a patent application after its publication | ||
| RJ01 | Rejection of invention patent application after publication |