m (Scipediacontent moved page Draft Content 205264597 to Retvari 2010a) |
|||
| Line 3: | Line 3: | ||
This paper focuses on the selection of bandwidth-guaranteed channels for communication sessions that require it. The basic idea comes from Minimum Interference Routing: select a feasible path that puts the least possible restriction on the transmission capacity offered by the network for other communicating parties. This is achieved by circumventing some critical bottleneck links. The main contribution of the paper is a method to assess the degree of link criticality facilitating efficient route precomputation even in the case, when up to date resource availability information is not immediately available. | This paper focuses on the selection of bandwidth-guaranteed channels for communication sessions that require it. The basic idea comes from Minimum Interference Routing: select a feasible path that puts the least possible restriction on the transmission capacity offered by the network for other communicating parties. This is achieved by circumventing some critical bottleneck links. The main contribution of the paper is a method to assess the degree of link criticality facilitating efficient route precomputation even in the case, when up to date resource availability information is not immediately available. | ||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| Line 15: | Line 10: | ||
* [https://link.springer.com/content/pdf/10.1007%2F978-3-540-39404-4_19.pdf https://link.springer.com/content/pdf/10.1007%2F978-3-540-39404-4_19.pdf] | * [https://link.springer.com/content/pdf/10.1007%2F978-3-540-39404-4_19.pdf https://link.springer.com/content/pdf/10.1007%2F978-3-540-39404-4_19.pdf] | ||
| + | |||
| + | * [http://link.springer.com/content/pdf/10.1007/978-3-540-39404-4_19 http://link.springer.com/content/pdf/10.1007/978-3-540-39404-4_19], | ||
| + | : [http://dx.doi.org/10.1007/978-3-540-39404-4_19 http://dx.doi.org/10.1007/978-3-540-39404-4_19] under the license http://www.springer.com/tdm | ||
| + | |||
| + | * [https://link.springer.com/chapter/10.1007%2F978-3-540-39404-4_19 https://link.springer.com/chapter/10.1007%2F978-3-540-39404-4_19], | ||
| + | : [https://www.scipedia.com/public/Retvari_2010a https://www.scipedia.com/public/Retvari_2010a], | ||
| + | : [https://dblp.uni-trier.de/db/conf/mmns/mmns2003.html#Retvari03 https://dblp.uni-trier.de/db/conf/mmns/mmns2003.html#Retvari03], | ||
| + | : [https://rd.springer.com/chapter/10.1007/978-3-540-39404-4_19 https://rd.springer.com/chapter/10.1007/978-3-540-39404-4_19], | ||
| + | : [https://academic.microsoft.com/#/detail/1520740848 https://academic.microsoft.com/#/detail/1520740848] | ||
Latest revision as of 14:09, 21 January 2021
Abstract
This paper focuses on the selection of bandwidth-guaranteed channels for communication sessions that require it. The basic idea comes from Minimum Interference Routing: select a feasible path that puts the least possible restriction on the transmission capacity offered by the network for other communicating parties. This is achieved by circumventing some critical bottleneck links. The main contribution of the paper is a method to assess the degree of link criticality facilitating efficient route precomputation even in the case, when up to date resource availability information is not immediately available.
Original document
The different versions of the original document can be found in:
- http://dx.doi.org/10.1007/978-3-540-39404-4_19 under the license http://www.springer.com/tdm
Document information
Published on 01/01/2010
Volume 2010, 2010
DOI: 10.1007/978-3-540-39404-4_19
Licence: CC BY-NC-SA license
Share this document
Keywords
claim authorship
Are you one of the authors of this document?