A policy based framework for quality of service management in software defined networks
Author
Abstract
Suggested Citation
DOI: 10.1007/s11235-021-00816-8
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Alaitz Mendiola & Jasone Astorga & Eduardo Jacob & Kostas Stamos, 2019. "Enhancing network resources utilization and resiliency in multi-domain bandwidth on demand service provisioning using SDN," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 71(3), pages 505-515, July.
- Jin Y. Yen, 1971. "Finding the K Shortest Loopless Paths in a Network," Management Science, INFORMS, vol. 17(11), pages 712-716, July.
- Wu Jiawei & Qiao Xiuquan & Nan Guoshun, 2018. "Dynamic and adaptive multi-path routing algorithm based on software-defined network," International Journal of Distributed Sensor Networks, , vol. 14(10), pages 15501477188, October.
- Reza Mohammadi & Reza Javidan & Manijeh Keshtgari & Reza Akbari, 2018. "A novel multicast traffic engineering technique in SDN using TLBO algorithm," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 68(3), pages 583-592, July.
- Mudassar Hussain & Nadir Shah, 2018. "Automatic rule installation in case of policy change in software defined networks," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 68(3), pages 461-477, July.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Shahrzad Sedaghat & Amir Hossein Jahangir, 2022. "FRT-SDN: an effective firm real time routing for SDN by early removal of late packets," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 80(3), pages 359-382, July.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Yao-ying Tzeng & Chung-An Shen, 2021. "An integrated multi-controller management framework for highly reliable software defined networking," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 77(2), pages 377-388, June.
- Huili Zhang & Yinfeng Xu & Xingang Wen, 2015. "Optimal shortest path set problem in undirected graphs," Journal of Combinatorial Optimization, Springer, vol. 29(3), pages 511-530, April.
- Akhilendra Pratap Singh & Ashish Kr Luhach & Xiao-Zhi Gao & Sandeep Kumar & Diptendu Sinha Roy, 2020. "Evolution of wireless sensor network design from technology centric to user centric: An architectural perspective," International Journal of Distributed Sensor Networks, , vol. 16(8), pages 15501477209, August.
- Daria Dzyabura & Srikanth Jagabathula, 2018. "Offline Assortment Optimization in the Presence of an Online Channel," Management Science, INFORMS, vol. 64(6), pages 2767-2786, June.
- Melchiori, Anna & Sgalambro, Antonino, 2020. "A branch and price algorithm to solve the Quickest Multicommodity k-splittable Flow Problem," European Journal of Operational Research, Elsevier, vol. 282(3), pages 846-857.
- Luss, Hanan & Wong, Richard T., 2005. "Graceful reassignment of excessively long communications paths in networks," European Journal of Operational Research, Elsevier, vol. 160(2), pages 395-415, January.
- Rinaldi, Marco & Viti, Francesco, 2017. "Exact and approximate route set generation for resilient partial observability in sensor location problems," Transportation Research Part B: Methodological, Elsevier, vol. 105(C), pages 86-119.
- Timothy M. Sweda & Irina S. Dolinskaya & Diego Klabjan, 2017. "Adaptive Routing and Recharging Policies for Electric Vehicles," Transportation Science, INFORMS, vol. 51(4), pages 1326-1348, November.
- Chen, Bi Yu & Chen, Xiao-Wei & Chen, Hui-Ping & Lam, William H.K., 2020. "Efficient algorithm for finding k shortest paths based on re-optimization technique," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 133(C).
- Doan, Xuan Vinh, 2022. "Distributionally robust optimization under endogenous uncertainty with an application in retrofitting planning," European Journal of Operational Research, Elsevier, vol. 300(1), pages 73-84.
- Hela Masri & Saoussen Krichen, 2018. "Exact and approximate approaches for the Pareto front generation of the single path multicommodity flow problem," Annals of Operations Research, Springer, vol. 267(1), pages 353-377, August.
- Fernández, Elena & Pozo, Miguel A. & Puerto, Justo & Scozzari, Andrea, 2017. "Ordered Weighted Average optimization in Multiobjective Spanning Tree Problem," European Journal of Operational Research, Elsevier, vol. 260(3), pages 886-903.
- Alessandra Griffa & Mathieu Mach & Julien Dedelley & Daniel Gutierrez-Barragan & Alessandro Gozzi & Gilles Allali & Joanes Grandjean & Dimitri Ville & Enrico Amico, 2023. "Evidence for increased parallel information transmission in human brain networks compared to macaques and male mice," Nature Communications, Nature, vol. 14(1), pages 1-15, December.
- Qiang Tu & Han He & Xiaomin Lai & Chuan Jiang & Zhanji Zheng, 2024. "Identifying Critical Links in Degradable Road Networks Using a Traffic Demand-Based Indicator," Sustainability, MDPI, vol. 16(18), pages 1-20, September.
- T. Gomes & J. Craveirinha & L. Jorge, 2010. "An effective algorithm for obtaining the whole set of minimal cost pairs of disjoint paths with dual arc costs," Journal of Combinatorial Optimization, Springer, vol. 19(3), pages 394-414, April.
- Zhou, Bo & Eskandarian, Azim, 2006. "A Non-Deterministic Path Generation Algorithm for Traffic Networks," 47th Annual Transportation Research Forum, New York, New York, March 23-25, 2006 208047, Transportation Research Forum.
- Baṣak Altan & Okan Örsan Özener, 2021. "A Game Theoretical Approach for Improving the Operational Efficiencies of Less-than-truckload Carriers Through Load Exchanges," Networks and Spatial Economics, Springer, vol. 21(3), pages 547-579, September.
- Ma, Jie & Meng, Qiang & Cheng, Lin & Liu, Zhiyuan, 2022. "General stochastic ridesharing user equilibrium problem with elastic demand," Transportation Research Part B: Methodological, Elsevier, vol. 162(C), pages 162-194.
- Yücel, E. & Salman, F.S. & Arsik, I., 2018. "Improving post-disaster road network accessibility by strengthening links against failures," European Journal of Operational Research, Elsevier, vol. 269(2), pages 406-422.
- Liu, Zhaocai & Chen, Zhibin & He, Yi & Song, Ziqi, 2021. "Network user equilibrium problems with infrastructure-enabled autonomy," Transportation Research Part B: Methodological, Elsevier, vol. 154(C), pages 207-241.
More about this item
Keywords
Congestion; Quality of service; Routing; Software-defined networking;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:telsys:v:78:y:2021:i:3:d:10.1007_s11235-021-00816-8. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.