In this paper, we have proposed a fuzzy based decision making component for high volume traffic MPLS
networks, by implementing Traffic Engineering, Quality of Service and Multipath routing. The approach
explicitly proves to be successful in solving the issues and challenges pertaining to stability, scalability in
high volume and dynamic traffic. Furthermore, it will work to handle congestion by higher link utilization
and provides efficient rerouting of traffic along with fault tolerance in the network. In this research work,
fuzzy calculations are done for fixing the attributes of the MPLS label(s), which is put on particular packet
representing the Forwarding Equivalence Class. Fuzzy controller consists of two sub fuzzy systems- Label
Switched Path setup System (LsS) and Traffic Splitting System (TSS). The computation of dynamic status of
Load and Delay is utilized by LsS to arrange the paths in preference order. The attained Link Capacity and
Utilization Rate are employing by TSS for maintaining congestion free path. The impact of this is to
facilitate, we have better decision making for splitting the traffic for different promising paths. This was
apparent from the series of traffic scenarios. Observations are obtained using this realization.
Traffic Engineering and Quality of Experience in MPLS Network by Fuzzy Logic ...IJERA Editor
This paper proposes a load balancing algorithm using fuzzy logic so that maximum Quality of Experience can
be achieved. Avoidance of congestion is one of the major performance objectives of traffic engineering in
MPLS networks. Load balancing can prevent the congestion caused due to inefficient allocation of network
resources. Another aspect of the network performance is Quality of Experience (QoE). QoE in
telecommunications terminology, it is a measurement used to determine how well that network is satisfying the
end user's requirements. The Mean Opinion Score (MOS) is an important factor in determining the QoE. MOS
is a measurement of the quality delivered by the network based on human perception at the destination end.
Specifically we can tell mean opinion score (MOS) provides a numerical indication of the perceived quality of
received media after compression and/or transmission.
GRAPH THEORETIC ROUTING ALGORITHM (GTRA) FOR MOBILE AD-HOC NETWORKS (MANET)graphhoc
Battlefield theater applications require supporting large number of nodes. It can facilitate many multi-hop
paths between each source and destination pairs. For scalability, it is critical that for supporting network
centric applications with large set of nodes require hierarchical approach to designing networks. In this
research we consider using Mobile Ad Hoc Network (MANET) with multiple clusters. Each cluster
supports a few nodes with a cluster head. The intra-cluster connectivity amongst the nodes within the
cluster is supported by multi-hop connectivity to ensure handling mobility in such a way that no service
disruption can occur. The inter-cluster connectivity is also achieved by multi-hop connectivity. However,
for inter-cluster communications, only cluster heads are connected. The selection of intra-cluster
communications and inter-cluster communications allow scalability of the network to support multiservices
applications end-to-end with a desired Quality of Service (QoS). This paper proposes graph
theoretic approach to establish efficient connection between a source and a destination within each cluster
in intra-cluster network and between clusters in inter-cluster network. Graph theoretic approach
traditionally was applied networks where nodes are static or fixed. In this paper, we have applied the
graph theoretic routing to MANET where nodes are mobile. One of the important challenges in MANET is
to support an efficient routing algorithm for multi-hop communications across many nodes which are
dynamic in nature. However, dynamic behavior of the nodes requires greater understanding of the node
degree and mobility at each instance of time in order to maintain end-to-end QoS for multi-service
provisioning. This paper demonstrates graph theoretic approach produces an optimum multi-hop
connectivity path based on cumulative minimum degree that minimizes the contention and scheduling
delay end-to-end. It is applied to both intra-cluster communications as well as inter-cluster
communications. The performance shows that having a multi-hop connectivity for intra-cluster
communications is more power efficient compared to broadcast of information with maximum power
coverage. Each cluster performs similarly and the algorithm is also used for inter-cluster communications.
Our simulation results show that the proposed graph theoretic routing approach will reduce the overall
delay and improves the physical layer data frame transmission.
Congestion Control and QOS Improvement for AEERG protocol in MANET pijans
QOS improvement has been a subject of intensive discussion. The research in the network field for
congestion control is by means of scheduling packets from different traffic flows for processing at a specific
node. When that particular node is selected for the transmission of all traffic flows since it has been chosen
as an emerging node for the shortest path in the adaptive energy efficient algorithm, queue scheduling
disciplines have been used to improve the quality of service. In this paper, we evaluate the performance of
four queuing disciplines (FIFO, PQ, RED and WFQ) which is implemented in the AEERG protocol. This
paper gives the NS-2 simulation results to compare their relative performance based on queuing delay,
packet drop rate and end-to-end delay for the above queuing techniques.
Packet Transfer Rate & Robust Throughput for Mobile Adhoc NetworkEswar Publications
An ad-hoc wireless network is highly different considering dynamic stochastic process of its underlying links, leads to link breaks during data transaction. Hence, to provide free flow data transaction, many routing algorithms have the property of link recovery and maintenance procedures to minimize the loss of data during transmission. However these routing method do not guarantee reliable data transmission in some special application conditions with wide requirements on Packet delivery ratio and link quality of the network. Routing is a critical issue in MANET and hence the focus of this paper is the performance analysis of different routing protocols used in the
wireless network. We evaluate the ability of a mobile ad hoc wireless network to distribute flows across robust routes by introducing the robust throughput measure as a performance metric. The utility gained by the delivery of flow messages is based on the level of interruption experienced by the underlying transaction. We describe the mathematical calculation of a network’s robust throughput measure, as well as its robust throughput capacity. We introduce the robust flow admission and routing algorithm (RFAR) to provide for the timely and robust transport of flow transactions across mobile ad hoc wireless systems.
A novel routing technique for mobile ad hoc networks (manet)ijngnjournal
Actual network size depends on the application and the protocols developed for the routing for this kind of
networks should be scalable and efficient. Each routing protocol should support small as well as large
scale networks very efficiently. As the number of node increase, it increases the management functionality
of the network. Graph theoretic approach traditionally was applied to networks where nodes are static or
fixed. In this paper, we have applied the graph theoretic routing to MANET where nodes are mobile. Here,
we designed all identical nodes in the cluster except the cluster head and this criterion reduces the
management burden on the network. Each cluster supports a few nodes with a cluster head. The intracluster
connectivity amongst the nodes within the cluster is supported by multi-hop connectivity to ensure
handling mobility in such a way that no service disruption can occur. The inter-cluster connectivity is also
achieved by multi-hop connectivity. However, for inter-cluster communications, only cluster heads are
connected. This paper demonstrates graph theoretic approach produces an optimum multi-hop connectivity
path based on cumulative minimum degree that minimizes the contention and scheduling delay end-toend.
It is applied to both intra-cluster communications as well as inter-cluster communications. The
performance shows that having a multi-hop connectivity for intra-cluster communications is more power
efficient compared to broadcast of information with maximum power coverage. We also showed the total
number of required intermediate nodes in the transmission from source to destination. However, dynamic
behavior of the nodes requires greater understanding of the node degree and mobility at each instance of
time in order to maintain end-to-end QoS for multi-service provisioning. Our simulation results show that
the proposed graph theoretic routing approach will reduce the overall delay and improves the physical
layer data frame transmission.
QOS ROUTING AND PERFORMANCE EVALUATION FOR MOBILE AD HOC NETWORKS USING OLSR ...ijasuc
Mobile Ad-Hoc network is a collection of mobile nodes in communication without using infrastructure.
As the real-time applications used in today’s wireless network grow, we need some schemes to provide
more suitable service for them. We know that most of actual schemes do not perform well on traffic which
is not strictly CBR. Therefore, in this paper we have studied the impact, respectively, of mobility models
and the density of nodes on the performances (End-to-End Delay, Throughput and Packet Delivery ratio)
of routing protocol (Optimized Link State Routing) OLSR by using in the first a real-time VBR (MPEG-4)
and secondly the Constant Bit Rate (CBR) traffic. Finally we compare the performance on both cases.
Experimentally, we considered the three mobility models as follows Random Waypoint, Random
Direction and Mobgen Steady State. The experimental results illustrate that the behavior of OLSR change
according to the model and the used traffics.
Improved Routing Protocol in Mobile Ad Hoc Networks Using Fuzzy LogicTELKOMNIKA JOURNAL
In mobile ad hoc networks, route selection is one of the most important issues that is studied in
these networks as a field of research. Many articles trying to provide solutions to choose the best path in
which the important parameters such as power consumption, bandwidth and mobility are used. In this
article, in order to improve the solutions presented in recent papers parameters such as power remaining,
mobility, degree node and available bandwidth are used by taking the factors for each parameter in
proportion to its influence in choosing the best path. Finally, we compare the proposed solution with the
three protocols IAOMDV-F, AODVFART and FLM-AODV with the help of OPNET simulation program
based on network throughput, routing discovery time, the average number of hops per route, network
delay.
In mobile ad hoc wireless networks (MANETs), traditional protocol like AODV performs well for low mobility of nodes but not for high node mobility. So, it becomes important to consider mobility factor during the path selection procedure of routing protocol. Here, a fuzzy logic mobility based protocol (FLM-AODV) that considers the mobility factor is proposed. Due to the consideration of mobility factor, the proposed protocol has better performance than the traditional AODV. The experiment results show that the proposed protocol has advantages of improved average end-to-end delay and packet delivery ratio (PDR) over existing AODV protocol.
Traffic Engineering and Quality of Experience in MPLS Network by Fuzzy Logic ...IJERA Editor
This paper proposes a load balancing algorithm using fuzzy logic so that maximum Quality of Experience can
be achieved. Avoidance of congestion is one of the major performance objectives of traffic engineering in
MPLS networks. Load balancing can prevent the congestion caused due to inefficient allocation of network
resources. Another aspect of the network performance is Quality of Experience (QoE). QoE in
telecommunications terminology, it is a measurement used to determine how well that network is satisfying the
end user's requirements. The Mean Opinion Score (MOS) is an important factor in determining the QoE. MOS
is a measurement of the quality delivered by the network based on human perception at the destination end.
Specifically we can tell mean opinion score (MOS) provides a numerical indication of the perceived quality of
received media after compression and/or transmission.
GRAPH THEORETIC ROUTING ALGORITHM (GTRA) FOR MOBILE AD-HOC NETWORKS (MANET)graphhoc
Battlefield theater applications require supporting large number of nodes. It can facilitate many multi-hop
paths between each source and destination pairs. For scalability, it is critical that for supporting network
centric applications with large set of nodes require hierarchical approach to designing networks. In this
research we consider using Mobile Ad Hoc Network (MANET) with multiple clusters. Each cluster
supports a few nodes with a cluster head. The intra-cluster connectivity amongst the nodes within the
cluster is supported by multi-hop connectivity to ensure handling mobility in such a way that no service
disruption can occur. The inter-cluster connectivity is also achieved by multi-hop connectivity. However,
for inter-cluster communications, only cluster heads are connected. The selection of intra-cluster
communications and inter-cluster communications allow scalability of the network to support multiservices
applications end-to-end with a desired Quality of Service (QoS). This paper proposes graph
theoretic approach to establish efficient connection between a source and a destination within each cluster
in intra-cluster network and between clusters in inter-cluster network. Graph theoretic approach
traditionally was applied networks where nodes are static or fixed. In this paper, we have applied the
graph theoretic routing to MANET where nodes are mobile. One of the important challenges in MANET is
to support an efficient routing algorithm for multi-hop communications across many nodes which are
dynamic in nature. However, dynamic behavior of the nodes requires greater understanding of the node
degree and mobility at each instance of time in order to maintain end-to-end QoS for multi-service
provisioning. This paper demonstrates graph theoretic approach produces an optimum multi-hop
connectivity path based on cumulative minimum degree that minimizes the contention and scheduling
delay end-to-end. It is applied to both intra-cluster communications as well as inter-cluster
communications. The performance shows that having a multi-hop connectivity for intra-cluster
communications is more power efficient compared to broadcast of information with maximum power
coverage. Each cluster performs similarly and the algorithm is also used for inter-cluster communications.
Our simulation results show that the proposed graph theoretic routing approach will reduce the overall
delay and improves the physical layer data frame transmission.
Congestion Control and QOS Improvement for AEERG protocol in MANET pijans
QOS improvement has been a subject of intensive discussion. The research in the network field for
congestion control is by means of scheduling packets from different traffic flows for processing at a specific
node. When that particular node is selected for the transmission of all traffic flows since it has been chosen
as an emerging node for the shortest path in the adaptive energy efficient algorithm, queue scheduling
disciplines have been used to improve the quality of service. In this paper, we evaluate the performance of
four queuing disciplines (FIFO, PQ, RED and WFQ) which is implemented in the AEERG protocol. This
paper gives the NS-2 simulation results to compare their relative performance based on queuing delay,
packet drop rate and end-to-end delay for the above queuing techniques.
Packet Transfer Rate & Robust Throughput for Mobile Adhoc NetworkEswar Publications
An ad-hoc wireless network is highly different considering dynamic stochastic process of its underlying links, leads to link breaks during data transaction. Hence, to provide free flow data transaction, many routing algorithms have the property of link recovery and maintenance procedures to minimize the loss of data during transmission. However these routing method do not guarantee reliable data transmission in some special application conditions with wide requirements on Packet delivery ratio and link quality of the network. Routing is a critical issue in MANET and hence the focus of this paper is the performance analysis of different routing protocols used in the
wireless network. We evaluate the ability of a mobile ad hoc wireless network to distribute flows across robust routes by introducing the robust throughput measure as a performance metric. The utility gained by the delivery of flow messages is based on the level of interruption experienced by the underlying transaction. We describe the mathematical calculation of a network’s robust throughput measure, as well as its robust throughput capacity. We introduce the robust flow admission and routing algorithm (RFAR) to provide for the timely and robust transport of flow transactions across mobile ad hoc wireless systems.
A novel routing technique for mobile ad hoc networks (manet)ijngnjournal
Actual network size depends on the application and the protocols developed for the routing for this kind of
networks should be scalable and efficient. Each routing protocol should support small as well as large
scale networks very efficiently. As the number of node increase, it increases the management functionality
of the network. Graph theoretic approach traditionally was applied to networks where nodes are static or
fixed. In this paper, we have applied the graph theoretic routing to MANET where nodes are mobile. Here,
we designed all identical nodes in the cluster except the cluster head and this criterion reduces the
management burden on the network. Each cluster supports a few nodes with a cluster head. The intracluster
connectivity amongst the nodes within the cluster is supported by multi-hop connectivity to ensure
handling mobility in such a way that no service disruption can occur. The inter-cluster connectivity is also
achieved by multi-hop connectivity. However, for inter-cluster communications, only cluster heads are
connected. This paper demonstrates graph theoretic approach produces an optimum multi-hop connectivity
path based on cumulative minimum degree that minimizes the contention and scheduling delay end-toend.
It is applied to both intra-cluster communications as well as inter-cluster communications. The
performance shows that having a multi-hop connectivity for intra-cluster communications is more power
efficient compared to broadcast of information with maximum power coverage. We also showed the total
number of required intermediate nodes in the transmission from source to destination. However, dynamic
behavior of the nodes requires greater understanding of the node degree and mobility at each instance of
time in order to maintain end-to-end QoS for multi-service provisioning. Our simulation results show that
the proposed graph theoretic routing approach will reduce the overall delay and improves the physical
layer data frame transmission.
QOS ROUTING AND PERFORMANCE EVALUATION FOR MOBILE AD HOC NETWORKS USING OLSR ...ijasuc
Mobile Ad-Hoc network is a collection of mobile nodes in communication without using infrastructure.
As the real-time applications used in today’s wireless network grow, we need some schemes to provide
more suitable service for them. We know that most of actual schemes do not perform well on traffic which
is not strictly CBR. Therefore, in this paper we have studied the impact, respectively, of mobility models
and the density of nodes on the performances (End-to-End Delay, Throughput and Packet Delivery ratio)
of routing protocol (Optimized Link State Routing) OLSR by using in the first a real-time VBR (MPEG-4)
and secondly the Constant Bit Rate (CBR) traffic. Finally we compare the performance on both cases.
Experimentally, we considered the three mobility models as follows Random Waypoint, Random
Direction and Mobgen Steady State. The experimental results illustrate that the behavior of OLSR change
according to the model and the used traffics.
Improved Routing Protocol in Mobile Ad Hoc Networks Using Fuzzy LogicTELKOMNIKA JOURNAL
In mobile ad hoc networks, route selection is one of the most important issues that is studied in
these networks as a field of research. Many articles trying to provide solutions to choose the best path in
which the important parameters such as power consumption, bandwidth and mobility are used. In this
article, in order to improve the solutions presented in recent papers parameters such as power remaining,
mobility, degree node and available bandwidth are used by taking the factors for each parameter in
proportion to its influence in choosing the best path. Finally, we compare the proposed solution with the
three protocols IAOMDV-F, AODVFART and FLM-AODV with the help of OPNET simulation program
based on network throughput, routing discovery time, the average number of hops per route, network
delay.
In mobile ad hoc wireless networks (MANETs), traditional protocol like AODV performs well for low mobility of nodes but not for high node mobility. So, it becomes important to consider mobility factor during the path selection procedure of routing protocol. Here, a fuzzy logic mobility based protocol (FLM-AODV) that considers the mobility factor is proposed. Due to the consideration of mobility factor, the proposed protocol has better performance than the traditional AODV. The experiment results show that the proposed protocol has advantages of improved average end-to-end delay and packet delivery ratio (PDR) over existing AODV protocol.
WS-OLSR: MULTIPOINT RELAY SELECTION IN VANET NETWORKS USING A WINGSUIT FLYING...IJCNCJournal
The routing protocol is considered the backbone of network communication. However, mobility and
bandwidth availability make optimizing broadcast message flooding a problem in an Optimized Link State
Routing (OLSR)-based mobile wireless network. The selection of Multi-Point Relays (MPRs) has lately
been proposed as a potential approach that has the added benefit of eliminating duplicate re-transmissions
in VANET networks. Wingsuit Flying Search (WFS) is one of the swarm intelligent metaheuristic
algorithms, it enables one to find the minimum number of MPR. In this study, a novel methodology based
on (WFS) is called WS-OLSR (Wingsuit Search-OLSR). The (WS-OLSR) is investigated to enhance the
existing MPR-based solution, arguing that considering a cost function as a further decision measure will
effectively compute minimum MPR nodes that give the maximum coverage area possible. The enhanced
MPR selection powered by (WFS) algorithm leads to decreasing MPR count required to cover 95% of
mobile nodes, increasing throughput , and decreasing topology control which mitigates broadcasting storm
phenomenon in VANETs.
WS-OLSR: Multipoint Relay Selection in VANET Networks using a Wingsuit Flying...IJCNCJournal
The routing protocol is considered the backbone of network communication. However, mobility and bandwidth availability make optimizing broadcast message flooding a
problem in an Optimized Link State Routing (OLSR)-based mobile wireless network. The selection of Multi-Point Relays (MPRs) has lately been proposed as a potential approach that has the added benefit of eliminating duplicate re-transmissions in VANET networks. Wingsuit Flying Search (WFS) is one of the swarm intelligent metaheuristic
algorithms, it enables one to find the minimum number of MPR. In this study, a novel methodology based on (WFS) is called WS-OLSR (Wingsuit Search-OLSR). The (WS-
OLSR) is investigated to enhance the existing MPR-based solution, arguing that considering a cost function as a further decision measure will effectively compute minimum MPR nodes that give the maximum coverage area possible. The enhanced MPR selection powered by (WFS) algorithm leads to decreasing MPR count required to cover 95% of mobile nodes, increasing throughput , and decreasing topology control which mitigates broadcasting storm phenomenon in VANETs
Performance comparison of mobile ad hoc network routing protocolsIJCNCJournal
Mobile Ad-hoc Network (MANET) is an infrastructure less and decentralized network which need a robust
dynamic routing protocol. Many routing protocols for such networks have been proposed so far to find
optimized routes from source to the destination and prominent among them are Dynamic Source Routing
(DSR), Ad-hoc On Demand Distance Vector (AODV), and Destination-Sequenced Distance Vector (DSDV)
routing protocols. The performance comparison of these protocols should be considered as the primary
step towards the invention of a new routing protocol. This paper presents a performance comparison of
proactive and reactive routing protocols DSDV, AODV and DSR based on QoS metrics (packet delivery
ratio, average end-to-end delay, throughput, jitter), normalized routing overhead and normalized MAC
overhead by using the NS-2 simulator. The performance comparison is conducted by varying mobility
speed, number of nodes and data rate. The comparison results show that AODV performs optimally well
not the best among all the studied protocols.
Performance Comparison of Different Mobility Model on Topology Managed MANETEswar Publications
A wireless ad hoc network is a sovereign system in which users can communicate with each other freely. It can be deployed rapidly at a very low cost, and can be easily managed and extended. Topology management has main objective to maintain a topology connectivity that improves wireless network performance by minimizing energy consumption. Also Topology control with cooperative communication was recently research initiated .Cooperative Communication (CC) is a technique that allows no. of nodes to simultaneously transmit the same data. It can save power and extend transmission coverage. Topology management with cooperative communication is new research
initiated in the field of Mobile Ad-hoc Network. In this paper, we analyze the effect of multi-traffic on the topology managed MANET. We implemented some applications on different mobility models that is OLSR move and random mobility. To simulate all scenario OPNET 14.5 software is used. OPNET is a comprehensive suite of tools for modelling large wired and wireless networks. It uses simulation and emulation to predict the behaviour and performance of networks to improve their design, operation and management.
In the first part of paper, implemented the existed network on the OPNET simulator and evaluate the performance (Download Response Time, Traffic Send and Traffic Receive) of OLSR move based topology control network.
In the second part of paper, evaluated the QoS performanc (Delay, Download Response Time, Traffic Send and Receive Response) of Random Mobility based topology control network. From the simulation results we observed that compare with OLSR move models, the Random mobility model performance is good. We implemented different traffic pattern on two Topology managed MANET.
In the third part of paper, implemented the dynamic traffic pattern like Email, FTP & Voice and video conferencing on the proposed network. Simulation results show that FTP and E-mail both have large download response time in case of OLSR move model rather than Random Mobility model. Traffic send and receive performance of email is good in OLSR-move model. Video Conferencing has good response of traffic send and receive in Random Mobility model.
Adaptive QoS Multicast Routing with Mobility Prediction in MANETs ijasuc
A Mobile Ad hoc NETwork (MANET) is a collection of wireless mobile hosts that form a temporary network
without a centralized administration or wired infrastructure. Due to the high mobility of nodes, the network
topology of MANETs changes very fast, making it more difficult to find the routes that message packets use.
Network control with Quality of Service (QoS) support is a key issue for multimedia applications in MANET.
Most of the real time applications have stringent requirements on bandwidth, delay, delay-jitter, packet loss
ratio, cost and other QoS metrics. This paper proposes a Multi-constrained QoS routing with mobility
prediction protocol. If the node has enough resources to transmit data packets, it uses the Global
Positioning System (GPS) to get the location information of the mobile nodes and selects the routing path
with the maximum Route Expiration Time (RET). A set of static and mobile agents are used to find the
multicast routes and transmit the packets. Extensive simulations have been conducted to evaluate the
performance of MC_MAODV using Network Simulator (NS-2). The simulation results show that the
proposed protocol achieves good performance in terms of improving packet delivery ratio and minimizing
end-to-end delay.
A scalable and power efficient solution for routing in mobile ad hoc network ...ijmnct
Mobile Ad Hoc Network (MANET) is a very dynamic and infrastructure-less ad hoc network. The actual
network size depends on the application and the protocols developed for the routing for this kind of
networks should be scalable. MANET is a resource limited network and therefore the developed routing
algorithm for packet transmission should be power and bandwidth efficient. These kinds of dynamic
networks should operate with minimal management overhead. The management functionality of the
network increases with number of nodes and reduces the performance of the network. Here, in this paper,
we have designed all identical nodes in the cluster except the cluster head and this criterion reduces the
management burden on the network. Graph theoretic routing algorithm is used to develop route for packet
transmission by using the minimum resources. In this paper, we developed routing algorithm for cluster
based MANET and finds a path from source to destination using minimum cumulative degree path. Our
simulation results show that this routing algorithm provide efficient routing path with the increasing
number of nodes and uses multi-hop connectivity for intra-cluster to utilize minimum power for packet
transmission irrespective of number of nodes in the network.
Computer network is becoming more popular and common, the need to use the broadband connection services (e-learning - online training, video conferencing - online conference, IPTV - digital TV ...) of organizations and individuals is increasing. Multicast is an effective mechanism for the transmission of information and data to many recipients simultaneously. Multicast is a routing problem from a source node to a receiver node set, also known as the routing from one point to multipoint. The advances in technology and multimedia applications emerge quickly has provided great motivation for the application of new real-time multi-point. Many multi-point applications will not function properly if the QoS (quality of service) can not be guaranteed. Therefore, multi-point algorithms must be able to meet the QoS constraints (cost, reliability, bandwidth, jitter, delay...). The objective of multicast routing algorithms guarantee QoS is to provide routing algorithms have the ability to recognize the tree to satisfy the maximum of traffic streams with QoS requirements. Most multicast algorithms on MPLS (MultiProtocol Label Switching) considered the unique QoS constraint as bandwidth. The other QoS constraints can be converted into bandwidth efficiency. Starting from this reality, this paper research multicast routing algorithms guarantee bandwidth and propose new algorithm compares with existing ones.
ENERGY LOCATION AWARE ROUTING PROTOCOL (ELARP) FOR WIRELESS MULTIMEDIA SENSOR...ijcsit
Wireless Sensor Networks (WSNs)have sensor nodes that sense and extract information from surrounding
environment, processing information locally then transmit it to sink wirelessly. Multimedia data is larger in
volume than scalar data, thus transmitting multimedia data via Wireless Multimedia Sensor Networks
(WMSNs) requires stick constraints on quality of services in terms of energy, throughput and end to end
delay.Multipath routing is to discover multipath during route discovery from source to sink. Discover
multipath and sending data via these different paths improve the bandwidth and decrease the end to end
delay. This paper introduces an Energy Location Aware Routing Protocol (ELARP) which is reactive
multipath routing protocol establishing three paths with awareness of node’s residual energy and distance.
ELARP has experimented with NS2 simulator. The simulation results show that ELARP enhances QoS for
multimedia data in terms of end to end delay and packet delivery ratio.
Wireless Sensor Networks (WSNs)have sensor nodes that sense and extract information from surrounding environment, processing information locally then transmit it to sink wirelessly. Multimedia data is larger in volume than scalar data, thus transmitting multimedia data via Wireless Multimedia Sensor Networks (WMSNs) requires stick constraints on quality of services in terms of energy, throughput and end to end delay.Multipath routing is to discover multipath during route discovery from source to sink. Discover multipath and sending data via these different paths improve the bandwidth and decrease the end to end delay. This paper introduces an Energy Location Aware Routing Protocol (ELARP) which is reactive multipath routing protocol establishing three paths with awareness of node’s residual energy and distance. ELARP has experimented with NS2 simulator. The simulation results show that ELARP enhances QoS for multimedia data in terms of end to end delay and packet delivery ratio.
The present paper describes a novel Raspberry Pi and Arduino UNO architecture used as a meteorological station. One of the advantages of the proposed architecture is the huge quantity of sensors developed for its usage; practically one can find them for any application, and weather sensing is not an exception. The principle followed is to configure Raspberry as a collector for measures obtained from Arduino, transmitting occurs via USB; meanwhile, Raspberry broadcasts them via a web page. For such activity is possible thanks to Raspbian, a Linux-based operating system. It has a lot of libraries and resources available, among them Apache Web Server, that gives the possibility to host a web-page. On it, the user can observe temperature, humidity, solar radiance, and wind speed and direction. Information on the web-page is refreshed each five minute; however, measurements arrive at Raspberry every ten seconds. This low refreshment rate was determined because weather variables normally do not abruptly change. As an additional feature, system stores all information on the log file, this gives the possibility for future analysis and processing.
Wireless Sensor Networks (WSNs)have sensor nodes that sense and extract information from surrounding environment, processing information locally then transmit it to sink wirelessly. Multimedia data is larger in volume than scalar data, thus transmitting multimedia data via Wireless Multimedia Sensor Networks (WMSNs) requires stick constraints on quality of services in terms of energy, throughput and end to end delay. Multipath routing is to discover multipath during route discovery from source to sink. Discover multipath and sending data via these different paths improve the bandwidth and decrease the end to end delay. This paper introduces an Energy Location Aware Routing Protocol (ELARP) which is reactive multipath routing protocol establishing three paths with awareness of node’s residual energy and distance. ELARP has experimented with NS2 simulator. The simulation results show that ELARP enhances QoS for multimedia data in terms of end to end delay and packet delivery ratio.
Performance evaluation of MANET routing protocols based on QoS and energy p...IJECEIAES
Routing selection and supporting Quality of Service (QoS) are fundamental problems in Mobile Ad Hoc Network (MANET). Many different protocols have been proposed in the literature and some performance simulations are made to address this challenging task. This paper discusses the performance evaluation and comparison of two typical routing protocols; Ad Hoc On-Demand Distance Vector (AODV) and Destination-Sequenced DistanceVector (DSDV) based on measuring the power consumption in network with varing of the QoS parameters. In this paper, we have studied and analyzed the impact of variations in QoS parameter combined with the choice of routing protocol, on network performance. The network performance is measured in terms of average throughput, packet delivery ratio (PDR), average jitter and energy consumption. The simulations are carried out in NS-3. The simulation results show that DSDV and AODV routing protocols are less energy efficient. The main aim of this paper is to highlight the directions for the future design of routing protocol which would be better than the existing ones in terms of energy utilization and delivery ratio.
A Performance Comparison of Routing Protocols for Ad Hoc NetworksIJERA Editor
Mobile Ad hoc Network (MANET) is a collection of mobile nodes in which the wireless links are frequently broken down due to mobility and dynamic infrastructure. Routing is a significant issue and challenge in ad hoc networks. Many routing protocols have been proposed like OLSR, AODV so far to improve the routing performance and reliability. In this paper, we describe the Optimized Link State Routing Protocol (OLSR) and the Ad hoc On-Demand Distance Vector (AODV). We evaluate their performance through exhaustive simulations using the Network Simulator 2 (ns2) by varying conditions (node mobility, network density).
Impact of Variable Transmission Range and Scalability With Respect To Mobilit...Jitender Grover
A variety of protocols are used in ad hoc network but the most popular protocol one is Zone Routing Protocol (ZRP). ZRP is a hybrid routing protocol. Transmission power affects the design and performance of all the protocols in Mobile Ad hoc Networks (MANETs). Mobility of nodes and selection of Zone Size in ZRP are also the major issues. In this paper, the impact of Transmission Ranges and Scalability by varying Mobility rate along with Zone Radius on QoS based performance metrics has been analyzed. The environment has been simulated using NS2.33 Simulator. The objective of our work is to analyze that at what speed and by taking how much zone radius ZRP will be able to perform efficiently and effectively for Mobile Ad hoc Networks.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
International Journal of Engineering Research and DevelopmentIJERD Editor
Electrical, Electronics and Computer Engineering,
Information Engineering and Technology,
Mechanical, Industrial and Manufacturing Engineering,
Automation and Mechatronics Engineering,
Material and Chemical Engineering,
Civil and Architecture Engineering,
Biotechnology and Bio Engineering,
Environmental Engineering,
Petroleum and Mining Engineering,
Marine and Agriculture engineering,
Aerospace Engineering.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
ENHANCING ENGLISH WRITING SKILLS THROUGH INTERNET-PLUS TOOLS IN THE PERSPECTI...ijfcstjournal
This investigation delves into incorporating a hybridized memetic strategy within the framework of English
composition pedagogy, leveraging Internet Plus resources. The study aims to provide an in-depth analysis
of how this method influences students’ writing competence, their perceptions of writing, and their
enthusiasm for English acquisition. Employing an explanatory research design that combines qualitative
and quantitative methods, the study collects data through surveys, interviews, and observations of students’
writing performance before and after the intervention. Findings demonstrate a beneficial impact of
integrating the memetic approach alongside Internet Plus tools on the writing aptitude of English as a
Foreign Language (EFL) learners. Students reported increased engagement with writing, attributing it to
the use of Internet plus tools. They also expressed that the memetic approach facilitated a deeper
understanding of cultural and social contexts in writing. Furthermore, the findings highlight a significant
improvement in students’ writing skills following the intervention. This study provides significant insights
into the practical implementation of the memetic approach within English writing education, highlighting
the beneficial contribution of Internet Plus tools in enriching students' learning journeys.
A SURVEY TO REAL-TIME MESSAGE-ROUTING NETWORK SYSTEM WITH KLA MODELLINGijfcstjournal
Messages routing over a network is one of the most fundamental concept in communication which requires
simultaneous transmission of messages from a source to a destination. In terms of Real-Time Routing, it
refers to the addition of a timing constraint in which messages should be received within a specified time
delay. This study involves Scheduling, Algorithm Design and Graph Theory which are essential parts of
the Computer Science (CS) discipline. Our goal is to investigate an innovative and efficient way to present
these concepts in the context of CS Education. In this paper, we will explore the fundamental modelling of
routing real-time messages on networks. We study whether it is possible to have an optimal on-line
algorithm for the Arbitrary Directed Graph network topology. In addition, we will examine the message
routing’s algorithmic complexity by breaking down the complex mathematical proofs into concrete, visual
examples. Next, we explore the Unidirectional Ring topology in finding the transmission’s
“makespan”.Lastly, we propose the same network modelling through the technique of Kinesthetic Learning
Activity (KLA). We will analyse the data collected and present the results in a case study to evaluate the
effectiveness of the KLA approach compared to the traditional teaching method.
More Related Content
Similar to CONGESTION CONTROL USING FUZZY BASED LSPS IN MULTIPROTOCOL LABEL SWITCHING NETWORKS
WS-OLSR: MULTIPOINT RELAY SELECTION IN VANET NETWORKS USING A WINGSUIT FLYING...IJCNCJournal
The routing protocol is considered the backbone of network communication. However, mobility and
bandwidth availability make optimizing broadcast message flooding a problem in an Optimized Link State
Routing (OLSR)-based mobile wireless network. The selection of Multi-Point Relays (MPRs) has lately
been proposed as a potential approach that has the added benefit of eliminating duplicate re-transmissions
in VANET networks. Wingsuit Flying Search (WFS) is one of the swarm intelligent metaheuristic
algorithms, it enables one to find the minimum number of MPR. In this study, a novel methodology based
on (WFS) is called WS-OLSR (Wingsuit Search-OLSR). The (WS-OLSR) is investigated to enhance the
existing MPR-based solution, arguing that considering a cost function as a further decision measure will
effectively compute minimum MPR nodes that give the maximum coverage area possible. The enhanced
MPR selection powered by (WFS) algorithm leads to decreasing MPR count required to cover 95% of
mobile nodes, increasing throughput , and decreasing topology control which mitigates broadcasting storm
phenomenon in VANETs.
WS-OLSR: Multipoint Relay Selection in VANET Networks using a Wingsuit Flying...IJCNCJournal
The routing protocol is considered the backbone of network communication. However, mobility and bandwidth availability make optimizing broadcast message flooding a
problem in an Optimized Link State Routing (OLSR)-based mobile wireless network. The selection of Multi-Point Relays (MPRs) has lately been proposed as a potential approach that has the added benefit of eliminating duplicate re-transmissions in VANET networks. Wingsuit Flying Search (WFS) is one of the swarm intelligent metaheuristic
algorithms, it enables one to find the minimum number of MPR. In this study, a novel methodology based on (WFS) is called WS-OLSR (Wingsuit Search-OLSR). The (WS-
OLSR) is investigated to enhance the existing MPR-based solution, arguing that considering a cost function as a further decision measure will effectively compute minimum MPR nodes that give the maximum coverage area possible. The enhanced MPR selection powered by (WFS) algorithm leads to decreasing MPR count required to cover 95% of mobile nodes, increasing throughput , and decreasing topology control which mitigates broadcasting storm phenomenon in VANETs
Performance comparison of mobile ad hoc network routing protocolsIJCNCJournal
Mobile Ad-hoc Network (MANET) is an infrastructure less and decentralized network which need a robust
dynamic routing protocol. Many routing protocols for such networks have been proposed so far to find
optimized routes from source to the destination and prominent among them are Dynamic Source Routing
(DSR), Ad-hoc On Demand Distance Vector (AODV), and Destination-Sequenced Distance Vector (DSDV)
routing protocols. The performance comparison of these protocols should be considered as the primary
step towards the invention of a new routing protocol. This paper presents a performance comparison of
proactive and reactive routing protocols DSDV, AODV and DSR based on QoS metrics (packet delivery
ratio, average end-to-end delay, throughput, jitter), normalized routing overhead and normalized MAC
overhead by using the NS-2 simulator. The performance comparison is conducted by varying mobility
speed, number of nodes and data rate. The comparison results show that AODV performs optimally well
not the best among all the studied protocols.
Performance Comparison of Different Mobility Model on Topology Managed MANETEswar Publications
A wireless ad hoc network is a sovereign system in which users can communicate with each other freely. It can be deployed rapidly at a very low cost, and can be easily managed and extended. Topology management has main objective to maintain a topology connectivity that improves wireless network performance by minimizing energy consumption. Also Topology control with cooperative communication was recently research initiated .Cooperative Communication (CC) is a technique that allows no. of nodes to simultaneously transmit the same data. It can save power and extend transmission coverage. Topology management with cooperative communication is new research
initiated in the field of Mobile Ad-hoc Network. In this paper, we analyze the effect of multi-traffic on the topology managed MANET. We implemented some applications on different mobility models that is OLSR move and random mobility. To simulate all scenario OPNET 14.5 software is used. OPNET is a comprehensive suite of tools for modelling large wired and wireless networks. It uses simulation and emulation to predict the behaviour and performance of networks to improve their design, operation and management.
In the first part of paper, implemented the existed network on the OPNET simulator and evaluate the performance (Download Response Time, Traffic Send and Traffic Receive) of OLSR move based topology control network.
In the second part of paper, evaluated the QoS performanc (Delay, Download Response Time, Traffic Send and Receive Response) of Random Mobility based topology control network. From the simulation results we observed that compare with OLSR move models, the Random mobility model performance is good. We implemented different traffic pattern on two Topology managed MANET.
In the third part of paper, implemented the dynamic traffic pattern like Email, FTP & Voice and video conferencing on the proposed network. Simulation results show that FTP and E-mail both have large download response time in case of OLSR move model rather than Random Mobility model. Traffic send and receive performance of email is good in OLSR-move model. Video Conferencing has good response of traffic send and receive in Random Mobility model.
Adaptive QoS Multicast Routing with Mobility Prediction in MANETs ijasuc
A Mobile Ad hoc NETwork (MANET) is a collection of wireless mobile hosts that form a temporary network
without a centralized administration or wired infrastructure. Due to the high mobility of nodes, the network
topology of MANETs changes very fast, making it more difficult to find the routes that message packets use.
Network control with Quality of Service (QoS) support is a key issue for multimedia applications in MANET.
Most of the real time applications have stringent requirements on bandwidth, delay, delay-jitter, packet loss
ratio, cost and other QoS metrics. This paper proposes a Multi-constrained QoS routing with mobility
prediction protocol. If the node has enough resources to transmit data packets, it uses the Global
Positioning System (GPS) to get the location information of the mobile nodes and selects the routing path
with the maximum Route Expiration Time (RET). A set of static and mobile agents are used to find the
multicast routes and transmit the packets. Extensive simulations have been conducted to evaluate the
performance of MC_MAODV using Network Simulator (NS-2). The simulation results show that the
proposed protocol achieves good performance in terms of improving packet delivery ratio and minimizing
end-to-end delay.
A scalable and power efficient solution for routing in mobile ad hoc network ...ijmnct
Mobile Ad Hoc Network (MANET) is a very dynamic and infrastructure-less ad hoc network. The actual
network size depends on the application and the protocols developed for the routing for this kind of
networks should be scalable. MANET is a resource limited network and therefore the developed routing
algorithm for packet transmission should be power and bandwidth efficient. These kinds of dynamic
networks should operate with minimal management overhead. The management functionality of the
network increases with number of nodes and reduces the performance of the network. Here, in this paper,
we have designed all identical nodes in the cluster except the cluster head and this criterion reduces the
management burden on the network. Graph theoretic routing algorithm is used to develop route for packet
transmission by using the minimum resources. In this paper, we developed routing algorithm for cluster
based MANET and finds a path from source to destination using minimum cumulative degree path. Our
simulation results show that this routing algorithm provide efficient routing path with the increasing
number of nodes and uses multi-hop connectivity for intra-cluster to utilize minimum power for packet
transmission irrespective of number of nodes in the network.
Computer network is becoming more popular and common, the need to use the broadband connection services (e-learning - online training, video conferencing - online conference, IPTV - digital TV ...) of organizations and individuals is increasing. Multicast is an effective mechanism for the transmission of information and data to many recipients simultaneously. Multicast is a routing problem from a source node to a receiver node set, also known as the routing from one point to multipoint. The advances in technology and multimedia applications emerge quickly has provided great motivation for the application of new real-time multi-point. Many multi-point applications will not function properly if the QoS (quality of service) can not be guaranteed. Therefore, multi-point algorithms must be able to meet the QoS constraints (cost, reliability, bandwidth, jitter, delay...). The objective of multicast routing algorithms guarantee QoS is to provide routing algorithms have the ability to recognize the tree to satisfy the maximum of traffic streams with QoS requirements. Most multicast algorithms on MPLS (MultiProtocol Label Switching) considered the unique QoS constraint as bandwidth. The other QoS constraints can be converted into bandwidth efficiency. Starting from this reality, this paper research multicast routing algorithms guarantee bandwidth and propose new algorithm compares with existing ones.
ENERGY LOCATION AWARE ROUTING PROTOCOL (ELARP) FOR WIRELESS MULTIMEDIA SENSOR...ijcsit
Wireless Sensor Networks (WSNs)have sensor nodes that sense and extract information from surrounding
environment, processing information locally then transmit it to sink wirelessly. Multimedia data is larger in
volume than scalar data, thus transmitting multimedia data via Wireless Multimedia Sensor Networks
(WMSNs) requires stick constraints on quality of services in terms of energy, throughput and end to end
delay.Multipath routing is to discover multipath during route discovery from source to sink. Discover
multipath and sending data via these different paths improve the bandwidth and decrease the end to end
delay. This paper introduces an Energy Location Aware Routing Protocol (ELARP) which is reactive
multipath routing protocol establishing three paths with awareness of node’s residual energy and distance.
ELARP has experimented with NS2 simulator. The simulation results show that ELARP enhances QoS for
multimedia data in terms of end to end delay and packet delivery ratio.
Wireless Sensor Networks (WSNs)have sensor nodes that sense and extract information from surrounding environment, processing information locally then transmit it to sink wirelessly. Multimedia data is larger in volume than scalar data, thus transmitting multimedia data via Wireless Multimedia Sensor Networks (WMSNs) requires stick constraints on quality of services in terms of energy, throughput and end to end delay.Multipath routing is to discover multipath during route discovery from source to sink. Discover multipath and sending data via these different paths improve the bandwidth and decrease the end to end delay. This paper introduces an Energy Location Aware Routing Protocol (ELARP) which is reactive multipath routing protocol establishing three paths with awareness of node’s residual energy and distance. ELARP has experimented with NS2 simulator. The simulation results show that ELARP enhances QoS for multimedia data in terms of end to end delay and packet delivery ratio.
The present paper describes a novel Raspberry Pi and Arduino UNO architecture used as a meteorological station. One of the advantages of the proposed architecture is the huge quantity of sensors developed for its usage; practically one can find them for any application, and weather sensing is not an exception. The principle followed is to configure Raspberry as a collector for measures obtained from Arduino, transmitting occurs via USB; meanwhile, Raspberry broadcasts them via a web page. For such activity is possible thanks to Raspbian, a Linux-based operating system. It has a lot of libraries and resources available, among them Apache Web Server, that gives the possibility to host a web-page. On it, the user can observe temperature, humidity, solar radiance, and wind speed and direction. Information on the web-page is refreshed each five minute; however, measurements arrive at Raspberry every ten seconds. This low refreshment rate was determined because weather variables normally do not abruptly change. As an additional feature, system stores all information on the log file, this gives the possibility for future analysis and processing.
Wireless Sensor Networks (WSNs)have sensor nodes that sense and extract information from surrounding environment, processing information locally then transmit it to sink wirelessly. Multimedia data is larger in volume than scalar data, thus transmitting multimedia data via Wireless Multimedia Sensor Networks (WMSNs) requires stick constraints on quality of services in terms of energy, throughput and end to end delay. Multipath routing is to discover multipath during route discovery from source to sink. Discover multipath and sending data via these different paths improve the bandwidth and decrease the end to end delay. This paper introduces an Energy Location Aware Routing Protocol (ELARP) which is reactive multipath routing protocol establishing three paths with awareness of node’s residual energy and distance. ELARP has experimented with NS2 simulator. The simulation results show that ELARP enhances QoS for multimedia data in terms of end to end delay and packet delivery ratio.
Performance evaluation of MANET routing protocols based on QoS and energy p...IJECEIAES
Routing selection and supporting Quality of Service (QoS) are fundamental problems in Mobile Ad Hoc Network (MANET). Many different protocols have been proposed in the literature and some performance simulations are made to address this challenging task. This paper discusses the performance evaluation and comparison of two typical routing protocols; Ad Hoc On-Demand Distance Vector (AODV) and Destination-Sequenced DistanceVector (DSDV) based on measuring the power consumption in network with varing of the QoS parameters. In this paper, we have studied and analyzed the impact of variations in QoS parameter combined with the choice of routing protocol, on network performance. The network performance is measured in terms of average throughput, packet delivery ratio (PDR), average jitter and energy consumption. The simulations are carried out in NS-3. The simulation results show that DSDV and AODV routing protocols are less energy efficient. The main aim of this paper is to highlight the directions for the future design of routing protocol which would be better than the existing ones in terms of energy utilization and delivery ratio.
A Performance Comparison of Routing Protocols for Ad Hoc NetworksIJERA Editor
Mobile Ad hoc Network (MANET) is a collection of mobile nodes in which the wireless links are frequently broken down due to mobility and dynamic infrastructure. Routing is a significant issue and challenge in ad hoc networks. Many routing protocols have been proposed like OLSR, AODV so far to improve the routing performance and reliability. In this paper, we describe the Optimized Link State Routing Protocol (OLSR) and the Ad hoc On-Demand Distance Vector (AODV). We evaluate their performance through exhaustive simulations using the Network Simulator 2 (ns2) by varying conditions (node mobility, network density).
Impact of Variable Transmission Range and Scalability With Respect To Mobilit...Jitender Grover
A variety of protocols are used in ad hoc network but the most popular protocol one is Zone Routing Protocol (ZRP). ZRP is a hybrid routing protocol. Transmission power affects the design and performance of all the protocols in Mobile Ad hoc Networks (MANETs). Mobility of nodes and selection of Zone Size in ZRP are also the major issues. In this paper, the impact of Transmission Ranges and Scalability by varying Mobility rate along with Zone Radius on QoS based performance metrics has been analyzed. The environment has been simulated using NS2.33 Simulator. The objective of our work is to analyze that at what speed and by taking how much zone radius ZRP will be able to perform efficiently and effectively for Mobile Ad hoc Networks.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
International Journal of Engineering Research and DevelopmentIJERD Editor
Electrical, Electronics and Computer Engineering,
Information Engineering and Technology,
Mechanical, Industrial and Manufacturing Engineering,
Automation and Mechatronics Engineering,
Material and Chemical Engineering,
Civil and Architecture Engineering,
Biotechnology and Bio Engineering,
Environmental Engineering,
Petroleum and Mining Engineering,
Marine and Agriculture engineering,
Aerospace Engineering.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Similar to CONGESTION CONTROL USING FUZZY BASED LSPS IN MULTIPROTOCOL LABEL SWITCHING NETWORKS (20)
ENHANCING ENGLISH WRITING SKILLS THROUGH INTERNET-PLUS TOOLS IN THE PERSPECTI...ijfcstjournal
This investigation delves into incorporating a hybridized memetic strategy within the framework of English
composition pedagogy, leveraging Internet Plus resources. The study aims to provide an in-depth analysis
of how this method influences students’ writing competence, their perceptions of writing, and their
enthusiasm for English acquisition. Employing an explanatory research design that combines qualitative
and quantitative methods, the study collects data through surveys, interviews, and observations of students’
writing performance before and after the intervention. Findings demonstrate a beneficial impact of
integrating the memetic approach alongside Internet Plus tools on the writing aptitude of English as a
Foreign Language (EFL) learners. Students reported increased engagement with writing, attributing it to
the use of Internet plus tools. They also expressed that the memetic approach facilitated a deeper
understanding of cultural and social contexts in writing. Furthermore, the findings highlight a significant
improvement in students’ writing skills following the intervention. This study provides significant insights
into the practical implementation of the memetic approach within English writing education, highlighting
the beneficial contribution of Internet Plus tools in enriching students' learning journeys.
A SURVEY TO REAL-TIME MESSAGE-ROUTING NETWORK SYSTEM WITH KLA MODELLINGijfcstjournal
Messages routing over a network is one of the most fundamental concept in communication which requires
simultaneous transmission of messages from a source to a destination. In terms of Real-Time Routing, it
refers to the addition of a timing constraint in which messages should be received within a specified time
delay. This study involves Scheduling, Algorithm Design and Graph Theory which are essential parts of
the Computer Science (CS) discipline. Our goal is to investigate an innovative and efficient way to present
these concepts in the context of CS Education. In this paper, we will explore the fundamental modelling of
routing real-time messages on networks. We study whether it is possible to have an optimal on-line
algorithm for the Arbitrary Directed Graph network topology. In addition, we will examine the message
routing’s algorithmic complexity by breaking down the complex mathematical proofs into concrete, visual
examples. Next, we explore the Unidirectional Ring topology in finding the transmission’s
“makespan”.Lastly, we propose the same network modelling through the technique of Kinesthetic Learning
Activity (KLA). We will analyse the data collected and present the results in a case study to evaluate the
effectiveness of the KLA approach compared to the traditional teaching method.
A COMPARATIVE ANALYSIS ON SOFTWARE ARCHITECTURE STYLESijfcstjournal
Software architecture is the structural solution that achieves the overall technical and operational
requirements for software developments. Software engineers applied software architectures for their
software system developments; however, they worry the basic benchmarks in order to select software
architecture styles, possible components, integration methods (connectors) and the exact application of
each style.
The objective of this research work was a comparative analysis of software architecture styles by its
weakness and benefits in order to select by the programmer during their design time. Finally, in this study,
the researcher has been identified architectural styles, weakness, and Strength and application areas with
its component, connector and Interface for the selected architectural styles.
SYSTEM ANALYSIS AND DESIGN FOR A BUSINESS DEVELOPMENT MANAGEMENT SYSTEM BASED...ijfcstjournal
A design of a sales system for professional services requires a comprehensive understanding of the
dynamics of sale cycles and how key knowledge for completing sales is managed. This research describes
a design model of a business development (sales) system for professional service firms based on the Saudi
Arabian commercial market, which takes into account the new advances in technology while preserving
unique or cultural practices that are an important part of the Saudi Arabian commercial market. The
design model has combined a number of key technologies, such as cloud computing and mobility, as an
integral part of the proposed system. An adaptive development process has also been used in implementing
the proposed design model.
AN ALGORITHM FOR SOLVING LINEAR OPTIMIZATION PROBLEMS SUBJECTED TO THE INTERS...ijfcstjournal
Frank t-norms are parametric family of continuous Archimedean t-norms whose members are also strict
functions. Very often, this family of t-norms is also called the family of fundamental t-norms because of the
role it plays in several applications. In this paper, optimization of a linear objective function with fuzzy
relational inequality constraints is investigated. The feasible region is formed as the intersection of two
inequality fuzzy systems defined by frank family of t-norms is considered as fuzzy composition. First, the
resolution of the feasible solutions set is studied where the two fuzzy inequality systems are defined with
max-Frank composition. Second, some related basic and theoretical properties are derived. Then, a
necessary and sufficient condition and three other necessary conditions are presented to conceptualize the
feasibility of the problem. Subsequently, it is shown that a lower bound is always attainable for the optimal
objective value. Also, it is proved that the optimal solution of the problem is always resulted from the
unique maximum solution and a minimal solution of the feasible region. Finally, an algorithm is presented
to solve the problem and an example is described to illustrate the algorithm. Additionally, a method is
proposed to generate random feasible max-Frank fuzzy relational inequalities. By this method, we can
easily generate a feasible test problem and employ our algorithm to it.
LBRP: A RESILIENT ENERGY HARVESTING NOISE AWARE ROUTING PROTOCOL FOR UNDER WA...ijfcstjournal
Underwater detector network is one amongst the foremost difficult and fascinating analysis arenas that
open the door of pleasing plenty of researchers during this field of study. In several under water based
sensor applications, nodes are square measured and through this the energy is affected. Thus, the mobility
of each sensor nodes are measured through the water atmosphere from the water flow for sensor based
protocol formations. Researchers have developed many routing protocols. However, those lost their charm
with the time. This can be the demand of the age to supply associate degree upon energy-efficient and
ascendable strong routing protocol for under water actuator networks. During this work, the authors tend
to propose a customary routing protocol named level primarily based routing protocol (LBRP), reaching to
offer strong, ascendable and energy economical routing. LBRP conjointly guarantees the most effective use
of total energy consumption and ensures packet transmission which redirects as an additional reliability in
compare to different routing protocols. In this work, the authors have used the level of forwarding node,
residual energy and distance from the forwarding node to the causing node as a proof in multicasting
technique comparisons. Throughout this work, the authors have got a recognition result concerning about
86.35% on the average in node multicasting performances. Simulation has been experienced each in a
wheezy and quiet atmosphere which represents the endorsement of higher performance for the planned
protocol.
STRUCTURAL DYNAMICS AND EVOLUTION OF CAPSULE ENDOSCOPY (PILL CAMERA) TECHNOLO...ijfcstjournal
This research paper examined and re-evaluates the technological innovation, theory, structural dynamics
and evolution of Pill Camera(Capsule Endoscopy) technology in redirecting the response manner of small
bowel (intestine) examination in human. The Pill Camera (Endoscopy Capsule) is made up of sealed
biocompatible material to withstand acid, enzymes and other antibody chemicals in the stomach is a
technology that helps the medical practitioners especially the general physicians and the
gastroenterologists to examine and re-examine the intestine for possible bleeding or infection. Before the
advent of the Pill camera (Endoscopy Capsule) the colonoscopy was the local method used but research
showed that some parts (bowel) of the intestine can’t be reach by mere traditional method hence the need
for Pill Camera. Countless number of deaths from stomach disease such as polyps, inflammatory bowel
(Crohn”s diseases), Cancers, Ulcer, anaemia and tumours of small intestines which ordinary would have
been detected by sophisticated technology like Pill Camera has become norm in the developing nations.
Nevertheless, not only will this paper examine and re-evaluate the Pill Camera Innovation, theory,
Structural dynamics and evolution it unravelled and aimed to create awareness for both medical
practitioners and the public.
AN OPTIMIZED HYBRID APPROACH FOR PATH FINDINGijfcstjournal
Path finding algorithm addresses problem of finding shortest path from source to destination avoiding
obstacles. There exist various search algorithms namely A*, Dijkstra's and ant colony optimization. Unlike
most path finding algorithms which require destination co-ordinates to compute path, the proposed
algorithm comprises of a new method which finds path using backtracking without requiring destination
co-ordinates. Moreover, in existing path finding algorithm, the number of iterations required to find path is
large. Hence, to overcome this, an algorithm is proposed which reduces number of iterations required to
traverse the path. The proposed algorithm is hybrid of backtracking and a new technique(modified 8-
neighbor approach). The proposed algorithm can become essential part in location based, network, gaming
applications. grid traversal, navigation, gaming applications, mobile robot and Artificial Intelligence.
EAGRO CROP MARKETING FOR FARMING COMMUNITYijfcstjournal
The Major Occupation in India is the Agriculture; the people involved in the Agriculture belong to the poor
class and category. The people of the farming community are unaware of the new techniques and Agromachines, which would direct the world to greater heights in the field of agriculture. Though the farmers
work hard, they are cheated by agents in today’s market. This serves as a opportunity to solve
all the problems that farmers face in the current world. The eAgro crop marketing will serve as a better
way for the farmers to sell their products within the country with some mediocre knowledge about using
the website. This would provide information to the farmers about current market rate of agro-products,
their sale history and profits earned in a sale. This site will also help the farmers to know about the market
information and to view agricultural schemes of the Government provided to farmers.
EDGE-TENACITY IN CYCLES AND COMPLETE GRAPHSijfcstjournal
It is well known that the tenacity is a proper measure for studying vulnerability and reliability in graphs.
Here, a modified edge-tenacity of a graph is introduced based on the classical definition of tenacity.
Properties and bounds for this measure are introduced; meanwhile edge-tenacity is calculated for cycle
graphs and also for complete graphs.
COMPARATIVE STUDY OF DIFFERENT ALGORITHMS TO SOLVE N QUEENS PROBLEMijfcstjournal
This Paper provides a brief description of the Genetic Algorithm (GA), the Simulated Annealing (SA)
Algorithm, the Backtracking (BT) Algorithm and the Brute Force (BF) Search Algorithm and attempts to
explain the way as how the Proposed Genetic Algorithm (GA), the Proposed Simulated Annealing (SA)
Algorithm using GA, the Backtracking (BT) Algorithm and the Brute Force (BF) Search Algorithm can be
employed in finding the best solution of N Queens Problem and also, makes a comparison between these
four algorithms. It is entirely a review based work. The four algorithms were written as well as
implemented. From the Results, it was found that, the Proposed Genetic Algorithm (GA) performed better
than the Proposed Simulated Annealing (SA) Algorithm using GA, the Backtracking (BT) Algorithm and
the Brute Force (BF) Search Algorithm and it also provided better fitness value (solution) than the
Proposed Simulated Annealing Algorithm (SA) using GA, the Backtracking (BT) Algorithm and the Brute
Force (BF) Search Algorithm, for different N values. Also, it was noticed that, the Proposed GA took more
time to provide result than the Proposed SA using GA.
PSTECEQL: A NOVEL EVENT QUERY LANGUAGE FOR VANET’S UNCERTAIN EVENT STREAMSijfcstjournal
In recent years, the complex event processing technology has been used to process the VANET’s temporal
and spatial event streams. However, we usually cannot get the accurate data because the device sensing
accuracy limitations of the system. We only can get the uncertain data from the complex and limited
environment of the VANET. Because the VANET’s event streams are consist of the uncertain data, so they
are also uncertain. How effective to express and process these uncertain event streams has become the core
issue for the VANET system. To solve this problem, we propose a novel complex event query language
PSTeCEQL (probabilistic spatio-temporal constraint event query language). Firstly, we give the definition
of the possible world model of VANET’s uncertain event streams. Secondly, we propose an event query
language PSTeCEQL and give the syntax and the operational semantics of the language. Finally, we
illustrate the validity of the PSTeCEQL by an example.
CLUSTBIGFIM-FREQUENT ITEMSET MINING OF BIG DATA USING PRE-PROCESSING BASED ON...ijfcstjournal
Now a day enormous amount of data is getting explored through Internet of Things (IoT) as technologies
are advancing and people uses these technologies in day to day activities, this data is termed as Big Data
having its characteristics and challenges. Frequent Itemset Mining algorithms are aimed to disclose
frequent itemsets from transactional database but as the dataset size increases, it cannot be handled by
traditional frequent itemset mining. MapReduce programming model solves the problem of large datasets
but it has large communication cost which reduces execution efficiency. This proposed new pre-processed
k-means technique applied on BigFIM algorithm. ClustBigFIM uses hybrid approach, clustering using kmeans algorithm to generate Clusters from huge datasets and Apriori and Eclat to mine frequent itemsets
from generated clusters using MapReduce programming model. Results shown that execution efficiency of
ClustBigFIM algorithm is increased by applying k-means clustering algorithm before BigFIM algorithm as
one of the pre-processing technique.
A MUTATION TESTING ANALYSIS AND REGRESSION TESTINGijfcstjournal
Software testing is a testing which conducted a test to provide information to client about the quality of the
product under test. Software testing can also provide an objective, independent view of the software to
allow the business to appreciate and understand the risks of software implementation. In this paper we
focused on two main software testing –mutation testing and mutation testing. Mutation testing is a
procedural testing method, i.e. we use the structure of the code to guide the test program, A mutation is a
little change in a program. Such changes are applied to model low level defects that obtain in the process
of coding systems. Ideally mutations should model low-level defect creation. Mutation testing is a process
of testing in which code is modified then mutated code is tested against test suites. The mutations used in
source code are planned to include in common programming errors. A good unit test typically detects the
program mutations and fails automatically. Mutation testing is used on many different platforms, including
Java, C++, C# and Ruby. Regression testing is a type of software testing that seeks to uncover
new software bugs, or regressions, in existing functional and non-functional areas of a system after
changes such as enhancements, patches or configuration changes, have been made to them. When defects
are found during testing, the defect got fixed and that part of the software started working as needed. But
there may be a case that the defects that fixed have introduced or uncovered a different defect in the
software. The way to detect these unexpected bugs and to fix them used regression testing. The main focus
of regression testing is to verify that changes in the software or program have not made any adverse side
effects and that the software still meets its need. Regression tests are done when there are any changes
made on software, because of modified functions.
GREEN WSN- OPTIMIZATION OF ENERGY USE THROUGH REDUCTION IN COMMUNICATION WORK...ijfcstjournal
Advances in micro fabrication and communication techniques have led to unimaginable proliferation of
WSN applications. Research is focussed on reduction of setup operational energy costs. Bulk of operational
energy costs are linked to communication activities of WSN. Any progress towards energy efficiency has a
potential of huge savings globally. Therefore, every energy efficient step is an endeavour to cut costs and
‘Go Green’. In this paper, we have proposed a framework to reduce communication workload through: Innetwork compression and multiple query synthesis at the base-station and modification of query syntax
through introduction of Static Variables. These approaches are general approaches which can be used in
any WSN irrespective of application.
A NEW MODEL FOR SOFTWARE COSTESTIMATION USING HARMONY SEARCHijfcstjournal
Accurate and realistic estimation is always considered to be a great challenge in software industry.
Software Cost Estimation (SCE) is the standard application used to manage software projects. Determining
the amount of estimation in the initial stages of the project depends on planning other activities of the
project. In fact, the estimation is confronted with a number of uncertainties and barriers’, yet assessing the
previous projects is essential to solve this problem. Several models have been developed for the analysis of
software projects. But the classical reference method is the COCOMO model, there are other methods
which are also applied such as Function Point (FP), Line of Code(LOC); meanwhile, the expert`s opinions
matter in this regard. In recent years, the growth and the combination of meta-heuristic algorithms with
high accuracy have brought about a great achievement in software engineering. Meta-heuristic algorithms
which can analyze data from multiple dimensions and identify the optimum solution between them are
analytical tools for the analysis of data. In this paper, we have used the Harmony Search (HS)algorithm for
SCE. The proposed model which is a collection of 60 standard projects from Dataset NASA60 has been
assessed.The experimental results show that HS algorithm is a good way for determining the weight
similarity measures factors of software effort, and reducing the error of MRE.
AGENT ENABLED MINING OF DISTRIBUTED PROTEIN DATA BANKSijfcstjournal
Mining biological data is an emergent area at the intersection between bioinformatics and data mining
(DM). The intelligent agent based model is a popular approach in constructing Distributed Data Mining
(DDM) systems to address scalable mining over large scale distributed data. The nature of associations
between different amino acids in proteins has also been a subject of great anxiety. There is a strong need to
develop new models and exploit and analyze the available distributed biological data sources. In this study,
we have designed and implemented a multi-agent system (MAS) called Agent enriched Quantitative
Association Rules Mining for Amino Acids in distributed Protein Data Banks (AeQARM-AAPDB). Such
globally strong association rules enhance understanding of protein composition and are desirable for
synthesis of artificial proteins. A real protein data bank is used to validate the system.
International Journal on Foundations of Computer Science & Technology (IJFCST)ijfcstjournal
International Journal on Foundations of Computer Science & Technology (IJFCST) is a Bi-monthly peer-reviewed and refereed open access journal that publishes articles which contribute new results in all areas of the Foundations of Computer Science & Technology. Over the last decade, there has been an explosion in the field of computer science to solve various problems from mathematics to engineering. This journal aims to provide a platform for exchanging ideas in new emerging trends that needs more focus and exposure and will attempt to publish proposals that strengthen our goals. Topics of interest include, but are not limited to the following:
Because the technology is used largely in the last decades; cybercrimes have become a significant
international issue as a result of the huge damage that it causes to the business and even to the ordinary
users of technology. The main aims of this paper is to shed light on digital crimes and gives overview about
what a person who is related to computer science has to know about this new type of crimes. The paper has
three sections: Introduction to Digital Crime which gives fundamental information about digital crimes,
Digital Crime Investigation which presents different investigation models and the third section is about
Cybercrime Law.
DISTRIBUTION OF MAXIMAL CLIQUE SIZE UNDER THE WATTS-STROGATZ MODEL OF EVOLUTI...ijfcstjournal
In this paper, we analyze the evolution of a small-world network and its subsequent transformation to a
random network using the idea of link rewiring under the well-known Watts-Strogatz model for complex
networks. Every link u-v in the regular network is considered for rewiring with a certain probability and if
chosen for rewiring, the link u-v is removed from the network and the node u is connected to a randomly
chosen node w (other than nodes u and v). Our objective in this paper is to analyze the distribution of the
maximal clique size per node by varying the probability of link rewiring and the degree per node (number
of links incident on a node) in the initial regular network. For a given probability of rewiring and initial
number of links per node, we observe the distribution of the maximal clique per node to follow a Poisson
distribution. We also observe the maximal clique size per node in the small-world network to be very close
to that of the average value and close to that of the maximal clique size in a regular network. There is no
appreciable decrease in the maximal clique size per node when the network transforms from a regular
network to a small-world network. On the other hand, when the network transforms from a small-world
network to a random network, the average maximal clique size value decreases significantly
LF Energy Webinar: Electrical Grid Modelling and Simulation Through PowSyBl -...DanBrown980551
Do you want to learn how to model and simulate an electrical network from scratch in under an hour?
Then welcome to this PowSyBl workshop, hosted by Rte, the French Transmission System Operator (TSO)!
During the webinar, you will discover the PowSyBl ecosystem as well as handle and study an electrical network through an interactive Python notebook.
PowSyBl is an open source project hosted by LF Energy, which offers a comprehensive set of features for electrical grid modelling and simulation. Among other advanced features, PowSyBl provides:
- A fully editable and extendable library for grid component modelling;
- Visualization tools to display your network;
- Grid simulation tools, such as power flows, security analyses (with or without remedial actions) and sensitivity analyses;
The framework is mostly written in Java, with a Python binding so that Python developers can access PowSyBl functionalities as well.
What you will learn during the webinar:
- For beginners: discover PowSyBl's functionalities through a quick general presentation and the notebook, without needing any expert coding skills;
- For advanced developers: master the skills to efficiently apply PowSyBl functionalities to your real-world scenarios.
Elevating Tactical DDD Patterns Through Object CalisthenicsDorra BARTAGUIZ
After immersing yourself in the blue book and its red counterpart, attending DDD-focused conferences, and applying tactical patterns, you're left with a crucial question: How do I ensure my design is effective? Tactical patterns within Domain-Driven Design (DDD) serve as guiding principles for creating clear and manageable domain models. However, achieving success with these patterns requires additional guidance. Interestingly, we've observed that a set of constraints initially designed for training purposes remarkably aligns with effective pattern implementation, offering a more ‘mechanical’ approach. Let's explore together how Object Calisthenics can elevate the design of your tactical DDD patterns, offering concrete help for those venturing into DDD for the first time!
Essentials of Automations: Optimizing FME Workflows with ParametersSafe Software
Are you looking to streamline your workflows and boost your projects’ efficiency? Do you find yourself searching for ways to add flexibility and control over your FME workflows? If so, you’re in the right place.
Join us for an insightful dive into the world of FME parameters, a critical element in optimizing workflow efficiency. This webinar marks the beginning of our three-part “Essentials of Automation” series. This first webinar is designed to equip you with the knowledge and skills to utilize parameters effectively: enhancing the flexibility, maintainability, and user control of your FME projects.
Here’s what you’ll gain:
- Essentials of FME Parameters: Understand the pivotal role of parameters, including Reader/Writer, Transformer, User, and FME Flow categories. Discover how they are the key to unlocking automation and optimization within your workflows.
- Practical Applications in FME Form: Delve into key user parameter types including choice, connections, and file URLs. Allow users to control how a workflow runs, making your workflows more reusable. Learn to import values and deliver the best user experience for your workflows while enhancing accuracy.
- Optimization Strategies in FME Flow: Explore the creation and strategic deployment of parameters in FME Flow, including the use of deployment and geometry parameters, to maximize workflow efficiency.
- Pro Tips for Success: Gain insights on parameterizing connections and leveraging new features like Conditional Visibility for clarity and simplicity.
We’ll wrap up with a glimpse into future webinars, followed by a Q&A session to address your specific questions surrounding this topic.
Don’t miss this opportunity to elevate your FME expertise and drive your projects to new heights of efficiency.
Key Trends Shaping the Future of Infrastructure.pdfCheryl Hung
Keynote at DIGIT West Expo, Glasgow on 29 May 2024.
Cheryl Hung, ochery.com
Sr Director, Infrastructure Ecosystem, Arm.
The key trends across hardware, cloud and open-source; exploring how these areas are likely to mature and develop over the short and long-term, and then considering how organisations can position themselves to adapt and thrive.
Transcript: Selling digital books in 2024: Insights from industry leaders - T...BookNet Canada
The publishing industry has been selling digital audiobooks and ebooks for over a decade and has found its groove. What’s changed? What has stayed the same? Where do we go from here? Join a group of leading sales peers from across the industry for a conversation about the lessons learned since the popularization of digital books, best practices, digital book supply chain management, and more.
Link to video recording: https://bnctechforum.ca/sessions/selling-digital-books-in-2024-insights-from-industry-leaders/
Presented by BookNet Canada on May 28, 2024, with support from the Department of Canadian Heritage.
The Art of the Pitch: WordPress Relationships and SalesLaura Byrne
Clients don’t know what they don’t know. What web solutions are right for them? How does WordPress come into the picture? How do you make sure you understand scope and timeline? What do you do if sometime changes?
All these questions and more will be explored as we talk about matching clients’ needs with what your agency offers without pulling teeth or pulling your hair out. Practical tips, and strategies for successful relationship building that leads to closing the deal.
Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...UiPathCommunity
💥 Speed, accuracy, and scaling – discover the superpowers of GenAI in action with UiPath Document Understanding and Communications Mining™:
See how to accelerate model training and optimize model performance with active learning
Learn about the latest enhancements to out-of-the-box document processing – with little to no training required
Get an exclusive demo of the new family of UiPath LLMs – GenAI models specialized for processing different types of documents and messages
This is a hands-on session specifically designed for automation developers and AI enthusiasts seeking to enhance their knowledge in leveraging the latest intelligent document processing capabilities offered by UiPath.
Speakers:
👨🏫 Andras Palfi, Senior Product Manager, UiPath
👩🏫 Lenka Dulovicova, Product Program Manager, UiPath
PHP Frameworks: I want to break free (IPC Berlin 2024)Ralf Eggert
In this presentation, we examine the challenges and limitations of relying too heavily on PHP frameworks in web development. We discuss the history of PHP and its frameworks to understand how this dependence has evolved. The focus will be on providing concrete tips and strategies to reduce reliance on these frameworks, based on real-world examples and practical considerations. The goal is to equip developers with the skills and knowledge to create more flexible and future-proof web applications. We'll explore the importance of maintaining autonomy in a rapidly changing tech landscape and how to make informed decisions in PHP development.
This talk is aimed at encouraging a more independent approach to using PHP frameworks, moving towards a more flexible and future-proof approach to PHP development.
DevOps and Testing slides at DASA ConnectKari Kakkonen
My and Rik Marselis slides at 30.5.2024 DASA Connect conference. We discuss about what is testing, then what is agile testing and finally what is Testing in DevOps. Finally we had lovely workshop with the participants trying to find out different ways to think about quality and testing in different parts of the DevOps infinity loop.
Builder.ai Founder Sachin Dev Duggal's Strategic Approach to Create an Innova...Ramesh Iyer
In today's fast-changing business world, Companies that adapt and embrace new ideas often need help to keep up with the competition. However, fostering a culture of innovation takes much work. It takes vision, leadership and willingness to take risks in the right proportion. Sachin Dev Duggal, co-founder of Builder.ai, has perfected the art of this balance, creating a company culture where creativity and growth are nurtured at each stage.
Quantum Computing: Current Landscape and the Future Role of APIs
CONGESTION CONTROL USING FUZZY BASED LSPS IN MULTIPROTOCOL LABEL SWITCHING NETWORKS
1. International Journal in Foundations of Computer Science & Technology (IJFCST) Vol.6, No.2, March 2016
DOI:10.5121/ijfcst.2016.6201 1
CONGESTION CONTROL USING FUZZY BASED LSPS
IN MULTIPROTOCOL LABEL SWITCHING
NETWORKS
Anju Bhandari and V.P. Singh
Department of Computer Science and Engineering, Thapar University, Patiala, Punjab
ABSTRACT
In this paper, we have proposed a fuzzy based decision making component for high volume traffic MPLS
networks, by implementing Traffic Engineering, Quality of Service and Multipath routing. The approach
explicitly proves to be successful in solving the issues and challenges pertaining to stability, scalability in
high volume and dynamic traffic. Furthermore, it will work to handle congestion by higher link utilization
and provides efficient rerouting of traffic along with fault tolerance in the network. In this research work,
fuzzy calculations are done for fixing the attributes of the MPLS label(s), which is put on particular packet
representing the Forwarding Equivalence Class. Fuzzy controller consists of two sub fuzzy systems- Label
Switched Path setup System (LsS) and Traffic Splitting System (TSS). The computation of dynamic status of
Load and Delay is utilized by LsS to arrange the paths in preference order. The attained Link Capacity and
Utilization Rate are employing by TSS for maintaining congestion free path. The impact of this is to
facilitate, we have better decision making for splitting the traffic for different promising paths. This was
apparent from the series of traffic scenarios. Observations are obtained using this realization.
KEYWORDS
Multi Protocol Label Switching, Label Switched Path, Fuzzy Mixed Metric, Quality of Service, Traffic
Splitting, Traffic Regulator.
1. INTRODUCTION
Due to the characteristics like high speed traffic, rapid topological changes and repetitive
discontinuities. It is difficult to design an efficient protocol for MPLS networks. The MPLS is
basically works on the concept of Label Switched Router (LSR) and helps to control the flow of
the traffic. In this research work, Fuzzy calculations are done for fixing the attributes of the
MPLS label, which is put on particular packet representing the Forwarding Equivalence Class
(FEC). Since, MPLS packets have a different Layer 2 encoding [1-3]. The receiving LSR is aware
of the MPLS packet, based on the layer 2 encoding. The range of labels ranges from 0 all the way
through (20^20-1). Leaving aside the reserved and future ranges, our fuzzy based labels
(LsS_value, TSS_value) arrives at these crisp values to take decision on path routing. The impact
of this is that, we have better decision making for splitting the traffic for different possible paths.
This was apparent from the series of traffic scenarios. An observation is obtained using this
implementation and portrays the results in section afterward.
In terms of speed and scalability, today MPLS network is managing video traffic and it works
well in adversity attacks like denial-of-service (DDoS) [4] attacks. When the data volume is too
high and does not follow a predictable pattern, it becomes very challenging. Although, traffic
splitting is the only condition to maintain business continuity and various statistical methods,
machine learning methods have been implemented to understand traffic patterns and to take
traffic engineering decisions. But these methods suffer from issues like large overhead and
shallow analysis of current traffic. The dynamic rule based Engines are best suited for taking
Traffic Engineering (TE) decisions because they can be utilized for fine tuning the TE decision
2. International Journal in Foundations of Computer Science & Technology (IJFCST) Vol.6, No.2, March 2016
2
with low computation cost. The information collection of requirement characterization and the
network state are very difficult tasks in such a highly dynamic networks, which is the motivation
due to which researchers have used Fuzzy Logic (FL) for solving these problems. It is one of the
key issues to provide end-to-end QoS guarantees in today's networks. However, determining a
feasible route in the current scenario of traffic along with its constraint is difficult to model and it
is even harder to build a solution that will keep the network congestion free. In this case, FL can
be a really helpful. FL has been found in many applications of telecommunications networks. In
[13, 14] many different fuzzy logic controllers were proposed for traffic management in ATM
networks and also to provide QoS in Communication networks. Hence, an idea of applying FL on
the networks is to get better traffic management is surveyed in the paper.
The paper is organized with following details. Section 2 gives short description of stack of MPLS
protocols. The Section 3 and 4 describes the proposed algorithm to overcome the limitation of
existing MPLS based protocols used for traffic engineering. Section 5 demonstrates and gives
analytical view of the theory of simulation done to validate the proposed algorithm. Finally,
discussion and conclusions are presented.
2. RELATED WORK AND DISCUSSION
In the traditional approach, all types of traffic packets are treated equally. This is acceptable for
the application like e-mail and those having no specific requirements for latency or bandwidth,
but it becomes unacceptable and very challenging for high-speed networks, such as the real time
applications and mission critical applications e.g. IP telephony, gaming, hard Quality of Service
(QoS) demanding services [5, 6].One of the given solution is traffic management with MPLS
protocol. Several heuristics and approximation algorithms have been proposed for this problem.
But, most of them suffer from either excessive computational cost or low performance.
Algorithms [7-8] like Minimum Hop Algorithm (MHA), Widest Shortest Path algorithm (WSP)
and Shortest Widest Path (SWP) are based on the concept of combination of Shortest Path and
Traffic Engineering, but these are not able to give reliable traffic scenario of the network.
Minimum Interference Routing Algorithm (MIRA) and New Minimum Interference Routing
Algorithm (NewMIRA) are based on the combination of TE and QoSR constraints. MIRA works
on the potential traffic of Ingress-Egress routers as a weight to calculate shortest path. It is based
on the observation that usage of certain critical links must be avoided to some possible extent.
The objective in MHA is to minimize resource usage. It does not permit the protection of certain
ingress–egress pairs from having their available capacities being reduced too much by traffic
traversing between other ingress–egress pairs. It takes these factors into account when
determining the path for the current demand. It performs explicit routing of Label Switched Path
(LSP) in MPLS networks. Fowler et al. [10] proposed and evaluated a method that selects
alternative routes based on the minimum time delay between the Ingress and the Egress when a
new traffic flow arrives. Wu Hsiao Hsu et al. [11] proposed load balancing approach in handling
the high volume traffic problems. The load sensitive approach maximizes resource utilization,
and leads to a high number of packets reaching the destination. [12] Introduced an approach that
established alternate paths and switch the ongoing traffic on them before the existing paths are
pre-empted. It causes a loss of network throughput due to delay occurred and selects alternative
paths when links become overloaded to give superior performance over routing algorithms.
Fuzzy algorithms [13-31] are based on different fuzzy parameters to give desirable output in
different networks. Authors [15] utilized FL to model the multiobjective routing problem in
mobile Ad-hoc networks. Authors [16] proposed a method for building a fuzzy system capable of
predicting the QoS performance of each queue in a DiffServ node. Authors [17] applied the
abilities of FL to propose a technique for designing a fuzzy based traffic conditioner. Nahid
Ebrahimi Majd [28] found that fuzzy approach has a lower average setup time for establishing a
3. International Journal in Foundations of Computer Science & Technology (IJFCST) Vol.6, No.2, March 2016
3
connection than the previous existing approach. He concludes parameters like propagation delay,
bandwidth and loss probability to form Fuzzy Mixed Metric (FMM) and generates best path in
MPLS networks. It gives more priority to loss probability metric than any other metrics. It studied
that fuzzy approach enhances the throughput and overall network performance. FMM is more
efficient and overall drop is minimum than Wang et al. and Single Mixed Metric (SMM).
N.M.Din [29] introduced the FL predictor for the real time traffic for TE decisions. According to
the research work, the fuzzy predictor is used to construct one output (utilization) from two fuzzy
inputs (average rate, available bandwidth). As per the claims of author the network performance
increases, so that efficiency. There is a necessity to increase the control and to provide
intelligence to the network. Sergio Gramajo et al. [30] introduced traffic prioritization which
identifies traffic and then paths are allocated to them. The demand of this technique is increasing
day by day as it is very useful in critical network services. But, even then these are not able to
fully utilize the resources and lead to over and under utilization of the routes. As per this paper,
authors are advised to combine the features of TE, Quality of service Routing (QoSR) and FL on
the networks to get better traffic management. Hence, after conducting this systematic survey, we
have found an ample opportunity to the existing MPLS protocol for traffic engineering decisions
by utilizing FL.
2. THE PROPOSED FUZZY CONTROL METHODOLOGY
In this work, we have offered a soft component that classifies and arranging paths in preference
order and then perform traffic splitting among them. The objective is to develop a system for
highly loaded conditions i.e. when all communication links are congested and it is not possible to
maintain QoS. The objective consists of categorising the paths in the preferential order and
distributing the traffic over required number of LSP. FL is proved to be very effective in a lot of
applications, such as intelligent control, decision making process etc. FL is based on a set of
metrics which can be or not connected with each other. It calculates the best route by using
minimum complex computation of the most important and appropriate parameters. The detail is
in the next section.
3.1. Architecture of Traffic Regulator: Fuzzy Logic Control System
The Fuzzy logic Control System (FLCS) is sited at ingress node. FLCS is composed of two sub
fuzzy control systems - Label Switched Path setup System (LsS) and Traffic Splitting System
(TSS) as shown in the Figure 1.
Figure 1.Computation of Fuzzy based LSPs to perform Traffic management
LsS selects LSPs according to two input fuzzy metrics (delay and load) and gives output fuzzy
metric LsS_value. Load and Delay are suitable QoS factors on which selection of appropriate
path depends. TSS performs the traffic splitting among the computed paths, according to the two
4. International Journal in Foundations of Computer Science & Technology (IJFCST) Vol.6, No.2, March 2016
4
input fuzzy metrics (utilization rate and link capacity) and gives output fuzzy metric TSS_value.
An appropriate decision of traffic splitting is performed among the computed number of LSPs
required by Traffic Splitting Algorithm (TSA). The computed fuzzy based LSPs for forwarding
packets are obtained to avoid the situation of underutilization and over utilization of paths. None
of the paths remains idle for longer time and proper utilization of resources takes place. Hence, it
is better for congestion to be prevented rather than corrected. Implementation of FL using
Mamdani Fuzzy Inference System [31] evaluates final decisions as LsS_value and TSS_value.
The available number of rules in the Rule Base matrix LsS and TSS represents intermediate
situations and provides the control mechanism with a highly dynamic action.
LsS rule base is a set of inputs (delay (D), load(L)) with their five linguistic values (Very Low
(VL), Low (L), Medium (M), High (H), Very High (VH)) and output LsS_value with their seven
linguistic values (Zero (Z), Tiny (T), Very Small (VS), Small (S), Big (B), Very Big (VB), High
(H)) forms at most 5*5 = 25 possible combinations. The matrix shown as Figure 2 is referred as
Fuzzy Rule Base Matrix-LsS with columns representing D and rows representing L. Hence,
optimized decisions are made using developed 25 rules (R1, R2, R3…R25), which are maximum
possible cases for the selection of LSPs under different situations.
Figure 2. Fuzzy Rule Base Matrix- LsS with inputs (load, delay)
According to the QoS requirements of multimedia applications; indeed, the International
Telecommunications Union standard (ITU- recommendation 14), we are defining boundaries of
fuzzy sets of input parameters shown in Table 1.
Table 1. Linguistic values of (load, delay, utilization rate and link capacity) with their boundaries
Linguistic values with their boundaries
Load
VL L M H
VH
Below 0 to
250
0 to 500 250 to 750
500 to
1000
750 to above than 1000
Delay
VL L M H
VH
Below 0
to .25
0 to 5.0 2.5 to 7.5 5.0 to 10 7.5 to above than 10
Utilizatio
n rate Z T VS S B VB H
5. International Journal in Foundations of Computer Science & Technology (IJFCST) Vol.6, No.2, March 2016
5
Below 0
to .16
0 to .33 .16 to .50 .33 to .66
.50
to .83
.66 to
1
.83 to
above than
1
Link
capacity
VL L M H VH
Below 0 to
250
0 to 500 250 to 750
500 to
1000
750 to above than 1000
This FMM (LsS-Fuzzy Rule Base Matrix) provides large number of options to obtain best routing
decisions. It provides efficient alternate paths in preference order that support Traffic Engineering
and Path Optimization. The computed output response LsS_value identifies the paths as shown in
Table 2.
It demonstrates the classification of LSPs and also defines the fuzzy set boundaries. Paths lying in
region Z, T, VS, S, B, VB, H are best, very good, good, satisfactory, just acceptable, not
acceptable and rejected respectively. Hence, in this way it arranges the paths in preferential order
for the successful transmission of packets.
Table 2. Categorization of LSPs according to computed output value LsS_value
TSS rule base is a set of inputs (utilization rate (UR), link capacity (LC)), with their seven
linguistic values of UR (Zero (Z), Tiny (T), Very Small (VS), Small (S), Big (B), Very Big (VB),
High (H)) and five linguistic values of LC (Very Low (VL), Low (L) Medium (M), High (H),
Very High (VH)) and output TSS_value with their five linguistic values (Very Low (VL), Low
(L) Medium (M), High (H), Very High (VH)) forms at most 7*5 = 35 possible combinations. The
matrix shown in Figure 3 is referred as Fuzzy Rule Base Matrix- TSS with columns representing
UR and rows representing LC. Hence, optimized decisions are made using developed rules 35
(R1, R2, R3… R35).
6. International Journal in Foundations of Computer Science & Technology (IJFCST) Vol.6, No.2, March 2016
6
Figure 3. Fuzzy Rule Base Matrix-TSS with inputs (link capacity, utilization rate)
At different values of utilization rate and link capacity, the values of linguistic variables are
obtained as defined in Table 1, which indicates the boundaries of input fuzzy sets of TSS. This
FMM (TSS-Fuzzy Rule Base Matrix) gives the information of the requirement of number of
LSPs. Table 3 demonstrates the number of LSPs needed for the operation according to traffic
scenario. If TSS_value lies in the region of NC, it is defined as no change or no need of additional
LSP for congestion free transmission. Requirement of LSPs is obtained from TSS_value lies as
defined in Table 3, to check that in which region (IO, IW, IT, A) values are lying.
Table 3. Traffic Splitting among LSPs according to output value TSS_value
The requirement of number of LSPs depends upon the current dynamic scenario of the network in
terms of highly loaded, loaded, equilibrium, lightly loaded, and least loaded. In highly loaded
network - more number of paths is required and in lightly loaded- less number of paths is
required. Hence, by applying Traffic Engineering (TE)/load balancing, objective of congestion
free network is achieved.
For the simplicity of operation, Triangular Membership Function (TMF) is applied to obtain the
membership function of metrics as:-
triangle (x; a, b, c) = max (min (x-a/b-a, c-x/c-b), 0), (1)
7. International Journal in Foundations of Computer Science & Technology (IJFCST) Vol.6, No.2, March 2016
7
It is defined by three parameters, where b indicates the point on which, the membership function
value is 1, a and c indicate the left and right limits of the definition domain of the membership
function. On applying TMF as shown in formula (1), we obtain membership functions of input
and output parameters as follows:-
µload = {µVL,µL,µM,µH,µVH},
µdelay= {µVL,µL,µM,µH,µVH},
µ LsS_value = {µZ,µT,µVS,µS,µB,µVB,µH},
µutilization_ ַ◌rate = {µZ,µT,µVS,µS,µB,µVB,µH},
µlink_capacity= {µVL,µL,µM,µH,µVH},
µTSS_value = {µNC,µIO,µIW,µIT,µA}.
Decisions are based on the testing of rules of the rule bases and recognition of fired rules
(activated rules). Minimum (MIN) operation is applied to find out the minimum or least value of
parameters. The output responses LsS_value and TSS_value are obtained by applying logical
product (AND) on fired rules. These fired rules combined to make an optimal decision.
Composition combines the effects of all applicable rules and gives the best-weighted influence of
fired rules as shown in Table 4. Output linguistic terms are obtained as the combination of
different rules. The execution of if then rules of fuzzy controllers is explained in Annexure I.
Table 4. Composition of rules of fuzzy controllers LsS and TSS
Decision function is computed using as Center Average defuzzifier or discrete centroid method as
follows:-
(2)
This is an approximation of Center of Area (COA) defuzzifier method [33, 34]. xci denotes center
points of the output linguistic terms (xi), µCA is membership function of output linguistic term and
µxi is membership function value of input linguistic term. On applying formula (2) on the
linguistic terms and linguistic centers of control systems, LsS_value and TSS_value are obtained
as shown in Table 5.
8. International Journal in Foundations of Computer Science & Technology (IJFCST) Vol.6, No.2, March 2016
8
Table 5. Defuzzification of fuzzy controllers
3.2 Decision maker: Fuzzy Logic Control System Algorithm (FLCS)
FLCS algorithm is a proposed algorithm which implements and evaluates results of above
mentioned system. It is composed of two parts; firstly determination and selection of multiple
paths using LsS and secondly allocating network traffic among the required number of paths
using TSS.
3.2.1 Determination and Selection of multiple paths using LsS
It uses two metrics L, D for the selection of LSPs. L(i,j), load specifying number of packets to be
sent on link (i,j) and D(i,j), delay specifying delay of link (i,j) during transmission. D(i,j) is
computed as follows:-
D(i,j) = L(i,j)/ LC(i,j). (3)
LsS fuzzy inference system gives LsS_value (i,j), which identifies links for the selection of LSPs.
Link having minimum LsS_value is selected for the operation.
3.2.2 Allocating network traffic among the required number of paths using TSS.
It uses two metrics LC and UR for finding the requirement of LSPs for successfully congestion
free transmission. It is considered that link capacity of each link will remain same throughout the
execution, but load, delay, utilization rate get changed. LC(i, j), link_capacity giving bandwidth
value of link (i,j). UR(i,j), utilization_rate specifying utilization rate of link (i,j) computed as
UR(i,j) = Freq(i,j)/NL(i). (4)
Where Freq (i,j) is a frequency of link (i,j) and NL(i) gives a number of outgoing links from node
i. TSS fuzzy inference system gives TSS_value (i,j) of each link used to compute number of paths
required (Nlsps) for operation. The execution steps of FLCS algorithm shown below.
9. International Journal in Foundations of Computer Science & Technology (IJFCST) Vol.6, No.2, March 2016
9
FLCS (L, D, UR, LC)
Begin
1. LsS_value(i,j) = LsS(D,L) /*Call LsS computes LsS_value to identify links for the selection
of LSPs on processing inputs D and L */
2. TSS_value(i,j) = TSS(UR, LC)
Nlsps = TSS_value(i,j) /*Call TSS computes TSS_value to obtain the number of LSPs
required for operation on processing input UR and LC */
3. while(L(i,j)!= 0) /*Transmission will be continue till load at node i=ingress is non
zero*/
3.1 for k= 1 to Nlsps /*Traffic splitting takes place among the Nlsps */
Slsp[k] = min(LsS(i,j)) /*Generation of optimal LSPs (links having minimum
LsS_value) is obtained in Slsp
*/
3.2 Freq(i,j) = Freq(i,j) +1 /*Respective frequency of LSP is updated */
End
Step 1:-LsS computes the respective LsS_value of each link (i,j) of FLCS.
Step 2:-TSS computes the respective TSS_value of each link (i,j) of FLCS, which gives the
requirement of traffic splitting in network.
Step 3:-Transmission will continue till load at ingress is non zero. Traffic splitting takes place
among the optimal Nlsps (LSP having minimum LsS_value). Respective frequency of each
link (i,j) is incremented according to the number of times a particular link (i,j) is used. Slsp gives
the optimal LSPs for operation.
4. AN ILLUSTRATIVE EXAMPLE TO REALIZE ALGORITHM
For the realization of FLCS, the configuration of the network of 8 nodes shown in Figure 4 is
assumed. The ingress of network is node 1 and egress is node 8. In the network each link (i,j)
contains information as a set of 4 parameters (L, D, UR, LC). The algorithm presented in section
3.2 is executed for the assumed values of parameters shown as coordinates of links in Figure 4.
Membership functions are obtained for all the set of values of links of assumed network using
formula 1 & 2. In section 4.1, algorithm is implemented and results are obtained. It section 4.2,
the demonstration of generation of LSPs using proposed approach is described.
Figure 4. Input values of L, D, UR, and LC
10. International Journal in Foundations of Computer Science & Technology (IJFCST) Vol.6, No.2, March 2016
10
4.1 Realization of an Algorithm
At a particular instance membership function value of input parameters L, D, UR, LC are
assumed as L=858Mb, D=.936s, UR=.33Mb/s, LC=916Mb/s as shown in Annexure II, using Step
1 and Step 2, values of output parameters LsS_value and TSS_value at these respective input
parameters are evaluated. The final decision as LsS_value obtained indicates that the particular
link is 86% in S and 14% in VS as displayed in Figure 7 of Annexure II.
The final decision as TSS_value obtained indicates that according to the network status 32%
increase of LSPs by two and 68% increase of LSPs by three are required VS as displayed in
Figure 8 of Annexure II. It concludes that the selected link needs 68% splitting of traffic by
increasing LSPs by three. Throughout the simulation process, the updated information of all links
is maintained according to which final decisions takes place. For the better understanding of
approach, we have executed FLCS with different parametric values. The predictions of each link
are computed for the selection of appropriate links for operation. The observations at three
different instants are obtained, which depicts that paths are best, good, very good, satisfactory,
just acceptable, not acceptable and rejected according to the dynamic network. Hence, our
algorithm has all the essential requirements into its account. The results are obtained from fuzzy
controller (LsS, TSS) as matrix LsS_value and TSS_value.
4.2 Generation of LSPS in Assumed Scenario
The generation of LSPs takes place by the execution of FLCS algorithm as studied in above
section.
Figure 5. Generation of LSPs
In Figure 5(a), node 1 is colored orange it indicates that it is a source. Node 1 is having neighbors
as node 2, node3 and node 4. So, these are colored red as shown in Figure 5(b) and the LsS_value
of neighbors are compared. In Figure 5(c) node 2 is colored orange which indicates that it is
selected as it is having least LsS_value. Node 2 is having neighbors as node 3 and node 5 as
shown in Figure 5(c) and the LsS_value of neighbors are compared. Node 5 is colored orange
which indicates that it is selected as it is having least LsS_value shown in Figure 5 (d). Node 5 is
having neighbors as node 6 and node 8 as shown in Fig.5 (d) and the LsS_value of neighbors are
compared. Node 8 is colored orange which indicates that it is selected as it is having least
LsS_value shown in Figure 5 (e), which is final destination also. Hence, in this manner LSP is
11. International Journal in Foundations of Computer Science & Technology (IJFCST) Vol.6, No.2, March 2016
11
generated from node 1 to node 8 as shown in Figure 5 (f). Similarly other LSPs are generated; list
of paths in preference order at different values of parameters is generated as shown in Table 6.
Table 6. Generation of LSPs in the network of 8 nodes
Values of parameters change the decision of selection of path. As, we have to use the optimal
paths for the operation. Generated paths are optimal in terms of number of hops, in order to
minimize the network cost. It has been observed that, when value of these parameters increases
beyond the limit then path becomes unsuitable for future use. Dynamic status of network is
studied and according to that suitable paths are selected. The proposed algorithm is justifying the
requirement specifications of MPLS algorithm as described in [34] and discussed in previous
study too. The proposed algorithm is an online routing algorithm; computational expenses are
low and work on the QoS metrics, which is the most desirable feature.
4.3 Attained Observations of Three Different Scenarios
For validating incremental progress related to solving the problem of traffic splitting, a
comparison between classical approach (OSPF) [39] and proposed work (FLCS) was conducted
by multiple experiments using NS-3[35]. The scenario composed of MPLS-TE together with
constraint based routing (CBR). FLCS performs the dynamic route selection. Our work
demonstrates the improvements by using FLCS for LSP Selection. The topology used to evaluate
the proposed work behaviour consists of three different link capacities and propagation delay, a)
10 Mbps, 3ms, b) 100 Mbps, 2 ms, c) 1000 Mbps, 1 ms. The decisions will be taken by FLCS,
which works in ingress node. The incoming request follows an exponential distribution and the
requested bandwidth is uniformly distributed between ranges [0~10] (Mbps), [10~100] (Mbps),
[100~1000] (Mbps) to model Voice, Data and Video Traffic respectively [36- 38]. Holding time
is randomly distributed with a mean of 300 sec (ON = 0.325 OFF = .64). IPV4 network stack has
been used and packets are generated using a hypothetical ON/OFF model using the Drop tail
queue. Different traffic types are used in simulations like the FTP over the TCP to simulate data
traffic and the constant bit rate (CBR) to simulate voice and video over the UDP. The packet size
of the User Datagram Protocol (UDP) is 512 byte and 1024 byte for the Transport Control
Protocol (TCP). Finally, the existing topology and an available resources present in the database
of ingress are perfectly updated. The statistical comparison (MAXIMUM (MAX), MINIMUM
(MIN), and STANDARD DEVIATION (STDEV)) of FLCS and OSPF is depicted in Table 7,
which reflects that standard deviation for different traffic is high in the case of OSPF.
Node
Generated LSPs in preference order
Ingress = 1 and Egress = 8
1 1->2->5->6->8 1->3->4->7->8 1->4->7->8
2 2->5->6->8 2->3->4->7->8 2->3->6->8 2->3->6->7->8
3 3->4->7->8 3->6->8 3->6->7->8
4 4->7->8
5 5->6->8 5->8 5->6->7->8
6 6->8 6->7->8
7 7->8
12. International Journal in Foundations of Computer Science & Technology (IJFCST) Vol.6, No.2, March 2016
12
Table 7. Statistical study of the results obtained OSPF (red) and FLCS (blue)
In the Figure 6 (a,b) the mean delay and the mean loss rate of video traffic is displayed, which is
obtained with varying UDP traffic for 300 seconds. In the Figure 6 (c,d) the mean delay and mean
loss rate of data traffic is displayed, which is obtained with varying UDP traffic for 300 seconds.
In the Figure 6 (e, f) the mean delay and the mean loss rate of voice traffic is displayed, which is
obtained with varying UDP traffic for 300 seconds. It exhibits improvements in the terms of
mean delay (42.0%) and mean loss rate (2.4%) for Video Traffic, mean delay (5.4%) and mean
loss rate (3.4%) for Data Traffic and mean delay (44.9%) and mean loss rate(4.1%) for Voice
Traffic. Moreover, 42%, 15.4% and 44.4 % of Video packets, Data packets and Voice packets
respectively are dropped due to buffer overflow at the congested node when using OSPF. FLCS
on the other hand, as seen from Figure 6 by avoiding this congestion as mentioned earlier,
maintains the traffic delivery performance. By distributing the traffic over suitable preferable
paths and maintaining low queue lengths, all the packets can be successfully delivered.
The result is an increase in the queuing delay at a particular congested node, consequently leading
congestion, and large waiting time at a few hops where the performance is poor. For few seconds
in the above scenarios, OSPF outperforms due to low queuing delay. Even though FLCS utilizes
multiple paths and it leads to less delay for the said congested path. The obtained results of
simulation experiments are displayed in Table 7 and Figure 6 that give a better understanding of
research work. These findings predict that the fuzzy traffic monitor proved as more efficient
solution and constitute a good alternative to some conventional methods of traffic engineering
based on complex optimization.
5. CONCLUSIONS
Our main premise of this study is based on the fuzzy traffic regulation which works within the
realms of MPLS. The FLCS is sited at ingress node. The proposed fuzzy based approach is highly
suitable for congestion control over MPLS networks. It applies QoS & TE constraints. It is
designed for better video delivery, since it provides better throughput, average delay. We have
also empirically demonstrated the advantages of FLCS over OSPF in NS-3.
In current simulation, the network was using 2 edge routers and 6 switch routers. We have
displayed the obtained results and predictions in above sections. It is applicable for any kind of
traffic, where traffic volume is small and traffic type is normal. However, it is based on traffic
scenarios, which have been implemented in this research paper. It exhibits improvements in the
terms of mean delay (42.0%) and mean loss rate (2.4%) for Video Traffic, mean delay (5.4%) and
mean loss rate (3.4%) for Data Traffic and mean delay (44.9%) and mean loss rate(4.1%) for
13. International Journal in Foundations of Computer Science & Technology (IJFCST) Vol.6, No.2, March 2016
13
Voice Traffic. Moreover, 42%, 15.4% and 44.4 % of Video packets, Data packets and Voice
packets respectively are dropped due to buffer overflow at the congested node when using OSPF.
This work gives an opportunity to analyze the complex scenario in network traffic management,
which would help future implementation in this context. The proposed approach has very
simplified computation as at most 4 rules are fired at an instance. Hence, 4-5 additions and
multiplications are required. Only edge routers are required to be fuzzy inference engine capable,
which needs few kilobytes of memory.
The proposed approach has been presented by an example and it has been concluded that when
the value of L, D changes then, the selection of path also changes. The varying values of UR, LC
determines the traffic splitting among required number of paths. The results presented in this
paper suggest that this fuzzy logic system can accommodate to the traffic conditions and decide
the necessary action accordingly.
FUTURE DIRECTIONS
In Future, work can be carried out to validate the approach in more simulated dynamic scenarios.
The interest of such a work has a big impact for the applications related to the networks, in
particular those dedicated to the mission critical applications. We plan to improve/extend the
work by investigating the practicality of combining multiple learning methods to perform traffic
regulation. In conclusion, multipath routing and provision continue to underlie the current
internet and will shape its future and further innovation.
ACKNOWLEDGEMENTS
We are highly thankful to the reviewers for their valuable suggestions and comments that
significantly helped in improving the quality of research paper.
14. International Journal in Foundations of Computer Science & Technology (IJFCST) Vol.6, No.2, March 2016
14
Figure 6. Variation of Mean delay (s) and Mean Loss Rate (%) with respect to time (secs) for (a) (b)
Video Traffic (c) (d) Data Traffic (e) (f) Voice Traffic
REFERENCES
[1] E.Rosen, A.Viswanathan and R.Callon, (2001), Multi-protocol Label Switching Architecture, RFC
3031.
[2] C.Siva Ram, Murthy Mohan Guruswami, 2002, WDM Optical Networks Concepts, Design and
Algorithms, Prentice Hall of India.
[3] Jeremy Lawrence, (2001), Designing Multiprotocol Label Switching Networks, IEEE
Communications Magazine, 134-142.
15. International Journal in Foundations of Computer Science & Technology (IJFCST) Vol.6, No.2, March 2016
15
[4] D.Awduche, (1999), MPLS and Traffic Engineering in IP Networks, IEEE Communications
Magazine, 37(12), 42-47.
[5] Genge, B., & Siaterlis, C. (2013). Analysis of the effects of distributed denial-of-service attacks on
MPLS networks. International Journal of Critical Infrastructure Protection, 6(2), 87-95.
[6] G.Swallow, MPLS Advantages for Traffic Engineering, IEEE Communications Magazine, 37(12),
(1999), 54–57.
[7] Z.Wang and J. Crowcraft, (1996), Quality-of-Service routing for supplying multimedia applications,
IEEE journal on Selected Areas in Communication, 14(1996), 1228-1234.
[8] Murali S.Kodialam, T. V. Lakshman, (2003), Dynamic Routing of Restorable Bandwidth-Guaranteed
Tunnels Using Aggregated network resource Usage Information, IEEE/ACM Transactions on
Networking, 11, 399-410.
[9] Q.Zheng, G.Mohan, (2006), LSP protection for delay-differentiated dynamic traffic in IP-over-WDM
networks with port constraints, Computer Communications, 29, 1402–1412.
[10] Scott Fowler, Sherali Zeadally and Abdelhamid Mellouk, (2010), End-to End QoS Engineering in
next Generation heterogeneous Networks, Wiley Online Library, 309-345.
[11] Wu-Hsiao Hsu, Yuh- Pyng Shieh and Jenhui Chen, (2010), Multiple path selection algorithm for
DiffServ-Aware MPLS traffic engineering, Elsevier Science Journal Computer Communications, 33,
1557-1565.
[12] Chaun Hau Lau, (2006), Path selection with preemption and re-routing control for multiprotocol label
switching networks, Computer Communications 29, 3719-3732.
[13] Mohammad Hossien Yaghmaee, Mohammad bagher Menhaj, (2001), A novel FLC-based approach
for ATM traffic control, Computer Networks, 36, 643-658.
[14] Mohammad Hossien Yaghmaee,Hoda Taheri, Peyman Neakatollahi, (2012),An energy-aware
distributed clustering protocol in wireless sensor networks using fuzzy logic, Ad-Hoc Networks
10,1469-1481.
[15] C. Chrysostomou, A. Pitsillides, L. Rossides, A. Sekercioglu, (2003), Fuzzy Logic Controlled RED:
Congestion control in TCP/IP differentiated services networks, Soft Computing 8 ,79–92.
[16] Edgard Jamhour, Manoel C.Penna,Ricardo Nabhen, (2009), Modeling a multi-queue network node
with a fuzzy predictor, Fuzzy Sets and Systems, 160,1902-1928.
[17] Mohammad Hossien Yaghmaee, Mohammad bagher Menhaj, Design and performance evaluation of
a fuzzy based traffic conditioner for differentiated services, Computer Networks 47(2005), 847-869.
[18] Junaid A. Khan, Hussein Alnuweiri, (2003), A Traffic Engineered Routing Algorithm Based on
Fuzzy Logic, IEEE Pacific Rim Conference on Communications, Computers and Signal
Processing,1,454-457.
[19] Junaid A. Khan, Hussein Alnuweiri, (2004), A Fuzzy Constraint-Based Routing Algorithm for Traffic
Engineering, IEEE Communications Society1366-1372.
[20] E.Aboelela, C.Douligeris, (1998), Fuzzy Multiobjective Routing Model In B-1SDN, Journal of
Computer Communication, 21(17), 1572-1585.
[21] E.Aboelela, C.Douligeris, July(1997), Routing in Multimetric Networks Using A Fuzzy Link Cost,
The Second IEEE Symposium on Computers and Communications ,397-401.
[22] M.H.Yaghmaee, M.Bahekmat, G. Khojasteh Toussi, (2008), A Novel Fuzzy Logic Base Scheduling
Mechanism for Service Differentiation in IP Networks, Journal of Iranian Association of Electrical
and Electronics Engineers 52 ,54-64.
[23] N.M.Din and N.Fisal, (2008), Fuzzy Logic Bandwidth Prediction and Policing in A DiffServ-Aware
Network, Journal of Computers 3(5), 18-20.
[24] Joaguim Celestino Junior, (2004), FuDyLBA: A Traffic Engineering Load Balance Scheme for
MPLS Networks Based on Fuzzy Logic, Springer LNCS 3124, 622-627.
[25] G.Ran, H.Zhang, S.Gong, (2010), Improving on LEACH protocol of Wireless Sensor Networks using
Fuzzy Logic, Journal of Information and Computational Science, 767-775.
[26] B.Chen, Y.Yang, B.Lee, T.Lee, (2003) ,Fuzzy adaptive predictive flow control of ATM network
traffic, IEEE Transactions on Fuzzy Systems 11 (4),568–581.
[27] S.Ghosh, Q.Razouqi, H.J.Schumacher, A. Celmins, A survey of recent advances in fuzzy logic in
telecommunications networks and new challenges, IEEE Trans. Fuzzy Syst. 6 (3) (1998), 443–447.
[28] Nahid Ebrahimi Majd, Mohammad Hossien Yaghmaee, (2006), A Fuzzy Algorithm for QoS-Based
Routing in MPLS Network, IEEE, Asia-Pacific Conference, APCC '06.
[29] N.M.Din and H.Z.Abidin, S.F.A.Rahman and N.Fisal, (2005), A Fuzzy LSP Regulator for
Preemption Control in A DiffServ-Aware MPLS Internet, IEEE 7th Malaysia International
Conference ,415-420.
16. International Journal in Foundations of Computer Science & Technology (IJFCST) Vol.6, No.2, March 2016
16
[30] Sergio Gramajo, Luis Martinez, (2012), A linguistic decision support model for QoS priorities in
networking, Knowledge-Based Systems 32, 65-75.
[31] J.S.R.Jang, C.T.Sun, E.Mizutani, Neuro-Fuzzy and Soft Computing, Pearson Education, 2010.
[32] D.O.Awduche, J.Malcom, J.Agogbua, M. O’D` ell, and J. McManus, Sept.1999,” Requirements for
traffic engineering over MPLS,” RFC 2702.
[33] E.V.Broekhoven and B.D.Baets, 2006, “Fast and accurate center of gravity defuzzification of fuzzy
system outputs defined on trapezoidal fuzzypartitions,”Fuzzy Sets Syst., vol.157, no. 7, pp. 904–918.
[34] W.V.Leekwijck and E.E.Kerre, 1999, “Defuzzification: Criteria and classification, “Fuzzy Sets Syst.,
vol. 108, no. 2, pp. 159–178.
[35] Carneiro, G., Fontes, H., & Ricardo, M. (2011). Fast prototyping of network protocols through ns-3
simulation model reuse. Simulation Modeling Practice and Theory, 19(9), 2063-2075.
[36] Sánchez-López, S., Masip-Bruin, X., Solé-Pareta, J., & Domingo-Pascual, J. (2002). Providing QoS
in MPLS-ATM integrated environment. In From QoS Provisioning to QoS Charging (pp. 215-224).
Springer Berlin Heidelberg.
[37] Adas, A.(1997). Traffic models in broadband networks. Communications Magazine, IEEE, 35(7), 82-
89.
[38] Park, K., & Willinger, W.(2000). Self-similar network traffic: An overview. Self-similar network
traffic and performance evaluation, 1-38.
[39] Henderson, T.R., Roy, S., Floyd, S., & Riley, G. F. (2006, October). ns-3 project goals. In Proceeding
from the 2006 workshop on ns-2: the IP network simulator (p. 13). ACM.
AUTHORS
Ms. Anju Bhandari is pursuing doctoral program (PhD) at Computer Science and
Engineering Department of Thapar University, Patiala, India. Her qualifications include
B.Tech (CSE), M.Tech (CSE). She is member of ISTE. She has 9 years of teaching and
research experience in soft computing and computer networks.
Dr. V. P. Singh is PhD and ME in Computer Science from Thapar University, Patiala,
India. He is presently serving as assistant professor in the Computer Science and
Engineering Department of Thapar University, India. His research interests include soft
computing, Computer networks, Computer forensics and Cyber Law. He has many
research publications in reputed Journals and Conferences.
APPENDIX I
Proposed Algorithm: FLCS
NOTATIONS
FMM – Fuzzy Mixed Metric, MF- Membership Function, DS – Degree of Strength
LSPs Setup System (LsS)
(a) Computation of (FMM) to find ordered LSPs
Let MF and Y is any value from the defined regions
STEP 1 Put Y into MF system.
STEP 2 Check the area for both the variables (L, D) that in which Y is lying ie
Linguistic term L
1) If perfectly lying in VL area, then assign the computed DS to the fuzzy set VL.
2) If in the area VL & L, then compute the DS and assign to both fuzzy sets.
3) If perfectly lying in L area, then assign the computed DS to the fuzzy set L.
4) If in the area L & M, then compute the DS and assign to both fuzzy sets.
5) If exactly in M area, then assign the computed DS to the fuzzy set M.
17. International Journal in Foundations of Computer Science & Technology (IJFCST) Vol.6, No.2, March 2016
17
6) If in area M & H, then compute the DS and assign the same to both fuzzy sets.
7) If exactly in H area, then assign the computed DS to the fuzzy set H.
8) If in area H & VH, then compute the DS and assign the same to both fuzzy sets.
9) If in area VH, then assign the computed DS to the fuzzy set VH.
Linguistic term D
1) If perfectly lying in VL area, then assign the computed DS to the fuzzy set VL.
2) If in the area VL & L, then compute the DS and assign to both fuzzy sets.
3) If perfectly lying in L area, then assign the computed DS to the fuzzy set L.
4) If in the area L & M, then compute the DS and assign to both fuzzy sets.
5) If exactly in M area, then assign the computed DS to the fuzzy set M.
6) If in area M & H, then compute the DS and assign the same to both fuzzy sets.
7) If exactly in H area, then assign the computed DS to the fuzzy set H.
8) If in area H & VH, then compute the DS and assign the same to both fuzzy sets.
9) If in area VH, then assign the computed DS to the fuzzy set VH.
STEP 3 Applying the DS within the rule base obtained output Linguistic term LsS_value
1) If perfectly lying in Z area, then assign the computed DS to the fuzzy set Z.
2) If in the area Z & T, then compute the DS and assign to both fuzzy sets.
3) If perfectly lying in T area, then compute the DS and assign to linguistic term T.
4) If in the area T & VS, then compute the DS and assign to both fuzzy sets.
5) If in the area VS, then compute the DS and assign to linguistic term VS.
6) If in the area VS & S, then compute the DS and assign to both fuzzy sets.
7) If in S area, then assign the computed DS to the fuzzy set S.
8) If in area S & B, then compute the DS and assign the same to both fuzzy sets.
7) If exactly in B area, then assign the computed DS to the fuzzy set B.
8) If in area B & VB, then compute the DS and assign the same to both fuzzy sets.
9) If in area VB, then assign the computed DS to the fuzzy set VB.
10) If in area VB & H, then compute the DS and assign the same to both fuzzy sets.
11) If in area H, then assign the computed DS to the fuzzy set H.
STEP 4 Compute the value of each rule using AND/MIN operation.
STEP 5 Apply SUM compositions to achieve the final DS for the output variables.
STEP 6 Stop
(b) Formation of Routing Information Base (RIB) about Selection of LSPs for every node N in
the network constructs an IB. The LsS_value of different paths recognizes the status of network.
Computation of the Preferential order of the LSPs to arrange all the set of nodes/ paths using an
appropriate sorting technique to obtain preferential order of LSPs.
Traffic splitting System (TSS)
(a) Computation of Fuzzy Mixed metric (FMM) to find requirement of no. of LSPs using TSS_value.
Let MF and Y is any value from the available regions
STEP 1 Put Y into MF system.
STEP 2 Check the area for both the variables (UR, LC) that in which Y is lying
Linguistic term UR
1) If perfectly lying in Z area, then assign the computed DS to the fuzzy set Z.
2) If in the area Z & T, then compute the DS and assign to both fuzzy sets.
3) If perfectly lying in T area, then compute the DS and assign to linguistic term T.
4) If in the area T & VS, then compute the DS and assign to both fuzzy sets.
5) If in the area VS, then compute the DS and assign to linguistic term VS.
6) If in the area VS & S, then compute the DS and assign to both fuzzy sets.
7) If in S area, then assign the computed DS to the fuzzy set S.
8) If in area S & B, then compute the DS and assign the same to both fuzzy sets.
18. International Journal in Foundations of Computer Science & Technology (IJFCST) Vol.6, No.2, March 2016
18
7) If exactly in B area, then assign the computed DS to the fuzzy set B.
8) If in area B & VB, then compute the DS and assign the same to both fuzzy sets.
9) If in area VB, then assign the computed DS to the fuzzy set VB.
10) If in area VB & H, then compute the DS and assign the same to both fuzzy sets.
11) If in area H, then assign the computed DS to the fuzzy set H.
Linguistic term LC
1) If perfectly lying in VL area, then assign the computed DS to the fuzzy set VL.
2) If in the area VL & L, then compute the DS and assign to both fuzzy sets.
3) If perfectly lying in L area, then assign the computed DS to the fuzzy set L.
4) If in the area L & M, then compute the DS and assign to both fuzzy sets.
5) If exactly in M area, then assign the computed DS to the fuzzy set M.
6) If in area M & H, then compute the DS and assign the same to both fuzzy sets.
7) If exactly in H area, then assign the computed DS to the fuzzy set H.
8) If in area H & VH, then compute the DS and assign the same to both fuzzy sets.
9) If in area VH, then assign the computed DS to the fuzzy set VH.
STEP 3 Applying the DS within the rule base obtained Output Linguistic term TSS_value
1) If perfectly lying in NC area, then assign the computed DS to the fuzzy set NC.
2) If in the area NC & IO, then compute the DS and assign to both fuzzy sets.
3) If perfectly lying in IO area, then assign the computed DS to the fuzzy set IO.
4) If in the area IO & IW, then compute the DS and assign to both fuzzy sets.
5) If exactly in IW area, then assign the computed DS to the fuzzy set IW.
6) If in area IW & IT, then compute the DS and assign the same to both fuzzy sets.
7) If exactly in IT area, then assign the computed DS to the fuzzy set IT.
8) If in area IT & ALL, then compute the DS and assign the same to both fuzzy sets.
9) If in area ALL, then assign the computed DS to the fuzzy set ALL.
STEP 4 Compute the value of each rule using AND/MIN operation.
STEP 5 Apply SUM compositions to achieve the final DS for the output variables.
STEP 6 Stop
(b) Formation of Routing Information Base (RIB) consists of information of Traffic splitting for every
LSP in the network. It contains information of status (utilization rate, link capacity) of paths. Traffic
splitting among computed Fuzzy based LSPs is obtained according to the output response (TSS_value)
received.
APPENDIX II
Numerical of illustrative example with obtained results
LSPs Setup System (LsS)
load = 858
µload = {µVL,µL,µM,µH,µVH}
= {0, 0, 0, .62, .41}
delay =.936
µdelay = {µVL,µL,µM,µH,µVH}
= {0.33, 0.17, 0,0, 0,0}
Activate rules, Substitute membership values & applying MIN operation
19. International Journal in Foundations of Computer Science & Technology (IJFCST) Vol.6, No.2, March 2016
19
Table 8. Activated values
D
L
VL
.33
L
.17
M H VH
VL Z T VS S B
L T VS S B B
M T VS S B B
H
.62
VS
.33
S
.17
B VB VB
VH
.41
S
.33
B
.17
B VB H
Composition is to combine the effects of all applicable rules and will give the best weighted influence to
all firing rules.
Z=Rule 1=0
T=Rules (2+6+11) =0
VS=Rules (3+7+12+16) =0+0+0+.25= .33
S=Rules (4+8+13+17+21) =0+0+0+.17+.33 = .50
B=Rules (5+9+10+14+15+18+22+23) =0+0+0+0+0+0+.12+0=.17
VB=Rules (19+20+24) =0
H=Rule 25 = 0
LsS_value
µLsS_value = {µZ, µT,µVS,µS,µB,µVB ,µH }
= {0, 0, .33, 0.50, 0.17, 0,0}
Compute decision functions (Centroid Method) & Fuzzified decisions
Output Center points
ZC = 0.0
TC = 0.15
VSC = 0.35
SC = 0.50
BC = 0.65
VBC = 0 .85
HC = 1.0
Output=Z* ZC +T* TC +VS* VSC +S* SC +B* BC +VB* VBC +H* HC
=0*0.0+0*.15+.33*.35+.50*.50+.17*.65+0*.85+0*1.0
=0.0+0.0+.1155+.25+.1105+0.0+0.0 = .476
20. International Journal in Foundations of Computer Science & Technology (IJFCST) Vol.6, No.2, March 2016
20
Figure 7. Fuzzified decision Output LsS_value indicates that link is 86% satisfactory and 14% good.
Traffic splitting System (TSS)
utilization_rate = 0.33
µutilization_rate = µZ,µT,µVS,µS,µB,µVB,µH}
= {0, 0, 1,0,0,0, 0}
link _capacity = 916
µlink_capacity = {µVL, µL, µM, µH, µVH}
= {0, 0, 0, 0.30, 0.66}
Activate rules, Substitute membership values & applying Min operation
Table 9. Activated rules
UR
LC
Z T VS
1
S B VB H
VL NC NC NC NC IO IO IW
L NC NC NC IO IO IW IT
M NC NC IO IO IW IW IT
H
.30
NC IO IW
.30
IW IT IT IK
VH
.66
IW IW IT
.66
IT IK IK IK
Composition is to combine the effects of all applicable rules and will give the best weighted influence to
all firing rules.
NC=Rules (1+2+3+4+8+9+10+15+16) = 0+0+0+0+0+0+0+0= 0
IO=Rules (5+6+11+12+17+18+23) = 0+0+0+0+0+0+0+0 =0
IW=Rules (7+13+19+24+25+29+30+20) = 0+0+0+0.30+0+0+0+0+0=0.30
IT=Rules (14+21+26+27+31+32) = 0+0+0+0+0+0.66+0 =0.66
A=Rules (28+33+34+35) = 0+0+0+0+0+0+0 =0
21. International Journal in Foundations of Computer Science & Technology (IJFCST) Vol.6, No.2, March 2016
21
TSS_value
µTSS_value = {µNC, µIO, µIW,µIT,µA}
= {0, 0.30, 0.66,0, 0}
Compute decision functions (Centroid Method) & Fuzzified decisions
Output Center points
NCC =.1
IOC = .32
IWC = .55
ITC= .78
AC= 1
Output = NC* NCC +IO* IOC +IW* IWC +IT* ITC +A* AC
= 0*.1+ 0*.32+ .30*.55+ .66*.78+10*0
=0+0+0.165+0.5148+0.0 = .67
Figure 8. Fuzzified decision Output TSS_value indicates 68% increase of LSPs by 3
and 32% increases of LSPs by 2 are required.