1) The document proposes an efficient carrier Ethernet overbooking solution for mobile backhaul networks. It develops a statistical method to derive a safe overbooking factor at the user-network-interface (UNI) based on peak utilization data.
2) It then presents two transport architectures to support bandwidth sharing across a cellular cluster using a single Ethernet virtual connection (EVC) pipe with an overbooked bandwidth.
3) A novel bandwidth control algorithm is also introduced to provide quality of service for multimedia traffic over the overbooked UNI, with service level agreement policing and protection for high priority services. Experimental and simulation results show that the new schemes can improve resource utilization, reduce costs, and maintain backhaul performance
An Optimal Route Discovery using Biogeography based Optimization for Vehicula...StevePrice20
Ā
Vehicular ad hoc network (VANET) is a subdivision of the mobile ad hoc networks which uses the moving vehicles as mobile nodes to form the mobile network. In conventional vehicular communications, the restricted radio frequency bandwidth affects the network performances. Therefore, Visible Light Communication (VLC) is integrated with the growing vehicular ad hoc network to obtain high data rate and less energy consumption during the communication. In this paper, vehicular communication is integrated with visible light communication to avoid the issues caused by the restricted radio frequency bandwidth. Moreover, the Routing using Biogeography Based Optimization (RBBO) is proposed to develop an optimal route between the source vehicles to the destination. This research performs two different communications such as vehicle to vehicle and vehicle to the infrastructure. The performance of the RBBOVLC-VANET method is analyzed by means of throughput, packet delivery ratio, delay and routing overhead as well as these performances are compared with the existing method namely ant colony optimization based routing protocol. The throughput of the routing using the biogeography based optimization method is 589.763 kbps for 500 nodes which is high when compared to the existing method.
GPSFR: GPS-Free Routing Protocol for Vehicular Networks with Directional Ante...ijwmn
Ā
Efficient and practical communications between large numbers of vehicles are critical in providing high level of safety and convenience to drivers. Crucial real-time information on road hazard, traffic conditions and driver services must be communicated to vehicles rapidly even in adverse environments, such as āurban canyonsā and tunnels. We propose a novel routing protocol in vehicular networks that does not require position information (e.g. from GPS) but instead rely on relative position that can be determined dynamically. This GPS-Free Geographic Routing (GPSFR) protocol uses the estimated relative position of vehicles and greedily chooses the best next hop neighbor based on a Balance Advance (BADV) metric which balances between proximity and link stability in order to improve routing performance. In this paper, we focuses primarily on the complexity of routing in highways and solves routing problems that arise when vehicles are near interchanges, curves, and merge or exit lanes of highways. Our simulation results show that by taking relative velocity into account, GPSFR reduces link breakage to only 27% that of GPSR in the dense network. Consequently, GPSFR outperforms GPSR in terms of higher data delivery ratio, lower delay, less sensitivity of the network density and route pathsālength
A Proactive Greedy Routing Protocol Precludes Sink-Hole Formation in Wireless...ijwmn
Ā
The International Journal of Wireless & Mobile Networks (IJWMN) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Wireless & Mobile Networks. The journal focuses on all technical and practical aspects of Wireless & Mobile Networks. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced wireless & mobile networking concepts and establishing new collaborations in these areas.
An Efficient and Stable Routing Algorithm in Mobile Ad Hoc NetworkIJCNCJournal
Ā
Mobile Ad hoc Network (MANET) is mainly designed to set up communication among devices in infrastructure-less wireless communication network. Routing in this kind of communication network is highly affected by its restricted characteristics such as frequent topological changes and limited battery power. Several research works have been carried out to improve routing performance in MANET. However, the overall performance enhancement in terms of packet delivery, delay and control message overhead is still not come into the wrapping up. In order to overcome the addressed issues, an Efficient and Stable-AODV (EFST-AODV) routing scheme has been proposed which is an improvement over AODV to establish a better quality route between source and destination. In this method, we have modified the route request and route reply phase. During the route request phase, cost metric of a route is calculated on the basis of parameters such as residual energy, delay and distance. In a route reply phase, average residual energy and average delay of overall path is calculated and the data forwarding decision is taken at the source node accordingly. Simulation outcomes reveal that the proposed approach gives better results in terms of packet delivery ratio, delay, throughput, normalized routing load and control message overhead as compared to AODV.
An Optimal Route Discovery using Biogeography based Optimization for Vehicula...StevePrice20
Ā
Vehicular ad hoc network (VANET) is a subdivision of the mobile ad hoc networks which uses the moving vehicles as mobile nodes to form the mobile network. In conventional vehicular communications, the restricted radio frequency bandwidth affects the network performances. Therefore, Visible Light Communication (VLC) is integrated with the growing vehicular ad hoc network to obtain high data rate and less energy consumption during the communication. In this paper, vehicular communication is integrated with visible light communication to avoid the issues caused by the restricted radio frequency bandwidth. Moreover, the Routing using Biogeography Based Optimization (RBBO) is proposed to develop an optimal route between the source vehicles to the destination. This research performs two different communications such as vehicle to vehicle and vehicle to the infrastructure. The performance of the RBBOVLC-VANET method is analyzed by means of throughput, packet delivery ratio, delay and routing overhead as well as these performances are compared with the existing method namely ant colony optimization based routing protocol. The throughput of the routing using the biogeography based optimization method is 589.763 kbps for 500 nodes which is high when compared to the existing method.
GPSFR: GPS-Free Routing Protocol for Vehicular Networks with Directional Ante...ijwmn
Ā
Efficient and practical communications between large numbers of vehicles are critical in providing high level of safety and convenience to drivers. Crucial real-time information on road hazard, traffic conditions and driver services must be communicated to vehicles rapidly even in adverse environments, such as āurban canyonsā and tunnels. We propose a novel routing protocol in vehicular networks that does not require position information (e.g. from GPS) but instead rely on relative position that can be determined dynamically. This GPS-Free Geographic Routing (GPSFR) protocol uses the estimated relative position of vehicles and greedily chooses the best next hop neighbor based on a Balance Advance (BADV) metric which balances between proximity and link stability in order to improve routing performance. In this paper, we focuses primarily on the complexity of routing in highways and solves routing problems that arise when vehicles are near interchanges, curves, and merge or exit lanes of highways. Our simulation results show that by taking relative velocity into account, GPSFR reduces link breakage to only 27% that of GPSR in the dense network. Consequently, GPSFR outperforms GPSR in terms of higher data delivery ratio, lower delay, less sensitivity of the network density and route pathsālength
A Proactive Greedy Routing Protocol Precludes Sink-Hole Formation in Wireless...ijwmn
Ā
The International Journal of Wireless & Mobile Networks (IJWMN) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Wireless & Mobile Networks. The journal focuses on all technical and practical aspects of Wireless & Mobile Networks. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced wireless & mobile networking concepts and establishing new collaborations in these areas.
An Efficient and Stable Routing Algorithm in Mobile Ad Hoc NetworkIJCNCJournal
Ā
Mobile Ad hoc Network (MANET) is mainly designed to set up communication among devices in infrastructure-less wireless communication network. Routing in this kind of communication network is highly affected by its restricted characteristics such as frequent topological changes and limited battery power. Several research works have been carried out to improve routing performance in MANET. However, the overall performance enhancement in terms of packet delivery, delay and control message overhead is still not come into the wrapping up. In order to overcome the addressed issues, an Efficient and Stable-AODV (EFST-AODV) routing scheme has been proposed which is an improvement over AODV to establish a better quality route between source and destination. In this method, we have modified the route request and route reply phase. During the route request phase, cost metric of a route is calculated on the basis of parameters such as residual energy, delay and distance. In a route reply phase, average residual energy and average delay of overall path is calculated and the data forwarding decision is taken at the source node accordingly. Simulation outcomes reveal that the proposed approach gives better results in terms of packet delivery ratio, delay, throughput, normalized routing load and control message overhead as compared to AODV.
The performance of the vehicular communication-clustering processTELKOMNIKA JOURNAL
Ā
For the new wireless systems and beyond, the intelligent transportation system is considered as one of the main features that could be covered in the new research topics. Furthermore, both high-speed data transmission and data processing play a crucial role for these generations. Our work covers two main propositions in order to attain an improvement in such intelligent systems performance. A clustering algorithm is proposed and presented for grouping mobile nodes based on their speeds with some modified head assignments processes. This will be combined with a parallel-processing technique that enhances the QoS. Mainly, this work concerns enhancing the V2V data transmission and the processing speed. Thus, a wavelet processing stage has been imposed to optimize the transmitted power phenomenon. In order to check the validity of such proposition, five main efficiency factors have been investigated; namely complementary cumulative distributions, bit rates, energy efficiency, the lifetime of cluster head and the ordinary nodes reattaching-head average times.
A Cluster-Based Routing Protocol and Fault Detection for Wireless Sensor NetworkIJCNCJournal
Ā
In Wireless Sensors Networks (WSN) based application, a large number of sensor devices must be deployed. Energy efficiency and network lifetime are the two most challenging issues in WSN. As a consequence, the main goal is to reduce the overall energy consumption using clustering protocols which have to ensure reliability and connectivity in large-scale WSN. This work presents a new clustering and routing algorithm based on the properties of the sensor networks. The main goal of this work is to extend the network lifetime via charge equilibration in the WSN. According to many errors with sensing devices and to have greater data accuracy, we use a quorum mechanism. The proposed algorithms are evaluated widely and the results are compared with related works. The experimental results show that the proposed algorithm provides an effective improvement in terms of energy consumption, data accuracy and network lifetime.
PERFORMANCE ANALYSIS OF CARRIER AGGREGATION FOR VARIOUS MOBILE NETWORK IMPLEM...ijwmn
Ā
Carrier Aggregation (CA) is one of the Long Term Evolution Advanced (LTE-A) features that allow mobile network operators (MNO) to combine multiple component carriers (CCs) across the available spectrum to create a wider bandwidth channel for increasing the network data throughput and overall capacity. CA has a potential to enhance data rates and network performance in the downlink, uplink, or both, and it can support aggregation of frequency division duplexing (FDD) as well as time division duplexing (TDD). The technique enables the MNO to exploit fragmented spectrum allocations and can be utilized to aggregate licensed and unlicensed carrier spectrum as well. This paper analyzes the performance gains and complexity level that arises from the aggregation of three inter-band component carriers (3CC) as compared to the aggregation of 2CC using a Vienna LTE System Level simulator. The results show a considerable growth in the average cell throughput when 3CC aggregations are implemented over the 2CC aggregation, at the expense of reduction in the fairness index. The reduction in the fairness index implies that, the scheduler has an increased task in resource allocations due to the added component carrier. Compensating for such decrease in the fairness index could result into scheduler design complexity. The proposed scheme can be adopted in combining various component carriers, to increase the bandwidth and hence the data rates.
Novel Position Estimation using Differential Timing Information for Asynchron...IJCNCJournal
Ā
Positioning techniques have been a common objective since the early development of wireless networks. However, current positioning methods in cellular networks, for instance, are still primarily focused on the use of the Global Navigation Satellite System (GNSS), which has several limitations, like high power drainage and failure in indoor scenarios. This study introduces a novel approach employing standard LTE signaling in order to provide high accuracy positioning estimation. The proposed technique is designed in analogy to the human sound localization system, eliminating the need of having information from three spatially diverse Base Stations (BSs). This is inspired by the perfect human 3D sound localization with two ears. A field study is carried out in a dense urban city to verify the accuracy of the proposed technique, with more than 20 thousand measurement samples collected. The achieved positioning accuracy is meeting the latest Federal Communications Commission (FCC) requirements in the planner dimension.
GPS Enabled Energy Efficient Routing for ManetCSCJournals
Ā
In this paper, we propose an energy aware reactive approach by introducing energy and distance based threshold criteria. Cross Layer interaction is exploited the performance of physical layer which leads to significant improvement in the energy efficiency of a network.
The facilitation of inter-vehicular communication
by direct means or through fixed infrastructure devices like
roadside units enable Vehicular Ad hoc NETwork (VANET)
to be the predominant environment for the deployment of
Intelligent Transportation Systems (ITS).The vehicular
movements in VANET is governed by the incorporated
mobility model for achieving better data dissemination rate
as their mode of multicast routes-based parallel transmission
remains indispensable for sharing traffic related
information. The QoS parameters of multicast routing is to
be satisfied essentially on par with the base protocols, place
and time of application for compliance with the necessity in
robust data dissemination. Enhanced and Integrated Ant
Colony-Artificial Bee Colony oriented Multicast Routing
(EIAC-ABCMR) is formulated as a multicast tree
determination problem that imposes the satisfaction of
multi-constrained QoS by reducing cost, delay and jitter
with increased bandwidth for improving efficacy in data
transmission. The simulation experiments of EIAC-ABCMR
and its derived inferences confirm its importance in reducing
the number of multicast groups formed during data
communication which is about 36% predominant to the
compared baseline multicast routing techniques. The results
of EIAC-ABCMR also infers a better throughput, reduced
normalized load overhead and energy consumptions on par
with the benchmarked QoS constrained multicast routing
schemes under study.
STUDY OF THE EFFECT OF VELOCITY ON END-TOEND DELAY FOR V2V COMMUNICATION IN ITSijngnjournal
Ā
This paper focuses on vehicle to vehicle (V2V) communications in VANET. With the development of vehicles and mobile Ad Hoc network technology, the Vehicle Ad hoc Network (VANET) has become an emerging field of study. VANET is a special case of MANET, and will play an important role in city road traffic control. It is a challenging problem for searching and maintaining an effective route for transporting data information. Vehicular Ad Hoc network (VANET), is a hot topic applying mobile Ad Hoc network (MANET) to ITS in recent years. In the era of wireless computing, VANET communications are gaining a lot of attention. In this paper we provide a simulation and study of the effect of velocity on end-to-end delay for v2v communication in intelligent transportation Systems
QoS based Admission Control using Multipath Scheduler for IP over Satellite N...IJECEIAES
Ā
This paper presents a novel scheduling algorithm to support quality of service (QoS) for multiservice applications over integrated satellite and terrestrial networks using admission control system with multipath selection capabilities. The algorithm exploits the multipath routing paradigm over LEO and GEO satellites constellation in order to achieve optimum end-toend QoS of the client-server Internet architecture for HTTP web service, file transfer, video streaming and VoIP applications. The proposed multipath scheduler over the satellite networks advocates load balancing technique based on optimum time-bandwidth in order to accommodate the burst of application traffics. The method tries to balance the bandwidth load and queue length on each link over satellite in order to fulfil the optimum QoS level for each traffic type. Each connection of a traffic type will be routed over a link with the least bandwidth load and queue length at current time in order to avoid congestion state. The multipath routing scheduling decision is based on per connection granularity so that packet reordering at the receiver side could be avoided. The performance evaluation of IP over satellites has been carried out using multiple connections, different file sizes and bit-errorrate (BER) variations to measure the packet delay, loss ratio and throughput.
Traffic Congestion Prediction using Deep Reinforcement Learning in Vehicular ...IJCNCJournal
Ā
In recent years, a new wireless network called vehicular ad-hoc network (VANET), has become a popular research topic. VANET allows communication among vehicles and with roadside units by providing information to each other, such as vehicle velocity, location and direction. In general, when many vehicles likely to use the common route to proceed to the same destination, it can lead to a congested route that should be avoided. It may be better if vehicles are able to predict accurately the traffic congestion and then avoid it. Therefore, in this work, the deep reinforcement learning in VANET to enhance the ability to predict traffic congestion on the roads is proposed. Furthermore, different types of neural networks namely Convolutional Neural Network (CNN), Multilayer Perceptron (MLP) and Long Short-Term Memory (LSTM) are investigated and compared in this deep reinforcement learning model to discover the most effective one. Our proposed method is tested by simulation. The traffic scenarios are created using traffic simulator called Simulation of Urban Mobility (SUMO) before integrating with deep reinforcement learning model. The simulation procedures, as well as the programming used, are described in detail. The performance of our proposed method is evaluated using two metrics; the average travelling time delay and average waiting time delay of vehicles. According to the simulation results, the average travelling time delay and average waiting time delay are gradually improved over the multiple runs, since our proposed method receives feedback from the environment. In addition, the results without and with three different deep learning algorithms, i.e., CNN, MLP and LSTM are compared. It is obvious that the deep reinforcement learning model works effectively when traffic density is neither too high nor too low. In addition, it can be concluded that the effective algorithms for traffic congestion prediction models in descending order are MLP, CNN, and LSTM, respectively.
Optimized Cluster Establishment and Cluster-Head Selection Approach in WSNIJCNCJournal
Ā
In recent years, limited resources of user products and energy-saving are recognized as the major challenges of Wireless Sensor Networks (WSNs). Clustering is a practical technique that can reduce all energy consumption and provide stability of workload that causes a larger difference in energy depletion among other nodes and cluster heads (CHs). In addition, clustering is the solution of energy-efficient for maximizing the network longevity and improvising energy efficiency. In this paper, a novel OCE-CHS (Optimized Cluster Establishment and Cluster-Head Selection) approach for sensor nodes is represented to improvise the packet success ratio and reduce the average energy-dissipation. The main contribution of this paper is categorized into two processes, first, the clustering algorithm is improvised that periodically chooses the optimal set of the CHs according to the speed of the average node and average-node energy. This is considerably distinguished from node-based clustering that utilizes a distributed clustering algorithm to choose CHs based on the speed of the current node and remaining node energy. Second, more than one factor is assumed for the detached node to join the optimal cluster. In the result section, we discuss our clustering protocols implementation of optimal CH-selection to evade the death of SNs, maximizing throughput, and further improvise the network lifetime by minimizing energy consumption.
PERFORMANCE OF OLSR MANET ADOPTING CROSS-LAYER APPROACH UNDER CBR AND VBR TRA...IJCNCJournal
Ā
The routing protocols play an important role in Mobile Ad-Hoc Network (MANET) because of the dynamically change of its topology. Optimized Link State Routing (OLSR), unawareness of Quality of Service (QoS) and power-consumed protocol, is an example of a widely-used routing protocol in MANET.
The Multi-Point Relays (MPR) selection algorithm is very crucial in OLSR. Therefore, firstly, we propose a heuristic method to select the best path based on two parameters; Bit Error Rate (BER) derived from the physical layer and Weighted Connectivity Index (CI) adopted from the network layer. This can be done via the cross-layer design scheme. This is anticipated to enhance the performance of OLSR, provide QoS
guarantee and improve the power consumption. The performances of the proposed scheme are investigated
by simulation of two types of traffics: CBR and VBR (MPEG-4), evaluated by metrics namely Throughput, Packet Delivery Ratio (PDR), Average End-to-End Delay, Control Overhead and Average Total Power Consumption.We compare our results with the typical OLSR and OLSR using only Weighted CI. It is
obvious that our proposed scheme provides superior performances to the typical OLSR and OLSR using only Weighted CI, especially, at high traffic load.
Performance evaluation of interference aware topology power and flow control ...IJECEIAES
Ā
Multi-Radio Multi-Channel Wireless Mesh Network (MRMC-WMN) has been considered as one of the key technology for the enhancement of network performance. It is used in a number of real-time applications such as disaster management system, transportation system and health care system. MRMC-WMN is a multi-hop network and allows simultaneous data transfer by using multiple radio interfaces. All the radio interfaces are typically assigned with different channels to reduce the effect of co-channel interference. In MRMC-WMN, when two nodes transmit at the same channel in the range of each other, generates co-channel interference and degrades the network throughput. Co-channel interference badly affects the capacity of each link that reduces the overall network performance. Thus, the important task of channel assignment algorithm is to reduce the co-channel interference and enhance the network performance. In this paper, the problem of channel assignment has been addressed for MRMC-WMN. We have proposed an Interference Aware, Topology, Power and Flow Control (ITPFC) Channel Assignment algorithm for MRMC-WMN. This algorithm assignes the suitable channels to nodes, which provides better link capacity and reduces the co-channel interference. In the previous work performance of the proposed algorithm has been evaluated for a network of 30 nodes. The aim of this paper is to further evaluate the performance of proposed channel assignment algorithm for 40 and 50 nodes network. The results obtained from these networks show the consistent performance in terms of throughput, delay, packet loss and number of channels used per node as compared to LACA, FCPRA and IATC Channel Assignment algorithms.
How can we apply principles of Customer Experience Management (CEM), to the emerging category of Machine-to-Machine (m2m) communications? This workshop at TM Forum Orlando explored this provocation.
Universal Access and Aggregation Mobile Backhaul Design GuideJuniper Networks
Ā
This design guide provides all aspects of designing Juniper Networksā based mobile backhaul (MBH) networks, introduces key concepts related to the access and aggregation network and to MBH, and includes working configurations. The advantages of Junos OS together with the ACX Series and MX Series routers are described in detail with various use cases and deployment scenarios. Connected to the MX Series routers, Juniper Networksā TCA Series Timing Servers are used to provide highly accurate timing that is critical for mobile networks.
4G World Mobile Backhaul Summit. If you missed it in person, feel free to view it online.
Speakers:
Mark Casey, CFN Services, Incorporated
Mike Dodson, Utopian Wireless
Doug Smith, Digital Bridge
Dan Graf, Leap Wireless/Cricket Communications
If you have any questions please contact CFN Services at backhaul@cfnservices.com
With worldwide mobile backhaul connections increasing from 5 to 10 Mbps in 2009 to 50 Mbps by 2012, mobile operators, network equipment vendors and others must implement new strategies to cope with the influx. Fiber, copper, microwave, millimeter waveāeach backhaul medium has its own advantages and limitations in terms of availability, cost to deploy, operational cost, speed/distance and regulatory considerations. What is the right strategy for todayās 3G and emerging 4G ecosystem, and is there any hope of leveraging today's backhaul assets for three (let alone five) years?
In this webinar, Jennifer Pigg, Yankee Group research VP, examines the mobile backhaul solutions operators are deploying today and the emerging strategies for tomorrow.
The performance of the vehicular communication-clustering processTELKOMNIKA JOURNAL
Ā
For the new wireless systems and beyond, the intelligent transportation system is considered as one of the main features that could be covered in the new research topics. Furthermore, both high-speed data transmission and data processing play a crucial role for these generations. Our work covers two main propositions in order to attain an improvement in such intelligent systems performance. A clustering algorithm is proposed and presented for grouping mobile nodes based on their speeds with some modified head assignments processes. This will be combined with a parallel-processing technique that enhances the QoS. Mainly, this work concerns enhancing the V2V data transmission and the processing speed. Thus, a wavelet processing stage has been imposed to optimize the transmitted power phenomenon. In order to check the validity of such proposition, five main efficiency factors have been investigated; namely complementary cumulative distributions, bit rates, energy efficiency, the lifetime of cluster head and the ordinary nodes reattaching-head average times.
A Cluster-Based Routing Protocol and Fault Detection for Wireless Sensor NetworkIJCNCJournal
Ā
In Wireless Sensors Networks (WSN) based application, a large number of sensor devices must be deployed. Energy efficiency and network lifetime are the two most challenging issues in WSN. As a consequence, the main goal is to reduce the overall energy consumption using clustering protocols which have to ensure reliability and connectivity in large-scale WSN. This work presents a new clustering and routing algorithm based on the properties of the sensor networks. The main goal of this work is to extend the network lifetime via charge equilibration in the WSN. According to many errors with sensing devices and to have greater data accuracy, we use a quorum mechanism. The proposed algorithms are evaluated widely and the results are compared with related works. The experimental results show that the proposed algorithm provides an effective improvement in terms of energy consumption, data accuracy and network lifetime.
PERFORMANCE ANALYSIS OF CARRIER AGGREGATION FOR VARIOUS MOBILE NETWORK IMPLEM...ijwmn
Ā
Carrier Aggregation (CA) is one of the Long Term Evolution Advanced (LTE-A) features that allow mobile network operators (MNO) to combine multiple component carriers (CCs) across the available spectrum to create a wider bandwidth channel for increasing the network data throughput and overall capacity. CA has a potential to enhance data rates and network performance in the downlink, uplink, or both, and it can support aggregation of frequency division duplexing (FDD) as well as time division duplexing (TDD). The technique enables the MNO to exploit fragmented spectrum allocations and can be utilized to aggregate licensed and unlicensed carrier spectrum as well. This paper analyzes the performance gains and complexity level that arises from the aggregation of three inter-band component carriers (3CC) as compared to the aggregation of 2CC using a Vienna LTE System Level simulator. The results show a considerable growth in the average cell throughput when 3CC aggregations are implemented over the 2CC aggregation, at the expense of reduction in the fairness index. The reduction in the fairness index implies that, the scheduler has an increased task in resource allocations due to the added component carrier. Compensating for such decrease in the fairness index could result into scheduler design complexity. The proposed scheme can be adopted in combining various component carriers, to increase the bandwidth and hence the data rates.
Novel Position Estimation using Differential Timing Information for Asynchron...IJCNCJournal
Ā
Positioning techniques have been a common objective since the early development of wireless networks. However, current positioning methods in cellular networks, for instance, are still primarily focused on the use of the Global Navigation Satellite System (GNSS), which has several limitations, like high power drainage and failure in indoor scenarios. This study introduces a novel approach employing standard LTE signaling in order to provide high accuracy positioning estimation. The proposed technique is designed in analogy to the human sound localization system, eliminating the need of having information from three spatially diverse Base Stations (BSs). This is inspired by the perfect human 3D sound localization with two ears. A field study is carried out in a dense urban city to verify the accuracy of the proposed technique, with more than 20 thousand measurement samples collected. The achieved positioning accuracy is meeting the latest Federal Communications Commission (FCC) requirements in the planner dimension.
GPS Enabled Energy Efficient Routing for ManetCSCJournals
Ā
In this paper, we propose an energy aware reactive approach by introducing energy and distance based threshold criteria. Cross Layer interaction is exploited the performance of physical layer which leads to significant improvement in the energy efficiency of a network.
The facilitation of inter-vehicular communication
by direct means or through fixed infrastructure devices like
roadside units enable Vehicular Ad hoc NETwork (VANET)
to be the predominant environment for the deployment of
Intelligent Transportation Systems (ITS).The vehicular
movements in VANET is governed by the incorporated
mobility model for achieving better data dissemination rate
as their mode of multicast routes-based parallel transmission
remains indispensable for sharing traffic related
information. The QoS parameters of multicast routing is to
be satisfied essentially on par with the base protocols, place
and time of application for compliance with the necessity in
robust data dissemination. Enhanced and Integrated Ant
Colony-Artificial Bee Colony oriented Multicast Routing
(EIAC-ABCMR) is formulated as a multicast tree
determination problem that imposes the satisfaction of
multi-constrained QoS by reducing cost, delay and jitter
with increased bandwidth for improving efficacy in data
transmission. The simulation experiments of EIAC-ABCMR
and its derived inferences confirm its importance in reducing
the number of multicast groups formed during data
communication which is about 36% predominant to the
compared baseline multicast routing techniques. The results
of EIAC-ABCMR also infers a better throughput, reduced
normalized load overhead and energy consumptions on par
with the benchmarked QoS constrained multicast routing
schemes under study.
STUDY OF THE EFFECT OF VELOCITY ON END-TOEND DELAY FOR V2V COMMUNICATION IN ITSijngnjournal
Ā
This paper focuses on vehicle to vehicle (V2V) communications in VANET. With the development of vehicles and mobile Ad Hoc network technology, the Vehicle Ad hoc Network (VANET) has become an emerging field of study. VANET is a special case of MANET, and will play an important role in city road traffic control. It is a challenging problem for searching and maintaining an effective route for transporting data information. Vehicular Ad Hoc network (VANET), is a hot topic applying mobile Ad Hoc network (MANET) to ITS in recent years. In the era of wireless computing, VANET communications are gaining a lot of attention. In this paper we provide a simulation and study of the effect of velocity on end-to-end delay for v2v communication in intelligent transportation Systems
QoS based Admission Control using Multipath Scheduler for IP over Satellite N...IJECEIAES
Ā
This paper presents a novel scheduling algorithm to support quality of service (QoS) for multiservice applications over integrated satellite and terrestrial networks using admission control system with multipath selection capabilities. The algorithm exploits the multipath routing paradigm over LEO and GEO satellites constellation in order to achieve optimum end-toend QoS of the client-server Internet architecture for HTTP web service, file transfer, video streaming and VoIP applications. The proposed multipath scheduler over the satellite networks advocates load balancing technique based on optimum time-bandwidth in order to accommodate the burst of application traffics. The method tries to balance the bandwidth load and queue length on each link over satellite in order to fulfil the optimum QoS level for each traffic type. Each connection of a traffic type will be routed over a link with the least bandwidth load and queue length at current time in order to avoid congestion state. The multipath routing scheduling decision is based on per connection granularity so that packet reordering at the receiver side could be avoided. The performance evaluation of IP over satellites has been carried out using multiple connections, different file sizes and bit-errorrate (BER) variations to measure the packet delay, loss ratio and throughput.
Traffic Congestion Prediction using Deep Reinforcement Learning in Vehicular ...IJCNCJournal
Ā
In recent years, a new wireless network called vehicular ad-hoc network (VANET), has become a popular research topic. VANET allows communication among vehicles and with roadside units by providing information to each other, such as vehicle velocity, location and direction. In general, when many vehicles likely to use the common route to proceed to the same destination, it can lead to a congested route that should be avoided. It may be better if vehicles are able to predict accurately the traffic congestion and then avoid it. Therefore, in this work, the deep reinforcement learning in VANET to enhance the ability to predict traffic congestion on the roads is proposed. Furthermore, different types of neural networks namely Convolutional Neural Network (CNN), Multilayer Perceptron (MLP) and Long Short-Term Memory (LSTM) are investigated and compared in this deep reinforcement learning model to discover the most effective one. Our proposed method is tested by simulation. The traffic scenarios are created using traffic simulator called Simulation of Urban Mobility (SUMO) before integrating with deep reinforcement learning model. The simulation procedures, as well as the programming used, are described in detail. The performance of our proposed method is evaluated using two metrics; the average travelling time delay and average waiting time delay of vehicles. According to the simulation results, the average travelling time delay and average waiting time delay are gradually improved over the multiple runs, since our proposed method receives feedback from the environment. In addition, the results without and with three different deep learning algorithms, i.e., CNN, MLP and LSTM are compared. It is obvious that the deep reinforcement learning model works effectively when traffic density is neither too high nor too low. In addition, it can be concluded that the effective algorithms for traffic congestion prediction models in descending order are MLP, CNN, and LSTM, respectively.
Optimized Cluster Establishment and Cluster-Head Selection Approach in WSNIJCNCJournal
Ā
In recent years, limited resources of user products and energy-saving are recognized as the major challenges of Wireless Sensor Networks (WSNs). Clustering is a practical technique that can reduce all energy consumption and provide stability of workload that causes a larger difference in energy depletion among other nodes and cluster heads (CHs). In addition, clustering is the solution of energy-efficient for maximizing the network longevity and improvising energy efficiency. In this paper, a novel OCE-CHS (Optimized Cluster Establishment and Cluster-Head Selection) approach for sensor nodes is represented to improvise the packet success ratio and reduce the average energy-dissipation. The main contribution of this paper is categorized into two processes, first, the clustering algorithm is improvised that periodically chooses the optimal set of the CHs according to the speed of the average node and average-node energy. This is considerably distinguished from node-based clustering that utilizes a distributed clustering algorithm to choose CHs based on the speed of the current node and remaining node energy. Second, more than one factor is assumed for the detached node to join the optimal cluster. In the result section, we discuss our clustering protocols implementation of optimal CH-selection to evade the death of SNs, maximizing throughput, and further improvise the network lifetime by minimizing energy consumption.
PERFORMANCE OF OLSR MANET ADOPTING CROSS-LAYER APPROACH UNDER CBR AND VBR TRA...IJCNCJournal
Ā
The routing protocols play an important role in Mobile Ad-Hoc Network (MANET) because of the dynamically change of its topology. Optimized Link State Routing (OLSR), unawareness of Quality of Service (QoS) and power-consumed protocol, is an example of a widely-used routing protocol in MANET.
The Multi-Point Relays (MPR) selection algorithm is very crucial in OLSR. Therefore, firstly, we propose a heuristic method to select the best path based on two parameters; Bit Error Rate (BER) derived from the physical layer and Weighted Connectivity Index (CI) adopted from the network layer. This can be done via the cross-layer design scheme. This is anticipated to enhance the performance of OLSR, provide QoS
guarantee and improve the power consumption. The performances of the proposed scheme are investigated
by simulation of two types of traffics: CBR and VBR (MPEG-4), evaluated by metrics namely Throughput, Packet Delivery Ratio (PDR), Average End-to-End Delay, Control Overhead and Average Total Power Consumption.We compare our results with the typical OLSR and OLSR using only Weighted CI. It is
obvious that our proposed scheme provides superior performances to the typical OLSR and OLSR using only Weighted CI, especially, at high traffic load.
Performance evaluation of interference aware topology power and flow control ...IJECEIAES
Ā
Multi-Radio Multi-Channel Wireless Mesh Network (MRMC-WMN) has been considered as one of the key technology for the enhancement of network performance. It is used in a number of real-time applications such as disaster management system, transportation system and health care system. MRMC-WMN is a multi-hop network and allows simultaneous data transfer by using multiple radio interfaces. All the radio interfaces are typically assigned with different channels to reduce the effect of co-channel interference. In MRMC-WMN, when two nodes transmit at the same channel in the range of each other, generates co-channel interference and degrades the network throughput. Co-channel interference badly affects the capacity of each link that reduces the overall network performance. Thus, the important task of channel assignment algorithm is to reduce the co-channel interference and enhance the network performance. In this paper, the problem of channel assignment has been addressed for MRMC-WMN. We have proposed an Interference Aware, Topology, Power and Flow Control (ITPFC) Channel Assignment algorithm for MRMC-WMN. This algorithm assignes the suitable channels to nodes, which provides better link capacity and reduces the co-channel interference. In the previous work performance of the proposed algorithm has been evaluated for a network of 30 nodes. The aim of this paper is to further evaluate the performance of proposed channel assignment algorithm for 40 and 50 nodes network. The results obtained from these networks show the consistent performance in terms of throughput, delay, packet loss and number of channels used per node as compared to LACA, FCPRA and IATC Channel Assignment algorithms.
How can we apply principles of Customer Experience Management (CEM), to the emerging category of Machine-to-Machine (m2m) communications? This workshop at TM Forum Orlando explored this provocation.
Universal Access and Aggregation Mobile Backhaul Design GuideJuniper Networks
Ā
This design guide provides all aspects of designing Juniper Networksā based mobile backhaul (MBH) networks, introduces key concepts related to the access and aggregation network and to MBH, and includes working configurations. The advantages of Junos OS together with the ACX Series and MX Series routers are described in detail with various use cases and deployment scenarios. Connected to the MX Series routers, Juniper Networksā TCA Series Timing Servers are used to provide highly accurate timing that is critical for mobile networks.
4G World Mobile Backhaul Summit. If you missed it in person, feel free to view it online.
Speakers:
Mark Casey, CFN Services, Incorporated
Mike Dodson, Utopian Wireless
Doug Smith, Digital Bridge
Dan Graf, Leap Wireless/Cricket Communications
If you have any questions please contact CFN Services at backhaul@cfnservices.com
With worldwide mobile backhaul connections increasing from 5 to 10 Mbps in 2009 to 50 Mbps by 2012, mobile operators, network equipment vendors and others must implement new strategies to cope with the influx. Fiber, copper, microwave, millimeter waveāeach backhaul medium has its own advantages and limitations in terms of availability, cost to deploy, operational cost, speed/distance and regulatory considerations. What is the right strategy for todayās 3G and emerging 4G ecosystem, and is there any hope of leveraging today's backhaul assets for three (let alone five) years?
In this webinar, Jennifer Pigg, Yankee Group research VP, examines the mobile backhaul solutions operators are deploying today and the emerging strategies for tomorrow.
This was presented by Dr John Naylon, CTO of CBNL, at Mobile World Congress 2012.
This made up part of the Energy Efficient Networks session where industry experts discussed the energy efficiency challenges facing operators when deploying their networks.
This presentation analyses live customer data that clearly demonstrates the efficiencies intelligent data aggregation technologies can bring to mobile backhaul networks.
The data reveals that aggregation can reduce bandwidth requirements by a minimum of 40% whilst delivering an identical service.
The presentation also highlights how wireless point to multipoint network architecture dramatically improves spectral efficiency and power efficiency per link.
The introduction includes a short video of John highlighting the key points of the presentation and how point to multipoint wireless backhaul can help operators become more efficient, save costs and bring environmental benefits to their backhaul networks.
An energy aware scheme for layered chain in underwater wireless sensor networ...IJECEIAES
Ā
Extending the network lifetime is a very challenging problem that needs to be taken into account during routing data in wireless sensor networks in general and particularly in underwater wireless sensor networks (UWSN). For this purpose, the present paper proposes a multilayer chain based on genetic algorithm routing (MCGA) for routing data from nodes to the sink. This algorithm consists to create a limited number of local chains constructed by using genetic algorithm in order to obtain the shortest path between nodes; furthermore, a leader node (LN) is elected in each chain followed by constructing a global chain containing LNs. The selection of the LN in the closest chain to the sink is as follows: Initially, the closest node to sink is elected LN in this latter because all nodes have initially the same energy value; then the future selection of the LN is based on the residual energy of the nodes. LNs in the other chains are selected based on the proximity to the previous LNs. Data transmission is performed in two steps: intra-chain transmission and inter-chain transmission. Furthermore, MCGA is simulated for different scenarios of mobility and density of nodes in the networks. The performance evaluation of the proposed technique shows a considerable reduction in terms of energy consumption and network lifespan.
Efficient and stable route selection by using cross layer concept for highly...Roopali Singh
Ā
Efficient and stable route selection by using cross layer concept for highly mobile network with predictive features by Rupali Singh, Gajendra Singh Dhakad
published in International Journal of Research & Technology, Volume 3, Issue 4_November_2015
Design and implementation of new routingIJCNCJournal
Ā
Energy consumption is a key element in the Wireless Sensor Networks (WSNs) design. Indeed, sensor nodes are really constrained by energy supply. Hence, how to improve the network lifetime is a crucial and challenging task. Several techniques are available at different levels of the OSI model to maximize the WSN lifetime and especially at the network layer which uses routing strategies to maintain the routes in the network and guarantee reliable communication. In this paper we intend to propose a new protocol called
Combined Energy and Distance Metrics Dynamic Routing Protocol (CEDM-DR). Our new approach considers not only the distance between wireless sensors but also the energy of node acting as a router in order to find the optimal path and achieve a dynamic and adaptive routing.
The performance metrics exploited for the evaluation of our protocol are average energy consumed, network lifetime and packets lost. By comparing our proposed routing strategy to protocol widely used in WSN namely Ad hoc On demand Distance Vector(AODV), simulation results show that CEDM-DR strategy might effectively balance the sensor power consumption and permits accordingly to enhance the network
lifetime. As well, this new protocol yields a noticeable energy saving compared to its counterpart.
BIO-INSPIRED SEAMLESS VERTICAL HANDOVER ALGORITHM FOR VEHICULAR AD HOC NETWORKSijwmn
Ā
One of the most important factors to implement VANET is by considering the variety of wireless networks available around the city as well as the vehicles traffic scenarios. However, by providing a diverse range of wireless access technologies, it is necessary to provide continuous network connectivity as well as selecting the most suitable network technology and performance. Many researchers have worked on building algorithms for selecting the best network to improve the handover process. However, with high-speed vehicles mobility, the vertical handover process became the most challenging task in order to achieve realtime network selection. This paper proposes a bio-inspired network selection algorithm influenced by insect's behaviour which combines Artificial Bee Colony (ABC) and Particle Swarm Optimization (PSO). The proposed algorithm is applied to process multi-criteria parameters to evaluate the best available network and then execute the handover process seamlessly. The results demonstrate the benefits of the proposed Multi-Criteria ABC-PSO method by reducing the handover decision delays by 25%. It gives the optimum performance in terms of network selections and reduces the handover latency by 14.5%. The proposed algorithm also reduces the number of unnecessary handovers by 48% for three different mobility scenarios based on traffic environments (highway, urban and traffic jam).
Performance Analysis of Energy Optimized LTE-V2X Networks for Delay Sensitive...IJCNCJournal
Ā
Energy-efficient relaying technology in multi-hop data transmission can help the challenges faced in cellular Vehicle-to-Everything (cellular-V2X) communication. However, due to high demand of emergency service requirements of the systems such as Public Protection and Disaster Relief (PPDR), National Security and Public Safety (NSPS), Intelligent Transport System (ITS) etc., least energy consumed user equipment (UEs)/Vehicular-UEs are required which can either run real-time applications or relay the application data. To support these scenarios, we present a high way based system model in rural area and enhance its scope for applying single-hop direct, relay assisted multi-hop cellular-V2X and Store-CarryForward (SCF) modes of uplink data transmission. We compare the performance of three modes of transmissions in terms of overall energy consumption and overall transmission delay with specific delay constraints of VoIP and video applications. With the varying cell radius and irrespective type of applications, our numerical results, validated with ns-3 show that, least energy is always consumed in SCF mode due to its inherent property but applications suffer a lot due to high delay incurred whereas singlehop direct mode shows the reverse. When compared with cellular-V2X mode, overall transmission delay for single-hop direct mode is acceptable within cell radius 600m but beyond that, relay assisted multi-hop cellular-V2X mode always outperforms (with low latency and moderate energy consumption).
PERFORMANCE ANALYSIS OF ENERGY OPTIMIZED LTE-V2X NETWORKS FOR DELAY SENSITIVE...IJCNCJournal
Ā
Energy-efficient relaying technology in multi-hop data transmission can help the challenges faced in cellular Vehicle-to-Everything (cellular-V2X) communication. However, due to high demand of emergency service requirements of the systems such as Public Protection and Disaster Relief (PPDR), National Security and Public Safety (NSPS), Intelligent Transport System (ITS) etc., least energy consumed user equipment (UEs)/Vehicular-UEs are required which can either run real-time applications or relay the application data. To support these scenarios, we present a high way based system model in rural area and enhance its scope for applying single-hop direct, relay assisted multi-hop cellular-V2X and Store-CarryForward (SCF) modes of uplink data transmission. We compare the performance of three modes of transmissions in terms of overall energy consumption and overall transmission delay with specific delay constraints of VoIP and video applications. With the varying cell radius and irrespective type of applications, our numerical results, validated with ns-3 show that, least energy is always consumed in SCF mode due to its inherent property but applications suffer a lot due to high delay incurred whereas singlehop direct mode shows the reverse. When compared with cellular-V2X mode, overall transmission delay for single-hop direct mode is acceptable within cell radius 600m but beyond that, relay assisted multi-hop cellular-V2X mode always outperforms (with low latency and moderate energy consumption).
ADAPTIVE HANDOVER HYSTERESIS AND CALL ADMISSION CONTROL FOR MOBILE RELAY NODESIJCNCJournal
Ā
The aim of equipping a wireless network with a mobile relay node is to support broadband wireless communications for vehicular users and their devices. The high mobility of vehicular users, possibly at a very high velocity in the area in which two cells overlap, could cause the network to suffer from a reduced handover success rate and, hence, increased radio link failure. The combined impact of these problems is service interruptions to vehicular users. Thus, the handover schemes are crucial in solving these problems. In this work, we first present the adaptive handover hysteresis scheme for the wireless network with mobile relay nodes in the high-speed train scenario. Specifically, our proposed adaptive hysteresis scheme is based on the velocity of the train. Second, the handover call dropping probability is reduced by introducing a modified call admission control scheme to support radio resource reservation for handover calls that prioritizes handover calls of mobile relay over the other calls. The proposed solution in which adaptive parameter is combined with call admission control is evaluated by system level simulation. Our simulation results illustrate an increased handover success rate and reduced radio link failures.
Quadrant Based DIR in CWin Adaptation Mechanism for Multihop Wireless NetworkIJCI JOURNAL
Ā
In Multihop Wireless Networks, traffic forwarding capability of each node varies according to its level of contention. Each node can yield its channel access opportunity to its neighbouring nodes, so that all the nodes can evenly share the channel and have similar forwarding capability. In this manner the wireless channel is utilized effectively, which is achieved using Contention Window Adaptation Mechanism (CWAM). This mechanism achieves a higher end-to-end throughout but consumes the network power to a higher level. So, a newly proposed algorithm Quadrant- Based Directional Routing Protocol (Q-DIR) is implemented as a cross-layer with CWAM, to reduce the total network power consumption through limited flooding and also reduce the routing overheads, which eventually increases overall network throughput. This algorithm limits the broadcast region to a quadrant where the source node and the destination nodes are located. Implementation of the algorithm is done in Linux based NS-2 simulator
Implementing packet broadcasting algorithm of mimo based mobile ad hoc networ...IJNSA Journal
Ā
With the rapid growth of wireless communication infras,,tructure over the recent few years, new
challenges has been posed on the system and analysis on wireless adhoc networking. Implementation of
MIMO communication in such type of network is enhancing the packet transmission capabilities. There
are different techniques for cooperative transmission and broadcasting packet in MIMO equipped
Mobile Adhoc Network. We have employed a model network in the OPNET environment and propose a
new scheduling algorithm based on investigating the different broadcasting algorithm. The new
broadcasting algorithm improves the packet transmission rate of the network based on energy
performance of the network and minimizes the BER for different transmission mode which is illustrated
in this paper. The simulations are done in MATLAB and OPNET environment and the simulated result
for the packet transmission rate are collected and shown in the tabular form. Also simulate the network
for generating a comparative statement for each mobile node. And performance analysis is also done for
the model network. The main focus is to minimize BER and improve information efficiency of the
network.
IMPLEMENTING PACKET BROADCASTING ALGORITHM OF MIMO BASED MOBILE AD-HOC NETWOR...IJNSA Journal
Ā
With the rapid growth of wireless communication infras,,tructure over the recent few years, new challenges has been posed on the system and analysis on wireless adhoc networking. Implementation of MIMO communication in such type of network is enhancing the packet transmission capabilities. There are different techniques for cooperative transmission and broadcasting packet in MIMO equipped Mobile Adhoc Network. We have employed a model network in the OPNET environment and propose a new scheduling algorithm based on investigating the different broadcasting algorithm. The new broadcasting algorithm improves the packet transmission rate of the network based on energy performance of the network and minimizes the BER for different transmission mode which is illustrated in this paper. The simulations are done in MATLAB and OPNET environment and the simulated result for the packet transmission rate are collected and shown in the tabular form. Also simulate the network for generating a comparative statement for each mobile node. And performance analysis is also done for the model network. The main focus is to minimize BER and improve information efficiency of the network.
QoS Oriented Coding For Mobility Constraint in Wireless Networksiosrjce
Ā
IOSR Journal of Electronics and Communication Engineering(IOSR-JECE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of electronics and communication engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in electronics and communication engineering. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
JCWAEED: JOINT CHANNEL ASSIGNMENT AND WEIGHTED AVERAGE EXPECTED END-TO-END DE...csandit
Ā
In recent years, multi-channel multi-radio Wireless Mesh network has become one of the most important technologies in the evolution of next-generation networks. Its multi-hop, selforganization,self-healing and simple deployment is an effective way to solve the bottleneck problem of last mile. In this paper, we propose a new routing metric called WAEED, deployed in JCWAEED protocol, a joint channel assignment and weighted average expected end-to-end delay routing protocol which considers both interference suppression with factor IF and end-toend delay. Additionally, we give the exact calculation formula of transmission delay and queuing delay. Simulations results demonstrate that JCWAEED outperforms other joint design routing protocols in terms of throughput, end-to-end delay and packet loss rate.
Exponential MLWDF (EXP-MLWDF) Downlink Scheduling Algorithm Evaluated in LTE ...IJECEIAES
Ā
Nowadays, with the advent of smartphones, most of people started to make voice and video conference calls continuously even in a high mobility scenario, the bandwidth requirements have increased considerably, which can cause network congestion phenomena. To avoid network congestion problems and to support high mobility scenario, 3GPP has developed a new cellular standard based packet switching, termed LTE (Long Term Evolution). The purpose of this paper is to evaluate the performance of the new proposed algorithm, named Exponential Modified Largest Weighted Delay First āEXP-MLWDFā, for high mobility scenario and with the presence of a large number of active users, in comparison with the wellknown algorithms such as a proportional fair algorithm (PF), Exponential Proportional Fairness (EXP/PF), Logarithm Rule (LOG-Rule), Exponential Rule (EXP-Rule) and Modified Largest Weighted Delay First (MLWDF). The performance evaluation is conducted in terms of system throughput, delay and PLR. Finally, it will be concluded that the proposed scheduler satisfies the quality of service (QoS) requirements of the real-time traffic in terms of packet loss ratio (PLR), average throughput and packet delay. Because of the traffic evolution, some key issues related to scheduling strategies that will be considered in the future requirements are discussed in this article.
Essentials of Automations: The Art of Triggers and Actions in FMESafe Software
Ā
In this second installment of our Essentials of Automations webinar series, weāll explore the landscape of triggers and actions, guiding you through the nuances of authoring and adapting workspaces for seamless automations. Gain an understanding of the full spectrum of triggers and actions available in FME, empowering you to enhance your workspaces for efficient automation.
Weāll kick things off by showcasing the most commonly used event-based triggers, introducing you to various automation workflows like manual triggers, schedules, directory watchers, and more. Plus, see how these elements play out in real scenarios.
Whether youāre tweaking your current setup or building from the ground up, this session will arm you with the tools and insights needed to transform your FME usage into a powerhouse of productivity. Join us to discover effective strategies that simplify complex processes, enhancing your productivity and transforming your data management practices with FME. Letās turn complexity into clarity and make your workspaces work wonders!
UiPath Test Automation using UiPath Test Suite series, part 4DianaGray10
Ā
Welcome to UiPath Test Automation using UiPath Test Suite series part 4. In this session, we will cover Test Manager overview along with SAP heatmap.
The UiPath Test Manager overview with SAP heatmap webinar offers a concise yet comprehensive exploration of the role of a Test Manager within SAP environments, coupled with the utilization of heatmaps for effective testing strategies.
Participants will gain insights into the responsibilities, challenges, and best practices associated with test management in SAP projects. Additionally, the webinar delves into the significance of heatmaps as a visual aid for identifying testing priorities, areas of risk, and resource allocation within SAP landscapes. Through this session, attendees can expect to enhance their understanding of test management principles while learning practical approaches to optimize testing processes in SAP environments using heatmap visualization techniques
What will you get from this session?
1. Insights into SAP testing best practices
2. Heatmap utilization for testing
3. Optimization of testing processes
4. Demo
Topics covered:
Execution from the test manager
Orchestrator execution result
Defect reporting
SAP heatmap example with demo
Speaker:
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
Alt. GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using ...James Anderson
Ā
Effective Application Security in Software Delivery lifecycle using Deployment Firewall and DBOM
The modern software delivery process (or the CI/CD process) includes many tools, distributed teams, open-source code, and cloud platforms. Constant focus on speed to release software to market, along with the traditional slow and manual security checks has caused gaps in continuous security as an important piece in the software supply chain. Today organizations feel more susceptible to external and internal cyber threats due to the vast attack surface in their applications supply chain and the lack of end-to-end governance and risk management.
The software team must secure its software delivery process to avoid vulnerability and security breaches. This needs to be achieved with existing tool chains and without extensive rework of the delivery processes. This talk will present strategies and techniques for providing visibility into the true risk of the existing vulnerabilities, preventing the introduction of security issues in the software, resolving vulnerabilities in production environments quickly, and capturing the deployment bill of materials (DBOM).
Speakers:
Bob Boule
Robert Boule is a technology enthusiast with PASSION for technology and making things work along with a knack for helping others understand how things work. He comes with around 20 years of solution engineering experience in application security, software continuous delivery, and SaaS platforms. He is known for his dynamic presentations in CI/CD and application security integrated in software delivery lifecycle.
Gopinath Rebala
Gopinath Rebala is the CTO of OpsMx, where he has overall responsibility for the machine learning and data processing architectures for Secure Software Delivery. Gopi also has a strong connection with our customers, leading design and architecture for strategic implementations. Gopi is a frequent speaker and well-known leader in continuous delivery and integrating security into software delivery.
Enhancing Performance with Globus and the Science DMZGlobus
Ā
ESnet has led the way in helping national facilitiesāand many other institutions in the research communityāconfigure Science DMZs and troubleshoot network issues to maximize data transfer performance. In this talk we will present a summary of approaches and tips for getting the most out of your network infrastructure using Globus Connect Server.
Removing Uninteresting Bytes in Software FuzzingAftab Hussain
Ā
Imagine a world where software fuzzing, the process of mutating bytes in test seeds to uncover hidden and erroneous program behaviors, becomes faster and more effective. A lot depends on the initial seeds, which can significantly dictate the trajectory of a fuzzing campaign, particularly in terms of how long it takes to uncover interesting behaviour in your code. We introduce DIAR, a technique designed to speedup fuzzing campaigns by pinpointing and eliminating those uninteresting bytes in the seeds. Picture this: instead of wasting valuable resources on meaningless mutations in large, bloated seeds, DIAR removes the unnecessary bytes, streamlining the entire process.
In this work, we equipped AFL, a popular fuzzer, with DIAR and examined two critical Linux libraries -- Libxml's xmllint, a tool for parsing xml documents, and Binutil's readelf, an essential debugging and security analysis command-line tool used to display detailed information about ELF (Executable and Linkable Format). Our preliminary results show that AFL+DIAR does not only discover new paths more quickly but also achieves higher coverage overall. This work thus showcases how starting with lean and optimized seeds can lead to faster, more comprehensive fuzzing campaigns -- and DIAR helps you find such seeds.
- These are slides of the talk given at IEEE International Conference on Software Testing Verification and Validation Workshop, ICSTW 2022.
Securing your Kubernetes cluster_ a step-by-step guide to success !KatiaHIMEUR1
Ā
Today, after several years of existence, an extremely active community and an ultra-dynamic ecosystem, Kubernetes has established itself as the de facto standard in container orchestration. Thanks to a wide range of managed services, it has never been so easy to set up a ready-to-use Kubernetes cluster.
However, this ease of use means that the subject of security in Kubernetes is often left for later, or even neglected. This exposes companies to significant risks.
In this talk, I'll show you step-by-step how to secure your Kubernetes cluster for greater peace of mind and reliability.
GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using Deplo...James Anderson
Ā
Effective Application Security in Software Delivery lifecycle using Deployment Firewall and DBOM
The modern software delivery process (or the CI/CD process) includes many tools, distributed teams, open-source code, and cloud platforms. Constant focus on speed to release software to market, along with the traditional slow and manual security checks has caused gaps in continuous security as an important piece in the software supply chain. Today organizations feel more susceptible to external and internal cyber threats due to the vast attack surface in their applications supply chain and the lack of end-to-end governance and risk management.
The software team must secure its software delivery process to avoid vulnerability and security breaches. This needs to be achieved with existing tool chains and without extensive rework of the delivery processes. This talk will present strategies and techniques for providing visibility into the true risk of the existing vulnerabilities, preventing the introduction of security issues in the software, resolving vulnerabilities in production environments quickly, and capturing the deployment bill of materials (DBOM).
Speakers:
Bob Boule
Robert Boule is a technology enthusiast with PASSION for technology and making things work along with a knack for helping others understand how things work. He comes with around 20 years of solution engineering experience in application security, software continuous delivery, and SaaS platforms. He is known for his dynamic presentations in CI/CD and application security integrated in software delivery lifecycle.
Gopinath Rebala
Gopinath Rebala is the CTO of OpsMx, where he has overall responsibility for the machine learning and data processing architectures for Secure Software Delivery. Gopi also has a strong connection with our customers, leading design and architecture for strategic implementations. Gopi is a frequent speaker and well-known leader in continuous delivery and integrating security into software delivery.
Transcript: Selling digital books in 2024: Insights from industry leaders - T...BookNet Canada
Ā
The publishing industry has been selling digital audiobooks and ebooks for over a decade and has found its groove. Whatās changed? What has stayed the same? Where do we go from here? Join a group of leading sales peers from across the industry for a conversation about the lessons learned since the popularization of digital books, best practices, digital book supply chain management, and more.
Link to video recording: https://bnctechforum.ca/sessions/selling-digital-books-in-2024-insights-from-industry-leaders/
Presented by BookNet Canada on May 28, 2024, with support from the Department of Canadian Heritage.
Pushing the limits of ePRTC: 100ns holdover for 100 daysAdtran
Ā
At WSTS 2024, Alon Stern explored the topic of parametric holdover and explained how recent research findings can be implemented in real-world PNT networks to achieve 100 nanoseconds of accuracy for up to 100 days.
1. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 5, No. 4, August 2013
DOI : 10.5121/ijwmn.2013.5411 143
OVERBOOKING IN MOBILE BACKHAUL
Chunming Liu, Bryan Fleming
T-Mobile, Bellevue, USA
{Chunming.Liu, Bryan.Fleming}@t-mobile.com
ABSTRACT
The rapid increase of mobile data subscribers and deployment of broadband radio access networks push
mobile operators to upgrade their mobile backhaul from expensive legacy TDM transport to carrier
Ethernet for cheaper operational expenditures. The Metro Ethernet Forum has defined a set of Ethernet
Virtual Connection services that are adopted to provide scalable Ethernet transport for mobile backhaul.
However, these services usually address single cell site backhaul per UNI handoff, neither considering
statistical multiplexing gain at a hub site which aggregates backhaul traffics of multiple cell sites, nor
supporting Quality-of-Service provisioning in overbooked backhaul pipe. This paper proposed an efficient
carrier Ethernet overbooking solution for mobile backhaul. A statistical estimation method has been
developed for deriving a safe overbooking factor at a given UNI. Then two efficient transport architectures
were proposed to support bandwidth sharing in cellular cluster with overbooked backhaul bandwidth in
carrier Ethernet. A novel bandwidth control algorithm has been derived at customer edge device to provide
Quality-of-Service for multimedia traffics over overbooked UNI, with SLA policing and protection on high
priority services. Experimental data analysis and simulations have showed that our new schemes can
benefit mobile operators in resource utilization efficiency, carrier Ethernet cost saving and backhaul
performance.
KEYWORDS
Mobile backhaul, overbooking, Carrier Ethernet, UNI handoff, CIR, SLA, Quality of Service
1. INTRODUCTION
In recent years, carrier Ethernet becomes a more popular scheme for the mobile backhaul,
because it is packet based transport network and allow flexible Ethernet circuit provisioning with
bandwidth scalability and low operational expenditures (OPEX) for mobile operators [1]. The
Metro Ethernet Forum (MEF) [9] has defined Ethernet virtual Connection (EVC) services with
performance requirements, as a transport association between two or more user-network-
interfaces (UNI) [2][9]. There are three types of EVC service including E-Line, E-LAN and E-
Tree services, which represent a point-to-point (P2P), multipoint-to-multipoint (MP2MP), and
rooted multipoint-to-multipoint EVC service, respectively. Due to simplicity and reliability, P2P
EVC services are adopted by most mobile operators to connect their cellular sites to mobile core
networks. A carrier Ethernet vendor is responsible to provide such a P2P EVC connectivity
following the bandwidth profile and performance requirements defined in a Service Level
Agreement (SLA) [2][3] between the carrier vendor and the mobile operator.
Wireless radios become popular to provide mobile backhaul connectivity for cellular sites in
cases where Ethernet cable or fiber is not available, or cannot be deployed in a timely or
economic manner. Compared to single cell site backhaul that is directly connected with carrier
Ethernet cable or fiber, mobile operators normally develop their own wireless radio links, such as
microwave [4], to connect multiple cell sites nearby, and deliver aggregated backhaul traffic to a
2. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 5, No. 4, August 2013
144
hub site which handoff to carrier Ethernet network at UNI. In order to support different backhaul
bandwidth requirements for each cell site in cluster, carrier vendors normally assign each mobile
cell site an individual EVC circuit with a distinct VLAN ID and Committed Information Rate
(CIR), and then implement parallel multiple EVC handoff over a same UNI at the hub site, as
shown in Figure 1.
Figure 1. Microwave backhaul with multiple EVC bundling UNI handoffs
However, since all EVC circuits are assigned with fixed CIR values, they cannot take advantages
of statistical multiplexing gain at UNI handoff and have no way sharing idle bandwidth among
EVCs [1]. Therefore, the overall resource utilization of an UNI is low and mobile operators
overpay carrier vendors for unused bandwidth. Authors in [5, 6] proposed delay based methods to
decide the minimum transport capacity for which all traffic delay requirements are met. However,
multimedia services have different performance requirements and optimal delay performance may
result in low bandwidth utilization too [7]. A piecewise linear approach was proposed in [7] to
achieve balance between network performance and bandwidth saving. Authors proposed a
selective overbooking scheme based on trunk size and usage profile. However, due to different
service types and traffic distributions in cell sites, peak bandwidth utilizations at hub site may
differ even UNI bandwidth or cluster sizes are same, which means overbooking factors at
different hub UNIs may differ from each other, instead of linearly following CIR. A capacity
planning scheme for LTE backhaul networks has been proposed in [8] where an overbooking
factor calculation method based on traffic forecast, multiplexing gain and peak throughput.
However, the overbooking factor is derived from estimation on 50 user peak throughput model,
without considering real cellular traffic distributions. Authors neither addressed how to
implement carrier Ethernet overbooking scheme, nor investigated bandwidth allocation with QoS
for multimedia services when an overbooked UNI becomes congested.
The contributions of this paper are follows: First, we developed a statistical regression method for
overbooking factor estimation, based on UNI peak utilization data, cellular traffic distributions,
and statistical service outage performance. Then we designed two efficient carrier Ethernet
architectures to help bypass CIR binding in EVC and implement mobile backhaul bandwidth
sharing among a cellular cluster. Specifically, a mobile operator can adopt either an Ethernet
switching or routing scheme to complete backhaul transport in its cellular cluster, while using a
single VLAN EVC pipe in carrier Ethernet for bandwidth overbooking. Then to overcome
network congestion caused by aggregated burst traffics at UNI, a new bandwidth control
algorithm was proposed to provide Quality of Service and fairness for resource allocation. Solid
experimental networking data and simulation results showed that the proposed schemes can
3. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 5, No. 4, August 2013
145
benefit mobile operators in resource utilization efficiency, backhaul cost saving and quality of
service provisioning.
This paper is organized as follows: in section 3, we present the UNI capacity estimation and
overbooking derivation methods. Then we describe two efficient Carrier Ethernet architectures
for implementing UNI overbooking with carrier Ethernet. In section 4, we present a new
bandwidth control scheme at an overbooked UNI to support QoS. Network performance data and
simulation results are shown in section 5 with analysis. Finally, we conclude this paper with a
brief summary.
2. ACRONYMS
CBS Constant Burst Size
CE Customer Edge device
CIR Committed Information Rate
CoS Class of Service
EVC Ethernet Virtual Connection
MBS Maximum Burst Size
MEF Metro Ethernet Forum
PE Provider Edge device
PIR Peak Information Rate
SLA Service Level Agreement
UNI User-Network-Interface
3. UNI CAPACITY AND OVERBOOKING DERIVATION
Consider a microwave cluster containing total K cell sites and traffic intensity of a cell site i, Xi,
the aggregated traffic intensity at UNI, Yuni, is represented as,
ā1
K
i
iuniuni XAY
=
ā = (1)
where Auni is the statistical multiplexing gain value at the UNI.
Assume backhaul traffic intensities of cell sites are independent, and there are two major traffic
patterns: the Poisson based model and self-similar model [7]. The Poisson-based traffic model has
been intensively used to represent cellular voice connections, while the self-similar model is used
to represent data services with burst throughputs. We further assume there are M types of voice
services, and N types of self-similar services. We adopt an ON-OFF source model to analyze the
peak throughput of a voice connection, where the ON and OFF states represent the active and
silent conditions of the voice connection, respectively. Both ON and OFF state intervals are
assumed to be exponentially distributed, and Rj is a constant packet generation rate of voice class
j in the ON state. Due to packet burst characteristics and CIR throttle on backhaul capacity, the
throughput jĪ¾ of self-similar service class j follows truncated Pareto distribution with following
probability distribution function [5],
j
jj
jj
jjj
j
HE
E
f Ī±
Ī±Ī±
Ī¾Ī±
Ī¾
)(1
)(
1
ā
=
āā
(2)
where jĪ± denotes shape parameter, Ej denotes the minimal traffic rate, and Hj denotes the
maximum traffic rate of service class j. Then the aggregated throughput uniĪ¾ at the UNI is
denoted as,
4. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 5, No. 4, August 2013
146
āāāāāā K
i
NM
Mj
l
k
s
K
i
M
j
l
k
puni
jiji
kjikji
1=
+
1+= 0=1= 1= 0=
+=
,,
),,(),,( Ī¾Ī¾Ī¾
āā1= 1=
+
1+= 0=1=
+ā¤
K
i
K
i
NM
Mj
l
k
s
M
j
ji
ji
kjijRl āāā,
),,()(, Ī¾ (3)
where ),,( kjipĪ¾ represents the throughput of connection k of Poisson-based service type j in cell i,
),,( kjisĪ¾ represents throughput of connection k of self-similar service type j in cell i, and li,j
represents total connection number of class j in cell i.
From the equation (3), the peak aggregation throughput at UNI is determined by the sum of self-
similar traffics following truncated Pareto distribution function, which can be approximated as a
Gaussian distribution [5][7], with mean value peakĀµ , and standard deviation peakĻ , which can be
derived from peak throughputs at the UNI. When an overbooking ratio Ouni is applied at UNI
bandwidth which equal to ā1=
N
i
iCIR )( , it is expected to achieve low bandwidth outage probability,
i.e., the probability of the case that overbooked bandwidth cannot transport aggregated peak
throughput is smaller than or equal to a threshold service outage ratio Īµ , 0 < Īµ < 1. Then we can
get,
ā=
ā„ā ā¤
N
i
uniuni iCIROP
1
))(( ĪµĪ¾ (4)
When equality holds in (4), the overbooking ratio Ouni is minimized, and the overbooked UNI
bandwidth can be minimized. Since uniĪ¾ follows normal distribution, then the following
relationship is satisfied,
ā=
ā
+ā
= N
i
peakpeak
uni
iCIR
Q
O
1
1
)(
)( ĀµĪµĻ
(5)
where )(1
xQā
is the inverse function of normal distribution Q(x), and ā«
ā ā
=
x
s
dsexQ 2
2
2
1
)(
Ļ
.
Applying Ouni on existing UNI bandwidth, we get the overbooked UNI bandwidth for the whole
cluster as,
ā=
ā =
N
i
unio iCIROB
1
)( (6)
Because full utilization results in high latency and congestion [8], the real UNI bandwidth after
overbooking is set to be larger than overbooked bandwidth derived in equation (6) by dividing a
maximum utilization ratioĪ· . Therefore, the feasible UNI bandwidth Buni is set as,
Ī·/ouni BB = (7)
where 1<ā¤50 Ī·. and it is normally defined by mobile operators based on backhaul
performance requirements [7].
5. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 5, No. 4, August 2013
147
4. EFFICIENT UNI HANDOFF ARCHITECTURE
Since current MEF E-line service does not support overbooking at UNI with parallel EVC
circuits, we need to improve the carrier Ethernet transport architecture to implement bandwidth
sharing inside the cellular cluster. Considering a CE device at a UNI is either a layer 2 switch or a
cell site router (CSR) which supports layer 3 networking functionalities, we proposed two UNI
handoff architectures to implement the above goal.
4.1. Q-in-Q Tunneling Architecture
In scenarios that the CE at UNI only supports Layer 2 VLAN switching, a mobile operator can
order a single EVC pipe with its contracted carrier vendor for mobile backhaul of a target cell
cluster. The EVC pipe is implemented with IEEE 802.1ad stacked VLAN bridging technology
(Q-in-Q tunneling) [2], in which the Ethernet carrier configures and delivers P2P mobile backhaul
traffic between two PEs based on outer VLAN service tag (S-tag) in carrier Ethernet frames.
After the carrier PE handoffs traffic to associated CE in mobile network, the CE implement
switching based on inner customer VLAN tag (c-tag) for frame delivery to the destination
recipient cell, as shown in Figure 2.
Figure 2. Q-in-Q Tunneling Carrier Backhaul Architecture
The EVC capacity is determined by the overbooked UNI bandwidth defined in equation (7). The
mobile operator predefines and encapsulates a VLAN ID associated with one of their destination
cell sites with inner customer-tag (C-tag) without necessarily notifying the carrier vendor CIR
value of each cell site, and only contract with the vendor with the CIR value of ordered EVC
circuit, which tunnel backhaul traffic between MSO and the hub site. The tunneling backhaul
scheme goes as follows: any backhaul Ethernet frame generated in MSO or in a cellular cluster is
attached with a C-tag VLAN ID which works as an ID marker of the backhaul of a destination
cell site. When aggregated backhaul frames arrive at CE devices at UNI, the CE attaches S-tag
VLAN ID in each frame as an indicator of the pre-specified carrier Ethernet EVC circuit, and
handoffs the Q-in-Q frame to carrier Ethernet network. When the PE device in the carrier network
receives the frame, it checks S-tag VLAN ID in the frame and finds out the associated carrier
EVC circuit for delivery. Once a CE on the other side of the EVC circuit receives Q-in-Q frame
from its associated PE, it detaches the outer S-tag, checks the inner VLAN ID in C-tag for
6. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 5, No. 4, August 2013
148
destination site, and delivers the frame to next hop that follows same layer 2 switching scheme
based on VLAN ID until it reaches the destination cell site.
4.2. Cross-layer Backhaul Architecture
In scenarios that the CE at UNI is a cell site router (CSR) which supports IP layer functionalities,
we adopt a cross-layer solution for cellular cluster backhaul, i.e., a carrier vendor configures a
single EVC pipe from PE associated with the MSO to the edge PE associated with a CE at the
hub site with overbooked bandwidth. After a UNI handoff, the router at hub site will deliver the
payload packet to the destination site by checking IP address in frame payload. Then in the
cellular cluster, the backhaul packets are delivered through routing, which implements an end-to-
end cross-layer backhaul scheme, as shown in Figure 3.
Figure 3. Cross-layer backhaul architecture
The traffic routing in cellular cluster can be implemented by either static routing or dynamic
routing. If the cluster size is small, static routing is preferred and the routing table is configured
manually in the CSR at hub site by specifying next-hop interface IP address towards the
destination cell site. However, when the cluster size increase, the static routing is neither fault
tolerant nor efficient for networking configuration and management. Dynamic routing can fix
these problems by supporting real-time routing path construction and selection. It is required that
the recipient sites have their own routers so that they can communicate with the CSR at hub site
with common dynamic routing protocols, such as Open Shortest Path First (OSPF) or Routing
Information Protocol (RIP) [1][2], for creation, maintenance, and updating routing paths in their
routing table.
4.3. Advantages of Proposed Architectures
Advantages of our proposed architectures: the UNI is implemented as a backhaul aggregation
pipe, instead of a group of parallel EVC circuits. And the UNI bandwidth profile is determined by
the multiplication product value of the derived overbooking ratio and the sum of CIR values of all
cell sites in the cluster. Therefore, the statistical multiplexing gain is used for bandwidth sharing
among the cell site cluster, and no more dependency on carrier EVC provisioning. The mobile
operator can adjust bandwidth profile more easily based on cluster size and the peak utilization at
the UNI. The scalability of mobile backhaul also get improved because it is not necessary for the
mobile operator to request additional EVC circuits for newly added cell sites in the cluster.
7. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 5, No. 4, August 2013
149
Furthermore, carrier vendors reduce the complexity in networking configurations and EVC
maintenance, through a single EVC circuit provisioning for whole cellular cluster.
5. BANDWIDTH CONTROL AT OVERBOOKED UNI
Due to burst throughput and overbooking at UNI bandwidth, a traffic policing and rate shaping
scheme are required for providing stable QoS level even when UNI becomes congested [12,13],
as well as maximizing bandwidth utilization [9, 10]. MEF has defined a two-rate, three-color
marker (trTCM) algorithm for CE VLAN CoS which can be implemented via two token buckets
scheduling [3]. One bucket is used to determine in-profile service frame rate per CoS, following
CIR value, while the other bucket is to determine excess service frame rate per CoS, following
EIR value. However, in the MEF scheme, each bucket size is a fixed value and egress point does
not differentiate service priorities for multimedia traffics. Due to cluster traffic aggregation and
UNI bandwidth overbooking, the bandwidth scheduling and rate enforcement need to be re-
calculated in real time. Based on service performance requirements, traffics generated in mobile
network are classified into three types which are marked with P bits in the Priority Code Point
(PCP) field of IEEE 802.1Q tag in Ethernet frames. When aggregated traffics arrive, The CE at
UNI checks p bits in frames and puts traffic of each class into an individual forwarding class (FC)
queue which implement egress policy with specified CIR, Peak Information Rate (PIR), Constant
Burst Size (CBS) and Maximum Burst Size (MBS). Policing rule of each FC queue is set as
follows: the specified CIR rate is enforced when egress to the PE device in carrier network, and
service traffics above CIR are marked as out-of-profile. The PIR is the maximum rate at which
frames are allowed to burst over the CIR and delivered as best efforts. Traffic shaping is
implemented through absorbing the traffic burst up to MBS and dropping traffic over PIR after
MBS. The CBS in kilobyte is generally determined by the product of maximal tolerable latency of
the service specified in the SLA and the assigned CIR rate, as follows:
81000Ć
ā
= ii
i
LCIR
CBS (8)
where Li denotes the required latency value of service i, and },,{ datavideovoiceiā . Similarly,
the MBS in kilobyte is denoted as the product of maximal tolerable latency of the service and the
assigned PIR rate,
81000Ć
ā
= ii
i
LPIR
MBS (9)
The scheduling priorities: the voice service is assigned with highest priority for rate allocation,
due to its most strict requirements on throughput, latency, jitter and FLR. The next priority is
given to video stream service, due to its high requirements on throughput, latency and FLR. The
data service priority is lowest due to best-effort traffic characteristics. However, the data service
is sensitive to the minimum throughput to avoid starvation and network management blocking. To
implement dynamic rate allocation based on aggregated traffic intensities at UNI, we further
divide time into a sequence of slots, in which each slot contains same time length tslot second(s),
and the scheduler assign CIR and PIR rates for each service at the beginning of the slot.
8. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 5, No. 4, August 2013
150
Figure. 4 Egress Traffic Scheduling at Overbooked UNI
Consider Nvoice(i) voice connections in cluster at time slot i, total CIR of voice stream at CE is
assigned with full capacity as follows:
CIRvoice (i) = PIRvoice(i)=Nvoice(i)Ro (10)
Since Ro is the packet rate of voice ON state, there is no overbooking adopted for voice traffics
and all voice traffics at CE should handoff to the carrier without frame loss. Therefore, there is no
excess packet rate over CIR of voice, and PIRvoice equal to CIRvoice.
Due to bursty video traffics, it is difficult to assign video FC queue with same allocation rate all
the time. However, we can assign CIR bandwidth as much as possible to video bursts, if QoS
policy of voice and data service can be satisfied. Therefore, the total CIR of video stream at CE at
slot i is shown as follows:
CIRvideo(i) = max {Buni ā CIRvoice(i) ā guni Buni, 0} (11)
where guni is a guard ratio defined by a mobile operator, normally 0 < guni < 0.2, as a percentage
of total UNI bandwidth reserved for data service to provide minimum throughput, which help
avoiding the data starvation caused by video bursts. The video bursts over CIR will be scheduled
for PIR rate which equals to the whole available UNI bandwidth.
For data service, we assign available UNI bandwidth after CIR rate allocations on voice and video
service queues, as well as the whole available UNI bandwidth for the data PIR rate allocation:
CIRdata(i) = Buni ā CIRvoice(i) ā CIRvideo (i) (12)
The PIRs allocations for video and data traffic can only provide best-effort access for video and
data services after CIR scheduling, and denotes as,
9. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 5, No. 4, August 2013
151
PIRvideo(i) = PIRdata (i) = Buni (13)
The above rate allocations follow a strict round robin sequence from voice to BE data shown in
Figure 4. CIR assignment can guarantee bandwidth assignment while PIR make use of maximum
available resource left after CIR assignments. All idle bandwidth left in CIR rate allocation step
will become available bandwidth for the PIR allocation in the same slot.
6. PERFORMANCE EVALUATIONS
In this section, we first evaluate the network performance on overbooked UNI with ns-2
simulation tool [11-13], which has been widely adopted for network simulations and performance
evaluations. A dumbbell topology is adopted to simulate the traffic on UNI, as shown in Figure 5.
The network scenarios are built from the following elements: (1) Hub CE connects with multiple
connections, containing at least one voice, video, and data connections; (2) We assume that
congestion only happens when traffic egress from CE to PE; (3) CE supports the trTCM
scheduling frame where our proposed dynamic bandwidth control algorithm in section 4 for
performance comparison.
Table 1. System Parameters for Simulation
We adopt 3GPP voice model with ON/OFF time interval following exponential distributions:
mean active time as 600 millisecond and mean idle time as 400 milliseconds, and active data rate
is a constant rate as 24 Kbytes per second. We use a contributed MPEG4 video traffic generator
model which is derived from a video trace, with initial seed as 0.3 and rate factor as 60. We adopt
FTP application model with TCP transport and file size 100 mega bytes for data service. The
frame size of all three traffic model is set as 1024 bytes.
Figure 5. Dumbbell Topology for Network Simulation
Figure 6 shows the result of voice throughput when aggregated video connections increase at the
UNI egress point. We can find that total voice throughputs for 5 voice connections and 10 voice
connections are about 51 Kbps and 98 Kbps respectively, even when the UNI becomes congested
due to large number of video bursts. This is because each voice connection is assigned full
bandwidth based on its active state rate at UNI, which guarantee the high priority voice
throughput and related Key Performance Index (KPI) performances.
10. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 5, No. 4, August 2013
152
Figure 6. Voice Throughput Performance
Since video service has higher priority for resource allocation over data service, it has been shown
in Figure. 7 that data throughput shrinks when video connections increase. However, due to
minimum guard CIR bandwidth reserved as 20% of total 20Mbps UNI bandwidth, the data
throughput is always above 4 Mbps, which satisfy minimum data throughput requirement of
mobile operator for network management and signaling purposes.
Figure 8 shows the frame loss ratio of video traffic when total video connections increase. There
are total 5 voice connections and 1 data connection. For static trTCM scheme, we set CIR ratios
for voice, video and data as 20%, 40%, and 40% of the UNI bandwidth, respectively. PIR ratio of
voice is same as its CIR ratio, and PIR ratios of video and data are both equal to 100% of UNI
bandwidth. It is found that video frame loss ratio for static trTCM are almost same as our
dynamic bandwidth allocation scheme when video traffic intensity is small. However, the frame
loss ratio of static trTCM increases more quickly than our dynamic scheme when heavy video
bursts happen. This is because our dynamic scheduling method can make use of most idle
bandwidth in each slot for video burst bandwidth allocation after it satisfies requirements of voice
bandwidth and minimum data throughput, while in static trTCM, video connections have
fixed ratio on CIR scheduling round and cannot compete for idle resource efficiently.
Figure 7. Data Throughput
11. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 5, No. 4, August 2013
153
Figure 8. Video FLR
Similarly, Fig. 9 shows the results of video frame latency performance with 5 voice, 10 video and
1 data connections at UNI. We can see that the latency range of our dynamic scheme is smaller
than static trTCM method. This is because video connection can get more bandwidth allocation
rate in the proposed dynamic scheduling scheme with more CIR and PIR bandwidths. Therefore,
the average waiting time in service queue is smaller than the static trTCM method, which
determines the video frame latency performance.
Figure 9. Video Frame Latency
Then we evaluate the overbooking ratio selection with several production microwave clusters in a
national cellular network. For proprietary information protection, we neglect locations and names
of the selected clusters and only show related performance data, as shown in table 2. For each
cluster, the service outage threshold Īµ is set as 0.001%, and maximum allowable utilization Ī· in
equation (7) is set as 0.8. peakĀµ and peakĻ of each UNI are calculated through daily peak UNI
throughput data over one year. The peak throughput with 99% confidence interval based on
estimation is denoted as Tpeak. Compared to a linear piecewise relationship between UNI
bandwidth and overbooking ratio in [7], we found that peak UNI backhaul throughputs of clusters
12. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 5, No. 4, August 2013
154
are different to each other and not strictly follows a monotonically non-increasing relationship
with total CIR values of a cell cluster. This demonstrates that traffic intensity and statistical
multiplexing gains of clusters are different from each other, even they have same CIR values or
cluster size. So it is more appropriate to adopt our statistical estimation method for cluster based
overbooking estimation, rather than using the linear piecewise based scheme which derived
overbooking ratio only based on UNI CIR value.
Table 2. Real Network Utilization Performance & Overbooking Ratio
We further investigate cost saving through overbooking. Figure.10 shows a pricing example from
the Carrier Ethernet Market website [14] which is monotonically increasing with UNI bandwidth.
It is worthy to notice that some carrier vendors provide discrete UNI bandwidth options for UNI
handoff. Once we apply overbooking, the UNI bandwidth can be reduced without deteriorating
service quality. The new UNI bandwidth may in same or different pricing range, compared to
original UNI bandwidth. For example, when UNI bandwidth drops from 200 Mbps to 100 Mbps,
the new pricing can be saved by 40.1%, as shown in Figure 11. In this case, the mobile operator
can save transport cost from UNI overbooking. But when UNI bandwidth changes from 50 Mbps
to 35 Mbps, the new pricing is same as the old one. Then for the cost perspective, the mobile
operator would rather keep original UNI bandwidth from carrier for the cellular cluster than do
UNI overbooking.
Figure 10. UNI Pricing
13. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 5, No. 4, August 2013
155
Figure 11. Cost Saving Map
7. CONCLUSION
This paper proposes an efficient overbooking framework for mobile backhaul. We first develop a
statistical estimation method to derive a safe overbooking factor for a given UNI. Then two novel
transport architectures are proposed to help cellular cluster backhauls with overbooked UNI
bandwidth in carrier Ethernet. A novel bandwidth control algorithm has been derived at customer
edge device to provide Quality-of-Service for multimedia traffics over overbooked UNI, with
SLA policing and protection on high priority services. Experimental networking data analysis and
simulations show that our new schemes can benefit mobile operators in resource utilization
efficiency, carrier Ethernet cost saving and backhaul performance.
REFERENCES
[1] P. Briggs, R. Chundury, and J. Olsson, āCarrier ethernet for mobile backhaul,ā Communications
Magazine, IEEE, vol. 48, no. 10, pp. 94ā100, 2010.
[2] K. Fouli and M. Maier, āThe road to carrier-grade ethernet,ā Communications Magazine, IEEE,
vol. 47, no. 3, pp. S30āS38, 2009.
[3] F. Brockners, Metro Ethernet Services and standardization, Metro Ethernet Forum Std., 2005.
[4] S. Little, āIs microwave backhaul up to the 4g task?ā Microwave Magazine, IEEE, vol. 10, no. 5,
pp. 67ā74, 2009.
[5] A. W. M. Stasiak, M. Glabowski and P. Zwierzykowski, Modelling and dimensioning of mobile
wireless networks: from GSM to LTE. John Wiley & Sons.
[6] X. Li, et al., āDimensioning of the lte s1 interface,ā in Proc. IEEE Wireless and Mobile
Networking Conference, 2010 Third Joint IFIP, 2010, pp. 1ā6.
[7] F. Huang, C. Deccio, R. Ball, M. Clement, and Q. Snell, āA piecewise linear approach to
overbooking,ā in Proc. IEEE High Performance Switching and Routing Conference (HPSRā04),
2004.
[8] A. Checko, L. Ellegaard, and M. Berger, āCapacity planning for carrier ethernet lte backhaul
networks,ā in Proc. IEEE Wireless Communications and Networking Conference (WCNCā12),
2012.
[9] Metro Ethernet Forum, āMetro Ethernet Services ā A technical Overviewā, http:/ /
metroethernetforum.org/metroethernet-services.pdf
[10] C. Liu, C. Zhou, N. Pissinou and K. Makki, āAdaptive Quality of Service Provisioning in IEEE
802.11 Wireless Local Access Network,ā International Journal of Sensors, Wireless
Communications and Control, Vol. 2, pp.117-129 2012.
[11] ISI, āThe network simulator ā ns2,ā http://www.isi.edu/nsnam/ns/
[12] C. Liu, C. Zhou, āAn improved interworking architecture for UMTS-WLAN tight coupling,ā
IEEE Wireless Communications and Networking Conference, Vol. 3, pp. 1690-1695, 2005.
14. International Journal of Wireless & Mobile Networks (IJWMN) Vol. 5, No. 4, August 2013
156
[13] C. Liu, C. Zhou, āProviding quality of service in IEEE 802.11 WLAN," IEEE International
Conference on Advanced Information Networking and Applications, vol. 1, pp. 817-824, 2006.
[14] Carrier Ethernet Market, http://www.carrier-ethernet-market.com/en/
Authors
Chunming Liu is currently a Principal Engineer at T-Mobile, Bellevue, WA, United
States, and working on mobile network strategy, design and standards. He received
Ph.D. degree in Electrical Engineering from the Florida International University in
2006. From 2006 to 2008, he worked as a senior software engineer at Motorola for 4G
WiMAX product design and software development. From 2008 to 2010, he worked for
Microsoft as a software development engineer on Windows Phone Platform. He has
over 10 years R&D experience in areas of wireless communications, mobile computing, and
telecommunications, with 18 publications in refereed journals, conferences and book chapters. He has
invented 6 US / International patents (pending). He has been Editorial Board Member of Journal of
Networks, International Journal of Wireless and Mobile Networks, and International Journal of Privacy and
Health Information Management. He is an IEEE Senior Member.
Bryan Fleming is Vice President of Technical Systems and Business Operations, T-
Mobile USA. He is responsible for the Carrier Management, Engineering & EIT
Procurement organizations at T-Mobile. His teams direct telecoms spend, infrastructure
purchases and support engineering and supply chain operations. His team led T-
Mobileās the FTTC/Ethernet program which supports Americaās Largest 4G NetworkĀ®
covering over 220 million POPs. With Bryanās 22 years of experience in Telecom, he
has proven that he is an innovative Telecom leader executing high ROI solutions that fuel multibillion-
dollar revenues, driving excellence in operational performance, and sustaining superior customer
relationships. Throughout his career, Bryan has held various leadership positions in RF engineering,
operations, finance, procurement, and strategy. Bryan holds a Bachelorās degree in Business Management
from Columbia College and an MBA from Auburn University.