Network Resource Management Framework Research Articles

QCon: QoS-Aware Network Resource Management for Fog Computing.

Fog computing is a new computing paradigm that employs computation and network resources at the edge of a network to build small clouds, which perform as small data centers. In fog computing, lightweight virtualization (e.g., containers) has been widely used to achieve low overhead for performance-limited fog devices such as WiFi access points (APs) and set-top boxes. Unfortunately, containers have a weakness in the control of network bandwidth for outbound traffic, which poses a challenge to fog computing. Existing solutions for containers fail to achieve desirable network bandwidth control, which causes bandwidth-sensitive applications to suffer unacceptable network performance. In this paper, we propose qCon, which is a QoS-aware network resource management framework for containers to limit the rate of outbound traffic in fog computing. qCon aims to provide both proportional share scheduling and bandwidth shaping to satisfy various performance demands from containers while implementing a lightweight framework. For this purpose, qCon supports the following three scheduling policies that can be applied to containers simultaneously: proportional share scheduling, minimum bandwidth reservation, and maximum bandwidth limitation. For a lightweight implementation, qCon develops its own scheduling framework on the Linux bridge by interposing qCon’s scheduling interface on the frame processing function of the bridge. To show qCon’s effectiveness in a real fog computing environment, we implement qCon in a Docker container infrastructure on a performance-limited fog device—a Raspberry Pi 3 Model B board.

A Network Resource Management Framework for Wireless Mesh Networks

In infrastructure wireless mesh networks (WMNs), a mobile station (STA) associates with one of the nearby mesh access points (MAPs) that are connected to a capacity-limited wireless multi-hop backhaul. For better network resource utilization in WMNs, it is preferred that more traffic is carried by the good-backhaul MAPs that are closer to the portal or having better backhaul condition. In this paper, by taking the features of WMNs and the inter-cell interference into consideration, we propose a network resource management framework that jointly manages MAP–STA association, MAP access network channel assignment, and user bandwidth allocation. The proposed framework is composed of three components: an optimization-based association control algorithm that improves the network resource utilization by associating more STAs with the good-backhaul MAPs, an access network channel assignment algorithm that effectively increases the network capacity by reducing the interference at the good-backhaul MAPs, and a utility-fair bandwidth allocation algorithm that is flexible in adjusting the trade-off between network throughput and user fairness. We demonstrate the superior performance of the proposed algorithms through simulations with various network topologies and conditions.

Software Defined Cognitive Radio Network Framework

Software defined networking SDN provides a novel network resource management framework that overcomes several challenges related to network resources management. On the other hand, Cognitive Radio ...

Software Defined Cognitive Radio Network Framework

Software defined networking (SDN) provides a novel network resource management framework that overcomes several challenges related to network resources management. On the other hand, Cognitive Radio (CR) technology is a promising paradigm for addressing the spectrum scarcity problem through efficient dynamic spectrum access (DSA). In this paper, the authors introduce a virtualization based SDN resource management framework for cognitive radio networks (CRNs). The framework uses the concept of multilayer hypervisors for efficient resources allocation. It also introduces a semi-decentralized control scheme that allows the CRN Base Station (BS) to delegate some of the management responsibilities to the network users. The main objective of the proposed framework is to reduce the CR users' reliance on the CRN BS and physical network resources while improving the network performance by reducing the control overhead.

CPS: Operating system architecture for efficient network resource management with control-theoretic packet scheduler

The efficient network resource management is one of the important topics in a real-time system. In this paper, we present a practical network resource management framework, control-theoretic packet scheduler (CPS) system. Using our framework, an operating system can schedule both input and output streams accurately and efficiently. Our framework adopts very portable feedback control theory for efficiency and accuracy. The CPS system is able to operate independent of the internal network protocol state, and it is designed to schedule packet streams in fine-grained time intervals to meet the resource requirement. This approach simplifies the design of the CPS system, and leads us to obtain the intended output bandwidth. We implemented our prototype system in Linux, and measured the performance of the network resource management system under various network QoS constraints. The distinctive features of our principles are as follows: It is robust and accurate, and its operation is independent of internal network protocols.

Optimal bandwidth allocation for bandwidth adaptation in wireless multimedia networks

The concept of bandwidth adaptation which additionally allocates the terminated bandwidth to ongoing calls is one of the promising methods to reduce the new call blocking and handoff call dropping probabilities. In this paper, we formulate the bandwidth allocation problem for the bandwidth adaptation as a binary linear integer program which maximizes the satisfaction degree of customers. Since this optimization should be performed in real time, we presented a computationally efficient heuristic algorithm for the problem based on the Lagrangean relaxation procedure. Our simulation test shows that the algorithm finds a sub-optimal solution within 0.5% in average from the true optimal solution. The solutions of our scheme show better performance than other scheme in both handoff call dropping and new call blocking probabilities. Scope and purpose With the emergence of various multimedia applications, it becomes more important that wireless networks satisfy quality of service (QoS) requirements. Each base station has a specific amount of bandwidth to be used within a small geographical area called cell. As the number of users increases, the amount of bandwidth assigned to a cell becomes insufficient to support the required number of users. Therefore, wireless networks will employ smaller cells to perform channel reuse in the cells at specific distance and to accommodate the overall increase in system capacity. Since employing smaller cells implies higher rate of handoff, the continuous support of QoS guarantees of multimedia calls poses a major challenge in the wireless networks. Such a support requires the development of an adaptable network resource management framework. In this paper, we deal with the multimedia adaptive service where the bandwidth of an ongoing call can be varied during its lifetime. When an ongoing call is completed or is handed off from a current cell to another, its bandwidth can be reallocated to other ongoing calls. The concept of this bandwidth adaptation is one of the promising methods to reduce the new call blocking and handoff call dropping probabilities. If the bandwidth is optimally allocated among all ongoing calls which need more bandwidth, then the satisfaction grade of the customers can be increased. We formulate the bandwidth allocation problem for this bandwidth adaptation as a binary linear integer program which maximizes the satisfaction degree of customers.