CN106209631A - The system of selection of the route in real time of end-to-end communication network - Google Patents
The system of selection of the route in real time of end-to-end communication network Download PDFInfo
- Publication number
- CN106209631A CN106209631A CN201610550240.8A CN201610550240A CN106209631A CN 106209631 A CN106209631 A CN 106209631A CN 201610550240 A CN201610550240 A CN 201610550240A CN 106209631 A CN106209631 A CN 106209631A
- Authority
- CN
- China
- Prior art keywords
- capacity
- path
- bandwidth
- routed
- delay
- 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
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/302—Route determination based on requested QoS
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses the system of selection of the route in real time of a kind of end-to-end communication network, to different service quality ratings, determine end-to-end path, at a known network, characteristic according to link, it is considered to larger capacity and relatively short delay, selects end-to-end path, and determining that the user being routed at every connects number, concrete steps calculate the capacity in all end-to-end paths, delay；Select a capacity maximum and the path of shortest delay；Computation bandwidth；Calculate the connection number of distribution bandwidth；Calculate the capacity making to use up；Update the bandwidth capacity of link；Update the connection number of remaining bandwidth；Recording capacity and connection number, generate sample data sets；Output sample data sets.Present invention achieves the real-time Route Selection for end-to-end communication network, consider quality of service requirement, determining that being suitable for the user of each service quality rating on path, and path connects quantity, experimental result shows that this method can be run and quickly select method for routing.
Description
Technical field
The present invention relates to internet arena, particularly relate to the reality of a kind of end-to-end communication network considering quality of service requirement
Time route system of selection.
Background technology
The Internet random network is a kind of network technology reflecting multiple random factor.It is different from traditional network technology,
Node, arrow and flow in random network model all with uncertainty to a certain extent, not only reflection activity
Various quantitative parameters, if time, expense, resource consumption, benefit, loss etc. are stochastic variables, and network consisting figure is every
Activity can also be random, can occur by certain probability or not occur, and allows multiple origin node or from multiple joints that converge
The network closed circuit of point exists.Random network represents that problem information relevant in network is the uncertain of the unknown in advance, but
It is that these random informations can be described by known probability distribution.Such as, random networking route searching optimization problem
I.e. represent and expend the stochastic variable for obeying certain probability distribution by the transmission on limit in network.
Route searching optimization problem in the Internet random network solve the state needing consideration time and network, because of
This its problem scale dramatically increases comparatively speaking.And solve the such issues that of shortest path real-time for such as random network, ask
The selection amount of calculation making next node is increased by the expansion of topic scale, and this certainly will affect the effectiveness of optimized algorithm.
Service quality (Quality of Service) management is used to solve the problem such as network latency, obstruction and tie up
Hold the technology of certain network transmission quality.Service quality comprises reliability (Reliability), postpones (Delay), stability
(Jitter), the index such as available bandwidth (Bandwidth).Bandwidth refers to message transmission rate.Along with network service is vigorously sent out
Opening up, the network bandwidth needed for application program grows with each passing day.Different application needs different bandwidth, the band needed such as video conference
Wide more, the bandwidth that message language needs is relatively low.Bandwidth distribution can ensure that the data of tool high priority can send out the soonest,
And the most important application program requires the highest reliability.For reaching quality of service goals, permeable scheduling (scheduling),
The technology such as resource reservation (resource reservation) and access control (admission control) realize.
In the face of significantly improving and flourish of communication and Information technology, the Internet increases rapidly, Internet user's quantity
The huge congested pressure necessarily causing network faces huge, the most how reasonable distribution internet resource has become have to solve
Problem.The discharge pattern become increasingly complex makes network management become a challenging task, its facing challenges
One of be catenet service provider (Internet Service Providers) in the face of the big data of network traffic demand
Just in ever-increasing situation.In order to the distribution of the bandwidth of the Internet is effectively managed, carry out the traffic demand on network
Forecast analysis and the bandwidth resources effectively utilizing whole the Internet to be provided are very important.
Summary of the invention
It is an object of the invention to, to different service quality ratings, select the system of selection that end-to-end path route in real time.
For achieving the above object, the technical scheme is that the route in real time of a kind of end-to-end communication network
System of selection, to different service quality ratings, determines end-to-end path, at a known network, according to the characteristic of link,
Consider larger capacity and relatively short delay, select end-to-end path, and determine that the user being routed at every connects number,
Specifically comprise the following steps that
Step one, calculates the capacity in all end-to-end paths, delay；
Step 2, selects a capacity maximum and the path of shortest delay；
Step 3, calculates the bandwidth that maximum and shortest delay the path of capacity is to be distributed；
Step 4, calculates capacity maximum and the path of shortest delay, in the company of each service quality rating bandwidth to be distributed
Connect number；
Step 5, calculates the capacity making to use up；
Step 6, updates the bandwidth capacity of link；
Step 7, updates the connection number of remaining bandwidth；
Step 8, the capacity in the path of recording capacity maximum and shortest delay and each service quality rating bandwidth to be distributed
Connection number, generate respectively be routed sample data sets, be routed each grade of service bandwidth to be distributed
Connect the sample data sets of number；
Step 9, checks that the connection number of remaining bandwidth, whether equal to 0, if being equal to 0, goes to step 11；If being not equal to
0, it is recycled to step one, continues to select next path；
Step 10, output be routed sample data sets, be routed each grade of service bandwidth to be distributed
Connect number sample data sets.
The invention has the beneficial effects as follows:
Present invention achieves the real-time Route Selection for end-to-end communication network, it is contemplated that quality of service requirement, it is resolved that suitable
Closing the user of each service quality rating on path, and path and connect quantity, experimental result shows that this method can be run
And quickly select method for routing.
Accompanying drawing explanation
Fig. 1 is simple type network diagram；
Detailed description of the invention
Below in conjunction with embodiment, technical scheme is clearly and completely described.
Table 1 is bandwidth capacity and the delay of link；
Table 2 is experimental result；
Table 3 is that the process time is for incremental total customer volume.
The target of this method is to different service quality ratings, it is resolved that end-to-end path, at a known network, root
According to the characteristic of link, this method considers larger capacity and relatively short delay, selects end-to-end path, and determines to be chosen at every
User on path connects number.
First parameters is set as follows:
The quantity of service quality rating: #class；The quantity in all end-to-end paths: #path；The quantity of all links: #
link；The bandwidth capacity of each link: Ue；The delay of link: de
Routing database includes all end-to-end paths: { Pk(e)=0or 1, for k=1,2 ..., #path, for e
=1,2 ..., #link}, so the delay in path
Bandwidth θ that each service quality rating is to be distributedi=bi, wherein biIt is the bandwidth needed for the i-th grade, i=1,
2,...,#class
The connection number of each service quality rating bandwidth to be distributed is KiFor i=1,2 ..., #class
For chosen path, set the allocation proportion of bandwidth,
Initiation:
Often after distribution, remaining connection number rem (Ki), it is set as Ki；
Quantity #sel in selected path, is set as 0.
Concrete steps:
Step one, calculates the capacity in all end-to-end paths,For k=1,2 ..., #
path
Step 2, according to U (Pk(e)) and d (Pk(e)), select a capacity maximum and the path of shortest delay, be expressed as p
(e)；
Step 3, calculates the capacity of p (e),
Step 4, on p (e), calculates bandwidth A=ratio U (p (e)) to be distributed；
Step 5, on p (e), asks the connection number of every grade, niFor i=1,2 ..., #class, fully use
Bandwidth, it is, seek niMake to minimize
Step 6, calculates the capacity making to use up
Step 7, updates the bandwidth capacity U of linke=Ue-p(e)·Uused；
Step 8, updates remaining connection number rem (Ki)=rem (Ki)-ni；
Step 9, records p (e) and n respectivelyiAt set Qk(e) and set Nk,i；
Step 10, #sel=sel+1；
Step 11, checks rem (Ki) whether equal to 0, then stop, otherwise return to next road of step one continuation selection
Footpath；
Step 12, exports Qk(e) and Nk,i,QkE () is the set being routed, Qk(e)={ pk(e) for k=1,
2 ..., #sel}, wherein pkE () is in step 2, the selected path of kth bar；Nk,iFor corresponding QkEach grade of (e)
Connect number, Nk,i={ (nk,i), for k=1,2 ..., #sel}, wherein nk,iFor in step 5, the selected path of kth bar
Determine that each grade connects number.
In the present embodiment, a simple type network is used to carry out this real-time route selection method of evaluation, as it is shown in figure 1, bag
Including Three Estate service quality (QoS) user, 26 links, through migration algorithm, can draw 80 end-to-end paths, link is special
Property such as table 1 (bandwidth capacity of link and delay) listed, need the number of users of transmission to be respectively 80,120 according to 1,2,3 grades,
150, the bandwidth of each user distribution is respectively set as 160,80,25kbps according to 1,2,3 grades, calculates through this method, it is resolved that
End-to-end path, and the number of users to be transmitted in these paths and delay, as shown in table 2 (experimental result).
For the real-time of evaluation this method, add user and connect number summation, from 350,525,700 ..., to 1750,
Test platform is Intel Core i5CPU@2.5GHz, uses Matlab to emulate, and the drawing modification time connects number to upper user
Curve, as shown in table 3 (time that processes is for incremental total customer volume), process the time about by increase in 0.1 second 0.45 second,
Curve is close to linear trend.
The bandwidth capacity of table 1. link and delay
| Selected end-to-end path | User connects number (n1,n2,n3) | Delay(in sec) |
| e2-e7-e11-e14-e23 | (38,56,60) | 0.152 |
| e3-e9-e12-e19-e25 | (40,60,75) | 0.124 |
| e3-e10-e16-e18-e23 | (2,4,15) | 0.139 |
Table 2. experimental result
Table 3. processes the time for incremental total customer volume
Described embodiment is only a part of embodiment of the present invention rather than whole embodiments.Based on the present invention
In embodiment, the every other enforcement that those of ordinary skill in the art are obtained under not making creative work premise
Example, broadly falls into the scope of protection of the invention.
Claims (1)
1. the system of selection of the route in real time of an end-to-end communication network, it is characterised in that to different service quality ratings,
Determine end-to-end path, at a known network, according to the characteristic of link, it is considered to larger capacity and relatively short delay, select end
Path, opposite end, and determine that the user being routed at every connects number, specifically comprise the following steps that
Step one, calculates the capacity in all end-to-end paths；
Step 2, selects a capacity maximum and the path of shortest delay；
Step 3, calculates the bandwidth that maximum and shortest delay the path of capacity is to be distributed；
Step 4, calculates capacity maximum and the path of shortest delay, at the connection number of each service quality rating bandwidth to be distributed；
Step 5, calculates the capacity making to use up；
Step 6, updates the bandwidth capacity of link；
Step 7, updates the connection number of remaining bandwidth；
Step 8, the capacity in the path of recording capacity maximum and shortest delay and the company of each service quality rating bandwidth to be distributed
Connect number, the connection generate the sample data sets being routed respectively, being routed each grade of service bandwidth to be distributed
The sample data sets of number；
Step 9, checks that the connection number of remaining bandwidth, whether equal to 0, if being equal to 0, goes to step 11；If being not equal to 0, follow
Ring, to step one, continues to select next path；
Step 10, exports the sample data sets being routed, the company being routed each grade of service bandwidth to be distributed
Connect several sample data sets.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610550240.8A CN106209631A (en) | 2016-07-13 | 2016-07-13 | The system of selection of the route in real time of end-to-end communication network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610550240.8A CN106209631A (en) | 2016-07-13 | 2016-07-13 | The system of selection of the route in real time of end-to-end communication network |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN106209631A true CN106209631A (en) | 2016-12-07 |
Family
ID=57477897
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610550240.8A Pending CN106209631A (en) | 2016-07-13 | 2016-07-13 | The system of selection of the route in real time of end-to-end communication network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106209631A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111555982A (en) * | 2020-07-10 | 2020-08-18 | 武汉绿色网络信息服务有限责任公司 | Method and system for intelligently routing message based on IPv6 extension header |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102780637A (en) * | 2012-08-14 | 2012-11-14 | 虞万荣 | Routing method for data transmission in space delay/disruption tolerant network |
| CN105376157A (en) * | 2015-11-22 | 2016-03-02 | 东北大学 | Method and device for routing path selection |
-
2016
- 2016-07-13 CN CN201610550240.8A patent/CN106209631A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102780637A (en) * | 2012-08-14 | 2012-11-14 | 虞万荣 | Routing method for data transmission in space delay/disruption tolerant network |
| CN105376157A (en) * | 2015-11-22 | 2016-03-02 | 东北大学 | Method and device for routing path selection |
Non-Patent Citations (1)
| Title |
|---|
| MAO-HSIUNG HUNG等: "A Real-Time Routing Algorithm for End-to-End Communication Networks with QoS Requirements", 《2016 THIRD INTERNATIONAL CONFERENCE ON COMPUTING MEASUREMENT CONTROL AND SENSOR NETWORK（CMCSN）》 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111555982A (en) * | 2020-07-10 | 2020-08-18 | 武汉绿色网络信息服务有限责任公司 | Method and system for intelligently routing message based on IPv6 extension header |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Shakkottai et al. | The price of simplicity | |
| US6310881B1 (en) | Method and apparatus for network control | |
| CN108833279B (en) | Method for multi-constraint QoS routing based on service classification in software defined network | |
| Ozdaglar et al. | Incentives and pricing in communication networks | |
| CN107070794A (en) | A kind of low rail information network optimal network benefit delay constraint method for routing | |
| CN105897575A (en) | Path computing method based on multi-constrained path computing strategy under SDN | |
| CN108599994A (en) | A kind of SDN slice building methods based on flow cluster | |
| CN112615780B (en) | Method and device for determining alternative path of data flow in SDN network | |
| CN106027288A (en) | Communication traffic prediction method for distribution line information monitoring service | |
| CN110474842A (en) | A kind of communication means, customer terminal equipment and transmission network | |
| CN115632939A (en) | Automatic network selection and routing method for achieving multi-target achievement of computational power network | |
| CN107483355B (en) | Data center-oriented online scene low-bandwidth overhead traffic scheduling scheme | |
| CN108989148A (en) | A kind of relaying multipath flow allocation method that propagation delay time minimizes | |
| CN107454009B (en) | Data center-oriented offline scene low-bandwidth overhead traffic scheduling scheme | |
| Li et al. | Redundancy-guaranteed and receiving-constrained disaster backup in cloud data center network | |
| CN108366015B (en) | Route calculation method for software defined network | |
| Seliuchenko et al. | Enhanced multi-commodity flow model for QoS-aware routing in SDN | |
| CN107769982A (en) | The adjustment method and system of PTN network bandwidth | |
| Zhu et al. | Optimal service rate in cognitive radio networks with different queue length information | |
| CN106209631A (en) | The system of selection of the route in real time of end-to-end communication network | |
| CN105471997A (en) | Method for controlling flow in P2P file sharing network based on price mechanism | |
| CN104901892A (en) | QoS multicasting route optimizer based on ant colony algorithm and realization method of QoS multicasting route optimizer | |
| Huang et al. | Efficiency and Braess' paradox under pricing in general networks | |
| CN107171957A (en) | A kind of adaptive DTN routing algorithms based under the conditions of resource-constrained | |
| Vidmar et al. | Broadband access network investment optimization in rural areas |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into 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: 20161207 |