Li, H., Zhang, J., Hong, Q. et al. (2 more authors) (2017) Digraph-based joint routing and resource allocation in software-defined backhaul networks. In: Computer Aided Modeling and Design of Communication Links and Networks (CAMAD), 2017 IEEE 22nd International Workshop on. 2017 IEEE 22nd International Workshop on Computer Aided Modeling and Design of Communication Links and Networks (CAMAD), 19-21 Jun 2017, Lund, Sweden. IEEE ISBN 9781509063024
Abstract
By decoupling the control plane from the data plane and providing programmability for network applications, software-defined network (SDN) is positioned to offer more efficient management, higher flexibility and better performance. Routing and resource allocation are two closely related applications in wireless networks. With close cooperation, better performance and lower complexity can be achieved in an SDN architecture. However, work that jointly studies routing and resource allocation is rarely seen. In this paper, the joint routing and resource allocation problem is investigated in OFDMA-based software-defined backhaul networks (SDBN). To exploit the SDN programmability, an SDBN system model is proposed, where the control panel can use high complexity algorithms in configuration phase in order to simplify algorithms in operation phases. Then the joint routing and resource allocation problem is formulated as a system throughput optimization problem. By constructing the interference digraph of the network and analysing the vertex degree characteristics, a digraph-based greedy algorithm (DBGA) is proposed. Simulation results have shown that, the proposed DBGA works well to increase the system throughput.
Metadata
Item Type: | Proceedings Paper |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | © 2017 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works. Reproduced in accordance with the publisher's self-archiving policy. |
Keywords: | Software-defined backhaul network; joint routing and resource allocation; graph theory |
Dates: |
|
Institution: | The University of Sheffield |
Academic Units: | The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Electronic and Electrical Engineering (Sheffield) |
Depositing User: | Symplectic Sheffield |
Date Deposited: | 01 Feb 2018 15:12 |
Last Modified: | 19 Dec 2022 13:49 |
Published Version: | https://doi.org/10.1109/CAMAD.2017.8031525 |
Status: | Published |
Publisher: | IEEE |
Refereed: | Yes |
Identification Number: | 10.1109/CAMAD.2017.8031525 |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:126925 |