Machine-to-Machine (M2M) communication plays a pivotal role in the evolution of Internet of Things (IoT). Cellular networks are considered to be a key enabler for M2M communications, which are originally designed mainly for Human-to-Human (H2H) communications. The introduction of M2M users will cause a series of problems to traditional H2H users, i.e., interference between various traffic. Resource allocation is an effective solution to these problems. In this paper, we consider a shared resource block (RB) and power allocation in an H2H/M2M coexistence scenario, where M2M users are subdivided into delay-tolerant and delay-sensitive types. We first model the RB-power allocation problem as maximization of capacity under Quality-of-Service (QoS) constraints of different types of traffic. Then, a learning framework is introduced, wherein a complex agent is built from simpler subagents, which provides the basis for distributed deployment scheme. Further, we proposed distributed Q-learning based autonomous RB-power allocation algorithm (DQ-ARPA), which enables the machine type network gateways (MTCG) as agents to learn the wireless environment and choose the RB-power autonomously to maximize M2M pairs' capacity while ensuring the QoS requirements of critical services. Simulation results indicates that with an appropriate reward design, our proposed scheme succeeds in reducing the impact of delay-tolerant machine type users on critical services in terms of SINR thresholds and outage ratios.

Admission control is a procedure to guarantee a given level of Quality of Service (QoS) by accepting or rejecting arrival connection requests. There are many studies on backlog or loss rate evaluation formulas for admission control at a single node. However, there are few studies on end-to-end evaluation formulas suitable for admission control. In a previous paper, the authors proposed a new stochastic network calculus for many flows using an approach taken from large deviations techniques and obtained asymptotic end-to-end evaluation formulas for output burstiness and backlog. In this paper, we apply this stochastic network calculus to a heterogeneous tandem network with many forwarding flows and cross traffic flows constrained by leaky buckets, and obtain a simple evaluation formula for the end-to-end backlog. In this formula, the end-to-end backlog can be evaluated by the traffic load at the bottle neck node. This result leads us to a natural extension of the evaluation formula for a single node.

This paper presents a new QoS model for end-to-end service provisioning in multi-hop wireless networks. In legacy IEEE 802.11e based multi-hop wireless networks, the fixed assignment of service classes according to flow's priority at every node causes priority inversion problem when performing end-to-end service differentiation. Thus, this paper proposes a new QoS provisioning model called Dynamic Hop Service Differentiation (DHSD) to alleviate the problem and support effective service differentiation between end-to-end nodes. Many previous works for QoS model through the 802.11e based service differentiation focus on packet scheduling on several service queues with different service rate and service priority. Our model, however, concentrates on a dynamic class selection scheme, called Per Hop Class Assignment (PHCA), in the node's MAC layer, which selects a proper service class for each packet, in accordance with queue states and service requirement, in every node along the end-to-end route of the packet. The proposed QoS solution is evaluated using the OPNET simulator. The simulation results show that the proposed model outperforms both best-effort and 802.11e based strict priority service models in mobile ad hoc environments.

As an alternative solution to provide the quality of services (QoS) for broadband access over Ethernet Passive Optical Network (EPON), we present the usage of MAC control message for plural class queues and a traffic-class burst-polling based delta dynamic bandwidth allocation (DBA), referred to as TCBP-DDBA, scheme. For better QoS support, the TCBP-DDBA minimizes packet delays and delay variations for expedited forwarding packet and maximizes throughput for assured forwarding and best effort packets. The network resources are efficiently utilized and adaptively allocated to the three traffic classes for the given unbalanced traffic conditions by guaranteeing the requested QoS. Simulation results using OPNET show that the TCBP-DDBA scheme performs well in comparison to the conventional unit-based allocation scheme over the measurement parameters such as: packet delay, packet delay variation, and channel utilization.

Optical Burst Switching (OBS) has been developed as an efficient switching technique to exploit the capacity provided by Wavelength Division Multiplexing (WDM) transmission technology for the next generation optical Internet. One critical design issue in OBS is how to provide Quality-of-Service (QoS) on optical networks. In order to provide the service differentiation, we propose in this paper a buffer allocation algorithm to schedule bursts at the edge OBS nodes, a bandwidth allocation algorithm and a Fiber Delay Line (FDL) allocation algorithm to schedule bursts at the core OBS nodes. We also introduce a new burst assembly technique in which the burst is generated either when the sum of the collected packet sizes reaches the maximum threshold or when the burst assembling time reaches the timeout limit. Our simulation results show that the proposed algorithms achieve the controllable burst loss probability for different service classes. The bandwidth allocation algorithm performs very well at the core OBS nodes in terms of the low loss probability.

In this study, we propose an object-based multimedia model for specifying the QoS (quality of service) requirements, such as the maximum data-dropping rate or the maximum data-delay rate. We also present a resource allocation model, called the net-profit model, in which the satisfaction of user's QoS requirements is measured by the benefit earned by the system. Based on the net-profit model, the system is rewarded if it can allocate enough resources to a multimedia delivery request and fulfill the QoS requirements specified by the user. At the same time, the system is penalized if it cannot allocate enough resources to a multimedia delivery request. We first investigate the problem of how to allocate resources efficiently, so that the QoS satisfaction is maximized. However, the net-profit may be distributed unevenly among the multimedia delivery requests. Thus, the second problem discusses how to allocate the resource efficiently so that the net-profit difference is minimized between any two multimedia requests. A dynamic programming based algorithm is proposed to find such an optimal solution with the minimum net-profit differences.

The multimedia applications have recently generated much interest in wireless network infrastructure with supporting the quality-of-service (QoS) communications. In this paper, we propose a lantern-tree-based QoS on-demand multicast protocol for wireless ad hoc networks. Our proposed scheme offers a bandwidth routing protocol for QoS support in a multihop mobile network, where the MAC sub-layer adopts the CDMA-over-TDMA channel model. The QoS on-demand multicast protocol determines the end-to-end bandwidth calculation and bandwidth allocation from a source to a group of destinations. In this paper, we identify a lantern-tree for developing the QoS multicast protocol to satisfy certain bandwidth requirement, while the lantern-tree is served as the multicast-tree. Our lantern-tree-based scheme offers a higher success rate to construct the QoS multicast tree due to using the lantern-tree. The lantern-tree is a tree whose sub-path is constituted by the lantern-path, where the lantern-path is a kind of multi-path structure. This obviously improves the success rate by means of multi-path routing. In particular, our proposed scheme can be easily applied to most existing on-demand multicast protocols. Performance analysis results demonstrate the achievements of our proposed protocol.

A mobile ad hoc network (MANET) is characterized by multi-hop wireless links in the absence of any cellular infrastructure as well as by frequent host mobility. This paper proposes a SMPQ: Spiral-Multi-Path QoS routing protocol in a MANET, while the MAC sub-layer adopts the CDMA-over-TDMA channel model. This work investigates the bandwidth reservation problem of on-demand QoS routing in a wireless mobile ad-hoc network. The proposed approach increases the ability of a route to identify a robust path, namely a spiral-multi-path, from source host to destination host, in a MANET to satisfy certain bandwidth requirements. Two important contributions of the proposed spiral-multi-path are: (1) the spiral-multi-path strengthens route-robustness and route-stability properties and (2) the spiral-multi-path increases the success rate of finding the QoS route. Performance analysis results demonstrate that our SMPQ protocol outperforms other protocols.