The Bandwidth Allocation Models (MAM, RDM, G-RDM and AllocTC-Sharing) are management
alternatives currently available which propose different resource (bandwidth) allocation strategies in
multiservice networks. The BAM adoption by a network is typically a management choice and
configuration task executed by the network operations and management system setup in a static or nearly
static way. This paper proposes and explores the alternative of allowing BAM definition and configuration
on a more dynamic way. In effect, one of the basic motivations towards BAM dynamic allocation is the fact
that multiservice networks characteristics (traffic load) may change considerably in daily network
operation and, as such, some dynamics in BAM allocation should be introduced in order to improve
performance. A framework is presented supporting BAM dynamic allocation. The framework adopts an
OpenFlow-based software-defined networking (SDN) implementation approach in order to support
scalability issues with a centralized controller and management network view. The framework architecture
also supports the implementation of some autonomic characteristics which, in brief, look for improving and
facilitating the decision-making process involved with BAM provisioning in a multiservice network. A
proof of concept is presented evaluating different BAM performance under different traffic loads in order to
demonstrate the framework strategy adopted.
A preliminary evaluation of bandwidth allocation model dynamic switchingIJCNCJournal
Bandwidth Allocation Models (BAMs) are used in orde
r to define Bandwidth Constraints (BCs) in a per-
class basis for MPLS/DS-TE networks and effectively
define how network resources like bandwidth are
obtained and shared by applications. The BAMs propo
sed (MAM – Maximum Allocation Model, RDM –
Russian Dolls Model, G-RDM – Generic RDM and AllocT
C-Sharing) attempt to optimize the use of
bandwidth resources on a per-link basis with differ
ent allocation and resource sharing characteristics
. As
such, the adoption of distinct BAMs and/or changes
in network resource demands (network traffic profil
e)
may result in different network traffic allocation
and operational behavior for distinct BAMs. This pa
per
evaluates the resulting network characteristics (li
nk utilization, preemption and flows blocking) of u
sing
BAMs dynamically with different traffic scenarios.
In brief, it is investigated the dynamics of BAM
switching with distinct traffic scenarios. The pape
r presents initially the investigated BAMs in relat
ion to
their behavior and resource allocation characterist
ics. Then, distinct BAMs are compared using differe
nt
traffic scenarios in order to investigate the impac
t of a dynamic change of the BAM configured in the
network. Finally, the paper shows that the adoption
of a dynamic BAM allocation strategy may result in
benefits for network operation in terms of link uti
lization, preemption and flows blocking.
This document presents a novel Cross-layer Mesh Router Placement (CMRP) scheme for wireless mesh networks. CMRP aims to minimize network deployment cost while meeting user demands. It considers various factors such as antenna types, wireless link characteristics, MAC scheduling, routing, and equipment costs. CMRP encapsulates these cross-layer factors into three attributes - Local Coverage, Backbone Residual Capacity, and Deployment Cost. It uses these attributes to select mesh router locations that maximize coverage and backbone capacity while minimizing costs. Simulations show CMRP outperforms existing schemes in cost performance ratio and feasibility for planning wireless mesh networks.
IJERD (www.ijerd.com) International Journal of Engineering Research and Devel...IJERD Editor
This document summarizes security issues and quality of service (QoS) challenges in mobile ad-hoc networks (MANETs). It begins with an introduction to MANETs and discusses their key features. It then outlines some of the main QoS challenges in MANETs, including routing, limited resources, and supporting different service levels given a changing network topology. The document also discusses several security issues for MANETs, such as vulnerabilities to attacks from both internal and external entities. It proposes a methodology for QoS support in MANETs that allocates resources to individual flows and considers aspects like identifying flows and reserving/releasing resources. In closing, it notes that QoS support for MANETs
Recently proposed wireless mesh routing metrics
based on awareness of congestion, load or interference typically
employ queue occupancy of a node's wireless interface to
estimate traffic load. Queue occupancy, however, does not
directly reflect the impact of channel contention from neighbor
nodes. We propose an alternative called the channel load-aware
(CLAW) routing metric that takes into consideration not only
the traffic load within the node itself, but also the degree of
interference and contention within the channel. CLAW uses
local information from a node's MAC layer to estimate channel
busyness and contention levels. It does not require complex
computations, nor the exchange of link-level statistics with
neighbors. Our preliminary results show that CLAW can
identify congested regions within the network and thus enable
the determination of routes around these congested areas. We
present the results of simulations we conducted to evaluate the
use of CLAW in mesh-wide routing.
Control Channel Dilemma (CCD) is still an open problem for Cognitive Radio Network (CRN). In this
article, we investigate and present a novel solution of Distributed Coordination in CRN to mitigate the
necessity for a common control channel. This scheme is based on the fact that a group of nearby nodes
almost detects the same frequency spectrum. That will allow every group of close nodes to choose a node
called coordinator, which in its turn chooses a reliable control channel for the group, then the reaming
nodes become slaves. Furthermore, the nodes that belong to two or more groups have an important role in
maintaining the network connectivity since they act as bridges to relay data between different groups. The
proposed approach carries potentials to provide robust operation under network dynamics conditions.
Finally, several simulation experiments are presented to validate the proposed approach.
A Survey on the Common Network Traffic Sources ModelsCSCJournals
Selecting the appropriate traffic model can lead to the successful design of networks. The more accurate is the traffic model the better is the system quantified in terms of its performance Successful design lead to enhancement the overall performance of the whole of network .in literature there is innumerous traffic models proposed for understanding and analyzing the traffic characteristics of networks. Consequently, the study of traffic models to understand the features of the models and identify eventually the best traffic model, for a concerned environment has become a crucial and lucrative task. Good traffic modeling is also a basic requirement for accurate capacity planning. This paper provides an overview of some of the widely used network traffic models, highlighting the core features of the model and traffic characteristics they capture best. Finally we found that the N_BURST traffic model can capture the traffic characteristics of most types of networks, under every possible circumstance rather than any type of traffic model.
IRJET- An Efficient Cross-Layer Cooperative Diversity Optimization Scheme Tog...IRJET Journal
The document summarizes a research paper that proposes an efficient cross-layer cooperative diversity optimization scheme called CCDRA+DEL-CMAC to maximize network lifetime and energy efficiency in mobile ad hoc networks (MANETs). The proposed scheme considers relay selection, routing, and power allocation strategies to meet reliability constraints in MANETs. Simulation results show the cross-layer cooperative strategies significantly prolong network lifetime and achieve energy savings compared to other approaches.
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
The papers for publication in The International Journal of Engineering& Science are selected through rigorous peer reviews to ensure originality, timeliness, relevance, and readability.
A preliminary evaluation of bandwidth allocation model dynamic switchingIJCNCJournal
Bandwidth Allocation Models (BAMs) are used in orde
r to define Bandwidth Constraints (BCs) in a per-
class basis for MPLS/DS-TE networks and effectively
define how network resources like bandwidth are
obtained and shared by applications. The BAMs propo
sed (MAM – Maximum Allocation Model, RDM –
Russian Dolls Model, G-RDM – Generic RDM and AllocT
C-Sharing) attempt to optimize the use of
bandwidth resources on a per-link basis with differ
ent allocation and resource sharing characteristics
. As
such, the adoption of distinct BAMs and/or changes
in network resource demands (network traffic profil
e)
may result in different network traffic allocation
and operational behavior for distinct BAMs. This pa
per
evaluates the resulting network characteristics (li
nk utilization, preemption and flows blocking) of u
sing
BAMs dynamically with different traffic scenarios.
In brief, it is investigated the dynamics of BAM
switching with distinct traffic scenarios. The pape
r presents initially the investigated BAMs in relat
ion to
their behavior and resource allocation characterist
ics. Then, distinct BAMs are compared using differe
nt
traffic scenarios in order to investigate the impac
t of a dynamic change of the BAM configured in the
network. Finally, the paper shows that the adoption
of a dynamic BAM allocation strategy may result in
benefits for network operation in terms of link uti
lization, preemption and flows blocking.
This document presents a novel Cross-layer Mesh Router Placement (CMRP) scheme for wireless mesh networks. CMRP aims to minimize network deployment cost while meeting user demands. It considers various factors such as antenna types, wireless link characteristics, MAC scheduling, routing, and equipment costs. CMRP encapsulates these cross-layer factors into three attributes - Local Coverage, Backbone Residual Capacity, and Deployment Cost. It uses these attributes to select mesh router locations that maximize coverage and backbone capacity while minimizing costs. Simulations show CMRP outperforms existing schemes in cost performance ratio and feasibility for planning wireless mesh networks.
IJERD (www.ijerd.com) International Journal of Engineering Research and Devel...IJERD Editor
This document summarizes security issues and quality of service (QoS) challenges in mobile ad-hoc networks (MANETs). It begins with an introduction to MANETs and discusses their key features. It then outlines some of the main QoS challenges in MANETs, including routing, limited resources, and supporting different service levels given a changing network topology. The document also discusses several security issues for MANETs, such as vulnerabilities to attacks from both internal and external entities. It proposes a methodology for QoS support in MANETs that allocates resources to individual flows and considers aspects like identifying flows and reserving/releasing resources. In closing, it notes that QoS support for MANETs
Recently proposed wireless mesh routing metrics
based on awareness of congestion, load or interference typically
employ queue occupancy of a node's wireless interface to
estimate traffic load. Queue occupancy, however, does not
directly reflect the impact of channel contention from neighbor
nodes. We propose an alternative called the channel load-aware
(CLAW) routing metric that takes into consideration not only
the traffic load within the node itself, but also the degree of
interference and contention within the channel. CLAW uses
local information from a node's MAC layer to estimate channel
busyness and contention levels. It does not require complex
computations, nor the exchange of link-level statistics with
neighbors. Our preliminary results show that CLAW can
identify congested regions within the network and thus enable
the determination of routes around these congested areas. We
present the results of simulations we conducted to evaluate the
use of CLAW in mesh-wide routing.
Control Channel Dilemma (CCD) is still an open problem for Cognitive Radio Network (CRN). In this
article, we investigate and present a novel solution of Distributed Coordination in CRN to mitigate the
necessity for a common control channel. This scheme is based on the fact that a group of nearby nodes
almost detects the same frequency spectrum. That will allow every group of close nodes to choose a node
called coordinator, which in its turn chooses a reliable control channel for the group, then the reaming
nodes become slaves. Furthermore, the nodes that belong to two or more groups have an important role in
maintaining the network connectivity since they act as bridges to relay data between different groups. The
proposed approach carries potentials to provide robust operation under network dynamics conditions.
Finally, several simulation experiments are presented to validate the proposed approach.
A Survey on the Common Network Traffic Sources ModelsCSCJournals
Selecting the appropriate traffic model can lead to the successful design of networks. The more accurate is the traffic model the better is the system quantified in terms of its performance Successful design lead to enhancement the overall performance of the whole of network .in literature there is innumerous traffic models proposed for understanding and analyzing the traffic characteristics of networks. Consequently, the study of traffic models to understand the features of the models and identify eventually the best traffic model, for a concerned environment has become a crucial and lucrative task. Good traffic modeling is also a basic requirement for accurate capacity planning. This paper provides an overview of some of the widely used network traffic models, highlighting the core features of the model and traffic characteristics they capture best. Finally we found that the N_BURST traffic model can capture the traffic characteristics of most types of networks, under every possible circumstance rather than any type of traffic model.
IRJET- An Efficient Cross-Layer Cooperative Diversity Optimization Scheme Tog...IRJET Journal
The document summarizes a research paper that proposes an efficient cross-layer cooperative diversity optimization scheme called CCDRA+DEL-CMAC to maximize network lifetime and energy efficiency in mobile ad hoc networks (MANETs). The proposed scheme considers relay selection, routing, and power allocation strategies to meet reliability constraints in MANETs. Simulation results show the cross-layer cooperative strategies significantly prolong network lifetime and achieve energy savings compared to other approaches.
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
The papers for publication in The International Journal of Engineering& Science are selected through rigorous peer reviews to ensure originality, timeliness, relevance, and readability.
Flexible channel allocation using best Secondary user detection algorithmijsrd.com
This document proposes a flexible channel allocation algorithm for cooperative cognitive radio networks using secondary user detection. It introduces Flexible Channel Cooperation (FLEC) which allows secondary users to optimize their use of resources including channels and time slots from primary users. The document develops efficient resource allocation algorithms for FLEC, including a distributed bargaining algorithm and centralized heuristic algorithm. It evaluates the performance of FLEC and shows it provides throughput improvements of 20-60% over conventional identical channel cooperation. A centralized heuristic algorithm achieves near-optimal performance with only 5% loss compared to the optimal centralized algorithm, providing a good tradeoff between performance and complexity.
LTE QOS DYNAMIC RESOURCE BLOCK ALLOCATION WITH POWER SOURCE LIMITATION AND QU...IJCNCJournal
3GPP has defined the long term evolution (LTE) for 3G radio access in order to maintain the future
competitiveness for 3G technology, the system provides the capability of supporting a mixture of services
with different quality of service (QoS) requirements. This paper proposes a new cross-layer scheduling
algorithm to satisfy better QoS parameters for real time applications. The proposed algorithm takes care of
allocating resource blocks (RBs) with different modulation and coding schemes (MCS) according to target
bit error rate (BER), user equipment supportable MCS, queue stability constraints and available transmit
power constraints. The proposed algorithm has been valued, compared with an earlier allocation algorithm
in terms of service rate and packet delay and showed better performance regards the real time
applications.
The document proposes a load-aware routing scheme for wireless mesh networks to balance traffic load and enhance network capacity. It divides the network into clusters, with each cluster head estimating traffic load and increasing routing metrics for overloaded links. This causes users to route around overloaded areas, achieving overall load balancing in a distributed manner. Simulation results show the proposed scheme outperforms routing using expected transmission time as a metric.
A Cooperative Approach to Extend Cellular Coverage via D2D Architecture based...IJCNCJournal
The access part of all cellular network’s generation suffers from common concerns related to dead spots (zones that are not covered by the network) and hot spots (zones where the number of users is higher compared to network resources). During the last decade, lots of research proposals have tried to overcome cellular problems through multi-hop D2D architecture, which is a new paradigm allowing the direct communication between devices in cellular network to enhance network performances and improve user QoS. In this paper, we propose a multi-hop D2D architecture based on the OLSR protocol to extend cellular coverage. Cell-OLSR, which is the proposed adaptation of OLSR for our architecture, allows the exchange of cellular parameters between nodes to choose the best proxy device to forward data to the cellular base station (BS).
Dynamic Shaping Method using SDN And NFV ParadigmsIJCNCJournal
Traffic shaping controls communication traffic flow to prevent a specified communication rate from being exceeded. In conventional networks, the traffic shaping device is implemented at a predetermined location and only a communication flow passing through the device is targeted. If the traffic can be shaped dynamically on any selected communication flows at the optimal point only when necessary, it could use network bandwidths and packet relay processing capacity more efficiently and flexibly.
This paper proposes a dynamic shaping method using Software-Defined Networking (SDN) and Network Functions Virtualization (NFV) paradigms, which selects the optimal communication flows to be shaped, and the optimal shaping points dynamically. This paper also presented system configuration and functions for the proposed dynamic shaping, and the method to simplify the process of collecting the traffic data of each communication flow by SDN controller.
Thus the article offers the model represented by algebraic equations and inequalities for routing and
policing traffic in infocommunication network. The novelty of the model is as follows: multiflow nature of
modern ICN is taken into account (1), i.е. a set of flows circling between different pairs of network routers are
considered simultaneously; coherent formalization of processes of traffic routing and policing within the model
that has lower dimensionality in comparison to known earlier is provided; the choice of optimality criterion, use
of which allows to implement multipath routing with consequent inclusion of paths as well as to organize
limitation of flow intensity on all the used routs simultaneously depending on their characteristics and flow
priority. According to the results of the analysis conducted we offer recommendations for choosing relation in
numerical values of routing metrics and service denial regarding the provision of the given values for the main
QoS characteristics, e.g. average packet delay. The model can be used as a basis for perspective protocol
decisions aimed at coherence of solutions for the tasks of traffic routing and policing. Further development of
the given model is possible under full account of stochastic characteristics of packet flows circling in the
network.
This ppt covers the following topics:
Structural evolution of cellular communications;
Frequency reuse;
Duplex techniques;
Multiple-access/broadcasting techniques;
Handover (handoff);
Multi-cell cooperation/processing;
Resource allocation;
Cognitive radios;
MIMO and massive MIMO;
Distributed antenna wireless communications;
Cellular social networks.
Improved Algorithm for Throughput Maximization in MC-CDMAVLSICS Design
The Multi-Carrier Code Division Multiple Access (MC-CDMA) is becoming a very significant downlink multiple access technique for high-rate data transmission in the fourth generation wireless communication systems. By means of efficient resource allocation higher data rate i.e. throughput can be achieved. This paper evaluates the performance of group (subchannel) allocation criteria employed in downlink transmission, which results in throughput maximization. Proposed algorithm gives the modified technique of sub channel allocation in the downlink transmission of MC-CDMA systems. Simulation are carried out for all the three combining schemes, results shows that for the given power and BER proposed algorithm comparatively gives far better results .
PERFORMANCE ANALYSIS OF WIRELESS MESH NETWORK USING ADAPTIVE INFORMANT FACTOR...IJCSES Journal
Wireless mesh network (WMN) has become an important leading technology which provides several types of useful applications such as community network, broadband home network and internet access, etc. The rise in the size of users in WMN has created a degradation of efficiency in a network especially in dense areas due to the clumsy channel allocation and hence creating many challenges for enhancing the users experience, network quality and throughput. Therefore in this paper, we proposed OCA based AIF model that can access the channel information and then it process to improve the RF channel association. The proposed OCA-AIF will function for each period when some interference is detected via AIF and we further extend this analysis by taking in to consideration the influence of interference to provide a high quality indicator in network. The analysis of result shows the optimization by our proposed approach which increases as per the increment of relay nodes (RNs).
Load balancing In Wireless Mesh Networks Using liquid–Simulated AlgorithmIJSRED
The document proposes a hierarchical routing framework and liquid-simulated algorithm for load balancing in wireless mesh networks. Key points:
- The framework forms clusters with wireless mesh routers (WMRs) as cluster heads and simplifies clustering procedures. It uses limited topology broadcasting to allow WMRs to choose best paths between adjacent clusters.
- The liquid-simulated algorithm aims to keep load balanced between WMRs by treating load as a liquid level and allowing flows between nodes to equalize levels across the network.
- The framework uses a proactive routing approach within this load balancing algorithm, with topology broadcasting constrained within clusters and adjacent clusters to reduce overhead.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
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.
ENERGY EFFICIENT NODE RANK-BASED ROUTING ALGORITHM IN MOBILE AD-HOC NETWORKSIJCNCJournal
Mobile Ad-hoc Network (MANET) is an emerging technology, infrastructure less with self-organizing, selfhealing, multi-hop wireless routing networks in real time. In such networks, many routing problems arise due to complexity in the network mobility which results from difficulty in achieving energy efficient routing
in the field of MANET. Due to the dynamic nature and the limited battery energy of the mobile nodes, the communication links between intermediate relay nodes may fail frequently, thus affecting the routing performance of the network and also the availability of the nodes. Though existing protocols are not
concentrating about communication links and battery energy, node links are very important factor for improving quality of routing protocols because Node Rank helps us to determine whether the node is within transmission range or out of transmission range through considering residual energy of the node during the routing process. This paper proposes a novel Energy Efficient Node Rank-based Routing (EENRR)
algorithm which includes certain performance metrics such as control overhead and residual energy in order to improve the Packet Delivery Ratio (PDR), and Network Life Time (NLT) from its originally observed routing performance obtained through other existing protocols. Simulation results show that, when the number of nodes increases from 10 to 100 nodes, EENRR algorithm increases the average residual energy by 31.08% and 21.26% over the existing Dynamic Source Routing (DSR) and Energy Efficient Delay Time Routing (EEDTR) protocols, respectively. Similarly it increases the PDR by 45.38% and 28.3% over the existing DSR and EEDTR protocols respectively.
MM-PNEMO: a mathematical model to assess handoff delay and packet lossjournalBEEI
Wireless networks incorporate Mobile Nodes (MNs) that use wireless access networks to communicate. However, the communication among these MNs are not remained stable due to the poor network coverage during inter mobility. Moreover, the wireless nodes are typically small that results in resource-constrained. Thus, it is uphill to use algorithms having giant processing power or memory footprint. Accordingly, it is essential to check schemes consistently to evaluate the performance within the probable application scenario. To do so, numerical analysis could be a notable method to grasp the performance of mobility management schemes as well as the constraint of evolving mobility management solutions specifically for multi-interfaced MR in Proxy NEMO environment. This paper analyzes handoff performance by using a mathematical model of Multihoming-based scheme to support Mobility management in Proxy NEMO (MM-PNEMO) environment. Moreover, a comparative study has been made among the standard Network Mobility Basic Support Protocol (NEMO BSP), Proxy NEMO (PNEMO) and MM-PNEMO scheme respectively. The performance metrics estimated for these schemes are mainly handoff delay and packet loss. This paper also analysed the packet loss ratio and handoff gain as a function of cell radius, number of SMR and velocity respectively. It is apparent that, the MM-PNEMO scheme shows lower packet loss ratio (1%) compared to NEMO-BSP (11%) and P-NEMO (6%).
CROSS-LAYER RESOURCE ALLOCATION SCHEME UNDER HETEROGENEOUS CONSTRAINTS FOR NE...IJNSA Journal
In the next generation wireless networks, the growing demand for new wireless applications is accompanied with high expectations for better quality of service (QoS) fulfillment especially for multimedia applications. Furthermore, the coexistence of future unlicensed users with existing licensed users is becoming a challenging task in the next generation communication systems to overcome the underutilization of the spectrum. A QoS and interference aware resource allocation is thus of special interest in order to respond to the heterogeneous constraints of the next generation networks. In this work, we address the issue of resource allocation under heterogeneous constraints for unlicensed multiband ultra-wideband (UWB) systems in the context of Future Home Networks, i.e. the wireless personal area network (WPAN). The problem is first studied analytically using a heterogeneous constrained optimization problem formulation. After studying the characteristics of the optimal solution, we propose a low-complexity suboptimal algorithm based on a cross-layer approach that combines information provided by the PHY and MAC layers. While the PHY layer is responsible for providing the channel quality of the unlicensed UWB users as well as their interference power that they cause on licensed users, the MAC layer is responsible for classifying the unlicensed users using a two-class based approach that guarantees for multimedia services a high-priority level compared to other services. Combined in an efficient and simple way, the PHY and MAC information present the key elements of the aimed resource allocation. Simulation results demonstrate that the proposed scheme provides a good tradeoff between the QoS satisfaction of the unlicensed applications with hard QoS requirements and the limitation of the interference affecting the licensed users.
Improving QoS in VANET Using Dynamic Clustering TechniqueKaushik Padmanabhan
The document presents a new dynamic multi-clustering technique to improve quality of service (QoS) in vehicular ad hoc networks (VANETs) used for vehicle platooning. It begins by discussing limitations of existing single clustering approaches. It then proposes a hierarchical clustering approach that forms multiple clusters within each platoon dynamically based on traffic conditions. A new Relative Multi-Head Disturbance Adaptation (RMDA) algorithm is introduced to select cluster heads. This algorithm considers both relative distance and mobility between nodes to select stable cluster heads. Simulation results show the approach improves QoS metrics like packet delay, throughput and packet loss ratio over existing single clustering techniques.
The exponential rise in wireless communication systems and allied applications has revitalized academiaindustries to achieve more efficient data transmission system to meet Quality-of-Service (QoS) demands. Amongst major wireless communication techniques, Mobile Ad-hoc Network (MANET) is found potential to provide decentralized and infrastructure less communication among multiple distributed nodes across network region. However, dynamic network conditions such as changing topology, congestion, packet drop, intrusion possibilities etc often make MANET’s routing a tedious task. On the other hand, mobile network feature broadens the horizon for intruders to penetrate the network and causes performance degradation. Unlike classical MANET protocols where major efforts have been made on single network parameter based routing decision, this research paper proposes a novel Elitist Genetic Algorithm (EGA) Multi-Objective Optimization assisted Network Condition Aware QoS-Routing Protocol for Mobile Ad-hoc Networks (MNCQM). Our proposed MNCQM protocol exhibits two phase implementation where at first it performs node-profiling under dynamic network topology for which three factors; irregular MAC information exchange, queuing overflow and topological variations have been considered. Towards this objective node features like Packet Forwarding Probability (PFP) at the MAC layer, Success Probability of Data Transmission (SPDT) of a neighboring node, and Probability of Successful Data Delivery (PSDD) have been obtained to estimate Node-Trustworthiness Index (NTI), which is further used to eliminate untrustworthy nodes. In the second phase of implementation, a novel Evolutionary Computing assisted nondisjoint best forwarding path selection model is developed that exploits node’s and allied link’s connectivity and availability features to identify the quasi-sub-optimal forwarding paths. EGA algorithm intends to reduce hop-counts, connectivity-loss and node or link unavailability to estimate best forwarding node. One key feature of the proposed model is dual-supplementary forwarding path selection that enables alternate path formation in case of link outage and thus avoids any iterative network discovery phase.
Link Stability Based On Qos Aware On - Demand Routing In Mobile Ad Hoc NetworksIOSR Journals
This document summarizes a research paper that proposes a new routing protocol for mobile ad hoc networks (MANETs) that considers link stability and quality of service (QoS) metrics. The protocol estimates link quality based on node mobility prediction using GPS data. It calculates a "cost" metric factoring in link stability and power consumption to select paths with more stable, lower-cost links. Simulation results show the proposed protocol achieves higher throughput and packet delivery ratio compared to existing protocols, with lower control overhead. Future work could incorporate additional link quality metrics and statistical classifiers to further optimize path selection in MANETs.
ON DEMAND CHANNEL ASSIGNMENT METHOD FOR CHANNEL DIVERSITY (ODCAM)ijwmn
This document proposes a new channel assignment method called ODCAM that aims to increase throughput and minimize delay in multi-channel multi-radio wireless mesh networks. ODCAM uses a channel diversity mechanism to select new channels along the path from source to destination. It stores channel information in a Channel Diversity Table. Simulation results show that ODCAM combined with the HWMP routing protocol increases average throughput by 12.78% and decreases average end-to-end delay compared to a hybrid channel assignment approach.
On client’s interactive behaviour to design peer selection policies for bitto...IJCNCJournal
Peer-to-peer swarming protocols have been proven to be very efficient for content replication over Internet.
This fact has certainly motivated proposals to adapt these protocols to meet the requirements of on-demand
streaming system. The vast majority of these proposals focus on modifying the piece and peer selection
policies, respectively, of the original protocols. Nonetheless, it is true that more attention has often been
given to the piece selection policy rather than to the peer selection policy. Within this context, this article
proposes a simple algorithm to be used as basis for peer selection policies of BitTorrent-like protocols,
considering interactive scenarios. To this end, we analyze the client’s interactive behaviour when accessing
real multimedia systems. This analysis consists of looking into workloads of real content providers and
assessing three important metrics, namely temporal dispersion, spatial dispersion and object position
popularity. These metrics are then used as the main guidelines for writing the algorithm. To the best of our
knowledge, this is the first time that the client’s interactive behaviour is specially considered to derive an
algorithm for peer selection policies. Finally, the conclusion of this article is drawn with key challenges
and possible future work in this research field.
A comparative analysis of number portability routing schemesIJCNCJournal
To reap the benefits of liberalized telecom market, the implementation of number portability (NP) is utmost
important. NP allows end user to retain their telephone number in case of change of geographical location
or service type or service provider. This paper describes the various number portability routing schemes
namely, All Call Query, Query on Release, Call Dropback and Onward routing. The comparative analysis
between these routing schemes on various parameters is presented here. The issues pertaining to NP have
also been described.
Link aware nice application level multicast protocolIJCNCJournal
Multicast is one of the most efficient ways to dist
ribute data to multiple users. There are different
types of
Multicast such as IP Multicast, Overlay Multicast,
and Application Layer Multicast (ALM). In this pape
r,
we present a link-aware Application Layer (ALM) Mul
ticast algorithm. Our proposed algorithm, Link
Aware-NICE (LA-NICE) [1], is an enhanced version of
the NICE protocol [2]. LA-NICE protocol uses the
variations of bandwidth or capacity in communicatio
n links to improve multicast message delivery and
minimize end-to-end delay. OMNeT++ simulation frame
work [3] was used to evaluate LA-NICE. The
evaluation is done through a comparison between LA-
NICE and NICE. The simulation results showed that
LA-NICE produces an increased percentage of success
ful message delivery ranging from 2% to 10%
compared to NICE. Also, LA-NICE has less average de
lay and less average message hop count than NICE
which reduces the overall latency of message delive
ry
Flexible channel allocation using best Secondary user detection algorithmijsrd.com
This document proposes a flexible channel allocation algorithm for cooperative cognitive radio networks using secondary user detection. It introduces Flexible Channel Cooperation (FLEC) which allows secondary users to optimize their use of resources including channels and time slots from primary users. The document develops efficient resource allocation algorithms for FLEC, including a distributed bargaining algorithm and centralized heuristic algorithm. It evaluates the performance of FLEC and shows it provides throughput improvements of 20-60% over conventional identical channel cooperation. A centralized heuristic algorithm achieves near-optimal performance with only 5% loss compared to the optimal centralized algorithm, providing a good tradeoff between performance and complexity.
LTE QOS DYNAMIC RESOURCE BLOCK ALLOCATION WITH POWER SOURCE LIMITATION AND QU...IJCNCJournal
3GPP has defined the long term evolution (LTE) for 3G radio access in order to maintain the future
competitiveness for 3G technology, the system provides the capability of supporting a mixture of services
with different quality of service (QoS) requirements. This paper proposes a new cross-layer scheduling
algorithm to satisfy better QoS parameters for real time applications. The proposed algorithm takes care of
allocating resource blocks (RBs) with different modulation and coding schemes (MCS) according to target
bit error rate (BER), user equipment supportable MCS, queue stability constraints and available transmit
power constraints. The proposed algorithm has been valued, compared with an earlier allocation algorithm
in terms of service rate and packet delay and showed better performance regards the real time
applications.
The document proposes a load-aware routing scheme for wireless mesh networks to balance traffic load and enhance network capacity. It divides the network into clusters, with each cluster head estimating traffic load and increasing routing metrics for overloaded links. This causes users to route around overloaded areas, achieving overall load balancing in a distributed manner. Simulation results show the proposed scheme outperforms routing using expected transmission time as a metric.
A Cooperative Approach to Extend Cellular Coverage via D2D Architecture based...IJCNCJournal
The access part of all cellular network’s generation suffers from common concerns related to dead spots (zones that are not covered by the network) and hot spots (zones where the number of users is higher compared to network resources). During the last decade, lots of research proposals have tried to overcome cellular problems through multi-hop D2D architecture, which is a new paradigm allowing the direct communication between devices in cellular network to enhance network performances and improve user QoS. In this paper, we propose a multi-hop D2D architecture based on the OLSR protocol to extend cellular coverage. Cell-OLSR, which is the proposed adaptation of OLSR for our architecture, allows the exchange of cellular parameters between nodes to choose the best proxy device to forward data to the cellular base station (BS).
Dynamic Shaping Method using SDN And NFV ParadigmsIJCNCJournal
Traffic shaping controls communication traffic flow to prevent a specified communication rate from being exceeded. In conventional networks, the traffic shaping device is implemented at a predetermined location and only a communication flow passing through the device is targeted. If the traffic can be shaped dynamically on any selected communication flows at the optimal point only when necessary, it could use network bandwidths and packet relay processing capacity more efficiently and flexibly.
This paper proposes a dynamic shaping method using Software-Defined Networking (SDN) and Network Functions Virtualization (NFV) paradigms, which selects the optimal communication flows to be shaped, and the optimal shaping points dynamically. This paper also presented system configuration and functions for the proposed dynamic shaping, and the method to simplify the process of collecting the traffic data of each communication flow by SDN controller.
Thus the article offers the model represented by algebraic equations and inequalities for routing and
policing traffic in infocommunication network. The novelty of the model is as follows: multiflow nature of
modern ICN is taken into account (1), i.е. a set of flows circling between different pairs of network routers are
considered simultaneously; coherent formalization of processes of traffic routing and policing within the model
that has lower dimensionality in comparison to known earlier is provided; the choice of optimality criterion, use
of which allows to implement multipath routing with consequent inclusion of paths as well as to organize
limitation of flow intensity on all the used routs simultaneously depending on their characteristics and flow
priority. According to the results of the analysis conducted we offer recommendations for choosing relation in
numerical values of routing metrics and service denial regarding the provision of the given values for the main
QoS characteristics, e.g. average packet delay. The model can be used as a basis for perspective protocol
decisions aimed at coherence of solutions for the tasks of traffic routing and policing. Further development of
the given model is possible under full account of stochastic characteristics of packet flows circling in the
network.
This ppt covers the following topics:
Structural evolution of cellular communications;
Frequency reuse;
Duplex techniques;
Multiple-access/broadcasting techniques;
Handover (handoff);
Multi-cell cooperation/processing;
Resource allocation;
Cognitive radios;
MIMO and massive MIMO;
Distributed antenna wireless communications;
Cellular social networks.
Improved Algorithm for Throughput Maximization in MC-CDMAVLSICS Design
The Multi-Carrier Code Division Multiple Access (MC-CDMA) is becoming a very significant downlink multiple access technique for high-rate data transmission in the fourth generation wireless communication systems. By means of efficient resource allocation higher data rate i.e. throughput can be achieved. This paper evaluates the performance of group (subchannel) allocation criteria employed in downlink transmission, which results in throughput maximization. Proposed algorithm gives the modified technique of sub channel allocation in the downlink transmission of MC-CDMA systems. Simulation are carried out for all the three combining schemes, results shows that for the given power and BER proposed algorithm comparatively gives far better results .
PERFORMANCE ANALYSIS OF WIRELESS MESH NETWORK USING ADAPTIVE INFORMANT FACTOR...IJCSES Journal
Wireless mesh network (WMN) has become an important leading technology which provides several types of useful applications such as community network, broadband home network and internet access, etc. The rise in the size of users in WMN has created a degradation of efficiency in a network especially in dense areas due to the clumsy channel allocation and hence creating many challenges for enhancing the users experience, network quality and throughput. Therefore in this paper, we proposed OCA based AIF model that can access the channel information and then it process to improve the RF channel association. The proposed OCA-AIF will function for each period when some interference is detected via AIF and we further extend this analysis by taking in to consideration the influence of interference to provide a high quality indicator in network. The analysis of result shows the optimization by our proposed approach which increases as per the increment of relay nodes (RNs).
Load balancing In Wireless Mesh Networks Using liquid–Simulated AlgorithmIJSRED
The document proposes a hierarchical routing framework and liquid-simulated algorithm for load balancing in wireless mesh networks. Key points:
- The framework forms clusters with wireless mesh routers (WMRs) as cluster heads and simplifies clustering procedures. It uses limited topology broadcasting to allow WMRs to choose best paths between adjacent clusters.
- The liquid-simulated algorithm aims to keep load balanced between WMRs by treating load as a liquid level and allowing flows between nodes to equalize levels across the network.
- The framework uses a proactive routing approach within this load balancing algorithm, with topology broadcasting constrained within clusters and adjacent clusters to reduce overhead.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
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.
ENERGY EFFICIENT NODE RANK-BASED ROUTING ALGORITHM IN MOBILE AD-HOC NETWORKSIJCNCJournal
Mobile Ad-hoc Network (MANET) is an emerging technology, infrastructure less with self-organizing, selfhealing, multi-hop wireless routing networks in real time. In such networks, many routing problems arise due to complexity in the network mobility which results from difficulty in achieving energy efficient routing
in the field of MANET. Due to the dynamic nature and the limited battery energy of the mobile nodes, the communication links between intermediate relay nodes may fail frequently, thus affecting the routing performance of the network and also the availability of the nodes. Though existing protocols are not
concentrating about communication links and battery energy, node links are very important factor for improving quality of routing protocols because Node Rank helps us to determine whether the node is within transmission range or out of transmission range through considering residual energy of the node during the routing process. This paper proposes a novel Energy Efficient Node Rank-based Routing (EENRR)
algorithm which includes certain performance metrics such as control overhead and residual energy in order to improve the Packet Delivery Ratio (PDR), and Network Life Time (NLT) from its originally observed routing performance obtained through other existing protocols. Simulation results show that, when the number of nodes increases from 10 to 100 nodes, EENRR algorithm increases the average residual energy by 31.08% and 21.26% over the existing Dynamic Source Routing (DSR) and Energy Efficient Delay Time Routing (EEDTR) protocols, respectively. Similarly it increases the PDR by 45.38% and 28.3% over the existing DSR and EEDTR protocols respectively.
MM-PNEMO: a mathematical model to assess handoff delay and packet lossjournalBEEI
Wireless networks incorporate Mobile Nodes (MNs) that use wireless access networks to communicate. However, the communication among these MNs are not remained stable due to the poor network coverage during inter mobility. Moreover, the wireless nodes are typically small that results in resource-constrained. Thus, it is uphill to use algorithms having giant processing power or memory footprint. Accordingly, it is essential to check schemes consistently to evaluate the performance within the probable application scenario. To do so, numerical analysis could be a notable method to grasp the performance of mobility management schemes as well as the constraint of evolving mobility management solutions specifically for multi-interfaced MR in Proxy NEMO environment. This paper analyzes handoff performance by using a mathematical model of Multihoming-based scheme to support Mobility management in Proxy NEMO (MM-PNEMO) environment. Moreover, a comparative study has been made among the standard Network Mobility Basic Support Protocol (NEMO BSP), Proxy NEMO (PNEMO) and MM-PNEMO scheme respectively. The performance metrics estimated for these schemes are mainly handoff delay and packet loss. This paper also analysed the packet loss ratio and handoff gain as a function of cell radius, number of SMR and velocity respectively. It is apparent that, the MM-PNEMO scheme shows lower packet loss ratio (1%) compared to NEMO-BSP (11%) and P-NEMO (6%).
CROSS-LAYER RESOURCE ALLOCATION SCHEME UNDER HETEROGENEOUS CONSTRAINTS FOR NE...IJNSA Journal
In the next generation wireless networks, the growing demand for new wireless applications is accompanied with high expectations for better quality of service (QoS) fulfillment especially for multimedia applications. Furthermore, the coexistence of future unlicensed users with existing licensed users is becoming a challenging task in the next generation communication systems to overcome the underutilization of the spectrum. A QoS and interference aware resource allocation is thus of special interest in order to respond to the heterogeneous constraints of the next generation networks. In this work, we address the issue of resource allocation under heterogeneous constraints for unlicensed multiband ultra-wideband (UWB) systems in the context of Future Home Networks, i.e. the wireless personal area network (WPAN). The problem is first studied analytically using a heterogeneous constrained optimization problem formulation. After studying the characteristics of the optimal solution, we propose a low-complexity suboptimal algorithm based on a cross-layer approach that combines information provided by the PHY and MAC layers. While the PHY layer is responsible for providing the channel quality of the unlicensed UWB users as well as their interference power that they cause on licensed users, the MAC layer is responsible for classifying the unlicensed users using a two-class based approach that guarantees for multimedia services a high-priority level compared to other services. Combined in an efficient and simple way, the PHY and MAC information present the key elements of the aimed resource allocation. Simulation results demonstrate that the proposed scheme provides a good tradeoff between the QoS satisfaction of the unlicensed applications with hard QoS requirements and the limitation of the interference affecting the licensed users.
Improving QoS in VANET Using Dynamic Clustering TechniqueKaushik Padmanabhan
The document presents a new dynamic multi-clustering technique to improve quality of service (QoS) in vehicular ad hoc networks (VANETs) used for vehicle platooning. It begins by discussing limitations of existing single clustering approaches. It then proposes a hierarchical clustering approach that forms multiple clusters within each platoon dynamically based on traffic conditions. A new Relative Multi-Head Disturbance Adaptation (RMDA) algorithm is introduced to select cluster heads. This algorithm considers both relative distance and mobility between nodes to select stable cluster heads. Simulation results show the approach improves QoS metrics like packet delay, throughput and packet loss ratio over existing single clustering techniques.
The exponential rise in wireless communication systems and allied applications has revitalized academiaindustries to achieve more efficient data transmission system to meet Quality-of-Service (QoS) demands. Amongst major wireless communication techniques, Mobile Ad-hoc Network (MANET) is found potential to provide decentralized and infrastructure less communication among multiple distributed nodes across network region. However, dynamic network conditions such as changing topology, congestion, packet drop, intrusion possibilities etc often make MANET’s routing a tedious task. On the other hand, mobile network feature broadens the horizon for intruders to penetrate the network and causes performance degradation. Unlike classical MANET protocols where major efforts have been made on single network parameter based routing decision, this research paper proposes a novel Elitist Genetic Algorithm (EGA) Multi-Objective Optimization assisted Network Condition Aware QoS-Routing Protocol for Mobile Ad-hoc Networks (MNCQM). Our proposed MNCQM protocol exhibits two phase implementation where at first it performs node-profiling under dynamic network topology for which three factors; irregular MAC information exchange, queuing overflow and topological variations have been considered. Towards this objective node features like Packet Forwarding Probability (PFP) at the MAC layer, Success Probability of Data Transmission (SPDT) of a neighboring node, and Probability of Successful Data Delivery (PSDD) have been obtained to estimate Node-Trustworthiness Index (NTI), which is further used to eliminate untrustworthy nodes. In the second phase of implementation, a novel Evolutionary Computing assisted nondisjoint best forwarding path selection model is developed that exploits node’s and allied link’s connectivity and availability features to identify the quasi-sub-optimal forwarding paths. EGA algorithm intends to reduce hop-counts, connectivity-loss and node or link unavailability to estimate best forwarding node. One key feature of the proposed model is dual-supplementary forwarding path selection that enables alternate path formation in case of link outage and thus avoids any iterative network discovery phase.
Link Stability Based On Qos Aware On - Demand Routing In Mobile Ad Hoc NetworksIOSR Journals
This document summarizes a research paper that proposes a new routing protocol for mobile ad hoc networks (MANETs) that considers link stability and quality of service (QoS) metrics. The protocol estimates link quality based on node mobility prediction using GPS data. It calculates a "cost" metric factoring in link stability and power consumption to select paths with more stable, lower-cost links. Simulation results show the proposed protocol achieves higher throughput and packet delivery ratio compared to existing protocols, with lower control overhead. Future work could incorporate additional link quality metrics and statistical classifiers to further optimize path selection in MANETs.
ON DEMAND CHANNEL ASSIGNMENT METHOD FOR CHANNEL DIVERSITY (ODCAM)ijwmn
This document proposes a new channel assignment method called ODCAM that aims to increase throughput and minimize delay in multi-channel multi-radio wireless mesh networks. ODCAM uses a channel diversity mechanism to select new channels along the path from source to destination. It stores channel information in a Channel Diversity Table. Simulation results show that ODCAM combined with the HWMP routing protocol increases average throughput by 12.78% and decreases average end-to-end delay compared to a hybrid channel assignment approach.
On client’s interactive behaviour to design peer selection policies for bitto...IJCNCJournal
Peer-to-peer swarming protocols have been proven to be very efficient for content replication over Internet.
This fact has certainly motivated proposals to adapt these protocols to meet the requirements of on-demand
streaming system. The vast majority of these proposals focus on modifying the piece and peer selection
policies, respectively, of the original protocols. Nonetheless, it is true that more attention has often been
given to the piece selection policy rather than to the peer selection policy. Within this context, this article
proposes a simple algorithm to be used as basis for peer selection policies of BitTorrent-like protocols,
considering interactive scenarios. To this end, we analyze the client’s interactive behaviour when accessing
real multimedia systems. This analysis consists of looking into workloads of real content providers and
assessing three important metrics, namely temporal dispersion, spatial dispersion and object position
popularity. These metrics are then used as the main guidelines for writing the algorithm. To the best of our
knowledge, this is the first time that the client’s interactive behaviour is specially considered to derive an
algorithm for peer selection policies. Finally, the conclusion of this article is drawn with key challenges
and possible future work in this research field.
A comparative analysis of number portability routing schemesIJCNCJournal
To reap the benefits of liberalized telecom market, the implementation of number portability (NP) is utmost
important. NP allows end user to retain their telephone number in case of change of geographical location
or service type or service provider. This paper describes the various number portability routing schemes
namely, All Call Query, Query on Release, Call Dropback and Onward routing. The comparative analysis
between these routing schemes on various parameters is presented here. The issues pertaining to NP have
also been described.
Link aware nice application level multicast protocolIJCNCJournal
Multicast is one of the most efficient ways to dist
ribute data to multiple users. There are different
types of
Multicast such as IP Multicast, Overlay Multicast,
and Application Layer Multicast (ALM). In this pape
r,
we present a link-aware Application Layer (ALM) Mul
ticast algorithm. Our proposed algorithm, Link
Aware-NICE (LA-NICE) [1], is an enhanced version of
the NICE protocol [2]. LA-NICE protocol uses the
variations of bandwidth or capacity in communicatio
n links to improve multicast message delivery and
minimize end-to-end delay. OMNeT++ simulation frame
work [3] was used to evaluate LA-NICE. The
evaluation is done through a comparison between LA-
NICE and NICE. The simulation results showed that
LA-NICE produces an increased percentage of success
ful message delivery ranging from 2% to 10%
compared to NICE. Also, LA-NICE has less average de
lay and less average message hop count than NICE
which reduces the overall latency of message delive
ry
In recent years, cooperative communication is a hot topic of research and it is a powerful physical layer
technique to combat fading in wireless relaying scenario. Concerning with the physical layer issues, in this
paper it is focussed on with providing a better space time block coding (STBC) scheme and incorporating it
in the cooperative relaying nodes to upgrade the system performance. Recently, the golden codes have
proven to exhibit a superior performance in a wireless MIMO (Multiple Input Multiple Output) scenario
than any other code. However, a serious limitation associated with it is its increased decoding complexity.
This paper attempts to resolve this challenge through suitable modification of golden code such that a less
complex sphere decoder could be used without much compromising the error rates. The decoder complexity
is analyzed through simulation and it proves to exhibit less complexity compared to the conventional
(Maximum likelihood) ML decoder. The single relay cooperative STBC consisting of source, relay and
destination are considered. The cooperative protocol strategy considered in the relay node is Decode and
forward (DF) protocol. The proposed modified golden code with less complex sphere decoder is
implemented in the nodes of the cooperative relaying system to achieve better performance in the system.
The simulation results have validated the effectiveness of the proposed scheme by offering better BER
performance, minimum outage probability and increased spectral efficiency compared to the non
cooperative transmission method.
Corporate role in protecting consumers from the risk of identity theftIJCNCJournal
The Internet has made it possible for users to be robbed of their reputation, money and credit worthiness by
the click of a mouse. The impact of identity theft severely limits victims’ ability to participate in commerce,
education and normal societal functions. This paper evaluates resurgence in syndicated cyber attacks,
which includes but not limited to identity theft, corporate espionage and cyber warfare taking advantage of
the Internet as a medium of operations. The paper highlights the increase of cyber related attacks in the
past ten years due to lack of transatlantic international corporation between participating countries,
coherent information security policies, data aggregation and sound international laws to facilitate
prosecution of perpetrators. The cyber space coupled with availability of free hacking tools has contributed
to resurgence in syndicated identity theft, corporate espionage and identity theft by organized crime
elements taking advantage of the Internet as a medium of operations. This paper presents conclusive
solution that users, organizations and consumers can enact to protect themselves from the threat of cyber
attacks culminating into identity theft, financial loss or both.
Real time audio translation module between iax and rswIJCNCJournal
At the last few years, multimedia communication has
been developed and improved rapidly in order to
enable users to communicate between each other over
the internet. Generally, multimedia communication
consists of audio and video communication. However,
this research concentrates on audio conferencing
only. The audio translation between protocols is a
very critical issue, because it solves the communic
ation
problems between any two protocols. So, it enables
people around the world to talk with each other eve
n
they use different protocols. In this research, a r
eal time audio translation module between two proto
cols
has been done. These two protocols are: InterAsteri
sk eXchange Protocol (IAX) and Real-Time Switching
Control Protocol (RSW), which they are widely used
to provide two ways audio transfer feature. The
solution here is to provide interworking between th
e two protocols which they have different media
transports, audio codec’s, header formats and diffe
rent transport protocols for the audio transmission
. This
translation will help bridging the gap between the
two protocols by providing interworking capability
between the two audio streams of IAX and RSW. Some
related works have been done to provide translation
between IAX and RSW control signalling messages. Bu
t, this research paper concentrates on the
translation that depends on the media transfer. The
proposed translation module was tested and evaluat
ed
in different scenarios in order to examine its perf
ormance. The obtained results showed that the Real-
Time
Audio Translation Module produces lower rates of pa
cket delay and jitter than the acceptance values fo
r
each of the mentioned performance metrics.
ANALYSIS OF IPV6 TRANSITION TECHNOLOGIESIJCNCJournal
Currently IPv6 is extremely popular with companies, organizations and Internet service providers (ISP)
due to the limitations of IPv4. In order to prevent an abrupt change from IPv4 to IPv6, three mechanisms
will be used to provide a smooth transition from IPv4 to IPv6 with minimum effect on the network. These
mechanisms are Dual-Stack, Tunnel and Translation. This research will shed the light on IPv4 and IPv6
and assess the automatic and manual transition strategies of the IPv6 by comparing their performances in
order to show how the transition strategy affects network behaviour. The experiment will be executed using
OPNET Modeler that simulates a network containing a Wide Area Network (WAN) , a Local Area Network
(LAN), hosts and servers. The results will be presented in graphs and tables, with further explanation. The
experiment will use different measurements such as throughput, latency (delay), queuing delay, and TCP
delay.
Security analysis of generalized confidentialmodulation for quantum communica...IJCNCJournal
We propose a new evaluation method for‘generalized confidential modulation(GCM)’ for quantum
communication. Confidential modulationrealizes a secret communication by using secret information for
modulationand noise in a channel. Y-00 is one of the famous methods of GCM forquantum communication.
The existing evaluation methods for GCM arebased on stream ciphers. They can estimate its analytical
security andthe evaluation depends on the security status of pseudo random numbergenerator (PRNG)
which controls the modulation. On the other hand,our method is based on mode of operation for block
ciphers and clears theweaknesses from structural viewpoint. Using our method, we can comparethe
security of different GCM structures. Our method of security evaluationand comparison does not depend on
the security status of PRNG.From the results of our evaluation, we conclude that the security of GCMis
limited to computational security.
IMPORTANCE OF REALISTIC MOBILITY MODELS FOR VANET NETWORK SIMULATIONIJCNCJournal
In the performance evaluation of a protocol for a vehicular ad hoc network, the protocol should be tested under a realistic conditions including, representative data traffic models, and realistic movements of the mobile nodes which are the vehicles (i.e., a mobility model). This work is a comparative study between two mobility models that are used in the simulations of vehicular networks, i.e., MOVE (MObility model generator for VEhicular networks) and CityMob, a mobility pattern generator for VANET. We describe several mobility models for VANET simulations.
In this paper we aim to show that the mobility models can significantly affect the simulation results in VANET networks. The results presented in this article prove the importance of choosing a suitable real world scenario for performances studies of routing protocols in this kind of network.
Design, implementation and evaluation of icmp based available network bandwid...IJCNCJournal
We propose a method to measure available network ba
ndwidth using the Internet Control Message
Protocol (ICMP). The recently proposed ImTCP techni
que uses Transmission Control Protocol (TCP) data
packets and the corresponding acknowledgement respo
nses to measure the available bandwidth between
sender and receiver. Since ImTCP needs to change th
e sender’s TCP implementation, it needs
modifications to sender’s operating system kernel.
Moreover, ImTCP cannot measure available bandwidth
accurately if the receiver sends delayed acknowledg
ments. These problems stem from the use of TCP. In
this paper, we discuss an ICMP-based method that ov
ercomes these limitations. We evaluate the
performance of the proposed method in an experiment
al network and show that it generates less
measurement traffic and requires less time for band
width measurement than PathLoad. We also show that
proposed method can measure the available bandwidth
even if the bandwidth changes during
measurement
On modeling controller switch interaction in openflow based sdnsIJCNCJournal
With an increase in number of software defined network (SDN) deployments,and OpenFlow consolidating as the protocol of choice for controller-switch interactions, a need to analytically model the system for performance analysis is increasing. An attempt has previously been made in [1] to model the syste considering both a controller and a switch as an M/M/1 queue. The method, although useful, lacks accuracy for higher probabilities of new flows entering the network. The approach is also deficient of
details on how it can be extended to more than one node in the data plane.These two short-comings are addressed in this paper where thecontroller and switch are modeled
collectively as Jackson’s network, with essential tuning to suit OpenFlow-based SDN. The consequent analysis shows the resilience of the model even for higher number of new flow entries. An example is also used
to illustrate the case of multiple nodes in the data plane.
Energy aware clustering protocol (eacp)IJCNCJournal
The document summarizes an Energy Aware Clustering Protocol (EACP) proposed for heterogeneous wireless sensor networks. EACP introduces heterogeneity by using two types of nodes: normal and advanced. Normal nodes elect cluster heads using a probability scheme based on residual and average energy. Advanced nodes use a separate probability scheme and act as gateways for normal cluster heads, transmitting their data to the base station. The performance of EACP is compared to SEP through simulations, showing better results for stability period, network life and energy savings.
Due to the proliferation in the number of users that are accessing the internet and due to the increase in
the number of the electronic devices that support mobility like mobiles, laptops and many others that
definitely lead to the need of a protocol that supports a mobility. Mobile Internet Protocol is a
recommended Internet protocol designed to support the mobility of a user (host). This protocol provides a
continuous connectivity for any mobile host . In the traditional Mobile IP all packets forwarded to the
Mobile host from the correspondent node will be forwarded via the Home Agent (HA) and that leads to
the triangle routing problem .
(ISP MBG) technique is used as a route optimization technique for solving the triangle routing problem
in conventional Mobile IPv4. This technique has been implemented on .net platform .The study of this
technique was discussed before using 2 similar Internet Service Providers and the simulation results
provided a better performance compared with the Conventional Mobile IP Technique. In this paper the
simulator will be used to study the performance of the (ISP MBG) technique using two different Internet
Service Providers ( ISPs) structures separated by a single Mobile Border Gateway ( MBG).Simulation
results shows also a better performance compared with the conventional Mobile IP technique .
Towards internet of things iots integration of wireless sensor network to clo...IJCNCJournal
Cloud computing provides great benefits for applications hosted on the Web that also have special
computational and storage requirements. This paper proposes an extensible and flexible architecture for
integrating Wireless Sensor Networks with the Cloud. We have used REST based Web services as an
interoperable application layer that can be directly integrated into other application domains for remote
monitoring such as e-health care services, smart homes, or even vehicular area networks (VAN). For proof
of concept, we have implemented a REST based Web services on an IP based low power WSN test bed,
which enables data access from anywhere. The alert feature has also been implemented to notify users via
email or tweets for monitoring data when they exceed values and events of interest.
PERFORMANCE EVALUATION OF THE EFFECT OF NOISE POWER JAMMER ON THE MOBILE BLUE...IJCNCJournal
This document evaluates the effect of noise power jamming on Bluetooth personal area networks (PANs). It finds that barrage noise jamming across the full 79MHz Bluetooth band is ineffective from 10 meters away. Narrower 20MHz and 5MHz sweep jamming can reduce the processing gain over time by causing channels to be blocked by the adaptive frequency hopping (AFH) mechanism. Jamming power levels of 2-5 watts were still insufficient to overcome path loss and processing gain at distances over 1 meter. Future work could evaluate follower jamming techniques targeting the frequency hopping scheme.
A new method for controlling and maintainingIJCNCJournal
Topology Control is an essential technique in a wireless sensor network to extend the operational time of
the sensor nodes. The goal of this technique is to maintain network connectivity and optimize performance
metrics such as network lifetime and throughput. In this paper we presented a new method for controlling
and maintaining topology in wireless sensor networks that show some improvement over the state of art
methods. The results are analyzed based on objective criteria.
Pwm technique to overcome the effect ofIJCNCJournal
Many current communication systems suffer from performance degradation due to the high sensitivity to
high power peaks especially in the nonlinear devices. The author introduces a new concept based on the
Pulse Width Modulation (PWM), namely MIMO-OFDM system based PWM (MO-PWM) to overcome this
deficiency. Here, the peak-to-average power ratio (PAPR) problem in Orthogonal Frequency Division
Multiplexing (OFDM) technique is used as a criterion to check the validity of the proposed work.
Moreover, the proposed system work has been implemented over Field Programmable Gate Array (FPGA),
which is designed to characterize both of the complexity and the speed issues.
The systems performance based MO-PWM and validity have been checked based on a numerical analysis
and a conducted simulation. The simulation results show that the MO-PWM can clearly reduce the PAPR
values nevertheless the used OFDM systems’ specifications, and gives a promising results over some
techniques found in the literature, such as clipping, SLM and PTS under same bandwidth occupancy and
system’s specifications.
Cloud computing challenges and solutionsIJCNCJournal
Cloud computing is an emerging area of computer technology that benefits form the processing power and
the computing resources of many connected, geographically distanced computers connected via Internet.
Cloud computing eliminates the need of having a complete infrastructure of hardware and software to meet
users requirements and applications. It can be thought of or considered as a complete or a partial
outsourcing of hardware and software resources. To access cloud applications, a good Internet connection
and a standard Internet browser are required. Cloud computing has its own drawback from the security
point of view; this paper aims to address most of these threats and their possible solutions.
Correlation based feature selection (cfs) technique to predict student perfro...IJCNCJournal
Education data mining is an emerging stream which h
elps in mining academic data for solving various
types of problems. One of the problems is the selec
tion of a proper academic track. The admission of a
student in engineering college depends on many fact
ors. In this paper we have tried to implement a
classification technique to assist students in pred
icting their success in admission in an engineering
stream.We have analyzed the data set containing inf
ormation about student’s academic as well as socio-
demographic variables, with attributes such as fami
ly pressure, interest, gender, XII marks and CET ra
nk
in entrance examinations and historical data of pre
vious batch of students. Feature selection is a pro
cess
for removing irrelevant and redundant features whic
h will help improve the predictive accuracy of
classifiers. In this paper first we have used featu
re selection attribute algorithms Chi-square.InfoGa
in, and
GainRatio to predict the relevant features. Then we
have applied fast correlation base filter on given
features. Later classification is done using NBTree
, MultilayerPerceptron, NaiveBayes and Instance bas
ed
–K- nearest neighbor. Results showed reduction in c
omputational cost and time and increase in predicti
ve
accuracy for the student model
Adaptive Routing in Wireless Sensor Networks: QoS Optimisation for Enhanced A...M H
The document describes a new routing protocol called Route Optimization and Load-balancing (ROL) for wireless sensor networks. ROL aims to balance several objectives like prolonging network lifetime, providing timely message delivery, and improving network robustness. It uses a combination of routing metrics that can be configured according to application priorities to optimize overall network performance. Simulation results show that ROL maintains balanced cluster sizes and populations, reduces overhead, end-to-end delays, and improves data delivery ratios compared to other protocols like Mires++.
A Professional QoS Provisioning in the Intra Cluster Packet Level Resource Al...GiselleginaGloria
Wireless mesh networking has transpired as a gifted technology for potential broadband wireless access. In a communication network, wireless mesh network plays a vital role in transmission and are structured in a mesh topology. The coordination of mesh routers and mesh clients forms the wireless mesh networks which are routed through the gateways. Wireless mesh networks uses IEEE 802.11 standards and has its wide applications broadband home networking and enterprise networking deployment such as Microsoft wireless mesh and MIT etc. A professional Qos provisioning in intra cluster packet level resource allocation for WMN approach takes power allocation, sub carrier allocation and packet scheduling. This approach combines the merits of a Karush-Kuhn-Tucker (KKT) algorithm and a genetic algorithm (GA) based approach. The KKT algorithm uses uniform power allocation over all the subcarriers, based on the optimal allocation criterion. The genetic algorithm is used to generate useful solutions to optimization and search problems and it is also used for search problems. By combining the intrinsic worth of both the approaches, it facilitates effective QOS provisioning at the packet level. It is concluded that, this approach achieves a preferred stability between system implementation and computational convolution.
ADAPTIVE BANDWIDTH MANAGEMENT MODEL FOR WIRELESS MOBILE AD-HOC NETWORKIJCNCJournal
The quality of service (QoS) component in a mobile ad-hoc network has an active role in the current
network scenario. In a dynamic mobile ad hoc network, ensuring optimum QoS with a scarce network
resource is a significant challenge. To achieve QoS, it is essential to adopt some effective and efficient
mechanisms. We have proposed an adaptive bandwidth manager model (ABMM) which uses a bandwidthsharing concept along with the flexible bandwidth reservation algorithm (FBRA) for an effective, quick and
authentic data transfer. During real-time data transfer, to make communication effective, we make use of
bandwidth-sharing network design problems and the concept of reserving bandwidth in high-performance
networks. In our proposed model we are concentrating on the maximum utilization of resources, and using
the scheduling concept to provide the minimum required bandwidth guarantee to QoS flows. Our goal is to
reduce the delay in data transfer and enhance the throughput while properly utilizing the system resources.
Our simulation result also shows that our model improves the network performance.
Adaptive Bandwidth Management Model for Wireless Mobile Ad-hoc NetworkIJCNCJournal
The quality of service (QoS) component in a mobile ad-hoc network has an active role in the current network scenario. In a dynamic mobile ad hoc network, ensuring optimum QoS with a scarce network resource is a significant challenge. To achieve QoS, it is essential to adopt some effective and efficient mechanisms. We have proposed an adaptive bandwidth manager model (ABMM) which uses a bandwidthsharing concept along with the flexible bandwidth reservation algorithm (FBRA) for an effective, quick and authentic data transfer. During real-time data transfer, to make communication effective, we make use of bandwidth-sharing network design problems and the concept of reserving bandwidth in high-performance networks. In our proposed model we are concentrating on the maximum utilization of resources, and using the scheduling concept to provide the minimum required bandwidth guarantee to QoS flows. Our goal is to reduce the delay in data transfer and enhance the throughput while properly utilizing the system resources. Our simulation result also shows that our model improves the network performance.
Constellation Shared Multiple Access - A Noma Scheme for Increased User Capac...IJCNCJournal
While the legacy cyclic prefix orthogonal frequency division multiple access is retained as the preferred multiple access scheme for 5G enhanced mobile broadband the research is now focussed on the multiple access schemes for massive machine type communication (mMTC) and ultra-reliable low latency communication .Though orthogonal multiple access schemes provide simple reception, they limit number of simultaneous user equipment as against the primary requirement of mMTC. On the other hand, the various non-orthogonal multiple access schemes which have been proposed so far as the likely solution, need complex successive interference cancellation receivers. So a simplified scheme named constellation shared multiple access is proposed here which substantially increases the number of simultaneous users to be served within a single resource block (RB) in LTE or 5G New Radio, thus aiding the massive connectivity requirement of mMTC. This is achieved by differentiating among the users in constellation domain. Moreover, the simple architecture compatible with 5G eMBB makes it a strong contender multiple access contender for 5G mMTC.
CONSTELLATION SHARED MULTIPLE ACCESS - A NOMA SCHEME FOR INCREASED USER CAPAC...IJCNCJournal
While the legacy cyclic prefix orthogonal frequency division multiple access is retained as the preferred
multiple access scheme for 5G enhanced mobile broadband the research is now focussed on the multiple
access schemes for massive machine type communication (mMTC) and ultra-reliable low latency
communication .Though orthogonal multiple access schemes provide simple reception, they limit number
of simultaneous user equipment as against the primary requirement of mMTC. On the other hand, the
various non-orthogonal multiple access schemes which have been proposed so far as the likely solution,
need complex successive interference cancellation receivers. So a simplified scheme named constellation
shared multiple access is proposed here which substantially increases the number of simultaneous users to
be served within a single resource block (RB) in LTE or 5G New Radio, thus aiding the massive
connectivity requirement of mMTC. This is achieved by differentiating among the users in constellation
domain. Moreover, the simple architecture compatible with 5G eMBB makes it a strong contender multiple
access contender for 5G mMTC.
Traffic-aware adaptive server load balancing for softwaredefined networks IJECEIAES
Servers in data center networks handle heterogeneous bulk loads. Load balancing, therefore, plays an important role in optimizing network bandwidth and minimizing response time. A complete knowledge of the current network status is needed to provide a stable load in the network. The process of network status catalog in a traditional network needs additional processing which increases complexity, whereas, in software defined networking, the control plane monitors the overall working of the network continuously. Hence it is decided to propose an efficient load balancing algorithm that adapts SDN. This paper proposes an efficient algorithm TAASLB-traffic-aware adaptive server load balancing to balance the flows to the servers in a data center network. It works based on two parameters, residual bandwidth, and server capacity. It detects the elephant flows and forwards them towards the optimal server where it can be processed quickly. It has been tested with the Mininet simulator and gave considerably better results compared to the existing server load balancing algorithms in the floodlight controller. After experimentation and analysis, it is understood that the method provides comparatively better results than the existing load balancing algorithms.
A comparative analysis on qos multicast routing protocols in MANETsIOSR Journals
Abstract: Simultaneous transmission of data from one sender to multiple receivers is called multicasting.
Several widely used applications require multicasting at least at the logical level. Examples include audio video
teleconferencing, real time video streaming and the maintenance of distributed databases. In many cases it is
advantageous to implement multicasting at the level of the routing algorithm (other approaches would be oneto-all
unicast or the implementation of multicasting at the application layer). In this paper we are presenting a
comparative analysis on various multicast routing protocols in adhoc networks.
Keywords: multicasting, multicast protocols,dynamic core, performance evaluation,Qos Parameters
A Broadband Wireless Access technology known as
Worldwide Interoperability for Microwave Access (WiMAX) is
based on IEEE 802.16 standards. It uses orthogonal frequency
division multiple accesses (OFDMA) as one of its multiple access
technique. Major design factors of OFDMA resource allocation are
scheduling and burst allocation. To calculate the appropriate
dimensions and location of each user’s data so as to construct the
bursts in the downlink subframe, is the responsibility of burst
allocation algorithm. Bursts are calculated in terms of number of
slots for each user. Burst Allocation Algorithm is used to overcome
the resource wastage in the form of unused and unallocated slots per
frame. It affects the Base station performance in mobile WiMAX
systems. In this Paper, HOCSA (Hybrid One Column Striping with
Non Increasing Area) algorithm is proposed to overcome frame
wastage. HOCSA is implemented by improving eOCSA algorithm
and is evaluated using MATLAB. HOCSA achieves significant
reduction of resource wastage per frame, leading to more
exploitation of the WiMAX frame.
A SURVEY ON RESOURCE ALLOCATION IN CLOUD COMPUTINGijccsa
Cloud computing is an on-demand service resource which includes applications to data centers on a
pay-per-use basis. In order to allocate these resources properly and satisfy users’ demands, an efficient
and flexible resource allocation mechanism is needed. Due to increasing user demand, the resource
allocating process has become more challenging and difficult. One of the main focuses of research
scholars is how to develop optimal solutions for this process. In this paper, a literature review on proposed
dynamic resource allocation techniques is introduced.
A SURVEY ON RESOURCE ALLOCATION IN CLOUD COMPUTINGijccsa
Cloud computing is an on-demand service resource which includes applications to data centers on a
pay-per-use basis. In order to allocate these resources properly and satisfy users’ demands, an efficient
and flexible resource allocation mechanism is needed. Due to increasing user demand, the resource
allocating process has become more challenging and difficult. One of the main focuses of research
scholars is how to develop optimal solutions for this process. In this paper, a literature review on proposed
dynamic resource allocation techniques is introduced.
A Survey on Resource Allocation in Cloud Computingneirew J
Cloud computing is an on-demand service resource which includes applications to data centers on a
pay-per-use basis. In order to allocate these resources properly and satisfy users’ demands, an efficient
and flexible resource allocation mechanism is needed. Due to increasing user demand, the resource
allocating process has become more challenging and difficult. One of the main focuses of research
scholars is how to develop optimal solutions for this process. In this paper, a literature review on proposed
dynamic resource allocation techniques is introduced.
Performance Analysis of Wireless Networks With MDQOSIJERA Editor
In Wireless/Mobile networks various kinds of encoding schemes were used for transmission of data over a bandwidth. The desired quality and generated traffic varies with the requirement with this bandwidth. A generic video telephony may require more than 40 kbps whereas a low motion video telephony may require about 25 kbps for data transmission. From the designing point of view these requirements demands for an alternative resource planning, especially for bandwidth allocation in wireless networks. In wireless network where bandwidth is a scare resource, the system may need to block incoming user if all of the bandwidth has been used to provide highest quality of service to existing users. However this bandwidth resource planning may be unacceptable for larger application. A degradable approach to multiple users can be made on bandwidth allocation to reduce the blocking probability without degrading the quality of service to existing users.
This work aims towards a realization of a wireless/mobile network using W-CDMA multi access technique supporting multilevel quality of services. The bandwidth allocation to multiple users is adjusted dynamically according to the required network condition so as to increase bandwidth utilization. The work analyze the performance deriving the degradation period ratio, mean degradation time and degradation state for the implemented wireless network.The proposed work is aim to implement on Matlab tool for its functional verification considering various mobility patterns
Resource usage optimization in cloud based networksDimo Iliev
This document provides a literature review and background research on resource usage optimization in cloud-based networks. It discusses several approaches to optimization including operational optimizations, cloud virtualization, emerging concepts, quality-of-service and service level agreements, traffic differentiation, cloud federation, and resource scheduling. The research aims to develop a prototype solution that combines these approaches and tools to improve efficiency of resource usage in cloud environments.
Clustering based performance improvement strategies for mobile ad hoc netwoIAEME Publication
This document discusses various clustering techniques that can improve performance in mobile ad hoc networks (MANETs). It begins by introducing MANETs and clustering concepts. It then reviews several clustering algorithms including lowest-ID, highest degree, least clustering change, and trust-based clustering. It also discusses clustering based on outlier detection for identifying misbehaving nodes. The document concludes that clustering is an important technique for resource management and routing in MANETs, and that selecting optimal cluster heads is critical to network performance and energy efficiency.
Cross Layer- Performance Enhancement Architecture (CL-PEA) for MANETijcncs
This document summarizes a proposed Cross Layer- Performance Enhancement Architecture (CL-PEA) for mobile ad hoc networks (MANETs). The key points are:
1) Existing TCP/IP architecture is not well-suited for the dynamic topology and limited resources of MANETs. A cross-layer design where all layers can exchange information is proposed to better optimize protocol performance.
2) The proposed CL-PEA adds a new hardware layer where parameters from the hardware, operating system, and other layers can be stored. This allows all layers to access information to make more informed decisions.
3) By exchanging parameters across layers, CL-PEA aims to enhance protocol performance in
MULTI-HOP BANDWIDTH MANAGEMENT PROTOCOL FOR MOBILE AD HOC NETWORKSIJMIT JOURNAL
An admission control scheme should play the role of a coordinator for flows in a data communication network, to provide the guarantees as the medium is shared. The nodes of a wired network can monitor the medium to know the available bandwidth at any point of time. But, in wireless ad hoc networks, a node must consume the bandwidth of neighboring nodes, during a communication. Hence, the consumption of bandwidth by a flow and the availability of resources to any wireless node strictly depend upon the neighboring nodes within its transmission range. We present a scalable and efficient admission control scheme, Multi-hop Bandwidth Management Protocol (MBMP), to support the QoS requirements
in multi-hop ad hoc networks. We simulate several options to design MBMP and compare the performances of these options through mathematical analysis and simulation results, and compare its effectiveness with the existing admission control schemes through extensive simulations.
Load Balancing in Cloud Computing Environment: A Comparative Study of Service...Eswar Publications
Load balancing is a computer networking method to distribute workload across multiple computers or a computer cluster, network links, central processing units, disk drives, or other resources, to achieve optimal resource utilization, maximize throughput, minimize response time, and avoid overload. Using multiple components with load balancing, instead of a single component, may increase reliability through redundancy. The
load balancing service is usually provided by dedicated software or hardware, such as a multilayer switch or a Domain Name System server. In this paper, the existing static algorithms used for simple cloud load balancing have been identified and also a hybrid algorithm for developments in the future is suggested.
Similar to A bandwidth allocation model provisioning framework with autonomic characteristics (20)
Rendezvous Sequence Generation Algorithm for Cognitive Radio Networks in Post...IJCNCJournal
Recent natural disasters have inflicted tremendous damage on humanity, with their scale progressively increasing and leading to numerous casualties. Events such as earthquakes can trigger secondary disasters, such as tsunamis, further complicating the situation by destroying communication infrastructures. This destruction impedes the dissemination of information about secondary disasters and complicates post-disaster rescue efforts. Consequently, there is an urgent demand for technologies capable of substituting for these destroyed communication infrastructures. This paper proposes a technique for generating rendezvous sequences to swiftly reconnect communication infrastructures in post-disaster scenarios. We compare the time required for rendezvous using the proposed technique against existing methods and analyze the average time taken to establish links with the rendezvous technique, discussing its significance. This research presents a novel approach enabling rapid recovery of destroyed communication infrastructures in disaster environments through Cognitive Radio Network (CRN) technology, showcasing the potential to significantly improve disaster response and recovery efforts. The proposed method reduces the time for the rendezvous compared to existing methods, suggesting that it can enhance the efficiency of rescue operations in post-disaster scenarios and contribute to life-saving efforts.
Blockchain Enforced Attribute based Access Control with ZKP for Healthcare Se...IJCNCJournal
The relationship between doctors and patients is reinforced through the expanded communication channels provided by remote healthcare services, resulting in heightened patient satisfaction and loyalty. Nonetheless, the growth of these services is hampered by security and privacy challenges they confront. Additionally, patient electronic health records (EHR) information is dispersed across multiple hospitals in different formats, undermining data sovereignty. It allows any service to assert authority over their EHR, effectively controlling its usage. This paper proposes a blockchain enforced attribute-based access control in healthcare service. To enhance the privacy and data-sovereignty, the proposed system employs attribute-based access control, zero-knowledge proof (ZKP) and blockchain. The role of data within our system is pivotal in defining attributes. These attributes, in turn, form the fundamental basis for access control criteria. Blockchain is used to keep hospital information in public chain but EHR related data in private chain. Furthermore, EHR provides access control by using the attributed based cryptosystem before they are stored in the blockchain. Analysis shows that the proposed system provides data sovereignty with privacy provision based on the attributed based access control.
EECRPSID: Energy-Efficient Cluster-Based Routing Protocol with a Secure Intru...IJCNCJournal
A revolutionary idea that has gained significance in technology for Internet of Things (IoT) networks backed by WSNs is the " Energy-Efficient Cluster-Based Routing Protocol with a Secure Intrusion Detection" (EECRPSID). A WSN-powered IoT infrastructure's hardware foundation is hardware with autonomous sensing capabilities. The significant features of the proposed technology are intelligent environment sensing, independent data collection, and information transfer to connected devices. However, hardware flaws and issues with energy consumption may be to blame for device failures in WSN-assisted IoT networks. This can potentially obstruct the transfer of data. A reliable route significantly reduces data retransmissions, which reduces traffic and conserves energy. The sensor hardware is often widely dispersed by IoT networks that enable WSNs. Data duplication could occur if numerous sensor devices are used to monitor a location. Finding a solution to this issue by using clustering. Clustering lessens network traffic while retaining path dependability compared to the multipath technique. To relieve duplicate data in EECRPSID, we applied the clustering technique. The multipath strategy might make the provided protocol more dependable. Using the EECRPSID algorithm, will reduce the overall energy consumption, minimize the End-to-end delay to 0.14s, achieve a 99.8% Packet Delivery Ratio, and the network's lifespan will be increased. The NS2 simulator is used to run the whole set of simulations. The EECRPSID method has been implemented in NS2, and simulated results indicate that comparing the other three technologies improves the performance measures.
Analysis and Evolution of SHA-1 Algorithm - Analytical TechniqueIJCNCJournal
A 160-bit (20-byte) hash value, sometimes called a message digest, is generated using the SHA-1 (Secure Hash Algorithm 1) hash function in cryptography. This value is commonly represented as 40 hexadecimal digits. It is a Federal Information Processing Standard in the United States and was developed by the National Security Agency. Although it has been cryptographically cracked, the technique is still in widespread usage. In this work, we conduct a detailed and practical analysis of the SHA-1 algorithm's theoretical elements and show how they have been implemented through the use of several different hash configurations.
Optimizing CNN-BiGRU Performance: Mish Activation and Comparative AnalysisIJCNCJournal
Deep learning is currently extensively employed across a range of research domains. The continuous advancements in deep learning techniques contribute to solving intricate challenges. Activation functions (AF) are fundamental components within neural networks, enabling them to capture complex patterns and relationships in the data. By introducing non-linearities, AF empowers neural networks to model and adapt to the diverse and nuanced nature of real-world data, enhancing their ability to make accurate predictions across various tasks. In the context of intrusion detection, the Mish, a recent AF, was implemented in the CNN-BiGRU model, using three datasets: ASNM-TUN, ASNM-CDX, and HOGZILLA. The comparison with Rectified Linear Unit (ReLU), a widely used AF, revealed that Mish outperforms ReLU, showcasing superior performance across the evaluated datasets. This study illuminates the effectiveness of AF in elevating the performance of intrusion detection systems.
An Hybrid Framework OTFS-OFDM Based on Mobile Speed EstimationIJCNCJournal
The Future wireless communication systems face the challenging task of simultaneously providing high-quality service (QoS) and broadband data transmission, while also minimizing power consumption, latency, and system complexity. Although Orthogonal Frequency Division Multiplexing (OFDM) has been widely adopted in 4G and 5G systems, it struggles to cope with a significant delay and Doppler spread in high mobility scenarios. To address these challenges, a novel waveform named Orthogonal Time Frequency Space (OTFS). Designers aim to outperform OFDM by closely aligning signals with the channel behaviour. In this paper, we propose a switching strategy that empowers operators to select the most appropriate waveform based on an estimated speed of the mobile user. This strategy enables the base station to dynamically choose the waveform that best suits the mobile user’s speed. Additionally, we suggest retaining an Integrated Sensing and Communication (ISAC) radar approach for accurate Doppler estimation. This provides precise information to facilitate the waveform selection procedure. By leveraging the switching strategy and harnessing the Doppler estimation capabilities of an ISAC radar.Our proposed approach aims to enhance the performance of wireless communication systems in high mobility cases. Considering the complexity of waveform processing, we introduce an optimized hybrid system that combines OTFS and OFDM, resulting in reduced complexity while still retaining performance benefits.This hybrid system presents a promising solution for improving the performance of wireless communication systems in higher mobility.The simulation results validate the effectiveness of our approach, demonstrating its potential advantages for future wireless communication systems. The effectiveness of the proposed approach is validated by simulation results as it will be illustrated.
Enhanced Traffic Congestion Management with Fog Computing - A Simulation-Base...IJCNCJournal
Accurate latency computation is essential for the Internet of Things (IoT) since the connected devices generate a vast amount of data that is processed on cloud infrastructure. However, the cloud is not an optimal solution. To overcome this issue, fog computing is used to enable processing at the edge while still allowing communication with the cloud. Many applications rely on fog computing, including traffic management. In this paper, an Intelligent Traffic Congestion Mitigation System (ITCMS) is proposed to address traffic congestion in heavily populated smart cities. The proposed system is implemented using fog computing and tested in a crowdedCairo city. The results obtained indicate that the execution time of the simulation is 4,538 seconds, and the delay in the application loop is 49.67 seconds. The paper addresses various issues, including CPU usage, heap memory usage, throughput, and the total average delay, which are essential for evaluating the performance of the ITCMS. Our system model is also compared with other models to assess its performance. A comparison is made using two parameters, namely throughput and the total average delay, between the ITCMS, IOV (Internet of Vehicle), and STL (Seasonal-Trend Decomposition Procedure based on LOESS). Consequently, the results confirm that the proposed system outperforms the others in terms of higher accuracy, lower latency, and improved traffic efficiency.
Rendezvous Sequence Generation Algorithm for Cognitive Radio Networks in Post...IJCNCJournal
Recent natural disasters have inflicted tremendous damage on humanity, with their scale progressively increasing and leading to numerous casualties. Events such as earthquakes can trigger secondary disasters, such as tsunamis, further complicating the situation by destroying communication infrastructures. This destruction impedes the dissemination of information about secondary disasters and complicates post-disaster rescue efforts. Consequently, there is an urgent demand for technologies capable of substituting for these destroyed communication infrastructures. This paper proposes a technique for generating rendezvous sequences to swiftly reconnect communication infrastructures in post-disaster scenarios. We compare the time required for rendezvous using the proposed technique against existing methods and analyze the average time taken to establish links with the rendezvous technique, discussing its significance. This research presents a novel approach enabling rapid recovery of destroyed communication infrastructures in disaster environments through Cognitive Radio Network (CRN) technology, showcasing the potential to significantly improve disaster response and recovery efforts. The proposed method reduces the time for the rendezvous compared to existing methods, suggesting that it can enhance the efficiency of rescue operations in post-disaster scenarios and contribute to life-saving efforts.
Vehicle Ad Hoc Networks (VANETs) have become a viable technology to improve traffic flow and safety on the roads. Due to its effectiveness and scalability, the Wingsuit Search-based Optimised Link State Routing Protocol (WS-OLSR) is frequently used for data distribution in VANETs. However, the selection of MultiPoint Relays (MPRs) plays a pivotal role in WS-OLSR's performance. This paper presents an improved MPR selection algorithm tailored to WS-OLSR, designed to enhance the overall routing efficiency and reduce overhead. The analysis found that the current OLSR protocol has problems such as redundancy of HELLO and TC message packets or failure to update routing information in time, so a WS-OLSR routing protocol based on improved-MPR selection algorithm was proposed. Firstly, factors such as node mobility and link changes are comprehensively considered to reflect network topology changes, and the broadcast cycle of node HELLO messages is controlled through topology changes. Secondly, a new MPR selection algorithm is proposed, considering link stability issues and nodes. Finally, evaluate its effectiveness in terms of packet delivery ratio, end-to-end delay, and control message overhead. Simulation results demonstrate the superior performance of our improved MR selection algorithm when compared to traditional approaches.
May 2024, Volume 16, Number 3 - The International Journal of Computer Network...IJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
Vehicle Ad Hoc Networks (VANETs) have become a viable technology to improve traffic flow and safety on the roads. Due to its effectiveness and scalability, the Wingsuit Search-based Optimised Link State Routing Protocol (WS-OLSR) is frequently used for data distribution in VANETs. However, the selection of MultiPoint Relays (MPRs) plays a pivotal role in WS-OLSR's performance. This paper presents an improved MPR selection algorithm tailored to WS-OLSR, designed to enhance the overall routing efficiency and reduce overhead. The analysis found that the current OLSR protocol has problems such as redundancy of HELLO and TC message packets or failure to update routing information in time, so a WS-OLSR routing protocol based on improved-MPR selection algorithm was proposed. Firstly, factors such as node mobility and link changes are comprehensively considered to reflect network topology changes, and the broadcast cycle of node HELLO messages is controlled through topology changes. Secondly, a new MPR selection algorithm is proposed, considering link stability issues and nodes. Finally, evaluate its effectiveness in terms of packet delivery ratio, end-to-end delay, and control message overhead. Simulation results demonstrate the superior performance of our improved MR selection algorithm when compared to traditional approaches.
A Novel Medium Access Control Strategy for Heterogeneous Traffic in Wireless ...IJCNCJournal
So far, Wireless Body Area Networks (WBANs) have played a pivotal role in driving the development of intelligent healthcare systems with broad applicability across various domains. Each WBAN consists of one or more types of sensors that can be embedded in clothing, attached directly to the body, or even implanted beneath an individual's skin. These sensors typically serve asingle application. However, the traffic generated by each sensor may have distinct requirements. This diversity necessitates a dual approach: tailored treatment based on the specific needs of each traffic typeand the fulfillment of application requirements, such asreliability and timeliness. Never the less, the presence of energy constraints and the unreliable nature of wireless communications make QoS provisioning under such networks a non-trivial task. In this context, the current paper introduces a novel Medium AccessControl (MAC) strategy for the regular traffic applications of WBANs, designed to significantly enhance efficiency when compared to the established MAC protocols IEEE 802.15.4 and IEEE 802.15.6, with a particular focus on improving reliability, timeliness, and energy efficiency.
May_2024 Top 10 Read Articles in Computer Networks & Communications.pdfIJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
A Topology Control Algorithm Taking into Account Energy and Quality of Transm...IJCNCJournal
The efficient use of energy in wireless sensor networks is critical for extending node lifetime. The network topology is one of the factors that have a significant impact on the energy usage at the nodes and the quality of transmission (QoT) in the network. We propose a topology control algorithm for software-defined wireless sensor networks (SDWSNs) in this paper. Our method is to formulate topology control algorithm as a nonlinear programming (NP) problem with the objective to optimizing two metrics, maximum communication range, and desired degree. This NP problem is solved at the SDWSN controller by employing the genetic algorithm (GA) to determine the best topology. The simulation results show that the proposed algorithm outperforms the MaxPower algorithm in terms of average node degree and energy expansion ratio.
Multi-Server user Authentication Scheme for Privacy Preservation with Fuzzy C...IJCNCJournal
The integration of artificial intelligence technology with a scalable Internet of Things (IoT) platform facilitates diverse smart communication services, allowing remote users to access services from anywhere at any time. The multi-server environment within IoT introduces a flexible security service model, enabling users to interact with any server through a single registration. To ensure secure and privacy preservation services for resources, an authentication scheme is essential. Zhao et al. recently introduced a user authentication scheme for the multi-server environment, utilizing passwords and smart cards, claiming resilience against well-known attacks. This paper conducts cryptanalysis on Zhao et al.'s scheme, focusing on denial of service and privacy attacks, revealing a lack of user-friendliness. Subsequently, we propose a new multi-server user authentication scheme for privacy preservation with fuzzy commitment over the IoT environment, addressing the shortcomings of Zhao et al.'s scheme. Formal security verification of the proposed scheme is conducted using the ProVerif simulation tool. Through both formal and informal security analyses, we demonstrate that the proposed scheme is resilient against various known attacks and those identified in Zhao et al.'s scheme.
Advanced Privacy Scheme to Improve Road Safety in Smart Transportation SystemsIJCNCJournal
In -Vehicle Ad-Hoc Network (VANET), vehicles continuously transmit and receive spatiotemporal data with neighboring vehicles, thereby establishing a comprehensive 360-degree traffic awareness system. Vehicular Network safety applications facilitate the transmission of messages between vehicles that are near each other, at regular intervals, enhancing drivers' contextual understanding of the driving environment and significantly improving traffic safety. Privacy schemes in VANETs are vital to safeguard vehicles’ identities and their associated owners or drivers. Privacy schemes prevent unauthorized parties from linking the vehicle's communications to a specific real-world identity by employing techniques such as pseudonyms, randomization, or cryptographic protocols. Nevertheless, these communications frequently contain important vehicle information that malevolent groups could use to Monitor the vehicle over a long period. The acquisition of this shared data has the potential to facilitate the reconstruction of vehicle trajectories, thereby posing a potential risk to the privacy of the driver. Addressing the critical challenge of developing effective and scalable privacy-preserving protocols for communication in vehicle networks is of the highest priority. These protocols aim to reduce the transmission of confidential data while ensuring the required level of communication. This paper aims to propose an Advanced Privacy Vehicle Scheme (APV) that periodically changes pseudonyms to protect vehicle identities and improve privacy. The APV scheme utilizes a concept called the silent period, which involves changing the pseudonym of a vehicle periodically based on the tracking of neighboring vehicles. The pseudonym is a temporary identifier that vehicles use to communicate with each other in a VANET. By changing the pseudonym regularly, the APV scheme makes it difficult for unauthorized entities to link a vehicle's communications to its real-world identity. The proposed APV is compared to the SLOW, RSP, CAPS, and CPN techniques. The data indicates that the efficiency of APV is a better improvement in privacy metrics. It is evident that the AVP offers enhanced safety for vehicles during transportation in the smart city.
April 2024 - Top 10 Read Articles in Computer Networks & CommunicationsIJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
DEF: Deep Ensemble Neural Network Classifier for Android Malware DetectionIJCNCJournal
Malware is one of the threats to security of computer networks and information systems. Since malware instances are available sufficiently, there is increased interest among researchers on usage of Artificial Intelligence (AI). Of late AI-enabled methods such as machine learning (ML) and deep learning paved way for solving many real-world problems. As it is a learning-based approach, accumulated training samples help in improving thequality of training and thus leveraging malware detection accuracy. Existing deep learning methods are focusing on learning-based malware detection systems. However, there is need for improving the state of the art through ensemble approach. Towards this end, in this paper we proposed a framework known as Deep Ensemble Framework (DEF) for automatic malware detection. The framework obtains features from training samples. From given malware instance a grayscale image is generated. There is another process to extract the opcode sequences. Convolutional Neural Network (CNN) and Long Short Term Memory (LSTM) techniques are used to obtain grayscale image and opcode sequence respectively. Afterwards, a stacking ensemble is employed in order to achieve efficient malware detection and classification. Malware samples collected fromthe Internet sources and Microsoft are used for theempirical study. An algorithm known as Ensemble Learning for Automatic Malware Detection (EL-AML) is proposed to realize our framework. Another algorithm named Pre-Process is proposed to assist the EL-AML algorithm for obtaining intermediate features required by CNN and LSTM.Empirical study reveals that our framework outperforms many existing methods in terms of speed-up and accuracy.
High Performance NMF Based Intrusion Detection System for Big Data IOT TrafficIJCNCJournal
With the emergence of smart devices and the Internet of Things (IoT), millions of users connected to the network produce massive network traffic datasets. These vast datasets of network traffic, Big Data are challenging to store, deal with and analyse using a single computer. In this paper we developed parallel implementation using a High Performance Computer (HPC) for the Non-Negative Matrix Factorization technique as an engine for an Intrusion Detection System (HPC-NMF-IDS). The large IoT traffic datasets of order of millions samples are distributed evenly on all the computing cores for both storage and speedup purpose. The distribution of computing tasks involved in the Matrix Factorization takes into account the reduction of the communication cost between the computing cores. The experiments we conducted on the proposed HPC-IDS-NMF give better results than the traditional ML-based intrusion detection systems. We could train the HPC model with datasets of one million samples in only 31 seconds instead of the 40 minutes using one processor), that is a speed up of 87 times. Moreover, we have got an excellent detection accuracy rate of 98% for KDD dataset.
A Novel Medium Access Control Strategy for Heterogeneous Traffic in Wireless ...IJCNCJournal
So far, Wireless Body Area Networks (WBANs) have played a pivotal role in driving the development of intelligent healthcare systems with broad applicability across various domains. Each WBAN consists of one or more types of sensors that can be embedded in clothing, attached directly to the body, or even implanted beneath an individual's skin. These sensors typically serve asingle application. However, the traffic generated by each sensor may have distinct requirements. This diversity necessitates a dual approach: tailored treatment based on the specific needs of each traffic typeand the fulfillment of application requirements, such asreliability and timeliness. Never the less, the presence of energy constraints and the unreliable nature of wireless communications make QoS provisioning under such networks a non-trivial task. In this context, the current paper introduces a novel Medium AccessControl (MAC) strategy for the regular traffic applications of WBANs, designed to significantly enhance efficiency when compared to the established MAC protocols IEEE 802.15.4 and IEEE 802.15.6, with a particular focus on improving reliability, timeliness, and energy efficiency.
TrustArc Webinar - 2024 Global Privacy SurveyTrustArc
How does your privacy program stack up against your peers? What challenges are privacy teams tackling and prioritizing in 2024?
In the fifth annual Global Privacy Benchmarks Survey, we asked over 1,800 global privacy professionals and business executives to share their perspectives on the current state of privacy inside and outside of their organizations. This year’s report focused on emerging areas of importance for privacy and compliance professionals, including considerations and implications of Artificial Intelligence (AI) technologies, building brand trust, and different approaches for achieving higher privacy competence scores.
See how organizational priorities and strategic approaches to data security and privacy are evolving around the globe.
This webinar will review:
- The top 10 privacy insights from the fifth annual Global Privacy Benchmarks Survey
- The top challenges for privacy leaders, practitioners, and organizations in 2024
- Key themes to consider in developing and maintaining your privacy program
HCL Notes und Domino Lizenzkostenreduzierung in der Welt von DLAUpanagenda
Webinar Recording: https://www.panagenda.com/webinars/hcl-notes-und-domino-lizenzkostenreduzierung-in-der-welt-von-dlau/
DLAU und die Lizenzen nach dem CCB- und CCX-Modell sind für viele in der HCL-Community seit letztem Jahr ein heißes Thema. Als Notes- oder Domino-Kunde haben Sie vielleicht mit unerwartet hohen Benutzerzahlen und Lizenzgebühren zu kämpfen. Sie fragen sich vielleicht, wie diese neue Art der Lizenzierung funktioniert und welchen Nutzen sie Ihnen bringt. Vor allem wollen Sie sicherlich Ihr Budget einhalten und Kosten sparen, wo immer möglich. Das verstehen wir und wir möchten Ihnen dabei helfen!
Wir erklären Ihnen, wie Sie häufige Konfigurationsprobleme lösen können, die dazu führen können, dass mehr Benutzer gezählt werden als nötig, und wie Sie überflüssige oder ungenutzte Konten identifizieren und entfernen können, um Geld zu sparen. Es gibt auch einige Ansätze, die zu unnötigen Ausgaben führen können, z. B. wenn ein Personendokument anstelle eines Mail-Ins für geteilte Mailboxen verwendet wird. Wir zeigen Ihnen solche Fälle und deren Lösungen. Und natürlich erklären wir Ihnen das neue Lizenzmodell.
Nehmen Sie an diesem Webinar teil, bei dem HCL-Ambassador Marc Thomas und Gastredner Franz Walder Ihnen diese neue Welt näherbringen. Es vermittelt Ihnen die Tools und das Know-how, um den Überblick zu bewahren. Sie werden in der Lage sein, Ihre Kosten durch eine optimierte Domino-Konfiguration zu reduzieren und auch in Zukunft gering zu halten.
Diese Themen werden behandelt
- Reduzierung der Lizenzkosten durch Auffinden und Beheben von Fehlkonfigurationen und überflüssigen Konten
- Wie funktionieren CCB- und CCX-Lizenzen wirklich?
- Verstehen des DLAU-Tools und wie man es am besten nutzt
- Tipps für häufige Problembereiche, wie z. B. Team-Postfächer, Funktions-/Testbenutzer usw.
- Praxisbeispiele und Best Practices zum sofortigen Umsetzen
AI 101: An Introduction to the Basics and Impact of Artificial IntelligenceIndexBug
Imagine a world where machines not only perform tasks but also learn, adapt, and make decisions. This is the promise of Artificial Intelligence (AI), a technology that's not just enhancing our lives but revolutionizing entire industries.
Let's Integrate MuleSoft RPA, COMPOSER, APM with AWS IDP along with Slackshyamraj55
Discover the seamless integration of RPA (Robotic Process Automation), COMPOSER, and APM with AWS IDP enhanced with Slack notifications. Explore how these technologies converge to streamline workflows, optimize performance, and ensure secure access, all while leveraging the power of AWS IDP and real-time communication via Slack notifications.
Building Production Ready Search Pipelines with Spark and MilvusZilliz
Spark is the widely used ETL tool for processing, indexing and ingesting data to serving stack for search. Milvus is the production-ready open-source vector database. In this talk we will show how to use Spark to process unstructured data to extract vector representations, and push the vectors to Milvus vector database for search serving.
Have you ever been confused by the myriad of choices offered by AWS for hosting a website or an API?
Lambda, Elastic Beanstalk, Lightsail, Amplify, S3 (and more!) can each host websites + APIs. But which one should we choose?
Which one is cheapest? Which one is fastest? Which one will scale to meet our needs?
Join me in this session as we dive into each AWS hosting service to determine which one is best for your scenario and explain why!
Ocean lotus Threat actors project by John Sitima 2024 (1).pptxSitimaJohn
Ocean Lotus cyber threat actors represent a sophisticated, persistent, and politically motivated group that poses a significant risk to organizations and individuals in the Southeast Asian region. Their continuous evolution and adaptability underscore the need for robust cybersecurity measures and international cooperation to identify and mitigate the threats posed by such advanced persistent threat groups.
Generating privacy-protected synthetic data using Secludy and MilvusZilliz
During this demo, the founders of Secludy will demonstrate how their system utilizes Milvus to store and manipulate embeddings for generating privacy-protected synthetic data. Their approach not only maintains the confidentiality of the original data but also enhances the utility and scalability of LLMs under privacy constraints. Attendees, including machine learning engineers, data scientists, and data managers, will witness first-hand how Secludy's integration with Milvus empowers organizations to harness the power of LLMs securely and efficiently.
Unlock the Future of Search with MongoDB Atlas_ Vector Search Unleashed.pdfMalak Abu Hammad
Discover how MongoDB Atlas and vector search technology can revolutionize your application's search capabilities. This comprehensive presentation covers:
* What is Vector Search?
* Importance and benefits of vector search
* Practical use cases across various industries
* Step-by-step implementation guide
* Live demos with code snippets
* Enhancing LLM capabilities with vector search
* Best practices and optimization strategies
Perfect for developers, AI enthusiasts, and tech leaders. Learn how to leverage MongoDB Atlas to deliver highly relevant, context-aware search results, transforming your data retrieval process. Stay ahead in tech innovation and maximize the potential of your applications.
#MongoDB #VectorSearch #AI #SemanticSearch #TechInnovation #DataScience #LLM #MachineLearning #SearchTechnology
5th LF Energy Power Grid Model Meet-up SlidesDanBrown980551
5th Power Grid Model Meet-up
It is with great pleasure that we extend to you an invitation to the 5th Power Grid Model Meet-up, scheduled for 6th June 2024. This event will adopt a hybrid format, allowing participants to join us either through an online Mircosoft Teams session or in person at TU/e located at Den Dolech 2, Eindhoven, Netherlands. The meet-up will be hosted by Eindhoven University of Technology (TU/e), a research university specializing in engineering science & technology.
Power Grid Model
The global energy transition is placing new and unprecedented demands on Distribution System Operators (DSOs). Alongside upgrades to grid capacity, processes such as digitization, capacity optimization, and congestion management are becoming vital for delivering reliable services.
Power Grid Model is an open source project from Linux Foundation Energy and provides a calculation engine that is increasingly essential for DSOs. It offers a standards-based foundation enabling real-time power systems analysis, simulations of electrical power grids, and sophisticated what-if analysis. In addition, it enables in-depth studies and analysis of the electrical power grid’s behavior and performance. This comprehensive model incorporates essential factors such as power generation capacity, electrical losses, voltage levels, power flows, and system stability.
Power Grid Model is currently being applied in a wide variety of use cases, including grid planning, expansion, reliability, and congestion studies. It can also help in analyzing the impact of renewable energy integration, assessing the effects of disturbances or faults, and developing strategies for grid control and optimization.
What to expect
For the upcoming meetup we are organizing, we have an exciting lineup of activities planned:
-Insightful presentations covering two practical applications of the Power Grid Model.
-An update on the latest advancements in Power Grid -Model technology during the first and second quarters of 2024.
-An interactive brainstorming session to discuss and propose new feature requests.
-An opportunity to connect with fellow Power Grid Model enthusiasts and users.
How to Get CNIC Information System with Paksim Ga.pptxdanishmna97
Pakdata Cf is a groundbreaking system designed to streamline and facilitate access to CNIC information. This innovative platform leverages advanced technology to provide users with efficient and secure access to their CNIC details.
How to Interpret Trends in the Kalyan Rajdhani Mix Chart.pdfChart Kalyan
A Mix Chart displays historical data of numbers in a graphical or tabular form. The Kalyan Rajdhani Mix Chart specifically shows the results of a sequence of numbers over different periods.
Salesforce Integration for Bonterra Impact Management (fka Social Solutions A...Jeffrey Haguewood
Sidekick Solutions uses Bonterra Impact Management (fka Social Solutions Apricot) and automation solutions to integrate data for business workflows.
We believe integration and automation are essential to user experience and the promise of efficient work through technology. Automation is the critical ingredient to realizing that full vision. We develop integration products and services for Bonterra Case Management software to support the deployment of automations for a variety of use cases.
This video focuses on integration of Salesforce with Bonterra Impact Management.
Interested in deploying an integration with Salesforce for Bonterra Impact Management? Contact us at sales@sidekicksolutionsllc.com to discuss next steps.
Best 20 SEO Techniques To Improve Website Visibility In SERPPixlogix Infotech
Boost your website's visibility with proven SEO techniques! Our latest blog dives into essential strategies to enhance your online presence, increase traffic, and rank higher on search engines. From keyword optimization to quality content creation, learn how to make your site stand out in the crowded digital landscape. Discover actionable tips and expert insights to elevate your SEO game.
HCL Notes and Domino License Cost Reduction in the World of DLAUpanagenda
Webinar Recording: https://www.panagenda.com/webinars/hcl-notes-and-domino-license-cost-reduction-in-the-world-of-dlau/
The introduction of DLAU and the CCB & CCX licensing model caused quite a stir in the HCL community. As a Notes and Domino customer, you may have faced challenges with unexpected user counts and license costs. You probably have questions on how this new licensing approach works and how to benefit from it. Most importantly, you likely have budget constraints and want to save money where possible. Don’t worry, we can help with all of this!
We’ll show you how to fix common misconfigurations that cause higher-than-expected user counts, and how to identify accounts which you can deactivate to save money. There are also frequent patterns that can cause unnecessary cost, like using a person document instead of a mail-in for shared mailboxes. We’ll provide examples and solutions for those as well. And naturally we’ll explain the new licensing model.
Join HCL Ambassador Marc Thomas in this webinar with a special guest appearance from Franz Walder. It will give you the tools and know-how to stay on top of what is going on with Domino licensing. You will be able lower your cost through an optimized configuration and keep it low going forward.
These topics will be covered
- Reducing license cost by finding and fixing misconfigurations and superfluous accounts
- How do CCB and CCX licenses really work?
- Understanding the DLAU tool and how to best utilize it
- Tips for common problem areas, like team mailboxes, functional/test users, etc
- Practical examples and best practices to implement right away
GraphRAG for Life Science to increase LLM accuracyTomaz Bratanic
GraphRAG for life science domain, where you retriever information from biomedical knowledge graphs using LLMs to increase the accuracy and performance of generated answers
UiPath Test Automation using UiPath Test Suite series, part 6DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 6. In this session, we will cover Test Automation with generative AI and Open AI.
UiPath Test Automation with generative AI and Open AI webinar offers an in-depth exploration of leveraging cutting-edge technologies for test automation within the UiPath platform. Attendees will delve into the integration of generative AI, a test automation solution, with Open AI advanced natural language processing capabilities.
Throughout the session, participants will discover how this synergy empowers testers to automate repetitive tasks, enhance testing accuracy, and expedite the software testing life cycle. Topics covered include the seamless integration process, practical use cases, and the benefits of harnessing AI-driven automation for UiPath testing initiatives. By attending this webinar, testers, and automation professionals can gain valuable insights into harnessing the power of AI to optimize their test automation workflows within the UiPath ecosystem, ultimately driving efficiency and quality in software development processes.
What will you get from this session?
1. Insights into integrating generative AI.
2. Understanding how this integration enhances test automation within the UiPath platform
3. Practical demonstrations
4. Exploration of real-world use cases illustrating the benefits of AI-driven test automation for UiPath
Topics covered:
What is generative AI
Test Automation with generative AI and Open AI.
UiPath integration with generative AI
Speaker:
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
Webinar: Designing a schema for a Data WarehouseFederico Razzoli
Are you new to data warehouses (DWH)? Do you need to check whether your data warehouse follows the best practices for a good design? In both cases, this webinar is for you.
A data warehouse is a central relational database that contains all measurements about a business or an organisation. This data comes from a variety of heterogeneous data sources, which includes databases of any type that back the applications used by the company, data files exported by some applications, or APIs provided by internal or external services.
But designing a data warehouse correctly is a hard task, which requires gathering information about the business processes that need to be analysed in the first place. These processes must be translated into so-called star schemas, which means, denormalised databases where each table represents a dimension or facts.
We will discuss these topics:
- How to gather information about a business;
- Understanding dictionaries and how to identify business entities;
- Dimensions and facts;
- Setting a table granularity;
- Types of facts;
- Types of dimensions;
- Snowflakes and how to avoid them;
- Expanding existing dimensions and facts.
A bandwidth allocation model provisioning framework with autonomic characteristics
1. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.6, November 2013
A BANDWIDTH ALLOCATION MODEL
PROVISIONING FRAMEWORK WITH AUTONOMIC
CHARACTERISTICS
Rafael F. Reale1, Romildo M. da S. Bezerra2 and Joberto S. B. Martins3
1
Federal Institute of Bahia (IFBA) - Brazil
Federal Institute of Bahia (IFBA) - Brazil
3
Computer Networks Research Group (NUPERC) - Salvador University (UNIFACS) - Brazil
2
ABSTRACT
The Bandwidth Allocation Models (MAM, RDM, G-RDM and AllocTC-Sharing) are management
alternatives currently available which propose different resource (bandwidth) allocation strategies in
multiservice networks. The BAM adoption by a network is typically a management choice and
configuration task executed by the network operations and management system setup in a static or nearly
static way. This paper proposes and explores the alternative of allowing BAM definition and configuration
on a more dynamic way. In effect, one of the basic motivations towards BAM dynamic allocation is the fact
that multiservice networks characteristics (traffic load) may change considerably in daily network
operation and, as such, some dynamics in BAM allocation should be introduced in order to improve
performance. A framework is presented supporting BAM dynamic allocation. The framework adopts an
OpenFlow-based software-defined networking (SDN) implementation approach in order to support
scalability issues with a centralized controller and management network view. The framework architecture
also supports the implementation of some autonomic characteristics which, in brief, look for improving and
facilitating the decision-making process involved with BAM provisioning in a multiservice network. A
proof of concept is presented evaluating different BAM performance under different traffic loads in order to
demonstrate the framework strategy adopted.
KEYWORDS
Bandwidth Allocation Models (BAM), Autonomic Management, Software Defined Networking (SDN),
OpenFlow, Resource Provisioning, MAM, RDM, G-RDM, AllocTC-Sharing.
1. INTRODUCTION
The multiservice networks are a class of computer network infrastructure in which several
services and applications are integrated. Multiservice networks use a common network
infrastructure and enable a more efficient use of network resources. In recent years there has been
a rapid increase in the number of multimedia applications running over IP creating a significant
variety of new services and applications, typical of a multiservice network. These new
applications and services require some guarantee of quality of service (QoS) which are usually
defined in Service Level Agreements (SLAs)[1]. The scarcity of resources and/or dynamics of the
traffic generate conflicts when provisioning resources, e.g. bandwidth, in the operation of a
multiservice network. As such one important and challenging aspect of the multiservice networks
consists in modeling and provisioning the available resources such as bandwidth and routes
among others.
This paper presents a framework which supports the provisioning of BAMs in a network,
typically multiservice, with autonomic characteristics. The main motivation behind the
framework and architectural decisions adopted is the need for a more dynamic management
DOI : 10.5121/ijcnc.2013.5606
103
2. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.6, November 2013
solution for this area, considering that networks will continue to evolve with hundreds of possible
multimedia applications with distinct SLAs and thousands of users which, in principle, want the
best possible support from the network in all scenarios. In brief, an ongoing effective and
complex management challenge. The framework, in terms of its implementation, also explores
the new paradigm provided by OpenFlow and SDN, by adopting this protocol as the basis for
communication between the framework and equipment on the network.
The paper is organized as follows. In section 2 are summarized the basic Bandwidth Allocation
Models currently available. Section 3 and 4 present the motivation and problem discussion in
relation to the management of BAMs in a multiservice network. Section 5 details the architecture
and functionalities of a framework under development supporting the BAM provisioning. Section
6 discuss the OpenFlow-based framework implementation and section 7 presents a comparative
evaluation of BAM models in order to demonstrate the need of the framework for BAM
provisioning. Concluding remarks are presented in section 6.
2. BANDWIDTH ALLOCATION MODELS (BAM)
One of the techniques that may be used to define rules and limits for link utilization for flow
aggregates (traffic classes - TCs) is the Bandwidth Allocation Model (BAM).
The bandwidth allocation model (BAM) defines the rules that result in granting, blocking or
preemption of a flow on a particular link. These models are associated and depend on the path
selection algorithm (OSPF, CSPF, other) which defines the links in a path used by all flows. An
adequate choice of the bandwidth allocation model can directly lead to an improved performance
of the network as a whole as well as in meeting QoS requirements defined the SLAs.
There are alternative bandwidth allocation models such as: the Maximum Allocation Model
(MAM), Russian Doll Model (RDM), Generalized-RDM (RDM-G) and AllocTC-sharing that
will be shortly described next.
2.1 Maximum Allocation Model (MAM)
The Maximum Allocation Model (MAM) is the basic BAM model. Its main objective is to
reserve a maximum bandwidth for each traffic class (TC) by mapping a bandwidth constraint
(BC) to the traffic classes (TCs)[5].
MAM model can be described as follows:
1) For each Traffic Class "TCi" where "M" is the maximum reservable bandwidth on link and
"Ni" is the bandwidth allocated for TC have:
Ni ≤ BCi ≤ M
2) With the restrictions, the total bandwidth allocated by the TCs may not exceed the link
capacity:
In this way, the sum of the total allocated bandwidth occupied by flow (Ni) of a particular TC
should always be less than or equal to the maximum bandwidth constraint (BC) associated with
this TC for a particular link. Moreover, the sum of bandwidth allocations of TCs always
corresponds to the bandwidth available for allocation on link considered (Figure 1).
104
3. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.6, November 2013
Figure 1. Maximum Allocation Model (MAM)
The inherent advantage of MAM Model is the total isolation between traffic of different TCs.
2.2 Russian Doll Model (RDM)
The RDM model upgrade in relation to MAM model corresponds briefly in allowing the sharing
of non-used bandwidth allocated for high-priority classes by low-priority classes (Figure 2)[4].
As such, free bandwidth allocated by the manager to higher priority classes (applications) can be
temporarily used by lower priority classes (applications).
Figure 2. Russian Dolls Model (RDM)
In general RDM leads to an improved link utilization and optimization when compared with
MAM model [12].
2.3 G-RDM
The Generalized-RDM (G-RDM) model is in effect an MAM and RDM hybrid by proposing to
join the best of both models [2]. G-RDM creates the concept of shared bandwidth and private
bandwidth for TCs. The private bandwidth (pools) form the reserved bandwidth class that uses
MAM model and, as such, cannot be shared by other TCs. Common bandwidth pools are shared
by TCs accordingly with the RDM model (Figure 3).
105
4. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.6, November 2013
Figure 3. G-RDM (Generalized-RDM)
2.4 AllocTC-Sharing
The AllocTC-Sharing is another bandwidth allocation model in which all the available bandwidth
is shared opportunistically among traffic classes (TCs)[9].
The AllocTC-Sharing model implements two integrated styles of sharing bandwidth (Figure 4 and
Figure 5):
•
•
Sharing "high-to-low" (high-to-low - HTL) and
Sharing "low-to-high" (low-to-high - LTH).
Sharing "high-to-low" is the classic style of sharing used in networking applications and follows
RDM model As such, unused bandwidth reserved for flows in high-priority classes are
temporarily allocated to applications in lower priority classes.
Sharing "low-to-high" allows flows of high-priority class to allocate unused bandwidth reserved
for flows of low-priority classes. This particular strategy is called "bandwidth loan".
In both styles AllocTC-Sharing uses a control mechanism to preserve the bandwidth restrictions
set for the links. The "high-to-low" sharing makes use of “preemption” to comply with these
constraints and the "low-to-high" sharing makes use of “devolution” (loan devolution).
Figure 4. AllocTC-Sharing “High-to-Low” Bandwidth Allocation
106
5. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.6, November 2013
Figure 5. AllocTC-Sharing “Low-to-High” Bandwidth Allocation
Figure 6.
3. MOTIVATION - BANDWIDTH ALLOCATION MODELS IN NETWORKS WITH
DYNAMIC CHARACTERISTICS
Over the years, computer networks were designed as a set of devices centrally coordinated by the
global vision of a manager or network administrator. The manager is responsible for maintaining
the operation of the infrastructure, usually complex, with heterogeneous device capabilities
which, in turn, support services and applications with different SLAs.
The complexity of network equipment management coupled with the growing need for service
availability, directly impacts the efficiency of managers and administrators [3]. Typically, a high
level of expertise and efficiency is required and this can make the human intervention a point of
failure. Moreover, the operational cost is affected since, normally, a larger search time is
necessary for obtaining solutions to the problems presented for the network manager and support
system. Another relevant factor in this context is the need for a large amount of expertise by
administrators for the effective management of complex environments.
In this same context, the bandwidth allocation models (BAMs) constitute an important and
necessary functionality for network management [11]. The adoption and / or use of a specific
bandwidth allocation model (MAM, RDM, G-RDM, AllocTC-Sharing, other) by the network
requires constant monitoring of network parameters and administrators with high degree of
expertise. In fact, the correct choice of a model and its correct configuration directly imply in
compliance or not with quality of service (QoS) requirements defined by SLAs (Service Level
Agreement).
The first challenge for the network administrator is to define the best bandwidth allocation model
in relation to QoS requirements considering the entire network and links individually. After this
step, which requires expertise in relation to the existing models and their operation, is necessary
to configure the BAM operation by setting parameters and aspects such as the number of classes,
flows that are associated with each class and restrictions of bandwidth for each class, among
others parameters.
The decision about the bandwidth allocation model adopted is taken, usually according to the
actual network baseline and, typically, decisions and resulting configurations have a static
107
6. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.6, November 2013
characteristic, as far as it is only adjusted when the administrator network decides it is necessary.
We have then a scenario of complex decision in a network management structure that is nearstatic.
In general, we understand that computer network management should be more dynamic and,
moreover, that the history of the network operation, your current scenario and its future
projection should be taken into account in deciding about the bandwidth allocation model adopted
and its parameters [3][6].
Regarding the dynamics of the network, we argue that reconfiguration should be dynamic and, to
the extent possible, "on-the-fly" so that the BAM provisioning with its parameters can evolve
with the operational state of the network.
4. THE PROBLEM OF CHOOSING BANDWIDTH ALLOCATION MODELS IN
MULTISERVICE NETWORK
Each bandwidth allocation model has some particular characteristics, optimizing network
performance metrics, such as: link utilization, number of preemptions, new flow allocation
blocking probability and number of flows treated, among others.
Thus, the administrator´s choice towards a specific bandwidth allocation model mechanism
adoption for a multiservice network must consider, minimally, two technical issues:
•
•
The BAM inherent technical characteristics and optimization focus which, in turn, may
define its applicability or not depending of the network management requirements
considered, and
The characterization of the multiservice traffic allocated in the network.
These technical aspects are further discussed in the next section.
4.1 Technical and Optimization Characteristics of Bandwidth Allocation Models
(BAM)
The choice of a bandwidth allocation model and its configuration parameters is directly related to
the inherent technical characteristics of the BAM adopted and, in addition, strongly depends of
traffic profile resulting from the applications running on the network.
The MAM model is indicated when we have a network traffic profile where “application classes”
(Traffic Classes – TCs) do not affect each other significantly. As can be seen in Table I, the
model does not admit any bandwidth sharing between classes ("high to low" or "low to high").
Another aspect to consider is that the adoption of the MAM model may imply in low link
utilization and high number of flow blocking. That occurs since the available resources (not
allocated per TC) cannot be shared by definition among classes in MAM´s model (full isolation
between TCs).
The RDM model has as its basic characteristics the sharing of unallocated bandwidth resources
unused by high-priority applications by low-priority applications (Table I). Thus, the RDM model
is mostly suitable for networks with a traffic profile in which the low-priority applications can
benefit from idle bandwidth that would be normally allocated for high-priority applications. In
situations where the dynamics of network leads the high-priority applications bandwidth demand
to exceed its configured capacity, new flows are blocked, even when there is bandwidth for lowpriority applications. As such, link utilization is not maximized with this BAM.
108
7. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.6, November 2013
The G-RDM model basic characteristics is to preserve MAM modeling for a reserved pool of
resources (private pool) and used the RDM modeling approach for another set of allocated
bandwidth resources (common pool). The G-RDM model can be consequently applied in both
scenarios of traffic profile suitable for MAM and RDM. The difference in relation to each
individual model is that the G-RDM bandwidth sharing is partial (part of the bandwidth resources
allocated per link by the manager).
The AllocTC-sharing model as its basic characteristics the simultaneous support for both highpriority and low-priority traffic classes (TCs). In effect, the model attempts to use the available
link capacity in both directions ("high to low" and "low to high") in order to maximize link
utilization. AllocTC-sharing model has as its main disadvantage the need to return borrowed
bandwidth (in both senses). Since high-priority TCs may use bandwidth borrowed from lowpriority TCs, high-priority application may be preempted. As such, this model is most suitable for
elastic and bandwidth eager high-priority applications.
Table 1. Technical Characteristics Comparison of Bandwidth Allocation Models
MAM, RDM, AllocTC-Sharing and G-RDM
BAM Characteristics
MAM
RDM
yes
no
AllocTCSharing
yes
yes
Sharing from “high to low”
Sharing from “low to high”
Efficient bandwidth utilization
with high traffic (low priority)
Efficient bandwidth utilization
with high traffic (high priority)
Isolation between TCs
no
no
GRDM
partial
no
low
high
high
medium
low
low
high
low
high
medium
low
medium
4.2 Multiservice Traffic Characteristics
The multiservice network traffic characterization has been studied and discussed in the literature
and, for the purpose of discussing BAM evaluation impacts, it has the following basic
characteristics: dynamic, asymmetrical and multi-path.
The dynamic characteristic of network traffic results from multiple applications running on top of
the network with different SLAs. Beyond that, each individual application´s traffic profile may
change from time to time: day/night, week/weekend, holidays, others. Application’s traffic is,
most of the time, asymmetric due to client-server characteristics of traffic and, finally,
applications make use normally of multi-path links and/or trajectories (paths).
With respect to the allocation of traffic per link which is the focus of BAM models, the nonuniform traffic per link must be considered. Non-uniform traffic per link means that it is usual to
have very different traffic profiles for each individual link. This characteristic implies on the need
to consider the BAM mechanism which is provisioning bandwidth for applications not only at
network level but also at link level.
4.3 Why Dynamic BAM Utilization
Networks and their traffic profile are dynamic. In turn, distinct bandwidth allocation models are
suitable for different traffic profile. As such, BAMs used by the network should also be
dynamically defined, provisioned and configured in order to evolve with the actual dynamics of
the network.
109
8. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.6, November 2013
As such it is necessary to have a framework with the capability to dynamically decide which
bandwidth allocation model is currently adequate for a given network traffic state. Furthermore,
to the extent that the decision-making process involves many parameters and on-the-fly
computing, to incorporate some autonomic characteristics in the framework is also desirable. In
doing this we get a more robust and less susceptible to errors solution even in the scenario of
dynamic and complex decision making.
Another aspect inherent in the realization of a framework with autonomic features is the choice of
the architecture adopted for the decision making process. In the proposed framework, we will
focus on the choice of a bandwidth allocation model that considers the entire network as its traffic
scenario. As such, we choose an architecture in which the network intelligence is centralized in
terms of the framework. In effect, the framework maintains a global view of the network and
management control is maintained in a single logical element (centralized management). This
allows, rather than configuring each device separately, abstracting the network as a whole through
the framework.
5. A FRAMEWORK FOR SELECTION
ALLOCATION MODELS (BAM)
AND
PROVISIONING
OF
BANDWIDTH
The framework for selection of Bandwidth Allocation Models (BAM) is composed by four basic
functional modules: Monitoring Module, Knowledge Module, Execution Module and a database
as presented in Figure 6.
Figure 7. Framework for Selection and Provisioning of Bandwidth Allocation Models
The functional structure of the framework for selection and provisioning of BAM incorporates the
basic elements of an autonomic architecture[7][10]. In effect, the framework is capable of
applying knowledge based on the network’s state (present or past) and then it can define actions
(in this case, a BAM selection) to be executed over the network. Therefore, the framework
incorporates autonomics characteristics that can be explored on behalf of the implementation of
the management plane supporting diverse functionalities.
Regarding the functional modules of the framework, the main function of the Monitoring Module
(Figure 7) is to collect relevant network state information and store it at the framework’s
database. The monitored network state is used by the Knowledge Module for the decision making
process regarding BAM option decision and provisioning. Internal actions performed by the
Monitoring Model include a standard XML representation of network state and parameters and
the analysis of current state in relation to defined SLAs which actually express the user
requirements. This module functionality includes, among others, SLA conformance verification,
network state evolution identification and alerts generation.
110
9. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.6, November 2013
Figure 8. Monitoring Module
The basic functionality of the Knowledge Module (Figure 8) is to introduce autonomic
characteristics in the framework in order to replace or minimize, at least partially, the direct
human intervention (G). The Knowledge Module deals with the definition of the path selection
algorithm (B), the bandwidth allocation model (C), focus of this paper, and other configuration
parameters involved. The module also includes an analysis of the network state and verifies the
network performance as required by the administrator. The Knowledge Modules intervention at
framework level might be trigged through an alert sent by the Monitoring Module or may be
programmed to be executed periodically by the network manager. The “actions” over the network
computed and defined by this module are executed by the Execution Module.
Figure 9. Knowledge Module
The Execution Module, as the name suggests, is responsible by the effective execution of the
management control actions over the network and its equipment (Figure 9). In effect, this module
maps the defined actions (A) and generates effective rules (B) that are applied (executed) over the
network using possibly different deployment mechanisms. The architectural decision for this
framework was to adopt OpenFlow as the basic mechanism to enforce rules and actions to the
network (section VI).
111
10. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.6, November 2013
Figure 10. Execution Module.
The framework database module is a persistent repository that stores the network state acquired
by the Monitoring Module (established flows, link utilization, other). The database also stores
other relevant data for processing such as network topology and configuration parameters such as
link capacity, customers SLAs, path selection algorithms, BAM algorithms, network relevant logs
and network state history, among others.
6. FRAMEWORK WITH OPENFLOW DEPLOYMENT
Software-defined networking (SDN) is a new computational paradigm that enables not only the
possibility of developing new network architectures but also supports the solution of specific
network and management problems [9].
SDN’s architecture adopts fundamentally the separation between control and data plane. The
control plane, itself, is programmable by software and, considering network management, allows
a more easy abstraction of network’s infrastructure due to the centralized approach normally
adopted by the OpenFlow controller involved [8].
The incorporation of OpenFlow to the framework was an architectural decision with the main
objective to allow centralized and software-defined control of management actions. The
deployment is realized through the adoption of a new framework element, the OpenFlow
controller (Figure 10) between the framework and managed network elements. In terms of the
framework, the rules generated by the Knowledge Module are effectively mapped to OpenFlow
flow rules and executed at different equipment used on the network.
The OpenFlow protocol supports the framework operation by intercepting new flow setup
requests (flow establishment process). Beyond that, OpenFlow protocol supports all management
control functionalities related to network equipment in a centralized way.
112
11. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.6, November 2013
Figure 11. Framework with OpenFlow
7. BAM EVALUATION FOR DIFFERENT TRAFFIC PROFILES
This section presents a proof of concept which evaluates the behavior of MAM, RDM and
AllocTC-Sharing for different traffic profiles. The objective is to demonstrate that the resulting
performance of the network may vary with the utilization of different bandwidth allocation
models in different network traffic conditions. As such, it might be recommended to adopt
distinct bandwidth allocation models for different network traffic profiles.
Two network traffic profiles (scenarios) with opposite traffic characteristics are evaluated for
MAM, RDM and AllocTC-Sharing and the algorithms are compared in relation to their
performance.
The performance evaluation used a network topology with one source of traffic (S1) and one
destination (D) (Figure 11). CSPF (Constrained Shortest Path First) algorithm was used for path
selection.
Figure 12. Network Topology – BAM Performance Comparison
Each scenario was simulated with 05 random seeds and the results are presented in terms of the
mean value obtained (confidence interval of 95%).
113
12. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.6, November 2013
The configuration parameters of the simulation scenarios are as follows:
Links: 622 Mbps (STM-4 – SDH)
Traffic Classes (TCs): TC0, TC1 e TC2
Bandwidth Constraint (BCs) according Table 2
•
•
•
Table 2. Bandwidth Allocation per Traffic Class (TC)
BCs
Max BC
(%)
MAX BC
( Mbps)
TC per BC
Max BC MAX BC CT per BC
(%)
( Mbps)
RDM and AllocTC-Sharing
BC0 100
BC1 80
BC2 45
622
497,6
279,9
MAM
TC0+TC1+TC2
TC1+TC2
TC2
20
35
45
124,4
217,7
279,9
TC0
TC1
TC2
In the evaluation scenario 01, the BAM models were compared for a network traffic profile in
which there was more traffic (flows) injected in the network for high priority classes (highpriority TCs). In the evaluation scenario 02, the BAM models were compared in an opposite
situation where there was more traffic (flows) for the low-priority classes (low-priority TCs).
The following performance parameters were compared for the BAM models:
•
•
•
•
Number of preemptions;
Number of blocked flows (blocking);
Number of devolutions; and
Link utilization per TC.
The basic simulation parameters were:
•
•
•
•
Flow – flow setup duration modeled exponentially – mean of 220 seconds; leads to link
saturation;
Flow bandwidth – uniform distribution between 05 Mbps e 25 Mbps and
Flow number – 1.000
Flow requests - Inter-arrival interval modeled exponentially with the following values
Table 3. Flow Request Inter-Arrival Interval per Scenario and TC
TC0
TC1
TC2
Scenario 01
1s
2s
3s
Scenario 02
3s
2s
1s
It follows an evaluation of the simulation results in relation to each evaluation parameter adopted.
114
13. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.6, November 2013
Figure 13. Preemptions
In relation to the number of preemptions resulting from BAM utilization (Figure 12), we observe
that the MAM algorithm has the best performance (zero preemption). This result is obvious since
MAM does not support any sharing or loan among TCs and, as such, preemptions will never
occur. In management terms, this could be a requirement existing in a network. When considering
the models RDM and AllocTC-Sharing, which either share or loan bandwidth among TCs, we
observe that AllocTC-Sharing generates a smaller number of preemptions for both traffic
scenarios.
115
14. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.6, November 2013
Figure 14. Blocking
In relation to the number of flow setup requests not granted (blocking) (Figure 13), we observe
that the MAM algorithm has the worst performance as far as it does not share or loan bandwidth
among TCs. In effect, with the increased number of flows setup in the network, the blocking for
new flows occurs more frequently. For scenario 01 in which there is a greater number of highpriority flows, we observe a better performance of AllocTC-Sharing model in relation to RDM
model. For scenario 02 in which there is a greater number of low-priority flows, we observe that
RDM model has a better performance. As such, in a network in which the minimization of
blocking could represent a requirement AllocTC-Sharing and RDM could be options for different
network scenarios (01 and 02).
116
15. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.6, November 2013
Figure 15. Devolution by TC.
As indicated in section II, the strategy of temporary bandwidth loan from low-priority TCs by
high-priority TCs is exclusive of AllocTC-Sharing model. As such, only this model is evaluated
in relation to the parameter “bandwidth/ loan devolution” or, in brief, devolution. The evaluation
shows that the devolution increases with the number of flows setup for both scenarios. We
observe that the scenario 01 has a greater number of “devolutions”. In this case, we have a greater
number of high-priority flows which take bandwidth from low-priority TCs. As far as the number
of established flows increase, leading to link saturation, high-priority flows have to liberate their
loans on behalf of low-priority classes. This result shows that the loan strategy providing
available low-priority bandwidth for high-priority traffic works better only with a small number
of low-priority flows. In case the management does not accept bandwidth devolution, the
AllocTC-Sharing is not recommended.
117
16. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.6, November 2013
Figure 16. Link utilization
In relation to link utilization (Figure 15), we observe that the AllocTC-Sharing has the best
performance and the MAM model presents the worst performance. With the increase of the
number of established flows near link and TC saturation, we observe that the models present a
similar performance.
8. CONCLUSION
The problem of Bandwidth Allocation Model (BAM) provisioning in multiservice networks was
addressed in this paper considering the variability of traffic profile inherent for this type of
network. A framework under development was presented aiming to support the provisioning of
different BAMs for distinct networking traffic scenarios with autonomic and dynamic
characteristics. The autonomic characteristic inherent to the framework is intended to improve
and facilitate the decision-making process involved with BAM provisioning in multiservice
networks.
The framework adopts a centralized management strategy based on OpenFlow in a Software
Defined Networking (SDN) implementation style, allowing a uniform and centralized view of the
network, its resources and management control actions. Flow rules according with the BAM
currently provisioned by the framework are generated and applied to the network by making use
of the OpenFlow protocol.
In order to demonstrate the effective need of a OpenFlow-based framework with more dynamic
BAM choice, the behaviour of three bandwidth allocation models was evaluated in relation to
performance parameters like number of preemptions, flows blocking, bandwidth devolution and
link utilization. The obtained results point to the need to allocate distinct BAMs for different
network scenarios.
118
17. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.6, November 2013
9. REFERENCES
[1]
J. Martins, S. Aidarous, T. Plevyak et al, “Managing IP networks: challenges and opportunities”,
Willey -IEEE Press, September 2003.
[2] Adami, C. Callegari, S. Giordano M. Pagano and M. Toninelli, “G-RDM: a New Bandwidth
Constraints Model for DS-TE networks”, Proceedings of IEEE GLOBECOM 2007.
[3] Bezerra, R. M. S. ; Martins, J. S. B. . “A Sense and React Plane Structured Autonomic Model Suitable
for Quality of Service (QoS) Management”. In: 5th International IEEE Workshop on Management of
Ubiquitous Communications and Services, 2008, Salvador. 5th International IEEE Workshop on
Management of Ubiquitous Communications and Services, 2008.
[4] F. Le Faucheur (a), "Russian dolls bandwidth constraints model for DiffServ-aware MPLS traffic
engineering", IETF, RFC 4127, June 2005.
[5] F. Le Faucheur and W. Lai, " Maximum allocation bandwidth constraints model for DiffServ-aware
MPLS traffic engineering", IETF, RFC 4125, June 2005.
[6] F. Le Faucheur and W. Lai, "Requirements for support of differentiated services-aware MPLS traffic
engineering", IETF, RFC 3564, July 2003.
[7] N. Samaan and A. Karmouch, “Towards autonomic network management: An analysis of current
and future research
directions,” IEEE Communications Surveys Tutorials, vol. 11, no. 3,
pp.
22–36,
2009.
[Online].
Available:
ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=5208731
[8] Nick McKeown, Tom Anderson, Hari Balakrishnan, Guru Parulkar, Larry Peterson, Jennifer Rexford,
Scott Shenker, and Jonathan Turner. 2008. “OpenFlow: enabling innovation in campus networks”.
SIGCOMM Comput. Commun. Rev. 38, 2 (March 2008), 69-74.
[9] Reale, R.F.; da C P Neto, W.; Martins, J. S B, "Routing in DS-TE networks with an opportunistic
bandwidth allocation model," Proceedings of the 17th IEEE Symposium on Computers and
Communications (ISCC) , Cappadocia, Turkey, 2012.
[10] Subharthi Paul, Jianli Pan, and Raj Jain. 2011. “Architectures for the future networks and the next
generation Internet: A survey”. Comput. Commun. 34, 1 (January 2011), 2-42.
[11] W. Lai, "Bandwidth constraints models for DiffServ-aware MPLS Traffic Engineering: Performance
Evaluation", IETF, RFC 4128, June 2005.
[12] W. Pinto Neto and J. Martins, "A RDM-like Bandwidth Management Algorithm for Traffic
Engineering with DiffServ and MPLS Support", Proceedings of the 15th International Conference on
Telecommunications - ICT, St. Petersburg, Russia, 2008a.
Authors
PhD student in Computer Science by DMCC (UFBA/UNIFACS/UEFS), Masters in Computer
and Systems by Salvador University - UNIFACS (2011) and graduation in Informatics by
Universidade Católica do Salvador (2005). Teaches at Instituto Federal da Bahia - Campus
Valença. Has being working in Computer Science with emphasis in computer networks in
topics like: Bandwidth Allocation M odel (MAM, RDM, G-RDM, AllocTC-Sharing, ..),
MPLS, MPLS-TE, DS-TE, Autonomy, QoS, Future Internet and Software Defined Networks.
PhD in Computer Science by PMCC (UFBA/UNIFACS/UEFS) (2012), Masters in Computer
and Systems by Salvador University – UNIFACS (2005), graduated in Computer Science by
Universidade Federal da Bahia (2001). Professor at Instituto Federal de Educação, Ciência e
Tecnologia da Bahia (IFBA) and research leader of GSORT - Grupo de Sistemas
Distribuídos, Otimização, Redes e Tempo Real (http://www.gsort.ifba.edu.br). Has
experience in Computer Science with focus on network management and is involved in security and
distance learning projects. Further details at: http://www.romildo.net.
Graduate at Federal University of Paraiba (1977) - Brazil, Masters from Technische
Universiteit Eindhoven (TUE)/ NUFFIC (1979) - Holland and Ph.D. from Université Pierre
et Marie Curie – UPMC (1986) - France. Has extensive experience in computer science,
teaching and researching on innovative areas such as Future Internet, OpenFlow &
Virtualization, Quality of Service, Ubiquitous Com puting and Autonomic Management.
Currently, invited Professor at HTW - Hochschule für Techknik und Wirtschaft des Saarlandes – Germany
and Université d´Evry – France.
119