18 research outputs found
Portfolio peak algorithms achieving superior performance for maximizing throughput in WiMAX networks
The Mobile WiMAX IEEE 802.16 standards ensure provision of last mile wireless access, variable and high data rate, point to multi-point communication, large frequency range and QoS (Quality of Service) for various types of applications.
The WiMAX standards are published by the Institute of Electric and Electronic Engineers (IEEE) and specify the standards of services and transmissions. However, the way how to run these services and when the transmission should be started are not specified in the IEEE standards and it is up to computer scientists to design scheduling algorithms that can best meet the standards. Finding the best way to implement the WiMAX standards through designing efficient scheduler algorithms is a very important component in wireless systems and the scheduling period presents the most common challenging issue in terms of throughput and time delay. The aim of the research presented in this thesis was to design and develop an efficient scheduling algorithm to provide the QoS support for real-time and non-real-time services with the WiMAX Network. This was achieved by combining a portfolio of algorithms, which will control and update transmission with the required algorithm by the various portfolios for supporting QoS such as; the guarantee of a maximum throughput for real-time and non-real-time traffic. Two algorithms were designed in this process and will be discussed in this thesis: Fixed Portfolio Algorithms and Portfolio Peak Algorithm. In order to evaluate the proposed algorithms and test their efficiency for IEEE 802.16 networks, the authors simulated the algorithms in the NS2 simulator. Evaluation of the proposed Portfolio algorithms was carried out through comparing its performance with those of the conventional algorithms. On the other hand, the proposed Portfolio scheduling algorithm was evaluated by comparing its performance in terms of throughput, delay, and jitter. The simulation results suggest that the Fixed Portfolio Algorithms and the Portfolio Peak Algorithm achieve higher performance in terms of throughput than all other algorithms.
Keywords: WiMAX, IEEE802.16, QoS, Scheduling Algorithms, Fixed Portfolio Algorithms, and Portfolio Peak Algorithms.The Mobile WiMAX IEEE 802.16 standards ensure provision of last mile wireless access, variable and high data rate, point to multi-point communication, large frequency range and QoS (Quality of Service) for various types of applications.
The WiMAX standards are published by the Institute of Electric and Electronic Engineers (IEEE) and specify the standards of services and transmissions. However, the way how to run these services and when the transmission should be started are not specified in the IEEE standards and it is up to computer scientists to design scheduling algorithms that can best meet the standards. Finding the best way to implement the WiMAX standards through designing efficient scheduler algorithms is a very important component in wireless systems and the scheduling period presents the most common challenging issue in terms of throughput and time delay. The aim of the research presented in this thesis was to design and develop an efficient scheduling algorithm to provide the QoS support for real-time and non-real-time services with the WiMAX Network. This was achieved by combining a portfolio of algorithms, which will control and update transmission with the required algorithm by the various portfolios for supporting QoS such as; the guarantee of a maximum throughput for real-time and non-real-time traffic. Two algorithms were designed in this process and will be discussed in this thesis: Fixed Portfolio Algorithms and Portfolio Peak Algorithm. In order to evaluate the proposed algorithms and test their efficiency for IEEE 802.16 networks, the authors simulated the algorithms in the NS2 simulator. Evaluation of the proposed Portfolio algorithms was carried out through comparing its performance with those of the conventional algorithms. On the other hand, the proposed Portfolio scheduling algorithm was evaluated by comparing its performance in terms of throughput, delay, and jitter. The simulation results suggest that the Fixed Portfolio Algorithms and the Portfolio Peak Algorithm achieve higher performance in terms of throughput than all other algorithms.
Keywords: WiMAX, IEEE802.16, QoS, Scheduling Algorithms, Fixed Portfolio Algorithms, and Portfolio Peak Algorithms
Application of learning algorithms to traffic management in integrated services networks.
SIGLEAvailable from British Library Document Supply Centre-DSC:DXN027131 / BLDSC - British Library Document Supply CentreGBUnited Kingdo
Recommended from our members
Intelligent based Packet Scheduling Scheme using Internet Protocol/Multi-Protocol Label Switching (IP/MPLS) Technology for 5G. Design and Investigation of Bandwidth Management Technique for Service-Aware Traffic Engineering using Internet Protocol/Multi-Protocol Label Switching (IP/MPLS) for 5G
Multi-Protocol Label Switching (MPLS) makes use of traffic engineering (TE)
techniques and a variety of protocols to establish pre-determined highly
efficient routes in Wide Area Network (WAN). Unlike IP networks in which
routing decision has to be made through header analysis on a hop-by-hop
basis, MPLS makes use of a short bit sequence that indicates the forwarding
equivalence class (FEC) of a packet and utilises a predefined routing table to
handle packets of a specific FEC type. Thus header analysis of packets is not
required, resulting in lower latency. In addition, packets of similar
characteristics can be routed in a consistent manner. For example, packets
carrying real-time information can be routed to low latency paths across the
networks. Thus the key success to MPLS is to efficiently control and distribute
the bandwidth available between applications across the networks.
A lot of research effort on bandwidth management in MPLS networks has
already been devoted in the past. However, with the imminent roll out of 5G,
MPLS is seen as a key technology for mobile backhaul. To cope with the 5G
demands of rich, context aware and multimedia-based user applications, more
efficient bandwidth management solutions need to be derived.
This thesis focuses on the design of bandwidth management algorithms, more
specifically QoS scheduling, in MPLS network for 5G mobile backhaul. The
aim is to ensure the reliability and the speed of packet transfer across the
network. As 5G is expected to greatly improve the user experience with
innovative and high quality services, users’ perceived quality of service (QoS)
needs to be taken into account when deriving such bandwidth management
solutions. QoS expectation from users are often subjective and vague. Thus
this thesis proposes the use of fuzzy logic based solution to provide service aware and user-centric bandwidth management in order to satisfy
requirements imposed by the network and users.
Unfortunately, the disadvantage of fuzzy logic is scalability since dependable
fuzzy rules and membership functions increase when the complexity of being
modelled increases. To resolve this issue, this thesis proposes the use of neuro-fuzzy to solicit interpretable IF-THEN rules.The algorithms are
implemented and tested through NS2 and Matlab simulations. The
performance of the algorithms are evaluated and compared with other
conventional algorithms in terms of average throughput, delay, reliability, cost,
packet loss ratio, and utilization rate.
Simulation results show that the neuro-fuzzy based algorithm perform better
than fuzzy and other conventional packet scheduling algorithms using IP and
IP over MPLS technologies.Tertiary Education Trust Fund (TETFUND
Achieving Soft Real-time Guarantees for Interactive Applications in Wireless Mesh Networks
The use of 802.11-based multi-hop wireless mesh networks for Internet access is extensive and growing. The primary advantages of this approach are ease of deployment and lower cost. However, these networks are designed for web and e-mail applications. Highly interactive applications, such as multiplayer online games and VoIP, with their requirements for low delay, present significant challenges to these networks. In particular, the interaction between real-time traffic and TCP traffic tends to result in either a failure of the real-time traffic getting its needed QoS or the TCP traffic unnecessarily experiencing very poor throughput. To solve this problem we place real-time and TCP traffic into separate queues. We then rate-limit TCP traffic based on the average queue size of the local or remote real-time queues. Thus, TCP traffic is permitted to use excess bandwidth as long as it does not interfere with real-time traffic guarantees. We therefore call our scheme Real-time Queue-based Rate and Admission Control, RtQ-RAC. Extensive simulations using the network simulator, ns-2, demonstrate that our approach is effective in providing soft real-time support, while allowing efficient use of the remaining bandwidth for TCP traffic
Energy efficient wireless sensor network protocols for monitoring and prognostics of large scale systems
In this work, energy-efficient protocols for wireless sensor networks (WSN) with applications to prognostics are investigated. Both analytical methods and verification are shown for the proposed methods via either hardware experiments or simulation. This work is presented in five papers. Energy-efficiency methods for WSN include distributed algorithms for i) optimal routing, ii) adaptive scheduling, iii) adaptive transmission power and data-rate control --Abstract, page iv
Qualité de service dans l'IOT : couche de brouillard
Abstract : The Internet of Things (IoT) can be defined as a combination of push and pull from the technological side and human side respectively. This push and pull effect results in more connectivity among objects and humans in the near surrounding environments [1]. With the growth in the field of IoT, in recent times, the risk of real time failures has increased as well. The failures are often detected by certain points of vulnerability in the system. Narrowing down to the root causes we get the point of failures and that leads to the required measures to overcome them. This creates the need for IoT systems to have a proper Quality of Service (QoS) architecture. Thus, QoS is becoming a crucial issue with the democratization of IoT. QoS is the description or measurement of the overall performance of a service, such as a telephony or computer network or a cloud computing service, particularly the performance seen by the users of the network. In this study, we propose the methods of enforcement of QoS in IoT platforms. We will highlight the challenges and recurrent issues faced by all IoT platforms which in turn inspired us to build a generic tool to overcome these challenges by enforcing the QoS in all the IoT platforms with an easy to use set up. The main focus of this study is to enable QoS features in the Fog layer of the IoT architecture. Existing platforms and systems enabling QoS features in the Fog layer are also highlighted. Finally, we validate our proposed model by implementing it on our AMI-LAB platform.L'Internet des objets (IdO) (Internet of Things en anglais), peut être défini comme une combinaison d’interactions entre les Humains et le monde technologique de l’Internet. De cet effet résulte une interconnexion entre les objets physiques et les appareils technologiques dans leur environnement proche. Ces dernières années le domaine de l'IdO s’est beaucoup développé, entrainant ainsi une augmentation du risque de défaillances en temps réel. Les défaillances sont souvent détectées par certains points de vulnérabilité dans le système. En se concentrant sur les causes profondes, le point de défaillance peut être détecter, ce qui conduit aux mesures à mettre en place pour surmonter les défaillances. Les systèmes IdO ont donc besoin d'avoir une architecture de Qualité de Service (QdS) adéquate. Ainsi, la QdS devient un enjeu crucial avec la démocratisation de l'IdO. La QdS est la description ou la mesure de la performance globale d'un service, tel qu'un réseau de téléphonie ou informatique, ou un service de cloud computing, en particulier la performance perçue par les utilisateurs du réseau. Dans cette étude, nous proposons les méthodes de mise en œuvre de la QdS dans les plateformes IdO. Nous mettrons en lumière les défis et les problèmes récurrents rencontrés par toutes les plateformes IdO, qui nous ont inspirés à construire un outil générique pour surmonter ces défis en imposant la QdS dans toutes les plateformes IdO avec une configuration facile à utiliser. L'objectif principal de cette étude est de permettre les fonctionnalités de QdS dans la couche Fog de l'architecture IdO. Les plateformes et systèmes existants permettant les fonctionnalités de QdS dans la couche Fog sont également mis en évidence. Enfin, nous soulignons la validation de notre modèle en le mettant en œuvre sur notre plateforme AMI-LAB
Adaptive scheduling in cellular access, wireless mesh and IP networks
Networking scenarios in the future will be complex and will include fixed networks and hybrid Fourth Generation (4G) networks, consisting of both infrastructure-based and infrastructureless, wireless parts. In such scenarios, adaptive provisioning and management of network resources becomes of critical importance. Adaptive mechanisms are desirable since they enable a self-configurable network that is able to adjust itself to varying traffic and channel conditions. The operation of adaptive mechanisms is heavily based on measurements. The aim of this thesis is to investigate how measurement based, adaptive packet scheduling algorithms can be utilized in different networking environments.
The first part of this thesis is a proposal for a new delay-based scheduling algorithm, known as Delay-Bounded Hybrid Proportional Delay (DBHPD), for delay adaptive provisioning in DiffServ-based fixed IP networks. This DBHPD algorithm is thoroughly evaluated by ns2-simulations and measurements in a FreeBSD prototype router network. It is shown that DBHPD results in considerably more controllable differentiation than basic static bandwidth sharing algorithms. The prototype router measurements also prove that a DBHPD algorithm can be easily implemented in practice, causing less processing overheads than a well known CBQ algorithm.
The second part of this thesis discusses specific scheduling requirements set by hybrid 4G networking scenarios. Firstly, methods for joint scheduling and transmit beamforming in 3.9G or 4G networks are described and quantitatively analyzed using statistical methods. The analysis reveals that the combined gain of channel-adaptive scheduling and transmit beamforming is substantial and that an On-off strategy can achieve the performance of an ideal Max SNR strategy if the feedback threshold is optimized. Finally, a novel cross-layer energy-adaptive scheduling and queue management framework EAED (Energy Aware Early Detection), for preserving delay bounds and minimizing energy consumption in WLAN mesh networks, is proposed and evaluated with simulations. The simulations show that our scheme can save considerable amounts of transmission energy without violating application level QoS requirements when traffic load and distances are reasonable
Resource Allocation in SDN/NFV-Enabled Core Networks
For next generation core networks, it is anticipated to integrate communication, storage and computing resources into one unified, programmable and flexible infrastructure. Software-defined networking (SDN) and network function virtualization (NFV) become two enablers. SDN decouples the network control and forwarding functions, which facilitates network management and enables network programmability. NFV allows the network functions to be virtualized and placed on high capacity servers located anywhere in the network, not only on dedicated devices in current networks. Driven by SDN and NFV platforms, the future network architecture is expected to feature centralized network management, virtualized function chaining, reduced capital and operational costs, and enhanced service quality.
The combination of SDN and NFV provides a potential technical route to promote the future communication networks. It is imperative to efficiently manage, allocate and optimize the heterogeneous resources, including computing, storage, and communication resources, to the customized services to achieve better quality-of-service (QoS) provisioning. This thesis makes some in-depth researches on efficient resource allocation for SDN/NFV-enabled core networks in multiple aspects and dimensionality. Typically, the resource allocation task is implemented in three aspects. Given the traffic metrics, QoS requirements, and resource constraints of the substrate network, we first need to compose a virtual network function (VNF) chain to form a virtual network (VN) topology. Then, virtual resources allocated to each VNF or virtual link need to be optimized in order to minimize the provisioning cost while satisfying the QoS requirements. Next, we need to embed the virtual network (i.e., VNF chain) onto the substrate network, in which we need to assign the physical resources in an economical way to meet the resource demands of VNFs and links. This involves determining the locations of NFV nodes to host the VNFs and the routing from source to destination. Finally, we need to schedule the VNFs for multiple services to minimize the service completion time and maximize the network performance.
In this thesis, we study resource allocation in SDN/NFV-enabled core networks from the aforementioned three aspects. First, we jointly study how to design the topology of a VN and embed the resultant VN onto a substrate network with the objective of minimizing the embedding cost while satisfying the QoS requirements. In VN topology design, optimizing the resource requirement for each virtual node and link is necessary. Without topology optimization, the resources assigned to the virtual network may be insufficient or redundant, leading to degraded service quality or increased embedding cost. The joint problem is formulated as a Mixed Integer Nonlinear Programming (MINLP), where queueing theory is utilized as the methodology to analyze the network delay and help to define the optimal set of physical resource requirements at network elements. Two algorithms are proposed to obtain the optimal/near-optimal solutions of the MINLP model.
Second, we address the multi-SFC embedding problem by a game theoretical approach, considering the heterogeneity of NFV nodes, the effect of processing-resource sharing among various VNFs, and the capacity constraints of NFV nodes. In the proposed resource constrained multi-SFC embedding game (RC-MSEG), each SFC is treated as a player whose objective is to minimize the overall latency experienced by the supported service flow, while satisfying the capacity constraints of all its NFV nodes. Due to processing-resource sharing, additional delay is incurred and integrated into the overall latency for each SFC. The capacity constraints of NFV nodes are considered by adding a penalty term into the cost function of each player, and are guaranteed by a prioritized admission control mechanism. We first prove that the proposed game RC-MSEG is an exact potential game admitting at least one pure Nash Equilibrium (NE) and has the finite improvement property (FIP). Then, we design two iterative algorithms, namely, the best response (BR) algorithm with fast convergence and the spatial adaptive play (SAP) algorithm with great potential to obtain the best NE of the proposed game.
Third, the VNF scheduling problem is investigated to minimize the makespan (i.e., overall completion time) of all services, while satisfying their different end-to-end (E2E) delay requirements. The problem is formulated as a mixed integer linear program (MILP) which is NP-hard with exponentially increasing computational complexity as the network size expands. To solve the MILP with high efficiency and accuracy, the original problem is reformulated as a Markov decision process (MDP) problem with variable action set. Then, a reinforcement learning (RL) algorithm is developed to learn the best scheduling policy by continuously interacting with the network environment.
The proposed learning algorithm determines the variable action set at each decision-making state and accommodates different execution time of the actions. The reward function in the proposed algorithm is carefully designed to realize delay-aware VNF scheduling.
To sum up, it is of great importance to integrate SDN and NFV in the same network to accelerate the evolution toward software-enabled network services. We have studied VN topology design, multi-VNF chain embedding, and delay-aware VNF scheduling to achieve efficient resource allocation in different dimensions. The proposed approaches pave the way for exploiting network slicing to improve resource utilization and facilitate QoS-guaranteed service provisioning in SDN/NFV-enabled networks
Mobile Ad-Hoc Networks
Being infrastructure-less and without central administration control, wireless ad-hoc networking is playing a more and more important role in extending the coverage of traditional wireless infrastructure (cellular networks, wireless LAN, etc). This book includes state-of-the-art techniques and solutions for wireless ad-hoc networks. It focuses on the following topics in ad-hoc networks: quality-of-service and video communication, routing protocol and cross-layer design. A few interesting problems about security and delay-tolerant networks are also discussed. This book is targeted to provide network engineers and researchers with design guidelines for large scale wireless ad hoc networks