IEEE Transactions on Emerging Topics in Computing · 2018 · 101 citations · 37 references
ComputingComputer SystemsInformation TechnologyComputer NetworksInternet Of ThingsQueuing TheoryIot NetworkingLatency OptimizationNetwork Performance AnalysisRoutingRouting AlgorithmsSoftware-defined NetworkingDelay-aware RoutingEnd-to-end DelayEnd-to-end Delay OptimizationGreedy HeuristicsK-shortest PathsShortest PathsSoftware-defined Networking RoutingTraffic-aware Routing
In this paper, we propose a traffic-aware quality-of-service (QoS) routing scheme in software-defined internet of things (SDIoT) network. The proposed scheme exploits the unique features of software-defined networking (SDN), such as flow-based nature, and network flexibility, in order to fulfill QoS requirements of each flow in the network. We consider two types of QoS routing strategies-delay-sensitive and loss-sensitive-for incoming packets from end-devices in the network. The former is devised to deal with delay-sensitive flows, and the latter deals with loss-sensitive flows, in order to maximize the overall network performance. We propose a greedy approach based on Yen's K-shortest paths algorithm to compute the optimal forwarding path, while considering the QoS requirements of each packet. Consequently, the SDN controller deploys adequate flow-rules at the forwarding devices in the network. Extensive simulation results show that the proposed scheme significantly reduces the end-to-end delay and the percentage of flows which violate QoS constraints compared to the benchmarks considered in the study. It is also observed that the proposed scheme adequately satisfies the QoS requirements for both type of flows in contrast to the existing schemes. In particular, with 2000 flows in the network, the proposed scheme achieves 13%, 14% and 15% (with AttMpls topology) and 38%, 37% and 39% (with Goodnet topology) reduction in QoS violated flows as compared to the existing LARAC, SPD, and MRC schemes, respectively.
37
Nick McKeown, Tom Anderson, Hari Balakrishnan et al. · ACM SIGCOMM Computer Communication Review · 2008 · 8.4K citations
Finding the <i>K</i> Shortest Loopless Paths in a Network
Jin Y. Yen · Management Science · 1971 · 2.6K citations
Bob Lantz, Brandon Heller, Nick McKeown · 2010 · 1.8K citations
Simon Knight, Hung Nguyen, Nickolas Falkner et al. · IEEE Journal on Selected Areas in Communications · 2011 · 1.7K citations