The transmission of voice over IP networks can generate network congestion due to weak supervision of the traffic incoming packet, queuing and scheduling. This congestion negatively affects the Quality of Service (QoS) such as delay, packet drop and packet loss. Packet delay effects will affect the other QoS such as: unstable voice packet delivery, packet jitter, packet loss and echo. Priority Queuing (PQ) algorithm is a more popular technique used in the VoIP network to reduce delays. In operation, the PQ is to use the method of sorting algorithms, search and route planning to classify packets on the router. Thus, this packet classifying method can result in repetition of the process. And this recursive loop leads to the next queue starved. In this paper, to solving problems, there are three phases namely queuing phase, classifying phase and scheduling phase. The PQ algorithm technique is based on the priority. It will be applied to the fuzzy inference system to classify the queuing incoming packet (voice, video and text); that can reduce recursive loop and starvation. After the incoming packet is classified, the packet will be sent to the packet buffering. In addition, to justify the research objective of the PQ improved algorithm will be compared against the algorithm existing PQ, which is found in the literature using metrics such as delay, packets drop and packet losses. This paper described about different execution long process in Priority (PQ) and our algorithm. Our Algorithm is to simplify process execution Algorithm that can cause starvation occurs in PQ algorithm.
A Real Time Framework of Multiobjective Genetic Algorithm for Routing in Mobi...IDES Editor
Routing in mobile networks is a multiobjective
optimization problem. The problem needs to consider multiple
objectives simultaneously such as Quality of Service
parameters, delay and cost. This paper uses the NSGA-II
multiobjectve genetic algorithm to solve the dynamic shortest
path routing problem in mobile networks and proposes a
framework for real-time software implementation.
Simulations confirm a good quality of solution (route
optimality) and a high rate of convergence.
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.
Towards Seamless TCP Congestion Avoidance in Multiprotocol EnvironmentsIDES Editor
In this paper we explore the area of congestion
avoidance in computer networks. We provide a brief overview
of the current state of the art in congestion avoidance and also
list our extension to the TCP congestion avoidance mechanism.
This extension was previously published on an international
forum and in this paper we describe an improved version which
allows multiprotocol support. We list preliminary results
carried out in a simulation environment.
New introduced approach called Advanced Notification
Congestion System (ACNS) allows TCP flows prioritization
based on the TCP flow age and priority carried in the header
of the network layer protocol. The aim of this approach is to
provide more bandwidth for young and high prioritized TCP
flows by means of penalizing old greedy flows with a low
priority. Using ACNS, substantial network performance
increase can be achieved.
Dynamic bandwidth allocation scheme in lr pon with performance modelling and ...IJCNCJournal
We consider models of telecommunication systems that incorporate probability, dense real-time and data.
We present a new formal abstraction method for computing minimum and maximum reachability
probabilities for such models. Our approach uses strictly local formal abstract steps to reduce both the size
of abstract specifications generated and the complexity of operations needed, in comparison to previous
approaches of this kind. A selection of large case studies are implemented the techniques and evaluate,
which include some infinite-state probabilistic real time models, demonstrating improvements over existing
tools in several cases. The capacity of metro and access networks are extended the reach and split ratio of
the conventional Long - Reach Passive Optical Networks (LR-PONs). The efficient solutions of LR-PONs
are appeared in feeder distances around 100km and high split ratios up to 1000-way . Among many
existing approaches, one of the most effective options to improve network performance in LR-PONs are the
multi-thread based dynamic bandwidth allocation (DBA) scheme where several bandwidth allocation
processes are performed in parallel is considered. Without proper intercommunication between the
overlapped threads, multi-thread DBA may lose efficiency and even perform worse than the conventional
single thread algorithm. Real Time Probabilistic Systems are used to evaluate a typical PON systems
performance. This approach is more convenient, flexible, and lower cost than the former simulation method,
which do not need develop special hardware and software tools. Moreover, how changes in performance
depend on changes in the particular modes can be easily analysis by supplying ranges for parameter values.
The proposed algorithm with traditional DBA is compared, and shows its advantage on average packet
delay. The key parameters of the algorithm are analysed and optimized, such as initiating and tuning
multiple threads, inter -thread scheduling, and fairness among users. The algorithms advantage in
numerical results are decreased the average packet delay and improve network throughput under varying
offered loads.
This document summarizes a research paper that proposes a new Position Based Opportunistic Routing Protocol (POR) to improve reliable data delivery in mobile ad hoc networks. Existing geographic routing protocols have issues with route failures and delays in discovering new routes when nodes move. The proposed POR protocol selects multiple forwarding candidate nodes to opportunistically forward packets. If the primary forwarder fails, backup candidates can forward packets to avoid transmission interruptions. Simulation results show the POR protocol has lower delay and higher packet delivery ratio compared to existing protocols.
Enhanced Multicast routing for QoS in delay tolerant networksIRJET Journal
This document summarizes research on enhanced multicast routing protocols for quality of service in delay tolerant networks. It proposes a novel multicast routing approach using the MAODV protocol and compares its performance to existing QBMR and DTN-DM protocols. Delay tolerant networks experience intermittent connectivity and long delays. Store-carry-forward is commonly used for data transfer between nodes. The proposed MAODV protocol improves storage and forwarding capabilities of mobile nodes and bundle message communication to multiple destinations. Its performance is evaluated based on metrics like throughput, routing load, and packet delivery fraction compared to existing protocols.
1) The document analyzes delay performance in multihop wireless networks and develops techniques to derive lower bounds on average packet delay under any scheduling policy.
2) It introduces the concept of a k-bottleneck, where k or fewer links can transmit simultaneously due to interference constraints.
3) A key technique, called reduction, simplifies analysis of queues upstream of a k-bottleneck by reducing it to a single queue system with k servers and appropriate arrival processes.
this paper they introduced UWMAC, a transmitter-based CDMA MAC protocol for UWASNs that integrates a new closed-loop distributed algorithm to establish the optimum transmit power and code length to decrease the near-far impact. UW-MAC objective is to obtain three goals i.e. low channel access delay, high network throughput and low energy consumption. It is shown that UW-MAC maintains to simultaneously obtain limited channel access delay, high network throughput and low energy consumption in deep water communications, which are not critically influenced by multipath. Fatma Bouabdallah and Raouf Boutaba suggested UW-OFDMAC, a distributed Medium Access Control (MAC) protocol which
A Real Time Framework of Multiobjective Genetic Algorithm for Routing in Mobi...IDES Editor
Routing in mobile networks is a multiobjective
optimization problem. The problem needs to consider multiple
objectives simultaneously such as Quality of Service
parameters, delay and cost. This paper uses the NSGA-II
multiobjectve genetic algorithm to solve the dynamic shortest
path routing problem in mobile networks and proposes a
framework for real-time software implementation.
Simulations confirm a good quality of solution (route
optimality) and a high rate of convergence.
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.
Towards Seamless TCP Congestion Avoidance in Multiprotocol EnvironmentsIDES Editor
In this paper we explore the area of congestion
avoidance in computer networks. We provide a brief overview
of the current state of the art in congestion avoidance and also
list our extension to the TCP congestion avoidance mechanism.
This extension was previously published on an international
forum and in this paper we describe an improved version which
allows multiprotocol support. We list preliminary results
carried out in a simulation environment.
New introduced approach called Advanced Notification
Congestion System (ACNS) allows TCP flows prioritization
based on the TCP flow age and priority carried in the header
of the network layer protocol. The aim of this approach is to
provide more bandwidth for young and high prioritized TCP
flows by means of penalizing old greedy flows with a low
priority. Using ACNS, substantial network performance
increase can be achieved.
Dynamic bandwidth allocation scheme in lr pon with performance modelling and ...IJCNCJournal
We consider models of telecommunication systems that incorporate probability, dense real-time and data.
We present a new formal abstraction method for computing minimum and maximum reachability
probabilities for such models. Our approach uses strictly local formal abstract steps to reduce both the size
of abstract specifications generated and the complexity of operations needed, in comparison to previous
approaches of this kind. A selection of large case studies are implemented the techniques and evaluate,
which include some infinite-state probabilistic real time models, demonstrating improvements over existing
tools in several cases. The capacity of metro and access networks are extended the reach and split ratio of
the conventional Long - Reach Passive Optical Networks (LR-PONs). The efficient solutions of LR-PONs
are appeared in feeder distances around 100km and high split ratios up to 1000-way . Among many
existing approaches, one of the most effective options to improve network performance in LR-PONs are the
multi-thread based dynamic bandwidth allocation (DBA) scheme where several bandwidth allocation
processes are performed in parallel is considered. Without proper intercommunication between the
overlapped threads, multi-thread DBA may lose efficiency and even perform worse than the conventional
single thread algorithm. Real Time Probabilistic Systems are used to evaluate a typical PON systems
performance. This approach is more convenient, flexible, and lower cost than the former simulation method,
which do not need develop special hardware and software tools. Moreover, how changes in performance
depend on changes in the particular modes can be easily analysis by supplying ranges for parameter values.
The proposed algorithm with traditional DBA is compared, and shows its advantage on average packet
delay. The key parameters of the algorithm are analysed and optimized, such as initiating and tuning
multiple threads, inter -thread scheduling, and fairness among users. The algorithms advantage in
numerical results are decreased the average packet delay and improve network throughput under varying
offered loads.
This document summarizes a research paper that proposes a new Position Based Opportunistic Routing Protocol (POR) to improve reliable data delivery in mobile ad hoc networks. Existing geographic routing protocols have issues with route failures and delays in discovering new routes when nodes move. The proposed POR protocol selects multiple forwarding candidate nodes to opportunistically forward packets. If the primary forwarder fails, backup candidates can forward packets to avoid transmission interruptions. Simulation results show the POR protocol has lower delay and higher packet delivery ratio compared to existing protocols.
Enhanced Multicast routing for QoS in delay tolerant networksIRJET Journal
This document summarizes research on enhanced multicast routing protocols for quality of service in delay tolerant networks. It proposes a novel multicast routing approach using the MAODV protocol and compares its performance to existing QBMR and DTN-DM protocols. Delay tolerant networks experience intermittent connectivity and long delays. Store-carry-forward is commonly used for data transfer between nodes. The proposed MAODV protocol improves storage and forwarding capabilities of mobile nodes and bundle message communication to multiple destinations. Its performance is evaluated based on metrics like throughput, routing load, and packet delivery fraction compared to existing protocols.
1) The document analyzes delay performance in multihop wireless networks and develops techniques to derive lower bounds on average packet delay under any scheduling policy.
2) It introduces the concept of a k-bottleneck, where k or fewer links can transmit simultaneously due to interference constraints.
3) A key technique, called reduction, simplifies analysis of queues upstream of a k-bottleneck by reducing it to a single queue system with k servers and appropriate arrival processes.
this paper they introduced UWMAC, a transmitter-based CDMA MAC protocol for UWASNs that integrates a new closed-loop distributed algorithm to establish the optimum transmit power and code length to decrease the near-far impact. UW-MAC objective is to obtain three goals i.e. low channel access delay, high network throughput and low energy consumption. It is shown that UW-MAC maintains to simultaneously obtain limited channel access delay, high network throughput and low energy consumption in deep water communications, which are not critically influenced by multipath. Fatma Bouabdallah and Raouf Boutaba suggested UW-OFDMAC, a distributed Medium Access Control (MAC) protocol which
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.
There is no doubt that network coding is a promising enhancement of routing to improve network throughput and provide high reliability. However, there are several open problems in practical network coding, especially on how to guarantee coding advantage for a decentralized control network without the knowledge of the network topology. The biggest benefit of OpenFlow is to decouple the control plane from the data plane, allowing the centralized forwarding decisions in comparison to traditional distributed control network. As a result, we propose a Software-Defined coding network and address key technical challenges in practice. We design NC-OF, a framework to enable networking coding in SDN networks, and use MMF-NC coding strategy proposed by Guan Xu in NC-OF. Finally, we proved that our solutions can effectively improve network performance through simulation experiments. And we also find that network coding is not necessary when the link bandwidth is enough , because it will bring the problems of time delay, the increase in the amount of calculation and so on.
This document presents MLProph, a machine learning-based routing protocol for opportunistic networks. It uses decision trees and neural networks to select the next hop for packet forwarding. Simulation results show that MLProph achieves higher delivery probability and lower packet dropping than the PROPHET+ routing protocol. Future work will involve simulating MLProph using real mobility traces and exploring other machine learning classifiers.
Analysis of Latency and Throughput of 2D Torus Topology using Modified XY Rou...IDES Editor
Network-on-Chip (NoC) is a packet switched onchip
communication network designed using a layered
methodology i.e. “routes packets, not wires”. It is an efficient
on chip communication architecture for System on Chip (SoC)
architectures. NoCs solved the disadvantages of SoCs and are
scalable. Each route in NoC includes some routers and it takes
a few clock periods by passing a router.
When the network is in congestion, the package transmission
will produce much more time delay. So adopting an appropriate
routing algorithm to get the balance between the time delay
and throughput rate becomes the key problem. In this paper
we tried to solve that problem using torus topology with our
modified XY routing algorithm.
We used NIRGAM simulator for analysis of latency and
throughput of modified XY routing algorithm for 2D torus
topology. 3x3 network size used for analyze the performance.
We consider all tiles as source, all tiles as destination and
vary the packet size & traffic used is Constant Bit Rate (CBR)
random traffic. It is found that packet size increases then
latency/packet increases and throughput (in Gbps) also
increases but latency/flit decreases.
Centrality-Based Network Coder Placement For Peer-To-Peer Content DistributionIJCNCJournal
Network coding has been shown to achieve optimal multicast throughput, yet at an expensive computation
cost: every node in the network has to code. Interested in minimizing resource consumption of network
coding while maintaining its performance, in this paper, we propose a practical network coder placement
algorithm which achieves comparable content distribution time as network coding, and at the same time,
substantially reduces the number of network coders compared to a full network coding solution in which all
peers have to encode, i.e. become encoders. Our algorithm is derived from two key elements. First, it is
based on the insight that coding at upstream peers eliminates information duplication to downstream peers,
which results in efficient content distribution. Second, our placement strategy exploits centrality
characteristics of the network topology to quickly determine key positions to place encoders. Performance
evaluation using various topology and algorithm parameters confirms the effectiveness of our proposed
method.
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.
AN EFFICIENT MATHEMATICAL MODELING FOR THE COMPREHENSIVE DESIGN OF AON INCLUD...optljjournal
This paper recommends a systematic wavelength assignment scheme which deliberately enhance the quality of service by minimizing the average dispersion in optical network. In this approach assignment of the wavelength recommended that allocates the wavelength as per mathematical model based on the path length request. Results validate that path length-based scheme improves the system performance in comparison with the commonly used existing assignment technique which works on the principle of first fit wavelength assignment(FFWA) and former assignment methodology should be ideal choice when the number of connection requests extremely high.
Performance evaluation of the IEEE 802.11n random topology WLAN with QoS appl...IJECEIAES
The IEEE 802.11n supports high data rate transmissions due its physical layer Multiple Input Multiple Output (MIMO) advanced antenna system and MAC layer enhancement features (frame aggregation and block acknowledgement). As a result this standard is very suitable for multimedia services through its Enhanced Distributed Channel Access (EDCA). This paper focuses on evaluating the Quality of Service (QoS) application on the performance of the IEEE 802.11n random topology WLAN. Three different number of nodes (3, 9 and 18) random topology with one access point are modeled and simulated by using the Riverbed OPNET 17.5 Modular to investigate the Wireless Local Area Network (WLAN) performance for different spatial streams. The result clarified the impact of QoS application and showed that its effect is best at the 18 node number topology. For a 4x4 MIMO, when QoS is applied and with respect to the no QoS application case, simulation results show a maximum improvement of 86.4%, 33.9%, 52.2% and 68.9% for throughput, delay, data drop and retransmission attempts, respectively.
This document compares the performance of three mobile ad hoc network (MANET) routing protocols: AODV, FSR, and IERP. It uses the QualNet network simulator to evaluate these protocols based on various metrics like throughput, average jitter, average end-to-end delay, and packet delivery ratio. The protocols are evaluated under different node speeds on a grid topology network with 90 nodes over an area of 1500x1500 meters. Simulation results show that AODV generally performs best in terms of throughput and packet delivery ratio across varying node speeds, while FSR performs worst for these metrics. IERP shows the worst performance for average end-to-end delay and average jitter as node speed increases.
This document contains questions and answers related to communication networks. It covers topics like data communication, network criteria, characteristics of data communication systems, advantages of distributed processing, need for protocols and standards, topologies, active and passive hubs, peer-to-peer vs primary-secondary relationships, OSI layers and their functions, framing, error detection methods like parity checks, checksums, and cyclic redundancy checks, flow control methods like stop-and-wait and sliding windows, error correction, HDLC frames and fields, LAN architectures like Ethernet, token bus, token ring, and FDDI.
This document discusses using Gamma tone Frequency Cepstral Coefficients (GFCC) and K-means clustering to identify singers based on their voice. It begins by explaining that MFCC is not accurate in noisy environments, while GFCC performs well in both clean and noisy audio. The process involves extracting GFCC features from the audio, using K-means clustering to group similar voices into clusters, and dynamic time warping for authentication. Feature extraction with GFCC involves preprocessing, framing, windowing, computing the discrete Fourier transform, applying a gamma tone filter bank, logarithmic compression, and discrete cosine transformation to generate feature vectors. K-means clustering is then used to group the feature vectors from similar voices into clusters to identify
Modeling and Performance Evaluation TAODV Routing Protocol Using Stochastic P...Editor IJCATR
This document presents an analytical model for evaluating the performance of the TAODV routing protocol in mobile ad hoc networks using stochastic Petri nets. The model represents the behavior and interactions of nodes in the network through different patterns, including patterns for intermediate nodes, source nodes, and destination nodes. The model accounts for processes like route discovery, packet transmission, and congestion handling. The analytical model is evaluated using PIPE and MATLAB tools and is validated by comparing its results for metrics like reliability, availability, and mean time to security failure to simulation results. The modeling approach allows for theoretical analysis of the TAODV protocol's performance at a large scale in a shorter time than simulation.
Analysis of Hierarchical Scheduling for Heterogeneous Traffic over NetworkIJCNCJournal
Scheduling real time and non real time packets at network nodes has an important impact by reducing the
processing overhead, queuing delay and response time. Most of the existing packet scheduling algorithms
used in network based on First-In First-Out (FIFO), non-preemptive priority, and preemptive priority
scheduling. However, these algorithms incur a large processing overhead, queuing delay and response
time and are not dynamic to the data traffic changes. In this paper, we present a new hierarchical
scheduling algorithm to assign priority, Hierarchical Hybrid EDF/FIFO which can not only serve the real
time traffic but also provide best effort service to non real time traffic. To examine our approach for
scheduling, we realized our analytical study to express the worst case queuing delay and the worst case
response time for different traffics. The simulation results showed that the Hierarchical hybrid EDF/FIFO
achieved the minimum packet delay and adequate loss packet for non real time traffic when compared with
Hierarchical FIFO. In general, the performances of our approach draw near to Hierarchical EDF which
confirms the effectiveness of this approach.
SECURING BGP BY HANDLING DYNAMIC NETWORK BEHAVIOR AND UNBALANCED DATASETSIJCNCJournal
The Border Gateway Protocol (BGP) provides crucial routing information for the Internet infrastructure. A problem with abnormal routing behavior affects the stability and connectivity of the global Internet. The biggest hurdles in detecting BGP attacks are extremely unbalanced data set category distribution and the dynamic nature of the network. This unbalanced class distribution and dynamic nature of the network results in the classifier's inferior performance. In this paper we proposed an efficient approach to properly managing these problems, the proposed approach tackles the unbalanced classification of datasets by turning the problem of binary classification into a problem of multiclass classification. This is achieved by splitting the majority-class samples evenly into multiple segments using Affinity Propagation, where the number of segments is chosen so that the number of samples in any segment closely matches the minority-class samples. Such sections of the dataset together with the minor class are then viewed as different classes and used to train the Extreme Learning Machine (ELM). The RIPE and BCNET datasets are used to evaluate the performance of the proposed technique. When no feature selection is used, the proposed technique improves the F1 score by 1.9% compared to state-of-the-art techniques. With the Fischer feature selection algorithm, the proposed algorithm achieved the highest F1 score of 76.3%, which was a 1.7% improvement over the compared ones. Additionally, the MIQ feature selection technique improves the accuracy by 3.5%. For the BCNET dataset, the proposed technique improves the F1 score by 1.8% for the Fisher feature selection technique. The experimental findings support the substantial improvement in performance from previous approaches by the new technique.
6RLR-ABC: 6LOWPAN ROUTING PROTOCOL WITH LOCAL REPAIR USING BIO INSPIRED ARTIF...IJCNCJournal
The document presents a new routing protocol called 6RLR-ABC for 6LoWPAN networks that uses an artificial bee colony algorithm for local route repair. It compares the performance of 6RLR-ABC to the existing 6LoWPAN Ad-hoc On-Demand Distance Vector (LOAD) protocol through simulations. The results show that 6RLR-ABC achieves lower packet delay, higher packet delivery ratio, and higher throughput while using less energy than LOAD, especially with increasing network traffic loads.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Choosing the best quality of service algorithm using OPNET simulationIJECEIAES
The concept of quality of service (QoS) is a new computer technology. Previously, there was a slow internet connection to access the sites and it was slow to send information. But now, it requires speeding up the traffic and increasing the efficiency for audio and video. In this study, we discuss the concepts of QoS provided over the network to achieve these goals. This study aims to compare six algorithms to control the QoS, then, the best algorithm will be selected to improve the traffic. These algorithms are named first in first out (FIFO), priority queuing (PQ), custom queuing (CQ), CQ with low latency queuing (LLQ), weighted fair queuing (WFQ), WFQ with low latency queuing (LLQ), so the behavior of these algorithms can be measured. The results obtained by comparing between them using OPNET simulation show that the best algorithm is the priority queuing algorithm, followed by CQ, then CQ with LLQ, then WFQ, then WFQ with LLQ and finally FIFO. All these results are plotted in the form of graphs to show the paths of these algorithms for the single state with an operation time of 5 minutes for each algorithm.
Approach to an Intelligent Based IP over MPLS VPLS Network for Packet SchedulingIRJET Journal
This document discusses using intelligent packet scheduling algorithms in an IP over MPLS VPLS network. It proposes using fuzzy logic and neuro-fuzzy systems at label switched routers to schedule packets. The key contributions are: 1) Modeling the network topology in NS2 and defining parameters like link bandwidth and delay; 2) Developing fuzzy and neuro-fuzzy inference systems with input variables for packet scheduling; 3) Analyzing the training error of the neuro-fuzzy algorithm and comparing the fuzzy and neuro-fuzzy performance metrics based on trace file results. The goal is to evaluate how incorporating intelligence into packet scheduling can effectively optimize network performance and delivery of data in the MPLS VPLS network.
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.
PERFORMANCE COMPARISON OF PACKET SCHEDULING ALGORITHMS FOR VIDEO TRAFFIC IN L...ijmnct
In this paper we have studied downlink packet scheduling algorithms proposed for LTE cellular networks.
The study emphasize on three most promising scheduling algorithms such as: FLS, EXP rule and LOG rule.
The performance of these three algorithms is conducted over video traffic in a vehicular environment using
LTE-Sim simulator. The simulation was setup with varying number of users from 10 - 60 in fixed bounded
regions of 1 km radius. The main goal this study is to provide results that will help in the design process of
packet scheduler for LTE cellular networks, aiming to get better overall performance users. Simulation
results show that, the FLS scheme outperforms in terms of average system throughput, average packet
delay, PLR; and with a satisfactory level of fairness index.
ENSURING QOS GUARANTEES IN A HYBRID OCS/OBS NETWORKijngnjournal
The bursting aggregation assembly in edge nodes is one of the key technologies in OBS (Optical Burst Switching) network, which has a direct impact on flow characteristics and packet loss rate. An optical burst assembly technique supporting QoS is presented through this paper, which can automatically adjust the threshold along with the increasing and decreasing volume of business, reduce the operational burst, and generate corresponding BDP (Burst Data Packet) and BCP (Burst Control Packet). In addition to the burst aggregation technique a packet recovery technique by restoration method is also described. The data packet loss due to the physical optical link failure is not currently included in the QoS descriptions. This link failure is also a severe problem which reduces the data throughput of the transmitter node. A mechanism for data recovery from this link failure is vital for guaranteeing the QoS demanded by each user. So this paper will also discusses a specific protocol for reducing the packet loss by utilizing the
features of both optical circuit switching (OCS) and Optical Burst switching (OBS) techniques
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.
There is no doubt that network coding is a promising enhancement of routing to improve network throughput and provide high reliability. However, there are several open problems in practical network coding, especially on how to guarantee coding advantage for a decentralized control network without the knowledge of the network topology. The biggest benefit of OpenFlow is to decouple the control plane from the data plane, allowing the centralized forwarding decisions in comparison to traditional distributed control network. As a result, we propose a Software-Defined coding network and address key technical challenges in practice. We design NC-OF, a framework to enable networking coding in SDN networks, and use MMF-NC coding strategy proposed by Guan Xu in NC-OF. Finally, we proved that our solutions can effectively improve network performance through simulation experiments. And we also find that network coding is not necessary when the link bandwidth is enough , because it will bring the problems of time delay, the increase in the amount of calculation and so on.
This document presents MLProph, a machine learning-based routing protocol for opportunistic networks. It uses decision trees and neural networks to select the next hop for packet forwarding. Simulation results show that MLProph achieves higher delivery probability and lower packet dropping than the PROPHET+ routing protocol. Future work will involve simulating MLProph using real mobility traces and exploring other machine learning classifiers.
Analysis of Latency and Throughput of 2D Torus Topology using Modified XY Rou...IDES Editor
Network-on-Chip (NoC) is a packet switched onchip
communication network designed using a layered
methodology i.e. “routes packets, not wires”. It is an efficient
on chip communication architecture for System on Chip (SoC)
architectures. NoCs solved the disadvantages of SoCs and are
scalable. Each route in NoC includes some routers and it takes
a few clock periods by passing a router.
When the network is in congestion, the package transmission
will produce much more time delay. So adopting an appropriate
routing algorithm to get the balance between the time delay
and throughput rate becomes the key problem. In this paper
we tried to solve that problem using torus topology with our
modified XY routing algorithm.
We used NIRGAM simulator for analysis of latency and
throughput of modified XY routing algorithm for 2D torus
topology. 3x3 network size used for analyze the performance.
We consider all tiles as source, all tiles as destination and
vary the packet size & traffic used is Constant Bit Rate (CBR)
random traffic. It is found that packet size increases then
latency/packet increases and throughput (in Gbps) also
increases but latency/flit decreases.
Centrality-Based Network Coder Placement For Peer-To-Peer Content DistributionIJCNCJournal
Network coding has been shown to achieve optimal multicast throughput, yet at an expensive computation
cost: every node in the network has to code. Interested in minimizing resource consumption of network
coding while maintaining its performance, in this paper, we propose a practical network coder placement
algorithm which achieves comparable content distribution time as network coding, and at the same time,
substantially reduces the number of network coders compared to a full network coding solution in which all
peers have to encode, i.e. become encoders. Our algorithm is derived from two key elements. First, it is
based on the insight that coding at upstream peers eliminates information duplication to downstream peers,
which results in efficient content distribution. Second, our placement strategy exploits centrality
characteristics of the network topology to quickly determine key positions to place encoders. Performance
evaluation using various topology and algorithm parameters confirms the effectiveness of our proposed
method.
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.
AN EFFICIENT MATHEMATICAL MODELING FOR THE COMPREHENSIVE DESIGN OF AON INCLUD...optljjournal
This paper recommends a systematic wavelength assignment scheme which deliberately enhance the quality of service by minimizing the average dispersion in optical network. In this approach assignment of the wavelength recommended that allocates the wavelength as per mathematical model based on the path length request. Results validate that path length-based scheme improves the system performance in comparison with the commonly used existing assignment technique which works on the principle of first fit wavelength assignment(FFWA) and former assignment methodology should be ideal choice when the number of connection requests extremely high.
Performance evaluation of the IEEE 802.11n random topology WLAN with QoS appl...IJECEIAES
The IEEE 802.11n supports high data rate transmissions due its physical layer Multiple Input Multiple Output (MIMO) advanced antenna system and MAC layer enhancement features (frame aggregation and block acknowledgement). As a result this standard is very suitable for multimedia services through its Enhanced Distributed Channel Access (EDCA). This paper focuses on evaluating the Quality of Service (QoS) application on the performance of the IEEE 802.11n random topology WLAN. Three different number of nodes (3, 9 and 18) random topology with one access point are modeled and simulated by using the Riverbed OPNET 17.5 Modular to investigate the Wireless Local Area Network (WLAN) performance for different spatial streams. The result clarified the impact of QoS application and showed that its effect is best at the 18 node number topology. For a 4x4 MIMO, when QoS is applied and with respect to the no QoS application case, simulation results show a maximum improvement of 86.4%, 33.9%, 52.2% and 68.9% for throughput, delay, data drop and retransmission attempts, respectively.
This document compares the performance of three mobile ad hoc network (MANET) routing protocols: AODV, FSR, and IERP. It uses the QualNet network simulator to evaluate these protocols based on various metrics like throughput, average jitter, average end-to-end delay, and packet delivery ratio. The protocols are evaluated under different node speeds on a grid topology network with 90 nodes over an area of 1500x1500 meters. Simulation results show that AODV generally performs best in terms of throughput and packet delivery ratio across varying node speeds, while FSR performs worst for these metrics. IERP shows the worst performance for average end-to-end delay and average jitter as node speed increases.
This document contains questions and answers related to communication networks. It covers topics like data communication, network criteria, characteristics of data communication systems, advantages of distributed processing, need for protocols and standards, topologies, active and passive hubs, peer-to-peer vs primary-secondary relationships, OSI layers and their functions, framing, error detection methods like parity checks, checksums, and cyclic redundancy checks, flow control methods like stop-and-wait and sliding windows, error correction, HDLC frames and fields, LAN architectures like Ethernet, token bus, token ring, and FDDI.
This document discusses using Gamma tone Frequency Cepstral Coefficients (GFCC) and K-means clustering to identify singers based on their voice. It begins by explaining that MFCC is not accurate in noisy environments, while GFCC performs well in both clean and noisy audio. The process involves extracting GFCC features from the audio, using K-means clustering to group similar voices into clusters, and dynamic time warping for authentication. Feature extraction with GFCC involves preprocessing, framing, windowing, computing the discrete Fourier transform, applying a gamma tone filter bank, logarithmic compression, and discrete cosine transformation to generate feature vectors. K-means clustering is then used to group the feature vectors from similar voices into clusters to identify
Modeling and Performance Evaluation TAODV Routing Protocol Using Stochastic P...Editor IJCATR
This document presents an analytical model for evaluating the performance of the TAODV routing protocol in mobile ad hoc networks using stochastic Petri nets. The model represents the behavior and interactions of nodes in the network through different patterns, including patterns for intermediate nodes, source nodes, and destination nodes. The model accounts for processes like route discovery, packet transmission, and congestion handling. The analytical model is evaluated using PIPE and MATLAB tools and is validated by comparing its results for metrics like reliability, availability, and mean time to security failure to simulation results. The modeling approach allows for theoretical analysis of the TAODV protocol's performance at a large scale in a shorter time than simulation.
Analysis of Hierarchical Scheduling for Heterogeneous Traffic over NetworkIJCNCJournal
Scheduling real time and non real time packets at network nodes has an important impact by reducing the
processing overhead, queuing delay and response time. Most of the existing packet scheduling algorithms
used in network based on First-In First-Out (FIFO), non-preemptive priority, and preemptive priority
scheduling. However, these algorithms incur a large processing overhead, queuing delay and response
time and are not dynamic to the data traffic changes. In this paper, we present a new hierarchical
scheduling algorithm to assign priority, Hierarchical Hybrid EDF/FIFO which can not only serve the real
time traffic but also provide best effort service to non real time traffic. To examine our approach for
scheduling, we realized our analytical study to express the worst case queuing delay and the worst case
response time for different traffics. The simulation results showed that the Hierarchical hybrid EDF/FIFO
achieved the minimum packet delay and adequate loss packet for non real time traffic when compared with
Hierarchical FIFO. In general, the performances of our approach draw near to Hierarchical EDF which
confirms the effectiveness of this approach.
SECURING BGP BY HANDLING DYNAMIC NETWORK BEHAVIOR AND UNBALANCED DATASETSIJCNCJournal
The Border Gateway Protocol (BGP) provides crucial routing information for the Internet infrastructure. A problem with abnormal routing behavior affects the stability and connectivity of the global Internet. The biggest hurdles in detecting BGP attacks are extremely unbalanced data set category distribution and the dynamic nature of the network. This unbalanced class distribution and dynamic nature of the network results in the classifier's inferior performance. In this paper we proposed an efficient approach to properly managing these problems, the proposed approach tackles the unbalanced classification of datasets by turning the problem of binary classification into a problem of multiclass classification. This is achieved by splitting the majority-class samples evenly into multiple segments using Affinity Propagation, where the number of segments is chosen so that the number of samples in any segment closely matches the minority-class samples. Such sections of the dataset together with the minor class are then viewed as different classes and used to train the Extreme Learning Machine (ELM). The RIPE and BCNET datasets are used to evaluate the performance of the proposed technique. When no feature selection is used, the proposed technique improves the F1 score by 1.9% compared to state-of-the-art techniques. With the Fischer feature selection algorithm, the proposed algorithm achieved the highest F1 score of 76.3%, which was a 1.7% improvement over the compared ones. Additionally, the MIQ feature selection technique improves the accuracy by 3.5%. For the BCNET dataset, the proposed technique improves the F1 score by 1.8% for the Fisher feature selection technique. The experimental findings support the substantial improvement in performance from previous approaches by the new technique.
6RLR-ABC: 6LOWPAN ROUTING PROTOCOL WITH LOCAL REPAIR USING BIO INSPIRED ARTIF...IJCNCJournal
The document presents a new routing protocol called 6RLR-ABC for 6LoWPAN networks that uses an artificial bee colony algorithm for local route repair. It compares the performance of 6RLR-ABC to the existing 6LoWPAN Ad-hoc On-Demand Distance Vector (LOAD) protocol through simulations. The results show that 6RLR-ABC achieves lower packet delay, higher packet delivery ratio, and higher throughput while using less energy than LOAD, especially with increasing network traffic loads.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Choosing the best quality of service algorithm using OPNET simulationIJECEIAES
The concept of quality of service (QoS) is a new computer technology. Previously, there was a slow internet connection to access the sites and it was slow to send information. But now, it requires speeding up the traffic and increasing the efficiency for audio and video. In this study, we discuss the concepts of QoS provided over the network to achieve these goals. This study aims to compare six algorithms to control the QoS, then, the best algorithm will be selected to improve the traffic. These algorithms are named first in first out (FIFO), priority queuing (PQ), custom queuing (CQ), CQ with low latency queuing (LLQ), weighted fair queuing (WFQ), WFQ with low latency queuing (LLQ), so the behavior of these algorithms can be measured. The results obtained by comparing between them using OPNET simulation show that the best algorithm is the priority queuing algorithm, followed by CQ, then CQ with LLQ, then WFQ, then WFQ with LLQ and finally FIFO. All these results are plotted in the form of graphs to show the paths of these algorithms for the single state with an operation time of 5 minutes for each algorithm.
Approach to an Intelligent Based IP over MPLS VPLS Network for Packet SchedulingIRJET Journal
This document discusses using intelligent packet scheduling algorithms in an IP over MPLS VPLS network. It proposes using fuzzy logic and neuro-fuzzy systems at label switched routers to schedule packets. The key contributions are: 1) Modeling the network topology in NS2 and defining parameters like link bandwidth and delay; 2) Developing fuzzy and neuro-fuzzy inference systems with input variables for packet scheduling; 3) Analyzing the training error of the neuro-fuzzy algorithm and comparing the fuzzy and neuro-fuzzy performance metrics based on trace file results. The goal is to evaluate how incorporating intelligence into packet scheduling can effectively optimize network performance and delivery of data in the MPLS VPLS network.
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.
PERFORMANCE COMPARISON OF PACKET SCHEDULING ALGORITHMS FOR VIDEO TRAFFIC IN L...ijmnct
In this paper we have studied downlink packet scheduling algorithms proposed for LTE cellular networks.
The study emphasize on three most promising scheduling algorithms such as: FLS, EXP rule and LOG rule.
The performance of these three algorithms is conducted over video traffic in a vehicular environment using
LTE-Sim simulator. The simulation was setup with varying number of users from 10 - 60 in fixed bounded
regions of 1 km radius. The main goal this study is to provide results that will help in the design process of
packet scheduler for LTE cellular networks, aiming to get better overall performance users. Simulation
results show that, the FLS scheme outperforms in terms of average system throughput, average packet
delay, PLR; and with a satisfactory level of fairness index.
ENSURING QOS GUARANTEES IN A HYBRID OCS/OBS NETWORKijngnjournal
The bursting aggregation assembly in edge nodes is one of the key technologies in OBS (Optical Burst Switching) network, which has a direct impact on flow characteristics and packet loss rate. An optical burst assembly technique supporting QoS is presented through this paper, which can automatically adjust the threshold along with the increasing and decreasing volume of business, reduce the operational burst, and generate corresponding BDP (Burst Data Packet) and BCP (Burst Control Packet). In addition to the burst aggregation technique a packet recovery technique by restoration method is also described. The data packet loss due to the physical optical link failure is not currently included in the QoS descriptions. This link failure is also a severe problem which reduces the data throughput of the transmitter node. A mechanism for data recovery from this link failure is vital for guaranteeing the QoS demanded by each user. So this paper will also discusses a specific protocol for reducing the packet loss by utilizing the
features of both optical circuit switching (OCS) and Optical Burst switching (OBS) techniques
This document summarizes a research paper that proposes a new protocol called E2EEST to estimate end-to-end delays in 802.11 ad hoc networks. It first discusses related work on QoS and delay estimation techniques. It then describes the authors' contributions, including using an available bandwidth estimation protocol called ABE to estimate available bandwidth, which the delay estimation depends on. The paper develops mathematical expressions to model nodes and estimate collision probability and delay. It presents the E2EEST protocol and simulations showing it provides lower delay, higher success rate and better QoS than other approaches.
This document presents a QoS-based packet scheduling algorithm for hybrid wireless networks. It proposes using the Earliest Deadline First (EDF) algorithm to schedule packets for online conference applications and the Least Slack Time First algorithm to schedule packets for online video applications. The goal is to reduce transmission delay and improve QoS. It implements this scheduling approach using the NS2 network simulator. The scheduling algorithm classifies packets by application type and places them in queues. EDF and Least Slack Time are then used to schedule packets from each queue to minimize delay for multimedia applications over hybrid wireless networks.
Two-level scheduling scheme for integrated 4G-WLAN network IJECEIAES
In this paper, a novel scheduling scheme for the Fourth Generation (4G)-Wireless Local Area Network (WLAN) network is proposed to ensure that end to end traffic transaction is provisioned seamlessly. The scheduling scheme is divided into two stages; in stage one, traffic is separated into Actual Time Traffic (ATT) and Non-Actual-Time Traffic (NATT), while in stage two, complex queuing strategy is performed. In stage one, Class-Based Queuing (CBQ) and Deficit Round Robin(DRR) are used for NATT and ATT applications, respectively to separate and forward traffic themselves according to source requirements. Whereas in the stage, two Control Priority Queuing (CPQ) is used to assign each class the appropriate priority level. Evaluation of the performance of the integrated network was done according to several metrics such as end-to-end delay, jitter, packet loss, and network’s throughput. Results demonstrate major improvements for AT services with minor degradation on NAT applications after implementing the new scheduling scheme.
8The Affects of Different Queuing Algorithms within the Router on QoS VoIP a...IJCNC
Voice over Internet Protocol (VoIP) is a service from the internet services that allows users to
communicate with each other. Quality of Service (QoS) is very sensitive to delay so that VOIP needs it.
The objective of this research is study the effect of different queuing algorithms within the router on VoIP
QoS.
This document discusses a study that compared the performance of multimedia traffic (voice, video, data) over MPLS VPN networks versus traditional IP networks. The study found that MPLS VPN networks offered better performance for multimedia traffic propagation based on key metrics like throughput, utilization, and packet delay variation. Specifically, the MPLS VPN scenario had higher throughput (2.44% vs 97.56%) and utilization (34.09% vs 65.91%), but lower packet delay variation (37.5% vs 62.5%) compared to the traditional IP network model. The results show that MPLS VPN is better suited for real-time multimedia applications due to its ability to provide guaranteed services, traffic engineering, and predictable minimum delays.
This document summarizes a student project on Voice over IP (VoIP) quality of service. It discusses how VoIP works by converting analog speech to digital packets sent over the Internet. It then covers current Internet limitations for real-time applications like VoIP. It evaluates scheduling algorithms like FIFO, priority queueing, and weighted fair queueing. The document outlines simulating these algorithms in OPNET and analyzing results. Based on this, it proposes a new algorithm using priority queueing for real-time traffic and weighted fair queueing with dynamic weights for other traffic. Simulation results show the proposed algorithm meeting quality of service requirements for different traffic classes.
A Comparative Analysis of the Performance of VoIP Traffic with Different Type...ijcnac
The key QoS parameters for VoIP are delay, jitter and loss. In the Internet, VoIP requires
the underlying packet switched network to minimize the impact of these parameters. A
major contributing factor in this regard is traffic engineering carried out by scheduling
algorithms. This paper studies the behavior of different types of scheduling algorithms on
the delay, jitter and loss QoS parameters. The performance evaluation involves
identifying the scheduling algorithms which are most suitable for VoIP communications.
The result from the analysis also shows the impact of the QoS parameters on VoIP over
the Internet.
final Year Projects, Final Year Projects in Chennai, Software Projects, Embedded Projects, Microcontrollers Projects, DSP Projects, VLSI Projects, Matlab Projects, Java Projects, .NET Projects, IEEE Projects, IEEE 2009 Projects, IEEE 2009 Projects, Software, IEEE 2009 Projects, Embedded, Software IEEE 2009 Projects, Embedded IEEE 2009 Projects, Final Year Project Titles, Final Year Project Reports, Final Year Project Review, Robotics Projects, Mechanical Projects, Electrical Projects, Power Electronics Projects, Power System Projects, Model Projects, Java Projects, J2EE Projects, Engineering Projects, Student Projects, Engineering College Projects, MCA Projects, BE Projects, BTech Projects, ME Projects, MTech Projects, Wireless Networks Projects, Network Security Projects, Networking Projects, final year projects, ieee projects, student projects, college projects, ieee projects in chennai, java projects, software ieee projects, embedded ieee projects, "ieee2009projects", "final year projects", "ieee projects", "Engineering Projects", "Final Year Projects in Chennai", "Final year Projects at Chennai", Java Projects, ASP.NET Projects, VB.NET Projects, C# Projects, Visual C++ Projects, Matlab Projects, NS2 Projects, C Projects, Microcontroller Projects, ATMEL Projects, PIC Projects, ARM Projects, DSP Projects, VLSI Projects, FPGA Projects, CPLD Projects, Power Electronics Projects, Electrical Projects, Robotics Projects, Solor Projects, MEMS Projects, J2EE Projects, J2ME Projects, AJAX Projects, Structs Projects, EJB Projects, Real Time Projects, Live Projects, Student Projects, Engineering Projects, MCA Projects, MBA Projects, College Projects, BE Projects, BTech Projects, ME Projects, MTech Projects, M.Sc Projects, Final Year Java Projects, Final Year ASP.NET Projects, Final Year VB.NET Projects, Final Year C# Projects, Final Year Visual C++ Projects, Final Year Matlab Projects, Final Year NS2 Projects, Final Year C Projects, Final Year Microcontroller Projects, Final Year ATMEL Projects, Final Year PIC Projects, Final Year ARM Projects, Final Year DSP Projects, Final Year VLSI Projects, Final Year FPGA Projects, Final Year CPLD Projects, Final Year Power Electronics Projects, Final Year Electrical Projects, Final Year Robotics Projects, Final Year Solor Projects, Final Year MEMS Projects, Final Year J2EE Projects, Final Year J2ME Projects, Final Year AJAX Projects, Final Year Structs Projects, Final Year EJB Projects, Final Year Real Time Projects, Final Year Live Projects, Final Year Student Projects, Final Year Engineering Projects, Final Year MCA Projects, Final Year MBA Projects, Final Year College Projects, Final Year BE Projects, Final Year BTech Projects, Final Year ME Projects, Final Year MTech Projects, Final Year M.Sc Projects, IEEE Java Projects, ASP.NET Projects, VB.NET Projects, C# Projects, Visual C++ Projects, Matlab Projects, NS2 Projects, C Projects, Microcontroller Projects, ATMEL Projects, PIC Projects, ARM Projects, DSP Projects, VLSI Projects, FPGA Projects, CPLD Projects, Power Electronics Projects, Electrical Projects, Robotics Projects, Solor Projects, MEMS Projects, J2EE Projects, J2ME Projects, AJAX Projects, Structs Projects, EJB Projects, Real Time Projects, Live Projects, Student Projects, Engineering Projects, MCA Projects, MBA Projects, College Projects, BE Projects, BTech Projects, ME Projects, MTech Projects, M.Sc Projects, IEEE 2009 Java Projects, IEEE 2009 ASP.NET Projects, IEEE 2009 VB.NET Projects, IEEE 2009 C# Projects, IEEE 2009 Visual C++ Projects, IEEE 2009 Matlab Projects, IEEE 2009 NS2 Projects, IEEE 2009 C Projects, IEEE 2009 Microcontroller Projects, IEEE 2009 ATMEL Projects, IEEE 2009 PIC Projects, IEEE 2009 ARM Projects, IEEE 2009 DSP Projects, IEEE 2009 VLSI Projects, IEEE 2009 FPGA Projects, IEEE 2009 CPLD Projects, IEEE 2009 Power Electronics Projects, IEEE 2009 Electrical Projects, IEEE 2009 Robotics Projects, IEEE 2009 Solor Projects, IEEE 2009 MEMS Projects, IEEE 2009 J2EE P
FREQUENCY AND TIME DOMAIN PACKET SCHEDULING BASED ON CHANNEL PREDICTION WITH ...ijwmn
1) The document discusses packet scheduling algorithms for LTE downlink systems that must operate under imperfect channel quality information (CQI) due to errors, delays, and other issues.
2) It proposes a new packet scheduling algorithm that uses a Kalman filter-based channel predictor in the frequency domain to estimate the true CQI from erroneous feedback, combined with a time domain grouping technique using proportional fair and modified largest weighted delay first algorithms.
3) Simulation results showed this approach achieves better performance than existing algorithms in terms of system throughput and packet loss ratio under imperfect CQI conditions.
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.
Comparative Study for Performance Analysis of VOIP Codecs Over WLAN in Nonmob...Zac Darcy
Voice over IP (VoIP) applications such as Skype, Google Talk, and FaceTime are promising technologies for providing cheaper voice calls to end users over extant networks. Wireless networks such as WiMAX and Wi-Fi focus on providing perfection of service for VoIP. However, there are numerous aspects that affect quality of voice connections over wireless networks [13]. The adoption of Voice over Wireless Local Area Network is on tremendous increase due its relief, non-invasive, economicexpansion, low maintenance cost, universal coverage and basic roaming capabilities.
COMPARATIVE STUDY FOR PERFORMANCE ANALYSIS OF VOIP CODECS OVER WLAN IN NONMOB...Zac Darcy
Voice over IP (VoIP) applications such as Skype, Google Talk, and FaceTime are promising technologies for providing cheaper voice calls to end users over extant networks. ireless networks such as WiMAX and Wi-Fi focus on providing perfection of service for VoIP. However, there are numerous aspects that affect quality of voice connections over wireless networks [13]. The adoption of Voice over Wireless Local Area
Network is on tremendous increase due its relief, non-invasive, economicexpansion, low maintenance cost, universal coverage and basic roaming capabilities. However, expansion Voice over Internet Protocol (VoIP) over Wireless Local Area Network (WLAN) is a challenging task for many network specialist and engineers. Voice codec is one of the most critical components of a VoIP system. In this project, we evaluate
the performance analysis of various codecs such as G.711, G.723 and G.729 over Wi-Fi networks. NS2 WiFi
simulation models are designed. Performance metrics such as Mean Opinion Score (MOS), average
end-to-end latency, and disconcert are evaluated and discussed [13]. 1. In this paper, our area of interest is to compare and study the performance analysis of VoIP codecs in Non-mobility scenarios by changing some parameters and plotting the graphs throughput, End to end Delay, MOS, Packet delivery Ratio, and Jitter by using Network Simulator version.
2. In this paper we analyze the different performance parameters, Recent research has focused on simulation studies with non- mobility scenarios to analyze different VoIP codecs with nodes up to 5. We have simulated the different VoIP codecs in non-mobility scenario with nodes up to 300.
Comparative Study for Performance Analysis of VOIP Codecs Over WLAN in Nonmob...Zac Darcy
Voice over IP (VoIP) applications such as Skype, Google Talk, and FaceTime are promising technologies
for providing cheaper voice calls to end users over extant networks. Wireless networks such as WiMAX and
Wi-Fi focus on providing perfection of service for VoIP. However, there are numerous aspects that affect
quality of voice connections over wireless networks [13]. The adoption of Voice over Wireless Local Area
Network is on tremendous increase due its relief, non-invasive, economicexpansion, low maintenance cost,
universal coverage and basic roaming capabilities. However, expansion Voice over Internet Protocol
(VoIP) over Wireless Local Area Network (WLAN) is a challenging task for many network specialist and
engineers. Voice codec is one of the most critical components of a VoIP system. In this project, we evaluate
the performance analysis of various codecs such as G.711, G.723 and G.729 over Wi-Fi networks. NS2 WiFi simulation models are designed. Performance metrics such as Mean Opinion Score (MOS), average
end-to-end latency, and disconcert are evaluated and discussed [13].
1. In this paper, our area of interest is to compare and study the performance analysis of VoIP
codecs in Non-mobility scenarios by changing some parameters and plotting the graphs
throughput, End to end Delay, MOS, Packet delivery Ratio, and Jitter by using Network
Simulator version.
2. In this paper we analyze the different performance parameters, Recent research has focused on
simulation studies with non- mobility scenarios to analyze different VoIP codecs with nodes up to
5. We have simulated the different VoIP codecs in non-mobility scenario with nodes up to 300.
COMPARATIVE STUDY FOR PERFORMANCE ANALYSIS OF VOIP CODECS OVER WLAN IN NONMOB...Zac Darcy
The recent Voice over IP (VOIP) applications such as Skype, Google Talk, and Face Time have
changed the way people communicate to each other. Due to the low cost, people find VOIP as an
alternative to the expensive traditional Public Switched Telephone Network (PSTN). VOIP has
set of parameters that defined its Quality of Service (QoS) such as end to delay, jitter, packets
loss, Mean Opinion Score (MOS, and throughput[13]. The existing wireless networks such as WiFi offer flexibility to support such applications. At the time the IEEE 802.11 (Wi-Fi) technology
showed great success as cheap wireless internet access. The Motive of this survey paper is to
analyse of Qos in VOIP [13].
COMPARATIVE STUDY FOR PERFORMANCE ANALYSIS OF VOIP CODECS OVER WLAN IN NONMOB...Zac Darcy
Voice over IP (VoIP) applications such as Skype, Google Talk, and FaceTime are promising technologies
for providing cheaper voice calls to end users over extant networks. Wireless networks such as WiMAX and
Wi-Fi focus on providing perfection of service for VoIP. However, there are numerous aspects that affect
quality of voice connections over wireless networks [13]. The adoption of Voice over Wireless Local Area
Network is on tremendous increase due its relief, non-invasive, economicexpansion, low maintenance cost,
universal coverage and basic roaming capabilities. However, expansion Voice over Internet Protocol
(VoIP) over Wireless Local Area Network (WLAN) is a challenging task for many network specialist and
engineers. Voice codec is one of the most critical components of a VoIP system. In this project, we evaluate
the performance analysis of various codecs such as G.711, G.723 and G.729 over Wi-Fi networks. NS2 WiFi simulation models are designed. Performance metrics such as Mean Opinion Score (MOS), average
end-to-end latency, and disconcert are evaluated and discussed [13]
Similar to COMPARISON PROCESS LONG EXECUTION BETWEEN PQ ALGORTHM AND NEW FUZZY LOGIC ALGORITHM FOR VOIP (20)
Digital Twins Computer Networking Paper Presentation.pptxaryanpankaj78
A Digital Twin in computer networking is a virtual representation of a physical network, used to simulate, analyze, and optimize network performance and reliability. It leverages real-time data to enhance network management, predict issues, and improve decision-making processes.
Optimizing Gradle Builds - Gradle DPE Tour Berlin 2024Sinan KOZAK
Sinan from the Delivery Hero mobile infrastructure engineering team shares a deep dive into performance acceleration with Gradle build cache optimizations. Sinan shares their journey into solving complex build-cache problems that affect Gradle builds. By understanding the challenges and solutions found in our journey, we aim to demonstrate the possibilities for faster builds. The case study reveals how overlapping outputs and cache misconfigurations led to significant increases in build times, especially as the project scaled up with numerous modules using Paparazzi tests. The journey from diagnosing to defeating cache issues offers invaluable lessons on maintaining cache integrity without sacrificing functionality.
Accident detection system project report.pdfKamal Acharya
The Rapid growth of technology and infrastructure has made our lives easier. The
advent of technology has also increased the traffic hazards and the road accidents take place
frequently which causes huge loss of life and property because of the poor emergency facilities.
Many lives could have been saved if emergency service could get accident information and
reach in time. Our project will provide an optimum solution to this draw back. A piezo electric
sensor can be used as a crash or rollover detector of the vehicle during and after a crash. With
signals from a piezo electric sensor, a severe accident can be recognized. According to this
project when a vehicle meets with an accident immediately piezo electric sensor will detect the
signal or if a car rolls over. Then with the help of GSM module and GPS module, the location
will be sent to the emergency contact. Then after conforming the location necessary action will
be taken. If the person meets with a small accident or if there is no serious threat to anyone’s
life, then the alert message can be terminated by the driver by a switch provided in order to
avoid wasting the valuable time of the medical rescue team.
Software Engineering and Project Management - Introduction, Modeling Concepts...Prakhyath Rai
Introduction, Modeling Concepts and Class Modeling: What is Object orientation? What is OO development? OO Themes; Evidence for usefulness of OO development; OO modeling history. Modeling
as Design technique: Modeling, abstraction, The Three models. Class Modeling: Object and Class Concept, Link and associations concepts, Generalization and Inheritance, A sample class model, Navigation of class models, and UML diagrams
Building the Analysis Models: Requirement Analysis, Analysis Model Approaches, Data modeling Concepts, Object Oriented Analysis, Scenario-Based Modeling, Flow-Oriented Modeling, class Based Modeling, Creating a Behavioral Model.
Applications of artificial Intelligence in Mechanical Engineering.pdfAtif Razi
Historically, mechanical engineering has relied heavily on human expertise and empirical methods to solve complex problems. With the introduction of computer-aided design (CAD) and finite element analysis (FEA), the field took its first steps towards digitization. These tools allowed engineers to simulate and analyze mechanical systems with greater accuracy and efficiency. However, the sheer volume of data generated by modern engineering systems and the increasing complexity of these systems have necessitated more advanced analytical tools, paving the way for AI.
AI offers the capability to process vast amounts of data, identify patterns, and make predictions with a level of speed and accuracy unattainable by traditional methods. This has profound implications for mechanical engineering, enabling more efficient design processes, predictive maintenance strategies, and optimized manufacturing operations. AI-driven tools can learn from historical data, adapt to new information, and continuously improve their performance, making them invaluable in tackling the multifaceted challenges of modern mechanical engineering.
Supermarket Management System Project Report.pdfKamal Acharya
Supermarket management is a stand-alone J2EE using Eclipse Juno program.
This project contains all the necessary required information about maintaining
the supermarket billing system.
The core idea of this project to minimize the paper work and centralize the
data. Here all the communication is taken in secure manner. That is, in this
application the information will be stored in client itself. For further security the
data base is stored in the back-end oracle and so no intruders can access it.
Height and depth gauge linear metrology.pdfq30122000
Height gauges may also be used to measure the height of an object by using the underside of the scriber as the datum. The datum may be permanently fixed or the height gauge may have provision to adjust the scale, this is done by sliding the scale vertically along the body of the height gauge by turning a fine feed screw at the top of the gauge; then with the scriber set to the same level as the base, the scale can be matched to it. This adjustment allows different scribers or probes to be used, as well as adjusting for any errors in a damaged or resharpened probe.
Home security is of paramount importance in today's world, where we rely more on technology, home
security is crucial. Using technology to make homes safer and easier to control from anywhere is
important. Home security is important for the occupant’s safety. In this paper, we came up with a low cost,
AI based model home security system. The system has a user-friendly interface, allowing users to start
model training and face detection with simple keyboard commands. Our goal is to introduce an innovative
home security system using facial recognition technology. Unlike traditional systems, this system trains
and saves images of friends and family members. The system scans this folder to recognize familiar faces
and provides real-time monitoring. If an unfamiliar face is detected, it promptly sends an email alert,
ensuring a proactive response to potential security threats.
Blood finder application project report (1).pdfKamal Acharya
Blood Finder is an emergency time app where a user can search for the blood banks as
well as the registered blood donors around Mumbai. This application also provide an
opportunity for the user of this application to become a registered donor for this user have
to enroll for the donor request from the application itself. If the admin wish to make user
a registered donor, with some of the formalities with the organization it can be done.
Specialization of this application is that the user will not have to register on sign-in for
searching the blood banks and blood donors it can be just done by installing the
application to the mobile.
The purpose of making this application is to save the user’s time for searching blood of
needed blood group during the time of the emergency.
This is an android application developed in Java and XML with the connectivity of
SQLite database. This application will provide most of basic functionality required for an
emergency time application. All the details of Blood banks and Blood donors are stored
in the database i.e. SQLite.
This application allowed the user to get all the information regarding blood banks and
blood donors such as Name, Number, Address, Blood Group, rather than searching it on
the different websites and wasting the precious time. This application is effective and
user friendly.
COMPARISON PROCESS LONG EXECUTION BETWEEN PQ ALGORTHM AND NEW FUZZY LOGIC ALGORITHM FOR VOIP
1. International Journal of Network Security & Its Applications (IJNSA), Vol.3, No.1, January 2011
DOI : 10.5121/ijnsa.2011.3102 17
COMPARISON PROCESS LONG EXECUTION BETWEEN PQ
ALGORTHM AND NEW FUZZY LOGIC ALGORITHM FOR VOIP
Suardinata1
, Kamalrulnizam bin Abu Bakar 2
and Nimitr Suanmali3
1
Department of Computer System and Communication, Faculty of Computer Science &
Information Systems, University Teknologi Malaysia, Johor Bahru, Malaysia
STMIK Indonesia Padang, Padang Indonesia
suardinata@gmail.com,suardinata@yahoo.com
2
Department of Computer System and Communication, Faculty of Computer Science &
Information Systems, University Teknologi Malaysia, Johor Bahru, Malaysia
kamarul@fsksm.utm.my,knizam@utm.my
3
Department of Computer System and Communication, Faculty of Computer Science &
Information Systems, University Teknologi Malaysia, Johor Bahru, Malaysia
nimitrs@hotmail.com
ABSTRACT
The transmission of voice over IP networks can generate network congestion due to weak supervision of
the traffic incoming packet, queuing and scheduling. This congestion negatively affects the Quality of
Service (QoS) such as delay, packet drop and packet loss. Packet delay effects will affect the other QoS
such as: unstable voice packet delivery, packet jitter, packet loss and echo. Priority Queuing (PQ)
algorithm is a more popular technique used in the VoIP network to reduce delays. In operation, the PQ is
to use the method of sorting algorithms, search and route planning to classify packets on the router. Thus,
this packet classifying method can result in repetition of the process. And this recursive loop leads to the
next queue starved. In this paper, to solving problems, there are three phases namely queuing phase,
classifying phase and scheduling phase. The PQ algorithm technique is based on the priority. It will be
applied to the fuzzy inference system to classify the queuing incoming packet (voice, video and text); that
can reduce recursive loop and starvation. After the incoming packet is classified, the packet will be sent
to the packet buffering. In addition, to justify the research objective of the PQ improved algorithm will be
compared against the algorithm existing PQ, which is found in the literature using metrics such as delay,
packets drop and packet losses. This paper described about different execution long process in Priority
(PQ) and our algorithm. Our Algorithm is to simplify process execution Algorithm that can cause
starvation occurs in PQ algorithm.
KEYWORDS
QoS, VoIP, Fuzzy logic, and Delay
1. INTRODUCTION
Currently, VoIP technology has been applied to a Wireless Local Area Network (WLAN)
technology sector [16]. However, many problems and issues such as delay, jitter, limited
bandwidth, and packet loss (packet drop) occur when communicating, which in turn will affect
Quality of Service (QoS) performance. In connection with these problems, the delay is one of
the problems that affect the voice quality [12] is will be the main focus of paper.
Some Quality of Service (QoS) technology has been used such as Best Effort Service (BeServ),
Differentiated Services (DiffServ), Integrated Service (IntServ), and Multi-Protocol Label
Switch (MPLS) [2]. DiffServ and MPLS are two examples of many new models in the network
architecture. Even though, the two architectures are almost the same, but DiffServ is more
2. International Journal of Network Security & Its Applications (IJNSA), Vol.3, No.1, January 2011
18
popular and more knowledgeable [19]and [3]. Furthermore, [5]stated that Diffserv can provide
QoS from end to end by establishing guarantee in every routing and switching nodes to perform
various types of functions related to QoS metrics (bandwidth, delay or packet loss). DiffServ
networks can also achieve its goal by separating the edge (which do complex tasks such as
traffic classification, traffic marking and traffic monitoring) and the DiffServ core network. This
will further be the focus of the paper. Differentiated service model is designed to achieve the
QoS requirements of voice. Some queue scheduling algorithm is also introduced in the
differentiated service such as First In First Out / First Come First Serve (FIFO / FCFS), Priority
Queuing (PQ), Fair Queuing (FQ), and Round Robin (RR) [14]and Error! Reference source not
found.
2. RELATED WORK
This paper is to continue the previous paper with entitled “Classifying Incoming Packet Using
Fuzzy logic for VoIP)” that will be published in Telkomnika journal in August 2010. In this
paper focused on analyzed long execution in PQ algorithm then will be compared with our
algorithm.
In several publications [20]; [9]; and [17], reveals that PQ algorithm has better performance
than the other queue scheduling algorithm. However, generally PQ algorithm also has some
problems that cause inefficiencies in the operation. The PQ algorithm is used sorting, searching
[15]and route planning in classifying packets. In classifying packets, some issues such as
selection of priority packets still occur recursively (repetition) when the operation, that can
cause next queue starvation [18]; [10], [20] and [7]. This is due to incoming packet (in the form
of voice, video, and data) are sorted (classified) based on priority. Sorting and searching
methods will affect the speed in classifying the packets, while the high speed in the
classification may also help to send the packet to the destination node more quickly.
Different priorities of data traffic queues in the network as shown in Figure 1. where the voice is
the highest priority, video is a medium priority and high priority data is the lowest priority. As
the VoIP network, voice must be serviced first before the video and data.
Figure 1. Generic PQ Scheduling algorithms (Source: Kampong J. Mabe, (2005)
In queuing scheduling algorithm that is proposed, the PQ algorithm approach to the incoming
packet has been investigated. Some weaknesses in the PQ have been identified as a recursive
(repetition) which can lead to lack (starvation) of bandwidth for the next queue, greedy packet
buffering is not optimal (inefficient) be used, because of the high priority are always serviced
first so that it can cause packet delay. In addition, in this paper a new queue scheduling
3. International Journal of Network Security & Its Applications (IJNSA), Vol.3, No.1, January 2011
19
algorithm based on PQ algorithm will be improved and applied to a new QoS architecture.
Based on the problems and weaknesses that have been identified in the PQ algorithm, then the
solution will be proposed in this queue scheduling algorithm. This algorithm is divided into
three phases namely queuing classifying, buffering, and scheduling.
To classify an incoming packets, the existing techniques in PQ algorithm will be reduced to
three priorities include the High, Medium, and Low. The voice is classified into High, videos
are classified into the medium, and the text is classified into Low. New algorithm will be
improved by combining existing techniques in PQ algorithms using a fuzzy logic classification
system for the packet. The fuzzy logic is simpler and flexible, is able to simplify complex
problems and algorithms have been investigated. Fuzzy logic has been used by many inter-
disciplinary science and applications [22]. In these applications that fuzzy theory can be used to
improve the performance of neural networks. For example, fuzzy logic has been used in the
simulation of the Microscopic Traffic Network (FLOMITS) model [4] for the car following
model. He has compared the traditional model and fuzzy logic models, and revealed that fuzzy
logic is more effective and efficient, and it has been used in the proposed model as well. [12] in
his paper have also been combined fuzzy logic and genetic algorithms (GA) to solve the access
network selection (ANS) problem in heterogeneous wireless networks (HWN). Fuzzy logic has
been used by [6] in the queue the packets in the router, where Fuzzy logic is used to classify
packets into different priorities based on the packet.
As a justification in this paper, PQ algorithm using sorting methods, search [8]and [15] and
planning a route [1] to classify the incoming packet. This algorithm (sorting, and searching) is
based on complex mathematical formulas such as bubble sort, insertion sort, heap sort, quick
sort, merge sort and Dijkstra's algorithm. Combined techniques in PQ algorithm applied to
Fuzzy Logic can classify the incoming packet with intelligent methods. Fuzzy gives priority to
each queue based on queue congestion (priority, arrival time and demand). For this paper using
the technique in the PQ algorithm and applied to Fuzzy Logic to solve the problem will be
proposed.
3. RESEARCH METHOD
The research methodology begins with the collection of the literature review that began
with the formulation of the problem. In the second step of the experiment test bed was setup to
perform real-world scenarios to investigate the QoS parameters and signals that cause latency
(delay) in VoIP networks as a process of real-time traffic. After obtaining the results of
experiments on a simulation model will be developed in order to reduce the latency (delay)
during the conversation so that traffic can be real-time communication continuity without
distortion. The main contribution of this paper is to develop an efficient queue scheduling
algorithm by using existing techniques in the algorithm PQ. In the last step of performance
comparisons will be made to justify the operation and efficiency of queue algorithms developed
with QoS the model known currently.
The decision to conduct an experiment test bed comes after an extensive paper of
research papers and methods used by other researchers. The idea is to experiment to include
VoIP systems, wireless devices and IP phone (soft phone) to obtain real-world results to justify
and distinguish the models developed in this paper.
Step-by-step research methodology discussed below and shown in Figure 2: Research
Methodology Flowchart.
4. International Journal of Network Security & Its Applications (IJNSA), Vol.3, No.1, January 2011
20
Figure 2. Flowchart of the Research Metodology
There are three phases of the incoming packets data traffic among them is the queuing phase,
classification phase, and scheduling phase. First, Phase Queuing is the arrival of incoming
packets at random. Incoming packet in the form of voice, video, and data (text) will come
randomly and continuously. Voice packets are marked as H (High), the video packets are
marked as M (Medium), and data (text) is marked as L (Low). Second, Classifying phase is
where the incoming packets will be selected and classified by priority, arrival and demand.
Here, there are three parameters that must be determined to classify traffic based on the data
type queue (priority), time of arrival and request packet, while the PQ algorithm is only based
on the priority without considering the packet arrival time which can cause a recursive (loop)
and starvation. Scheduling phase is where the packets that have been selected (classified) will
be scheduled in sequence that started from High, followed by medium and low. In this paper
just would be a study about classifying phase. Figure 3 is fuzzy rules based PQ algorithm.
Start
Literature review
Problem
formulation
QoS
PQ
Experiment/Prototype
Development
Performance
Evaluation
Test Bed
SIVuS
Briker
X-Lite
Matlab
Qos Metric
PQ
Thesis
Writing
End
Voice
Video
DiffServ
BC-PQ
PQ-WRR
PQ-WFQ Data
Delay
Packet drop
Packet loss
Fuzzy Logic
SPBA
Experiment
Setup
NS2
RR
FQ
FIFO/FCFS
M L H
1. If qi1=H, and qi2=H, and
qi3=H then First
serviced=qi1
2. If qi1=M, and qi2=H, and
qi3=L then First
serviced=qi2
3. If qi1=M, and qi2=L, and
qi3=H, then First
Serviced=qi3
4. ..
5. ..
6. If qin=…., and qin=…, and
qin=…., then First
Serviced=qin
qi1qi2qi3
L H M
qi4qi5qi6
Fuzzy Classifying rules if then based on PQ algorithm
5. International Journal of Network Security & Its Applications (IJNSA), Vol.3, No.1, January 2011
21
Figure 3. Fuzzy process data traffic classifying algorithm
4. RESULT AND DISCUSSION
Based on summary of overall information and after PQ algorithm comparison conducted
between of them, then a solution queuing scheduling algorithms will be proposed. This solution
is consisted of three phases among of are queuing phase, classifying phase and scheduling
phase as depicted in Figure 4. Figure 5 and 6 in elaborate detail.
Figure 4. Solution queuing scheduling algorithm
Based on Figure 4. that using existing techniques in PQ algorithms (by priority) and combined
with fuzzy logic is a solution that will be offered in a new queue scheduling algorithm. Figure 5.
illustrates in detail and drafts a new queue scheduling algorithm. Multimedia data consisting of
voice, video, and text (data) are prioritized, depending on the needs. So, the packet classification
by PQ algorithm, consisting of four priorities, in this case the priority may be reduced to three
priorities, which the voice is the highest priority, video is the medium priority, and data (text) is
the lowest priority. After the incoming packet arrives, this packet will be classified into three
classes is high for voice, video and Medium to Low to the data (text). Each packet which has
been classified by the classifier is shown in Figure 5.
Outgoing Packets
1
2
1
3
2
3
Fuzzy
Logic
Classifier
based on
PQ
algorithm
High
Medium
Low
Scheduler
111222
Incoming Packets
111
222
333
3
Buffering Packets based on
PQ and SPBA algorithm
Queuing
Buffering
Scheduling
Efficiency and optimalization of PQ (greedy)
and improvement of SPBA algorithm
Optimalization of PQ algorithm
Incoming packet
Classifying based on congestion namely
priorities (PQ), arrival time and demand
that applied into fuzzy logic
Outgoing packet
Out interface
To reduce recursive loop and
starvation that can generate to
lower delay
To avoid burst and to reduce packet drop
and packet loss
To reduce congestion, packet drop and
packet loss
6. International Journal of Network Security & Its Applications (IJNSA), Vol.3, No.1, January 2011
22
Figure 5. Detail new queuing scheduling algorithm
In VoIP network, voice is serviced first, followed by video and data before it is transmitted to
other networks. In this paper would combine the existing techniques in the PQ algorithm and
Fuzzy logic. Both of these techniques will be applied to the new queuing scheduling algorithm.
After the packet is classified, packets transmitted and regulated in the queue buffer to High
(voice) placed in the High buffer, to Medium (Video) is placed in the buffer Medium, and Low
(data) is placed in a low buffer. In this case, three samples of the queue will be used to make the
rules. It aims to facilitate the implementation of the fuzzy logic. New queue scheduling
algorithm is expected to be able to manage incoming packet based on priorities.
Figure 6. Flowchart new queuing scheduling algorithm
Queuing qi1, qi2, qi3, …,(qin)
qi1=“H” qi2=“H” qi3=“H”
N N
First serviced and send packet to High
packet buffering
H
qi1=“M” qi2=“M” qi3=“M”
N N
Second serviced and send packet to Medium
packet buffering
M
Y
Y
qi1=“L” qi2=“L” qi3=“L”
N N
Third serviced and send packet to Low packet
buffering
L
7. International Journal of Network Security & Its Applications (IJNSA), Vol.3, No.1, January 2011
23
In this new algorithm (see Figure 6) incoming packet is formed use fuzzy rule namely if then
rules. Fuzzy rules consist of input and output. In these case input is qi1, qi2, qi3,…,qin and
output is qo. For example is if qi1 is High and qi2 is High and ··· and qin is High then qo is
qi1, etc. And these fuzzy rules are also valid for back queuing continuously as shown in Figure
7.
As shown in Figure 7, there are three phases of the incoming packet data traffic among them is
the queuing phase, classifying phase, and scheduling phase. First, Phase Queuing is the arrival
of incoming packets at random. Incoming packet in the form of voice, video, and data (text) will
come randomly and continuously. Voice packets are marked as H, the video packets are marked
as M, and data (text) are marked as L. Second, Classifying phase is where the incoming packets
will be selected and classified by priority, arrival and demand. Here, there are three parameters
that must be determined to classify traffic based on the data type queue (priority), time of arrival
and request packet, while the PQ algorithm is only based on the priority without considering the
packet arrival time which can cause a recursive (loop) and starvation. After classifying, the
packet will be forwarded to the packet buffering. As in PQ buffer consists of four packets, and
also this problem has been described in the introduction, PQ algorithm is using a greedy
algorithm. Therefore, in this case simplified into three packets will be proposed that packet
buffering should be adjusted to three types of queues High, Medium and Low according to
incoming packets as well. Packet buffering algorithm based on PQ and SPBA algorithm. Third,
Scheduling phase is where the packets that have been selected (classified) will be scheduled in
sequence that started from High, followed by medium and low. As known in the VoIP network,
the voice has the highest priority to be serviced first, before video and data.
In this algorithm, each packet will be sent based on priority, arrival time, and demand. Based on
priority, that means high-priority packets are always transmitted (serviced) first. Based on
arrival time is if there are three packets or more of the same after a high priority is to continue
next. And on request is that if many high-priority queues after the next will be forwarded.
Figure 7. Phase data traffic classifying
H M H
H L M
M M L
L M H
C
L
A
S
S
I
F
I
E
R
S
C
H
E
D
U
L
E
R
qi1
qi2
qi3
qin
.
.
.
Queuing Classifying Scheduling
Input Process Output
H H H
M M M
L L L
L M M H H H
Outgoing packet
Incoming packet
Buffering
8. International Journal of Network Security & Its Applications (IJNSA), Vol.3, No.1, January 2011
24
In Figure 8 below has shown an example execution algorithm in PQ algorithm that happening
recursively. This algorithm needs many steps that must be executed to sorting priority
completed. This algorithm is based on insertion sort method, which has been used in PQ in long
time (previous time). In traffic incoming packet on TCP, the long execution will be spent time
to decide incoming packet priority.
Figure 8. An example execution algorithm in PQ algorithm
As steps execution that has been shown in Figure 8, can be simplified into flowchart as
depicted in Figure 9.a while Figure 9.b is showing algorithm in PQ which using an
insertion-sort. In Figure 9.a there are four decisions and five process of steps execution
while in Figure 9.b there are 14 decisions and five process of steps execution. So, based
on Figure 8, and 9.b our summarized that can cause incoming packet in TCP is
starvation.
9. International Journal of Network Security & Its Applications (IJNSA), Vol.3, No.1, January 2011
25
Figure 9 (a) and (b) An execution new queuing algorithm vs PQ algorithm
Starvation is happening on the PQ algorithm is caused by many recursively (repetitions) as
shown in Figure 9 (b) and the algorithm flow chart in Figure 9 (b) when operating and PQ
algorithm is always service the highest priority so that by simplifying the algorithm as shown in
Figure 9(a) will be able to reduce recursively.
Comparison between PQ algorithm and our algorithm is where PQ classifies packets according
to certain criteria in the IP network is also described part of introduction section. PQ classifies
packets to up to four classes; each associated with one of four priority queues, and gives each
class an appropriate packet queue. Fourth priority queue is high, medium, normal, and low
queues in order of priority. This algorithm is greedy, because the incoming packet is always
serviced first while second and other priority is never serviced that can cause others incoming
packet is starvation. In our algorithm, fourth priority is simplified just into three priorities
namely High, Medium, and Low. Incoming packet is arranged in buffering packet namely High,
Medium and Low as well. Our algorithm also considering priority, arrival time and demand,
while in PQ algorithm is just based on priority. The other rules in this algorithm are limited a
number until three queuing incoming packets as described.
q1≥q0 1st serviced
q2≥q0 2nd serviced
q3≥q0 3rd serviced
q4≥q0 4th serviced
N
Y
N
N
Y
Y
Y
N
5th serviced
7,3,2,1,5
qo=7
q1≥q2
q2≥q3
q3≥q4
q4≥q5 4th serviced
N
Y
N
N
N
5th serviced
q1≥q3
N
Y
q1≥q4
q2≥q4
q3≥q5
N
N
Y
Y
Y
Y
N
q2≥q5
q3≥qo
N
N
Y
q4≥qo
Y
(a) (b)
2nd serviced
q1≥q5
q2≥qo
3rd serviced
q1≥q
0
Y
Start
N
1st serviced
qo=7
7,3,2,1,5
Start
Y Y Y
N
Y
N
Y
10. International Journal of Network Security & Its Applications (IJNSA), Vol.3, No.1, January 2011
26
Figure 10. Fuzzy surface classifying view
Figure 10 is a Fuzzy surface view which is based on rules incoming packet. As shown in Figure
10, that incoming packet with lower priority (as indicated by the arrow) is still serviced after
next three queuing, so that all of the queuing incoming packets with lower priority in buffering
packet, it can be serviced as well. So this is a purpose to reduce delay, and so that starvation is
not occured for lower priority as well.
6. CONCLUSION
PQ algorithm is one of many queuing scheduling algorithm that can be used in VoIP network,
which has investigated in this paper. A new queuing scheduling algorithm is based on PQ
algorithm has been proposed to reduce delay in VoIP network. This algorithm created is based
existing technique in PQ algorithm based on priorities and combined with fuzzy logic. This
algorithm can classify a different packet from incoming packets and also can reduce recursive
loop and starving as occurs in PQ algorithm. As shown in Figure 8., 9(a) and 9(b) that long
execution in PQ algorithm can cause lower priority is starvation. This long execution algorithm
affects to delay of incoming packets in TCP protocol. Further work, this paper continues on
buffering and scheduling phase that would be extended to next paper.
ACKNOWLEDGEMENTS
This research is supported by DIKTI (High Education) Jakarta Indonesian scholarship for
allowing us to further our study at Universiti Teknologi Malaysia (UTM).
REFERENCES
[1] Algorithms and Data Structures Priority Queues and Simple Sorting, rev. 07/02/2009 21:55.
[2] Chinchol Kim, Sangcheol Shin, Sangyong Ha, Kyongro Yoon, and Sunyoung Han, (2004).
Architecture of End-to-End QoS for VoIP Call Processing in the MPLS Network, J. Solé-Pareta et al.
(Eds.): QofIS 2004, LNCS 3266, pp. 44−53, 2004.p Springer-Verlag Berlin Heidelberg 2004.
[3] David Ahlgren, (2005). Introduction to SIP and VoIP Technology and Business Development,
Copyright - Ahlgren 2005 AhlTek.
[4] ERRAMPALLI, Madhu, (2007). Fuzzy Logic based Microscopic Traffic Network Simulation
(FloMITS) Model,Urban and Regional Planning Lab.Graduate School of Engineering Gifu
University.
12. International Journal of Network Security & Its Applications (IJNSA), Vol.3, No.1, January 2011
28
University of Surrey, Guildford, UK Received 22 February 2007; received in revised form 6
November 2007; accepted 6 November 2007 Available online 4 December 2007.
[22]Zadeh, L. A. (1987). Fuzzy sets and applications: Selected papers by L.A. Zadeh. New York: Wiley.
Authors
Short Biography
Suardinata, he is received the Diploma III 1999 in Information Management at AMIK
Riau, Indonesia, Bachelor Degree in Information Engineering from STMIK Riau,
Indonesia, and Master Degree in Information Technology from Universitas Putra
Indonesia, Padang, Indonesia, Currently he is a Ph.D. student in the Dept. of Computer
System and Communication, Faculty of Computer Science and Information System,
University Teknologi Malaysia, Johor Bahru Malaysia. He has been working as Lecturer
at STMIK Indonesia Padang from 2005 in the Dept. of Computer Science and Information
Systems, STMIK Indonesia Padang. His research interests include Multimedia and Voice
over IP network, Network Security, Traffic Engineering and Quality of Service issues in
IP networks, Wireless Ad-Hoc Networks, and Distributed Systems.
Kamalrulnizam bin Abu Bakar obtained his Ph.D degree in Computer Science
(Network Security) from Aston University (Birmingham, UK) in 2004, B.S 1996 in
Computer Science, Universiti Teknologi Malaysia and M.S. in Computer Communication
& Networks, Leeds Metropolitan University, UK. in 1998. Currently, he is an Associate
Professor in Computer Science at Universiti Teknologi Malaysia (Malaysia) and member
of the “Pervasive Computing” research group. He involves in several research projects
and is the referee for many scientific journals and conferences. His specialization includes
mobile and wireless computing, information security and grid computing.
Nimitr Suanmali, is a Ph.D. student in the Dept. of Computer System and
Communication, Faculty of Computer Science and Information System, University
Teknologi Malaysia, Johor Bahru Malaysia. He received his B.Sc. degree in computer
science from Suan Dusit Rajabhat University,Thailand in 1998, M.Sc. degree in
Information Technology from King Mongkut’s University of Technology Thonburi,
Thailand in 2003. Since 2003, he has been working as lecturer at Suan Dusit Rajabhat
University, Bangkok Thailand. His research interests include Network Security, Intrusion
Detection and Intrusion Prevention, Wireless Ad-Hoc Networks, and Distributed
Systems.