Opennetmon: Network monitoring in openflow software-defined networks

NLM Van Adrichem, C Doerr… - 2014 IEEE Network …, 2014 - ieeexplore.ieee.org
We present OpenNetMon, an approach and open-source software implementation to
monitor per-flow metrics, especially throughput, delay and packet loss, in OpenFlow …

Research challenges in QoS routing

X Masip-Bruin, M Yannuzzi, J Domingo-Pascual… - Computer …, 2006 - Elsevier
Quality of Service Routing is at present an active and remarkable research area, since most
emerging network services require specialized Quality of Service (QoS) functionalities that …

A survey on green routing protocols using sleep-scheduling in wired networks

F Dabaghi, Z Movahedi, R Langar - Journal of Network and Computer …, 2017 - Elsevier
Over recent years, green communications have been proposed as an emerging strategy to
reduce the Carbon footprint produced by the networking sector. It consists in using different …

Network modelling and computation of quickest path for service-level agreements using bi-objective optimization

A Sharma, R Kumar, MWA Talib… - … of distributed sensor …, 2019 - journals.sagepub.com
This article addresses the problem related to the reliability of path after transmitting the given
amount of data with the service-level agreement cooperation in the computer …

Secure and robust multi-constrained QoS aware routing algorithm for VANETs

MH Eiza, T Owens, Q Ni - IEEE Transactions on Dependable …, 2015 - ieeexplore.ieee.org
Secure QoS routing algorithms are a fundamental part of wireless networks that aim to
provide services with QoS and security guarantees. In vehicular ad hoc networks (VANETs) …

Situation-aware QoS routing algorithm for vehicular ad hoc networks

MH Eiza, T Owens, Q Ni, Q Shi - IEEE Transactions on vehicular …, 2015 - ieeexplore.ieee.org
A wide range of services has been developed for vehicular ad hoc networks (VANETs),
ranging from safety to infotainment applications. An essential requirement for such services …

Delay-sensitive and availability-aware virtual network function scheduling for NFV

S Yang, F Li, R Yahyapour, X Fu - IEEE Transactions on …, 2019 - ieeexplore.ieee.org
Network Function Virtualization (NFV) has been emerging as an appealing solution that
transforms from dedicated hardware implementations to software instances running in a …

Lagrangian relaxation and enumeration for solving constrained shortest‐path problems

WM Carlyle, JO Royset… - … : an international journal, 2008 - Wiley Online Library
The constrained shortest‐path problem (CSPP) generalizes the standard shortest‐path
problem by adding one or more path‐weight side constraints. We present a new algorithm …

Polynomial time approximation algorithms for multi-constrained QoS routing

G Xue, W Zhang, J Tang… - IEEE/ACM Transactions …, 2008 - ieeexplore.ieee.org
We study the multi-constrained quality-of-service (QoS) routing problem where one seeks to
find a path from a source to a destination in the presence of K≧2 additive end-to-end QoS …

A time and energy efficient routing algorithm for electric vehicles based on historical driving data

AM Bozorgi, M Farasat… - IEEE Transactions on …, 2017 - ieeexplore.ieee.org
A routing algorithm that leads to extended driving range and battery longevity of electric
vehicles (EV) is proposed. In addition to locating the time and energy efficient routes, the …