Differentiated Services is the most advanced method for traffic management which provides QoS. QoS is
essential for today’s internet. QoS represents set of techniques necessary to manage throughput, packet
loss and delay. Traffic Conditioners or Policers are the most important components of differentiated
services. In this research, different Traffic Conditioners or Policers are compared on the basis of QoS
parameters (Performance metrics) which are throughput, packet loss and delay to provide QoS on internet.
Traffic classification and traffic conditioning are important functions of differentiated services also known
as admission control which are governed by service level agreement (SLA). Traffic classification and traffic
conditioning is done by traffic conditioners at edge routers. Goal of this research is to choose the best
Traffic Conditioner to apply from source to destination pair because only one traffic conditioner can be
applied from source to destination so that QoS can be guaranteed.
Determining the Optimum Number of Paths for Realization of Multi-path Routing...TELKOMNIKA JOURNAL
This document proposes an algorithm for determining the optimal number of paths for multi-path routing in MPLS-TE networks. The algorithm involves:
1. Constructing a network graph and finding the set of shortest paths between nodes using Dijkstra's algorithm.
2. Determining the maximum flow that can be transmitted over each shortest path based on the minimum cut using the Ford-Fulkerson theorem.
3. Considering delay as another criterion and formulating the problem as a multi-criteria optimization to maximize flow while minimizing delay.
4. Defining a utility function to reduce the problem to a single-criterion by representing the quality of criteria on a 0 to 1 scale.
5.
IJCER (www.ijceronline.com) International Journal of computational Engineerin...ijceronline
This document summarizes a research paper that evaluates the performance of two routing protocols (AODV and DSDV) under different traffic patterns (TCP and CBR) in a mobile ad hoc network (MANET) simulation. The paper describes MANET characteristics and challenges for routing. It provides an overview of reactive (AODV), proactive (DSDV), and hybrid routing protocols. It also defines TCP and CBR traffic patterns. The research aims to analyze and compare the packet delivery ratio and end-to-end delay of AODV and DSDV under different traffic loads using the NS-2 simulator. Preliminary results show that reactive protocols perform better in terms of these metrics.
Survey on scheduling and radio resources allocation in lteijngnjournal
- The document discusses scheduling and radio resource allocation in LTE networks. It focuses on the radio resource manager (RRM) element in LTE that performs admission control and packet scheduling.
- Several scheduling algorithms are proposed for both uplink and downlink directions, including proportional fair, EXP-PF, round robin, max-min fair, and algorithms that aim to maximize throughput or support quality of service requirements.
- The paper provides an overview of these scheduling algorithms, evaluates their performance, and offers criticism on how to best allocate radio resources in LTE networks.
LTE QOS DYNAMIC RESOURCE BLOCK ALLOCATION WITH POWER SOURCE LIMITATION AND QU...IJCNCJournal
3GPP has defined the long term evolution (LTE) for 3G radio access in order to maintain the future
competitiveness for 3G technology, the system provides the capability of supporting a mixture of services
with different quality of service (QoS) requirements. This paper proposes a new cross-layer scheduling
algorithm to satisfy better QoS parameters for real time applications. The proposed algorithm takes care of
allocating resource blocks (RBs) with different modulation and coding schemes (MCS) according to target
bit error rate (BER), user equipment supportable MCS, queue stability constraints and available transmit
power constraints. The proposed algorithm has been valued, compared with an earlier allocation algorithm
in terms of service rate and packet delay and showed better performance regards the real time
applications.
Performance Evaluation of UDP, DCCP, SCTP and TFRC for Different Traffic Flow...IJECEIAES
The demand for internet applications has increased rapidly. Providing quality of service (QoS) requirements for varied internet application is a challenging task. One important factor that is significantly affected on the QoS service is the transport layer. The transport layer provides end-to-end data transmission across a network. Currently, the most common transport protocols used by internet application are TCP (Transmission Control Protocol) and UDP (User Datagram Protocol). Also, there are recent transport protocols such as DCCP (data congestion control protocol), SCTP (stream congestion transmission protocol), and TFRC (TCP-friendly rate control), which are in the standardization process of Internet Engineering Task Force (IETF). In this paper, we evaluate the performance of UDP, DCCP, SCTP and TFRC protocols for different traffic flows: data transmission, video traffic, and VOIP in wired networks. The performance criteria used for this evaluation include throughput, end to end delay, and packet loss rate. Well-known network simulator NS-2 used to implement the UDP, DCCP, SCTP, and TFRC protocols performance comparison. Based on the simulation results, the performance throughput of SCTP and TFRC is better than UDP. Moreover, DCCP performance is superior SCTP and TFRC in term of end-to-end delay.
PERFORMANCE ANALYSIS AND COMPARISON OF IMPROVED DSR WITH DSR, AODV AND DSDV R...ijp2p
Mobile Ad-hoc networks are categorized by multi-hop wireless connectivity and numbers of nodes are connecting each other through wireless network. It includes several routing protocols specifically designed for ad-hoc routing. The most widely used ad hoc routing protocols are Ad-hoc On Demand Distance Vector (AODV), Destination Sequence Distance Vector (DSDV), and Dynamic Source Routing (DSR). In this paper, we present an analysis of DSR protocol and propose our algorithm to improve the performance of DSR protocol by using small delay applied on last route ACK path when an original route fails in Mobile Ad Hoc networks. Past researchers the MANET have focused on simulation study by varying network parameters, such as network size, number of nodes. The simulation results shows that the M-DSR protocol
having some excellent performance Metrics then other protocols. We have taken different performance parameters over the comparison of Modified -DSR with other three protocols in mobility as well as Nonmobility scenario up to 300 nodes in MANETs using NS2 simulator. To achieve this goal DSR is modified by using modified algorithm technique in order to load balancing, to avoid congestion and lower packet
delivery.
Our area of interest for the paper is the improvement of performance of DSR routing protocol by
changing in algorithm and this Improved DSR protocol should compare with remaining protocols
taken in this research paper.
2. In this paper we made changesin traditional DSR protocol and generation of new improved DSR the
different performance parameters and compare with AODV/DSR/DSDV protocols in mobility and
non- mobility scenarios nodes up to 300.
3. We can plot the graphs throughput, End to end Delay, Packet delivery Ratio, Dropping Ratio, and
average energy consumption on Mobility and Non-Mobility scenario by using Network Simulator
version 2.34 for Modified DSR protocols. M-DSR, DSDV perform well when Mobility is low.
Macro with pico cells (hetnets) system behaviour using well known scheduling ...ijwmn
This paper demonstrates the concept of using Heterogeneous networks (HetNets) to improve Long Term Evolution (LTE) system by introducing the LTE Advance (LTE-A). The type of HetNets that has been chosen for this study is Macro with Pico cells. Comparing the system performance with and without Pico cells has clearly illustrated using three well-known scheduling algorithms (Proportional Fair PF, Maximum Largest Weighted Delay First MLWDF and Exponential/Proportional Fair EXP/PF). The system is judged based on throughput, Packet Loss Ratio PLR, delay and fairness.. A simulation platform called LTE-Sim has been used to collect the data and produce the paper’s outcomes and graphs. The results prove that adding Pico cells enhances the overall system performance. From the simulation outcomes, the overall system performance is as follows: throughput is duplicated or tripled based on the number of users, the PLR is almost quartered, the delay is nearly reduced ten times (PF case) and changed to be a half (MLWDF/EXP cases), and the fairness stays closer to value of 1. It is considered an efficient and cost effective way to increase the throughput, coverage and reduce the latency.
The improvement of end to end delays in network management system using netwo...IJCNCJournal
The document summarizes research on improving end-to-end delays in a network management system using network coding. Specifically, it applies network coding to manage radio and television broadcast stations in a wireless network. The study shows that a proposed "Fast Forwarding Strategy" using network coding outperforms a classical routing strategy in reducing end-to-end delays from source to destination. It analyzes end-to-end delays theoretically using network calculus and conducts a practical study on a network of broadcast stations, finding the proposed strategy reduces delays compared to the classical strategy.
Determining the Optimum Number of Paths for Realization of Multi-path Routing...TELKOMNIKA JOURNAL
This document proposes an algorithm for determining the optimal number of paths for multi-path routing in MPLS-TE networks. The algorithm involves:
1. Constructing a network graph and finding the set of shortest paths between nodes using Dijkstra's algorithm.
2. Determining the maximum flow that can be transmitted over each shortest path based on the minimum cut using the Ford-Fulkerson theorem.
3. Considering delay as another criterion and formulating the problem as a multi-criteria optimization to maximize flow while minimizing delay.
4. Defining a utility function to reduce the problem to a single-criterion by representing the quality of criteria on a 0 to 1 scale.
5.
IJCER (www.ijceronline.com) International Journal of computational Engineerin...ijceronline
This document summarizes a research paper that evaluates the performance of two routing protocols (AODV and DSDV) under different traffic patterns (TCP and CBR) in a mobile ad hoc network (MANET) simulation. The paper describes MANET characteristics and challenges for routing. It provides an overview of reactive (AODV), proactive (DSDV), and hybrid routing protocols. It also defines TCP and CBR traffic patterns. The research aims to analyze and compare the packet delivery ratio and end-to-end delay of AODV and DSDV under different traffic loads using the NS-2 simulator. Preliminary results show that reactive protocols perform better in terms of these metrics.
Survey on scheduling and radio resources allocation in lteijngnjournal
- The document discusses scheduling and radio resource allocation in LTE networks. It focuses on the radio resource manager (RRM) element in LTE that performs admission control and packet scheduling.
- Several scheduling algorithms are proposed for both uplink and downlink directions, including proportional fair, EXP-PF, round robin, max-min fair, and algorithms that aim to maximize throughput or support quality of service requirements.
- The paper provides an overview of these scheduling algorithms, evaluates their performance, and offers criticism on how to best allocate radio resources in LTE networks.
LTE QOS DYNAMIC RESOURCE BLOCK ALLOCATION WITH POWER SOURCE LIMITATION AND QU...IJCNCJournal
3GPP has defined the long term evolution (LTE) for 3G radio access in order to maintain the future
competitiveness for 3G technology, the system provides the capability of supporting a mixture of services
with different quality of service (QoS) requirements. This paper proposes a new cross-layer scheduling
algorithm to satisfy better QoS parameters for real time applications. The proposed algorithm takes care of
allocating resource blocks (RBs) with different modulation and coding schemes (MCS) according to target
bit error rate (BER), user equipment supportable MCS, queue stability constraints and available transmit
power constraints. The proposed algorithm has been valued, compared with an earlier allocation algorithm
in terms of service rate and packet delay and showed better performance regards the real time
applications.
Performance Evaluation of UDP, DCCP, SCTP and TFRC for Different Traffic Flow...IJECEIAES
The demand for internet applications has increased rapidly. Providing quality of service (QoS) requirements for varied internet application is a challenging task. One important factor that is significantly affected on the QoS service is the transport layer. The transport layer provides end-to-end data transmission across a network. Currently, the most common transport protocols used by internet application are TCP (Transmission Control Protocol) and UDP (User Datagram Protocol). Also, there are recent transport protocols such as DCCP (data congestion control protocol), SCTP (stream congestion transmission protocol), and TFRC (TCP-friendly rate control), which are in the standardization process of Internet Engineering Task Force (IETF). In this paper, we evaluate the performance of UDP, DCCP, SCTP and TFRC protocols for different traffic flows: data transmission, video traffic, and VOIP in wired networks. The performance criteria used for this evaluation include throughput, end to end delay, and packet loss rate. Well-known network simulator NS-2 used to implement the UDP, DCCP, SCTP, and TFRC protocols performance comparison. Based on the simulation results, the performance throughput of SCTP and TFRC is better than UDP. Moreover, DCCP performance is superior SCTP and TFRC in term of end-to-end delay.
PERFORMANCE ANALYSIS AND COMPARISON OF IMPROVED DSR WITH DSR, AODV AND DSDV R...ijp2p
Mobile Ad-hoc networks are categorized by multi-hop wireless connectivity and numbers of nodes are connecting each other through wireless network. It includes several routing protocols specifically designed for ad-hoc routing. The most widely used ad hoc routing protocols are Ad-hoc On Demand Distance Vector (AODV), Destination Sequence Distance Vector (DSDV), and Dynamic Source Routing (DSR). In this paper, we present an analysis of DSR protocol and propose our algorithm to improve the performance of DSR protocol by using small delay applied on last route ACK path when an original route fails in Mobile Ad Hoc networks. Past researchers the MANET have focused on simulation study by varying network parameters, such as network size, number of nodes. The simulation results shows that the M-DSR protocol
having some excellent performance Metrics then other protocols. We have taken different performance parameters over the comparison of Modified -DSR with other three protocols in mobility as well as Nonmobility scenario up to 300 nodes in MANETs using NS2 simulator. To achieve this goal DSR is modified by using modified algorithm technique in order to load balancing, to avoid congestion and lower packet
delivery.
Our area of interest for the paper is the improvement of performance of DSR routing protocol by
changing in algorithm and this Improved DSR protocol should compare with remaining protocols
taken in this research paper.
2. In this paper we made changesin traditional DSR protocol and generation of new improved DSR the
different performance parameters and compare with AODV/DSR/DSDV protocols in mobility and
non- mobility scenarios nodes up to 300.
3. We can plot the graphs throughput, End to end Delay, Packet delivery Ratio, Dropping Ratio, and
average energy consumption on Mobility and Non-Mobility scenario by using Network Simulator
version 2.34 for Modified DSR protocols. M-DSR, DSDV perform well when Mobility is low.
Macro with pico cells (hetnets) system behaviour using well known scheduling ...ijwmn
This paper demonstrates the concept of using Heterogeneous networks (HetNets) to improve Long Term Evolution (LTE) system by introducing the LTE Advance (LTE-A). The type of HetNets that has been chosen for this study is Macro with Pico cells. Comparing the system performance with and without Pico cells has clearly illustrated using three well-known scheduling algorithms (Proportional Fair PF, Maximum Largest Weighted Delay First MLWDF and Exponential/Proportional Fair EXP/PF). The system is judged based on throughput, Packet Loss Ratio PLR, delay and fairness.. A simulation platform called LTE-Sim has been used to collect the data and produce the paper’s outcomes and graphs. The results prove that adding Pico cells enhances the overall system performance. From the simulation outcomes, the overall system performance is as follows: throughput is duplicated or tripled based on the number of users, the PLR is almost quartered, the delay is nearly reduced ten times (PF case) and changed to be a half (MLWDF/EXP cases), and the fairness stays closer to value of 1. It is considered an efficient and cost effective way to increase the throughput, coverage and reduce the latency.
The improvement of end to end delays in network management system using netwo...IJCNCJournal
The document summarizes research on improving end-to-end delays in a network management system using network coding. Specifically, it applies network coding to manage radio and television broadcast stations in a wireless network. The study shows that a proposed "Fast Forwarding Strategy" using network coding outperforms a classical routing strategy in reducing end-to-end delays from source to destination. It analyzes end-to-end delays theoretically using network calculus and conducts a practical study on a network of broadcast stations, finding the proposed strategy reduces delays compared to the classical strategy.
Protocol based QoS Estimation of OFDM-WIMAX Networkidescitation
This document summarizes a research paper that evaluated the quality of service (QoS) of different routing protocols in an orthogonal frequency-division multiplexing (OFDM) based WiMAX network. The researchers simulated scenarios using four routing protocols: Open Shortest Path First (OSPF), Intermediate System to Intermediate System (IS-IS), Routing Information Protocol (RIP), and Interior Gateway Routing Protocol (IGRP). They analyzed QoS metrics like throughput, delay, packet jitter, and packet drops. The results showed that OSPF and IGRP had lower delays while IGRP had higher uplink packet drops. In general, the different routing protocols significantly impacted network performance metrics. The paper concluded more work
Alternatives to Redistribution Communities in Inter-domain traffic Engineering cscpconf
Vivekanandan discusses alternatives to using redistribution communities for inter-domain traffic engineering. He summarizes MPLS and Ambient Networks as two approaches that provide more effective control over traffic than communities. MPLS separates control and forwarding planes and allows traffic to be engineered using constraints and explicit label switched paths. Ambient Networks integrate different network technologies and domains through its control space architecture, and can engineer traffic using multi-commodity flow optimization and local load balancing approaches.
A novel approach of hybrid multipath routing protocol for manets using receiv...eSAT Publishing House
This document summarizes a research paper that proposes a new hybrid multipath routing protocol called HMPRP for mobile ad hoc networks. HMPRP aims to improve performance metrics like packet delivery ratio, end-to-end delay, energy consumption and throughput. It applies concepts from AODV like route discovery and incorporates received signal strength and node-disjoint multipath routing. Simulation results show HMPRP outperforms AODV, OLSR and ZRP protocols across various node speeds for 150 node networks.
Concurrent Multi - Path Real Time Communication Control Protocol (Cmprtcp)IRJET Journal
The document proposes a new transport protocol called Concurrent Multi-Path Real Time Communication Control Protocol (CMPRTCP) to handle real-time streams like video and audio over IP networks. CMPRTCP intelligently uses multiple paths between multi-homed hosts to concurrently transmit synchronized streams. It describes CMPRTCP's architecture and operation in detail. Experiments show CMPRTCP performs better than other protocols by maximizing timely data delivery under varying network conditions.
This document summarizes a research paper that proposes a new routing metric called NMH (New Metric for Hybrid Wireless Mesh Protocol) for wireless mesh networks. The paper argues that existing routing metrics do not adequately consider factors like channel diversity, interference, and end-to-end delay. The proposed NMH metric combines two-hop channel diversity and hop delay. Simulation results showed that NMH outperformed WCETT (Weighted Cumulative Expected Transmission Time) in terms of average network throughput, end-to-end delay, and number of flows supported.
1) Computer networks allow communication and sharing of resources between computer systems and devices through communication channels. There are several types of networks including LANs, WANs, and MANs.
2) For communication between systems, both must agree on a protocol which sets rules for data transmission. The two main protocol stacks are OSI and TCP/IP.
3) The network layer is responsible for delivering packets from source to destination. It uses services from the data link layer and provides services to the transport layer. Common network layer protocols are IP (Internet Protocol) for connectionless service and MPLS for connection-oriented service.
This document analyzes the performance of different routing protocols (AODV, DSR, DSDV) under various mobility models (random waypoint, random direction, random walk) and node speeds in mobile ad hoc networks. It finds that reactive protocols like AODV and DSR generally have higher packet delivery ratios than proactive DSDV, but end-to-end delays vary depending on the mobility model and node speed. The document proposes an algorithm to select the best routing protocol based on whether data delivery or time is the higher priority, and whether nodes are stationary or mobile. DSDV is preferred when data delivery is most important, while DSR performs better for time-critical applications.
Improved Good put using Harvest-Then-Transmit Protocol for Video TransferEswar Publications
In multiple wireless networks, large end-to-end delay and packet losses can decrease meaningfully the traffic flow goodput due to path irregularity and multiplicity. To report these problems, current methods are proposed by using management of queue and decision making process. Hence, this paper proposesa Harvest-Then-Transmit (HTT) Protocol which selects an energy efficient path based on multiple parameters i.e. energy, delay, transmission time and perform transmission of video to handle number of video packets. A multipath environment is establishing where a server performs transferring of video along the energy efficient path of wireless network. Simulation shows the proposed protocol improves the overall goodput up to 10%, increases packet delivery rate up to 12%, and reduces end-to-end delay up to 3%, compared to existing system.
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.
This document presents a comparative analysis of three routing protocols for mobile ad hoc networks (MANETs): AODV, DSR, and OLSR. It analyzes the performance of these protocols under different scenarios varying node mobility, network load, and node density. The key metrics examined are throughput, end-to-end delay, routing overhead, and network load. The analysis found that OLSR generally had the highest throughput and AODV and OLSR introduced less delay than DSR. DSR introduced the highest routing overhead, while protocols performed similarly under varying network loads.
IRJET- Comparative Performance Analysis of Routing Protocols in Manet using NS-2IRJET Journal
This document analyzes and compares the performance of three routing protocols (AODV, DSR, DSDV) in mobile ad hoc networks (MANETs) using the network simulator NS-2. The protocols are evaluated based on parameters like end-to-end delay, packet delivery ratio, and average routing load. The results show that DSR generally has lower end-to-end delay while DSDV has lower average routing load. Packet delivery ratio increases with node count for AODV and DSDV but varies more for DSR. In general, no single protocol dominates across all parameters and performance depends on network conditions.
This document analyzes the performance of two on-demand routing protocols (AODV and DSR) in mobile ad hoc networks with varying network sizes up to 50 nodes. It simulates the protocols using the NS-2 network simulator and measures performance metrics like packet delivery fraction, end-to-end delay, normalized routing load, and throughput. The results show that the differences in AODV and DSR protocol mechanics lead to significant variations in performance for different network densities.
Long-Term Advancement Progressed (LTE-ADV) is the advancement of the long-term evolution,
which created via 3GPP. LTE-ADV aims to offer a transmission bandwidth of (100) MHz by using Carrier
Aggregation (CA) to aggregate LTE-ADV carriers. To increase the data capacity of the system and
resource allocation converts a very good tool. LTE-Advanced multiple Component Carriers (CCs) becomes
a difficult optimization problem. In the paper proposes a new scheduling algorithm and compares with a
different scheduling traditional algorithms that are proportional fair and round robin in the CA, in order to
find the best scheduler that provides high-quality throughput and improves fairness. It also evaluates
mapping model types are Mutual Information Effective SINR Mapping (MIESM) and Exponential Effective
SINR Mapping (EESM). The results show that the throughput in the proposed algorithm with MIESM
outperforms from others mapping and scheduling.
This document reviews Network-on-Chip (NoC) architectures that prioritize selected data streams to reduce communication latency. It categorizes the architectures based on the effect of prioritization (per end-to-end connection, per router, or per path segment) and discusses their pros and cons. Architectures that prioritize at the core-to-core level provide the highest latency reduction by bypassing the NoC, while those prioritizing per router or path segment require redetermining priority at each hop.
This document analyzes the performance of three routing protocols - AODV, DSDV, and OLSR - in a mobile ad hoc network simulation using the NS-3 simulator. It describes the key characteristics of each protocol and the simulation setup, which involved 50 nodes moving according to a random waypoint model. The performance metric studied was packet delivery ratio. The results showed that OLSR achieved the highest packet delivery ratio, performing better than AODV and DSDV in delivering packets from source to destination nodes over the 600 second simulation.
EVALUATION OF PROACTIVE, REACTIVE AND HYBRID AD HOC ROUTING PROTOCOL FOR IEEE...cscpconf
This document evaluates the performance of proactive, reactive, and hybrid ad hoc routing protocols (OLSR, AODV, DYMO, ZRP) for IEEE 802.11 MAC and 802.11 DCF in a vehicular ad hoc network (VANET) simulation using Qualnet. It discusses the characteristics and operations of these four routing protocols. The simulation varies VANET parameters like speed and altitude. The results show that in real traffic scenarios, the proactive OLSR protocol performs more efficiently for IEEE 802.11 MAC and DCF compared to the reactive and hybrid protocols.
Iterative network channel decoding with cooperative space-time transmissionijasuc
This document summarizes an iterative network-channel decoding scheme for cooperative space-time transmission with network coding. The scheme uses convolutional codes as network codes at the relay node and Reed-Solomon codes as channel codes at the user nodes. An iterative joint network-channel decoder exchanges soft information between convolutional code-based network decoder and Reed-Solomon code-based channel decoders. Extrinsic information transfer analysis is performed to investigate the convergence properties of the proposed iterative decoder.
NETWORK PERFORMANCE EVALUATION WITH REAL TIME APPLICATION ENSURING QUALITY OF...ijngnjournal
The quality of service is a need in recent computer network developments. The present paper evaluates some characteristics in a proposed network topology such as dropped packets and bandwidth use, using two traffic sources, firstly a VoIP source over an UDP agent, then a CBR traffic source over an UDP agent as well as the previous one. Two possible configurations are proposed, implementing both of them in the Network Simulator, and implementing in one of them differentiated services to compare the results. Statistics results are shown, in both cases showing the accumulative dropped packet number and the throughput in the link, obtaining a reducer number of dropped packets in the stage with differentiated services, and an improvement in the bandwidth use.
A COMPARATIVE ANALYSIS ON ROUTING PROTOCOLS OF MOBILE AD HOC NETWORKijcseit
In this modern era, Mobile Ad hoc Network (MANET) is widely used for its mobility and self-configuring
features. Hence, a better security approach is needed for maintaining high level network performance in
mobile ad hoc network. This paper presents the comparative analysis of quality of service (QoS) of MANET
protocols. In this regard, three types of most widely used protocols, named, Ad hoc On-demand Distance
Vector (AODV), Dynamic Source Routing (DSR) and Optimized Link State Routing Protocol (OLSR) have
been used to analyze. Therefore, AODV is selected in distributed ad hoc setting for the path discovery.
Also, AODV is a reactive improvement of Dynamic Destination Sequence Vector (DSDV) protocol. On the
other hand, the number of route broadcast is decreased by source routes on demand in AODV, which is
opposite of DSDV algorithm. In this research, the quality of service parameters of network paths are also
included to develop trust in the links to defend from various attacks. Moreover, a comparative analysis of
delay, congestion, packet losses, transit time between source and destination is illustrated on AODV and
DSR. In simulation time, packet drop-outs and link failures for probe packets are examined and analyzed
under network attack.
A COMPARATIVE ANALYSIS ON ROUTING PROTOCOLS OF MOBILE AD HOC NETWORKijcseit
In this modern era, Mobile Ad hoc Network (MANET) is widely used for its mobility and self-configuring
features. Hence, a better security approach is needed for maintaining high level network performance in
mobile ad hoc network. This paper presents the comparative analysis of quality of service (QoS) of MANET
protocols. In this regard, three types of most widely used protocols, named, Ad hoc On-demand Distance
Vector (AODV), Dynamic Source Routing (DSR) and Optimized Link State Routing Protocol (OLSR) have
been used to analyze. Therefore, AODV is selected in distributed ad hoc setting for the path discovery.
Also, AODV is a reactive improvement of Dynamic Destination Sequence Vector (DSDV) protocol. On the
other hand, the number of route broadcast is decreased by source routes on demand in AODV, which is
opposite of DSDV algorithm. In this research, the quality of service parameters of network paths are also
included to develop trust in the links to defend from various attacks. Moreover, a comparative analysis of
delay, congestion, packet losses, transit time between source and destination is illustrated on AODV and
DSR. In simulation time, packet drop-outs and link failures for probe packets are examined and analyzed
under network attack.
An Effective approach to control Inter-domain Traffic Engineering among Heter...ijistjournal
The Flow of packets inside an IP networks can be effectively controlled by appropriate traffic engineering. Today’s internet routing mainly concentrates on controlling the ingress and egress traffic which occurs through border routers. There are different ways by which we can control the traffic between autonomous systems. In most cases redistribution communities are used for the control over traffic engineering. In this paper we focus on alternative approaches like Multi Protocol Label Switching (MPLS) and Ambient Networks, through which there can be an effective control over traffic engineering. Ambient Networks are designed to solve switching problems between heterogeneous networks.
Protocol based QoS Estimation of OFDM-WIMAX Networkidescitation
This document summarizes a research paper that evaluated the quality of service (QoS) of different routing protocols in an orthogonal frequency-division multiplexing (OFDM) based WiMAX network. The researchers simulated scenarios using four routing protocols: Open Shortest Path First (OSPF), Intermediate System to Intermediate System (IS-IS), Routing Information Protocol (RIP), and Interior Gateway Routing Protocol (IGRP). They analyzed QoS metrics like throughput, delay, packet jitter, and packet drops. The results showed that OSPF and IGRP had lower delays while IGRP had higher uplink packet drops. In general, the different routing protocols significantly impacted network performance metrics. The paper concluded more work
Alternatives to Redistribution Communities in Inter-domain traffic Engineering cscpconf
Vivekanandan discusses alternatives to using redistribution communities for inter-domain traffic engineering. He summarizes MPLS and Ambient Networks as two approaches that provide more effective control over traffic than communities. MPLS separates control and forwarding planes and allows traffic to be engineered using constraints and explicit label switched paths. Ambient Networks integrate different network technologies and domains through its control space architecture, and can engineer traffic using multi-commodity flow optimization and local load balancing approaches.
A novel approach of hybrid multipath routing protocol for manets using receiv...eSAT Publishing House
This document summarizes a research paper that proposes a new hybrid multipath routing protocol called HMPRP for mobile ad hoc networks. HMPRP aims to improve performance metrics like packet delivery ratio, end-to-end delay, energy consumption and throughput. It applies concepts from AODV like route discovery and incorporates received signal strength and node-disjoint multipath routing. Simulation results show HMPRP outperforms AODV, OLSR and ZRP protocols across various node speeds for 150 node networks.
Concurrent Multi - Path Real Time Communication Control Protocol (Cmprtcp)IRJET Journal
The document proposes a new transport protocol called Concurrent Multi-Path Real Time Communication Control Protocol (CMPRTCP) to handle real-time streams like video and audio over IP networks. CMPRTCP intelligently uses multiple paths between multi-homed hosts to concurrently transmit synchronized streams. It describes CMPRTCP's architecture and operation in detail. Experiments show CMPRTCP performs better than other protocols by maximizing timely data delivery under varying network conditions.
This document summarizes a research paper that proposes a new routing metric called NMH (New Metric for Hybrid Wireless Mesh Protocol) for wireless mesh networks. The paper argues that existing routing metrics do not adequately consider factors like channel diversity, interference, and end-to-end delay. The proposed NMH metric combines two-hop channel diversity and hop delay. Simulation results showed that NMH outperformed WCETT (Weighted Cumulative Expected Transmission Time) in terms of average network throughput, end-to-end delay, and number of flows supported.
1) Computer networks allow communication and sharing of resources between computer systems and devices through communication channels. There are several types of networks including LANs, WANs, and MANs.
2) For communication between systems, both must agree on a protocol which sets rules for data transmission. The two main protocol stacks are OSI and TCP/IP.
3) The network layer is responsible for delivering packets from source to destination. It uses services from the data link layer and provides services to the transport layer. Common network layer protocols are IP (Internet Protocol) for connectionless service and MPLS for connection-oriented service.
This document analyzes the performance of different routing protocols (AODV, DSR, DSDV) under various mobility models (random waypoint, random direction, random walk) and node speeds in mobile ad hoc networks. It finds that reactive protocols like AODV and DSR generally have higher packet delivery ratios than proactive DSDV, but end-to-end delays vary depending on the mobility model and node speed. The document proposes an algorithm to select the best routing protocol based on whether data delivery or time is the higher priority, and whether nodes are stationary or mobile. DSDV is preferred when data delivery is most important, while DSR performs better for time-critical applications.
Improved Good put using Harvest-Then-Transmit Protocol for Video TransferEswar Publications
In multiple wireless networks, large end-to-end delay and packet losses can decrease meaningfully the traffic flow goodput due to path irregularity and multiplicity. To report these problems, current methods are proposed by using management of queue and decision making process. Hence, this paper proposesa Harvest-Then-Transmit (HTT) Protocol which selects an energy efficient path based on multiple parameters i.e. energy, delay, transmission time and perform transmission of video to handle number of video packets. A multipath environment is establishing where a server performs transferring of video along the energy efficient path of wireless network. Simulation shows the proposed protocol improves the overall goodput up to 10%, increases packet delivery rate up to 12%, and reduces end-to-end delay up to 3%, compared to existing system.
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.
This document presents a comparative analysis of three routing protocols for mobile ad hoc networks (MANETs): AODV, DSR, and OLSR. It analyzes the performance of these protocols under different scenarios varying node mobility, network load, and node density. The key metrics examined are throughput, end-to-end delay, routing overhead, and network load. The analysis found that OLSR generally had the highest throughput and AODV and OLSR introduced less delay than DSR. DSR introduced the highest routing overhead, while protocols performed similarly under varying network loads.
IRJET- Comparative Performance Analysis of Routing Protocols in Manet using NS-2IRJET Journal
This document analyzes and compares the performance of three routing protocols (AODV, DSR, DSDV) in mobile ad hoc networks (MANETs) using the network simulator NS-2. The protocols are evaluated based on parameters like end-to-end delay, packet delivery ratio, and average routing load. The results show that DSR generally has lower end-to-end delay while DSDV has lower average routing load. Packet delivery ratio increases with node count for AODV and DSDV but varies more for DSR. In general, no single protocol dominates across all parameters and performance depends on network conditions.
This document analyzes the performance of two on-demand routing protocols (AODV and DSR) in mobile ad hoc networks with varying network sizes up to 50 nodes. It simulates the protocols using the NS-2 network simulator and measures performance metrics like packet delivery fraction, end-to-end delay, normalized routing load, and throughput. The results show that the differences in AODV and DSR protocol mechanics lead to significant variations in performance for different network densities.
Long-Term Advancement Progressed (LTE-ADV) is the advancement of the long-term evolution,
which created via 3GPP. LTE-ADV aims to offer a transmission bandwidth of (100) MHz by using Carrier
Aggregation (CA) to aggregate LTE-ADV carriers. To increase the data capacity of the system and
resource allocation converts a very good tool. LTE-Advanced multiple Component Carriers (CCs) becomes
a difficult optimization problem. In the paper proposes a new scheduling algorithm and compares with a
different scheduling traditional algorithms that are proportional fair and round robin in the CA, in order to
find the best scheduler that provides high-quality throughput and improves fairness. It also evaluates
mapping model types are Mutual Information Effective SINR Mapping (MIESM) and Exponential Effective
SINR Mapping (EESM). The results show that the throughput in the proposed algorithm with MIESM
outperforms from others mapping and scheduling.
This document reviews Network-on-Chip (NoC) architectures that prioritize selected data streams to reduce communication latency. It categorizes the architectures based on the effect of prioritization (per end-to-end connection, per router, or per path segment) and discusses their pros and cons. Architectures that prioritize at the core-to-core level provide the highest latency reduction by bypassing the NoC, while those prioritizing per router or path segment require redetermining priority at each hop.
This document analyzes the performance of three routing protocols - AODV, DSDV, and OLSR - in a mobile ad hoc network simulation using the NS-3 simulator. It describes the key characteristics of each protocol and the simulation setup, which involved 50 nodes moving according to a random waypoint model. The performance metric studied was packet delivery ratio. The results showed that OLSR achieved the highest packet delivery ratio, performing better than AODV and DSDV in delivering packets from source to destination nodes over the 600 second simulation.
EVALUATION OF PROACTIVE, REACTIVE AND HYBRID AD HOC ROUTING PROTOCOL FOR IEEE...cscpconf
This document evaluates the performance of proactive, reactive, and hybrid ad hoc routing protocols (OLSR, AODV, DYMO, ZRP) for IEEE 802.11 MAC and 802.11 DCF in a vehicular ad hoc network (VANET) simulation using Qualnet. It discusses the characteristics and operations of these four routing protocols. The simulation varies VANET parameters like speed and altitude. The results show that in real traffic scenarios, the proactive OLSR protocol performs more efficiently for IEEE 802.11 MAC and DCF compared to the reactive and hybrid protocols.
Iterative network channel decoding with cooperative space-time transmissionijasuc
This document summarizes an iterative network-channel decoding scheme for cooperative space-time transmission with network coding. The scheme uses convolutional codes as network codes at the relay node and Reed-Solomon codes as channel codes at the user nodes. An iterative joint network-channel decoder exchanges soft information between convolutional code-based network decoder and Reed-Solomon code-based channel decoders. Extrinsic information transfer analysis is performed to investigate the convergence properties of the proposed iterative decoder.
NETWORK PERFORMANCE EVALUATION WITH REAL TIME APPLICATION ENSURING QUALITY OF...ijngnjournal
The quality of service is a need in recent computer network developments. The present paper evaluates some characteristics in a proposed network topology such as dropped packets and bandwidth use, using two traffic sources, firstly a VoIP source over an UDP agent, then a CBR traffic source over an UDP agent as well as the previous one. Two possible configurations are proposed, implementing both of them in the Network Simulator, and implementing in one of them differentiated services to compare the results. Statistics results are shown, in both cases showing the accumulative dropped packet number and the throughput in the link, obtaining a reducer number of dropped packets in the stage with differentiated services, and an improvement in the bandwidth use.
A COMPARATIVE ANALYSIS ON ROUTING PROTOCOLS OF MOBILE AD HOC NETWORKijcseit
In this modern era, Mobile Ad hoc Network (MANET) is widely used for its mobility and self-configuring
features. Hence, a better security approach is needed for maintaining high level network performance in
mobile ad hoc network. This paper presents the comparative analysis of quality of service (QoS) of MANET
protocols. In this regard, three types of most widely used protocols, named, Ad hoc On-demand Distance
Vector (AODV), Dynamic Source Routing (DSR) and Optimized Link State Routing Protocol (OLSR) have
been used to analyze. Therefore, AODV is selected in distributed ad hoc setting for the path discovery.
Also, AODV is a reactive improvement of Dynamic Destination Sequence Vector (DSDV) protocol. On the
other hand, the number of route broadcast is decreased by source routes on demand in AODV, which is
opposite of DSDV algorithm. In this research, the quality of service parameters of network paths are also
included to develop trust in the links to defend from various attacks. Moreover, a comparative analysis of
delay, congestion, packet losses, transit time between source and destination is illustrated on AODV and
DSR. In simulation time, packet drop-outs and link failures for probe packets are examined and analyzed
under network attack.
A COMPARATIVE ANALYSIS ON ROUTING PROTOCOLS OF MOBILE AD HOC NETWORKijcseit
In this modern era, Mobile Ad hoc Network (MANET) is widely used for its mobility and self-configuring
features. Hence, a better security approach is needed for maintaining high level network performance in
mobile ad hoc network. This paper presents the comparative analysis of quality of service (QoS) of MANET
protocols. In this regard, three types of most widely used protocols, named, Ad hoc On-demand Distance
Vector (AODV), Dynamic Source Routing (DSR) and Optimized Link State Routing Protocol (OLSR) have
been used to analyze. Therefore, AODV is selected in distributed ad hoc setting for the path discovery.
Also, AODV is a reactive improvement of Dynamic Destination Sequence Vector (DSDV) protocol. On the
other hand, the number of route broadcast is decreased by source routes on demand in AODV, which is
opposite of DSDV algorithm. In this research, the quality of service parameters of network paths are also
included to develop trust in the links to defend from various attacks. Moreover, a comparative analysis of
delay, congestion, packet losses, transit time between source and destination is illustrated on AODV and
DSR. In simulation time, packet drop-outs and link failures for probe packets are examined and analyzed
under network attack.
An Effective approach to control Inter-domain Traffic Engineering among Heter...ijistjournal
The Flow of packets inside an IP networks can be effectively controlled by appropriate traffic engineering. Today’s internet routing mainly concentrates on controlling the ingress and egress traffic which occurs through border routers. There are different ways by which we can control the traffic between autonomous systems. In most cases redistribution communities are used for the control over traffic engineering. In this paper we focus on alternative approaches like Multi Protocol Label Switching (MPLS) and Ambient Networks, through which there can be an effective control over traffic engineering. Ambient Networks are designed to solve switching problems between heterogeneous networks.
PERFORMANCE COMPARISON AND ANALYSIS OF PROACTIVE, REACTIVE AND HYBRID ROUTING...ijwmn
Wireless Sensor networks are a challenging task due to the lack of resources in the network as well as the frequent changes in network topology. Various routing protocols are designed basically to establish correct and efficient paths between source and destination. In the recent years, several routing protocols
have been proposed in literature and many of them studied through extensive simulation at different network characteristics. In this paper, we compare the performance of three most common routing protocols of wireless sensor networks i.e. AODV, DSDV and ZRP. These protocols have been simulated
using NS2 Package. This study investigates the routing protocols corresponding to packet delivery ratio, packet loss ratio, average throughput, dropped packets and end-to-end delay. Hence, evaluation and comparison between routing protocols is required because performance of any routing protocol can be changed with various parameters such as speed of nodes, pause times and number of nodes.
Performance Comparison and Analysis of Proactive, Reactive and Hybrid Routing...ijwmn
Wireless Sensor networks are a challenging task due to the lack of resources in the network as well as the frequent changes in network topology. Various routing protocols are designed basically to establish correct and efficient paths between source and destination. In the recent years, several routing protocols have been proposed in literature and many of them studied through extensive simulation at different network characteristics. In this paper, we compare the performance of three most common routing protocols of wireless sensor networks i.e. AODV, DSDV and ZRP. These protocols have been simulated using NS2 Package. This study investigates the routing protocols corresponding to packet delivery ratio, packet loss ratio, average throughput, dropped packets and end-to-end delay. Hence, evaluation and comparison between routing protocols is required because performance of any routing protocol can be changed with various parameters such as speed of nodes, pause times and number of nodes.
Performance Comparison and Analysis of Proactive, Reactive and Hybrid Routing...ijwmn
Wireless Sensor networks are a challenging task due to the lack of resources in the network as well as the frequent changes in network topology. Various routing protocols are designed basically to establish correct and efficient paths between source and destination. In the recent years, several routing protocols have been proposed in literature and many of them studied through extensive simulation at different network characteristics. In this paper, we compare the performance of three most common routing protocols of wireless sensor networks i.e. AODV, DSDV and ZRP. These protocols have been simulated using NS2 Package. This study investigates the routing protocols corresponding to packet delivery ratio, packet loss ratio, average throughput, dropped packets and end-to-end delay. Hence, evaluation and comparison between routing protocols is required because performance of any routing protocol can be changed with various parameters such as speed of nodes, pause times and number of nodes.
PERFORMANCE OF OLSR MANET ADOPTING CROSS-LAYER APPROACH UNDER CBR AND VBR TRA...IJCNCJournal
The routing protocols play an important role in Mobile Ad-Hoc Network (MANET) because of the dynamically change of its topology. Optimized Link State Routing (OLSR), unawareness of Quality of Service (QoS) and power-consumed protocol, is an example of a widely-used routing protocol in MANET.
The Multi-Point Relays (MPR) selection algorithm is very crucial in OLSR. Therefore, firstly, we propose a heuristic method to select the best path based on two parameters; Bit Error Rate (BER) derived from the physical layer and Weighted Connectivity Index (CI) adopted from the network layer. This can be done via the cross-layer design scheme. This is anticipated to enhance the performance of OLSR, provide QoS
guarantee and improve the power consumption. The performances of the proposed scheme are investigated
by simulation of two types of traffics: CBR and VBR (MPEG-4), evaluated by metrics namely Throughput, Packet Delivery Ratio (PDR), Average End-to-End Delay, Control Overhead and Average Total Power Consumption.We compare our results with the typical OLSR and OLSR using only Weighted CI. It is
obvious that our proposed scheme provides superior performances to the typical OLSR and OLSR using only Weighted CI, especially, at high traffic load.
This document summarizes a study comparing the performance of the AODV and MAODV routing protocols in a mobile ad hoc network (MANET) using the Network Simulator 2 (NS-2). The study introduces a malicious node to simulate a hacker attack and analyzes the impact on packet delivery ratio, end-to-end delay, and throughput under different node densities and pause times. The results show that MAODV has lower performance than AODV, and the difference increases as the number of nodes increases due to the greater impact of the malicious node. Future work could extend the study to include more malicious nodes and design a new protocol to detect and mitigate malicious nodes.
Performance evaluation of different routing protocols in wsn using different ...Dr Sandeep Kumar Poonia
This document evaluates the performance of different routing protocols in wireless sensor networks using various network parameters. It simulates the Dynamic Source Routing (DSR) and Adhoc On-Demand Distance Vector (AODV) routing protocols in a 1000m x 1000m terrain area with 100 sensor nodes. The packet delivery fraction, average throughput, and normalized routing load are analyzed at different node speeds ranging from 20-100m/s. The results show that AODV performs better than DSR in terms of packet delivery fraction and normalized routing load, while DSR has better average throughput performance. In conclusion, AODV is more optimal for small terrain areas when considering packet delivery and routing overhead, while DSR provides higher data rates.
Performance evaluation of dynamic source routing protocol with variation in t...IJECEIAES
This document evaluates the performance of the dynamic source routing (DSR) protocol in mobile ad-hoc networks (MANETs) by simulating variations in transmission power and node speed using the OPNET simulator. The simulation analyzes how average throughput and end-to-end delay are affected when the transmission power is varied from 1-4 mW at node speeds of 10-40 m/s for network sizes of 40 and 80 nodes. The results show that throughput initially increases with transmission power up to a certain value, after which it decreases, and the network performs optimally at a specific transmission power that depends on node speed. Delay also initially decreases with transmission power up to a point, then increases significantly at higher powers.
Evaluating feasibility of using wireless sensor networks in a coffee crop thr...IJCNCJournal
A Wireless Sensor Networks is a network formed with sensors that have characteristics to sensor an area to
extract a specific metric, depending of the application.
We would like to analyse the feasibility to use sensors in a coffee crop.In this work we are evaluating routing protocolsusing real dimensions and characteristics of a coffee crop. We evaluate, through simulation, AODV, DSDV and AOMDV and two variants known in this work as AODVMOD and AOMDVMOD with 802.15.4 MAC Protocol
.For this comparison, we defined three performance metrics: Packet Delivery Ratio (PDR), End-to-End Delay
and Average Energy Consumption. Simulation results show that AOMDVMOD overall, outperforms others
routing protocols evaluated, showing that is possible to use WSN in a real coffee crop environment.
IJCER (www.ijceronline.com) International Journal of computational Engineerin...ijceronline
This document summarizes a study that evaluated the performance of the AODV and DSR routing protocols for MANETs under increasing node density using VBR traffic. The study found that as node density increased:
- DSR had lower routing overhead than AODV
- AODV had a higher packet delivery ratio than DSR
- DSR experienced higher network load and was more overloaded than AODV
- DSR maintained more optimal path lengths than AODV
Overall, the study concluded that AODV is better suited than DSR for delay-sensitive applications with VBR traffic in dense MANETs due to its lower overhead and delays.
Performance analysis of manet routing protocol in presenceiaemedu
This document analyzes the performance of different routing protocols in a mobile ad hoc network (MANET) under hybrid traffic conditions. It simulates a MANET with 50 nodes moving at speeds up to 20 m/s using the AODV, DSDV, and DSR routing protocols. Traffic included both constant bit rate and variable bit rate sources. Results found that AODV had lower average end-to-end delay and higher packet delivery ratios than DSDV and DSR as the percentage of variable bit rate traffic increased. AODV also performed comparably under both low and high node mobility scenarios with hybrid traffic.
This document summarizes a research paper that evaluates the performance of the Dynamic Source Routing (DSR) routing protocol for Variable Bit Rate (VBR) multimedia traffic in mobile ad hoc networks (MANETs) using the Network Simulator 2 (NS-2). The paper conducts simulations of DSR under different scenarios by varying the terrain size, connection rate, and data send rate. It compares the performance of DSR and an enhanced version of DSR based on packet delivery ratio, average end-to-end delay, and optimal path length. The results show that the enhanced DSR performs better in terms of packet delivery but worse in terms of delay and path length compared to the original DSR protocol.
PERFORMANCE ANALYSIS AND COMPARISON OF IMPROVED DSR WITH DSR, AODV AND DSDV R...ijp2p
Mobile Ad-hoc networks are categorized by multi-hop wireless connectivity and numbers of nodes are
connecting each other through wireless network. It includes several routing protocols specifically designed
for ad-hoc routing. The most widely used ad hoc routing protocols are Ad-hoc On Demand Distance Vector
(AODV), Destination Sequence Distance Vector (DSDV), and Dynamic Source Routing (DSR). In this
paper, we present an analysis of DSR protocol and propose our algorithm to improve the performance of
DSR protocol by using small delay applied on last route ACK path when an original route fails in Mobile
Ad Hoc networks. Past researchers the MANET have focused on simulation study by varying network
parameters, such as network size, number of nodes. The simulation results shows that the M-DSR protocol
having some excellent performance Metrics then other protocols. We have taken different performance
parameters over the comparison of Modified -DSR with other three protocols in mobility as well as Nonmobility scenario up to 300 nodes in MANETs using NS2 simulator. To achieve this goal DSR is modified
by using modified algorithm technique in order to load balancing, to avoid congestion and lower packet
delivery.
ENHANCING STUDENTS’ LEARNING AND SATISFACTION THROUGH THE USE OF SOCIAL MEDIAIJITE
Communication in and out the classroom is an essential component for education. As the technology
emerges, there is a need to adopt to the new technologies to enhance students’ learning experience. Social
media technologies provide informal communication methods that promote student engagement and
satisfaction by removing communication barriers. In this paper, we report our experience in using different
social media technologies to enhance students’ learning experience and satisfaction with the course. We
perform our experiment in software project management course and conduct a survey to assess the
students’ perspective towards using these different social media technologies in enhancing their learning
and satisfaction. Results show that students are satisfied and feel that their learning experience has
improved when using social media for class communication.
PERFORMANCE ANALYSIS AND COMPARISON OF IMPROVED DSR WITH DSR, AODV AND DSDV R...ijp2p
Mobile Ad-hoc networks are categorized by multi-hop wireless connectivity and numbers of nodes are
connecting each other through wireless network. It includes several routing protocols specifically designed
for ad-hoc routing. The most widely used ad hoc routing protocols are Ad-hoc On Demand Distance Vector
(AODV), Destination Sequence Distance Vector (DSDV), and Dynamic Source Routing (DSR). In this
paper, we present an analysis of DSR protocol and propose our algorithm to improve the performance of
DSR protocol by using small delay applied on last route ACK path when an original route fails in Mobile
Ad Hoc networks. Past researchers the MANET have focused on simulation study by varying network
parameters, such as network size, number of nodes. The simulation results shows that the M-DSR protocol
having some excellent performance Metrics then other protocols. We have taken different performance
parameters over the comparison of Modified -DSR with other three protocols in mobility as well as Nonmobility scenario up to 300 nodes in MANETs using NS2 simulator. To achieve this goal DSR is modified
by using modified algorithm technique in order to load balancing, to avoid congestion and lower packet
delivery.
Application of N jobs M machine Job Sequencing Technique for MPLS Traffic Eng...CSCJournals
This paper discusses Traffic Engineering with Multi-Protocol Label Switching (MPLS) in an Internet Service Provider’s (ISP) network. In this paper, we first briefly describe MPLS, Constraint-based Routing, MPLS-TE, N jobs M machine Job sequencing technique and how to implement the job sequencing technique for Multi-Protocol Label Switching Traffic Engineering. And also improve the quality of service of the network, using this technique firstly reduce the congestion for traffic engineering; minimize the packet loss in complex MPLS domain. In small network packet loss is negligible. We used NS2 discrete event simulator for simulate the above work. Keywords: Traffic Engineering, Multi-Protocol Label Switching, Constraint based routing, N jobs M machine Job Sequencing Technique, Qos, MPLS-TE.
This document compares the SPEED and MMSPEED routing protocols for wireless sensor networks. It begins with background on wireless sensor networks and quality of service (QoS) routing. It then describes the SPEED protocol, including its design goals of supporting soft real-time communication with a guaranteed delivery speed. The SPEED architecture uses geographic routing and congestion control techniques. Next, it covers the MMSPEED protocol, which extends SPEED to provide multiple delivery speeds and probabilistic multipath forwarding for improved reliability and timeliness guarantees. The architectures of both protocols are explained in detail through phases of node selection, path discovery/selection, and data transmission. In summary, the document evaluates and compares SPEED and MMSPE
Similar to DIFFERENTIATED SERVICES ENSURING QOS ON INTERNET (20)
CHINA’S GEO-ECONOMIC OUTREACH IN CENTRAL ASIAN COUNTRIES AND FUTURE PROSPECTjpsjournal1
The rivalry between prominent international actors for dominance over Central Asia's hydrocarbon
reserves and the ancient silk trade route, along with China's diplomatic endeavours in the area, has been
referred to as the "New Great Game." This research centres on the power struggle, considering
geopolitical, geostrategic, and geoeconomic variables. Topics including trade, political hegemony, oil
politics, and conventional and nontraditional security are all explored and explained by the researcher.
Using Mackinder's Heartland, Spykman Rimland, and Hegemonic Stability theories, examines China's role
in Central Asia. This study adheres to the empirical epistemological method and has taken care of
objectivity. This study analyze primary and secondary research documents critically to elaborate role of
china’s geo economic outreach in central Asian countries and its future prospect. China is thriving in trade,
pipeline politics, and winning states, according to this study, thanks to important instruments like the
Shanghai Cooperation Organisation and the Belt and Road Economic Initiative. According to this study,
China is seeing significant success in commerce, pipeline politics, and gaining influence on other
governments. This success may be attributed to the effective utilisation of key tools such as the Shanghai
Cooperation Organisation and the Belt and Road Economic Initiative.
Understanding Inductive Bias in Machine LearningSUTEJAS
This presentation explores the concept of inductive bias in machine learning. It explains how algorithms come with built-in assumptions and preferences that guide the learning process. You'll learn about the different types of inductive bias and how they can impact the performance and generalizability of machine learning models.
The presentation also covers the positive and negative aspects of inductive bias, along with strategies for mitigating potential drawbacks. We'll explore examples of how bias manifests in algorithms like neural networks and decision trees.
By understanding inductive bias, you can gain valuable insights into how machine learning models work and make informed decisions when building and deploying them.
Embedded machine learning-based road conditions and driving behavior monitoringIJECEIAES
Car accident rates have increased in recent years, resulting in losses in human lives, properties, and other financial costs. An embedded machine learning-based system is developed to address this critical issue. The system can monitor road conditions, detect driving patterns, and identify aggressive driving behaviors. The system is based on neural networks trained on a comprehensive dataset of driving events, driving styles, and road conditions. The system effectively detects potential risks and helps mitigate the frequency and impact of accidents. The primary goal is to ensure the safety of drivers and vehicles. Collecting data involved gathering information on three key road events: normal street and normal drive, speed bumps, circular yellow speed bumps, and three aggressive driving actions: sudden start, sudden stop, and sudden entry. The gathered data is processed and analyzed using a machine learning system designed for limited power and memory devices. The developed system resulted in 91.9% accuracy, 93.6% precision, and 92% recall. The achieved inference time on an Arduino Nano 33 BLE Sense with a 32-bit CPU running at 64 MHz is 34 ms and requires 2.6 kB peak RAM and 139.9 kB program flash memory, making it suitable for resource-constrained embedded systems.
A SYSTEMATIC RISK ASSESSMENT APPROACH FOR SECURING THE SMART IRRIGATION SYSTEMSIJNSA Journal
The smart irrigation system represents an innovative approach to optimize water usage in agricultural and landscaping practices. The integration of cutting-edge technologies, including sensors, actuators, and data analysis, empowers this system to provide accurate monitoring and control of irrigation processes by leveraging real-time environmental conditions. The main objective of a smart irrigation system is to optimize water efficiency, minimize expenses, and foster the adoption of sustainable water management methods. This paper conducts a systematic risk assessment by exploring the key components/assets and their functionalities in the smart irrigation system. The crucial role of sensors in gathering data on soil moisture, weather patterns, and plant well-being is emphasized in this system. These sensors enable intelligent decision-making in irrigation scheduling and water distribution, leading to enhanced water efficiency and sustainable water management practices. Actuators enable automated control of irrigation devices, ensuring precise and targeted water delivery to plants. Additionally, the paper addresses the potential threat and vulnerabilities associated with smart irrigation systems. It discusses limitations of the system, such as power constraints and computational capabilities, and calculates the potential security risks. The paper suggests possible risk treatment methods for effective secure system operation. In conclusion, the paper emphasizes the significant benefits of implementing smart irrigation systems, including improved water conservation, increased crop yield, and reduced environmental impact. Additionally, based on the security analysis conducted, the paper recommends the implementation of countermeasures and security approaches to address vulnerabilities and ensure the integrity and reliability of the system. By incorporating these measures, smart irrigation technology can revolutionize water management practices in agriculture, promoting sustainability, resource efficiency, and safeguarding against potential security threats.
KuberTENes Birthday Bash Guadalajara - K8sGPT first impressionsVictor Morales
K8sGPT is a tool that analyzes and diagnoses Kubernetes clusters. This presentation was used to share the requirements and dependencies to deploy K8sGPT in a local environment.
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.
Introduction- e - waste – definition - sources of e-waste– hazardous substances in e-waste - effects of e-waste on environment and human health- need for e-waste management– e-waste handling rules - waste minimization techniques for managing e-waste – recycling of e-waste - disposal treatment methods of e- waste – mechanism of extraction of precious metal from leaching solution-global Scenario of E-waste – E-waste in India- case studies.
ACEP Magazine edition 4th launched on 05.06.2024Rahul
This document provides information about the third edition of the magazine "Sthapatya" published by the Association of Civil Engineers (Practicing) Aurangabad. It includes messages from current and past presidents of ACEP, memories and photos from past ACEP events, information on life time achievement awards given by ACEP, and a technical article on concrete maintenance, repairs and strengthening. The document highlights activities of ACEP and provides a technical educational article for members.
International Conference on NLP, Artificial Intelligence, Machine Learning an...gerogepatton
International Conference on NLP, Artificial Intelligence, Machine Learning and Applications (NLAIM 2024) offers a premier global platform for exchanging insights and findings in the theory, methodology, and applications of NLP, Artificial Intelligence, Machine Learning, and their applications. The conference seeks substantial contributions across all key domains of NLP, Artificial Intelligence, Machine Learning, and their practical applications, aiming to foster both theoretical advancements and real-world implementations. With a focus on facilitating collaboration between researchers and practitioners from academia and industry, the conference serves as a nexus for sharing the latest developments in the field.
TIME DIVISION MULTIPLEXING TECHNIQUE FOR COMMUNICATION SYSTEMHODECEDSIET
Time Division Multiplexing (TDM) is a method of transmitting multiple signals over a single communication channel by dividing the signal into many segments, each having a very short duration of time. These time slots are then allocated to different data streams, allowing multiple signals to share the same transmission medium efficiently. TDM is widely used in telecommunications and data communication systems.
### How TDM Works
1. **Time Slots Allocation**: The core principle of TDM is to assign distinct time slots to each signal. During each time slot, the respective signal is transmitted, and then the process repeats cyclically. For example, if there are four signals to be transmitted, the TDM cycle will divide time into four slots, each assigned to one signal.
2. **Synchronization**: Synchronization is crucial in TDM systems to ensure that the signals are correctly aligned with their respective time slots. Both the transmitter and receiver must be synchronized to avoid any overlap or loss of data. This synchronization is typically maintained by a clock signal that ensures time slots are accurately aligned.
3. **Frame Structure**: TDM data is organized into frames, where each frame consists of a set of time slots. Each frame is repeated at regular intervals, ensuring continuous transmission of data streams. The frame structure helps in managing the data streams and maintaining the synchronization between the transmitter and receiver.
4. **Multiplexer and Demultiplexer**: At the transmitting end, a multiplexer combines multiple input signals into a single composite signal by assigning each signal to a specific time slot. At the receiving end, a demultiplexer separates the composite signal back into individual signals based on their respective time slots.
### Types of TDM
1. **Synchronous TDM**: In synchronous TDM, time slots are pre-assigned to each signal, regardless of whether the signal has data to transmit or not. This can lead to inefficiencies if some time slots remain empty due to the absence of data.
2. **Asynchronous TDM (or Statistical TDM)**: Asynchronous TDM addresses the inefficiencies of synchronous TDM by allocating time slots dynamically based on the presence of data. Time slots are assigned only when there is data to transmit, which optimizes the use of the communication channel.
### Applications of TDM
- **Telecommunications**: TDM is extensively used in telecommunication systems, such as in T1 and E1 lines, where multiple telephone calls are transmitted over a single line by assigning each call to a specific time slot.
- **Digital Audio and Video Broadcasting**: TDM is used in broadcasting systems to transmit multiple audio or video streams over a single channel, ensuring efficient use of bandwidth.
- **Computer Networks**: TDM is used in network protocols and systems to manage the transmission of data from multiple sources over a single network medium.
### Advantages of TDM
- **Efficient Use of Bandwidth**: TDM all
A review on techniques and modelling methodologies used for checking electrom...nooriasukmaningtyas
The proper function of the integrated circuit (IC) in an inhibiting electromagnetic environment has always been a serious concern throughout the decades of revolution in the world of electronics, from disjunct devices to today’s integrated circuit technology, where billions of transistors are combined on a single chip. The automotive industry and smart vehicles in particular, are confronting design issues such as being prone to electromagnetic interference (EMI). Electronic control devices calculate incorrect outputs because of EMI and sensors give misleading values which can prove fatal in case of automotives. In this paper, the authors have non exhaustively tried to review research work concerned with the investigation of EMI in ICs and prediction of this EMI using various modelling methodologies and measurement setups.
Using recycled concrete aggregates (RCA) for pavements is crucial to achieving sustainability. Implementing RCA for new pavement can minimize carbon footprint, conserve natural resources, reduce harmful emissions, and lower life cycle costs. Compared to natural aggregate (NA), RCA pavement has fewer comprehensive studies and sustainability assessments.
Recycled Concrete Aggregate in Construction Part III
DIFFERENTIATED SERVICES ENSURING QOS ON INTERNET
1. International Journal of Computer Science, Engineering and Information Technology (IJCSEIT), Vol.2, No.5, October 2012
DOI : 10.5121/ijcseit.2012.2504 37
DIFFERENTIATED SERVICES ENSURING QOS ON
INTERNET
Pawansupreet Kaur1
, Monika Sachdeva2
and Gurjeet Kaur3
1
Department of Computer Engineering, SBS State Technical Campus, Ferozpur, Punjab
Meens399@gmail.com
2
Department of CSE, Associate Proff at SBS State Technical Campus, Ferozpur, Punjab
Monika.sal@rediffmail.com
3
Department of Computer Engineering, SBS State Technical Campus, Ferozpur, Punjab
Gurjeetrandhawa4@gmail.com
ABSTRACT
Differentiated Services is the most advanced method for traffic management which provides QoS. QoS is
essential for today’s internet. QoS represents set of techniques necessary to manage throughput, packet
loss and delay. Traffic Conditioners or Policers are the most important components of differentiated
services. In this research, different Traffic Conditioners or Policers are compared on the basis of QoS
parameters (Performance metrics) which are throughput, packet loss and delay to provide QoS on internet.
Traffic classification and traffic conditioning are important functions of differentiated services also known
as admission control which are governed by service level agreement (SLA). Traffic classification and traffic
conditioning is done by traffic conditioners at edge routers. Goal of this research is to choose the best
Traffic Conditioner to apply from source to destination pair because only one traffic conditioner can be
applied from source to destination so that QoS can be guaranteed.
KEYWORDS
Differentiated Services, Performance Metrics, QoS, Traffic Conditioners or Policers
1. INTRODUCTION
The Internet was designed as a best effort network for transporting computer-to-computer traffic.
However, as the footprint of the Internet grew, a wide variety of applications emerged. The
growth in the diversity and volume of Internet applications made it essential to discover and
implement new techniques that support different levels of service for different classes of traffic.
These techniques are collectively referred to as Quality of Services (QOS) techniques.
Differentiated Services [1] was introduced in the late 1990s in response to the need for a simple,
yet effective QOS mechanism suitable for implementation on the Internet. Differentiated services
has been proposed as an efficient and scalable traffic management mechanism way to ensure
internet QOS. QoS is the classification of packets for the purpose of treating certain classes or
flows of packets in a particular way as compared to the other packets. Various solutions have
been proposed to guarantee QoS. In 1997 IETF proposed an architecture that is Differentiated
Services architecture. The Differentiated Services (Diff Ser) network architecture attempts to
provide these QoS guarantees in the most scalable and least complex manner. The Diff Ser
approach is based on a set of simple mechanisms that treat packets differently according to the
marking of the DS field in the IP header [2]. In differentiated services, complexity is pushed at
edge routers with core remains with simple functionality. Packets are marked with different
2. International Journal of Computer Science, Engineering and Information Technology (IJCSEIT), Vol.2, No.5, October 2012
38
Traffic Conditioners or Policers at edge routers to receive particular behaviour. My research work
focus on these traffic conditioners. Five different traffic conditioners are selected for the
comparison. These Traffic Conditioners or Policers are compared on the basis of different
Performance metrics. Differentiated Services are implemented with NS2 Simulator. One of the
Differentiated Services packet forwarding treatments [3], Assured Forwarding PHB [4] is
implemented in this research work. The Differentiated Services Assured Forwarding (AF) Per-
Hop Behaviour Group defines a differentiated forwarding of packets in four independent classes,
having three levels of drop precedence.
2. TRAFFIC CONDITIONERS AND PERFORMANCE METRICS
A traffic conditioner may contain meters, markers, shapers and droppers for traffic conditioning
functions. The conditioner may re-mark a traffic stream or may discard or shape packet to alter
the temporal characteristics of the stream and bring it into compliance with a traffic profile
specified by the network administrator.
2.1. Traffic Conditioners
Traffic Conditioners are most important components of differentiated services. Packets are
marked with different Traffic Conditioners or Policers at edge routers to receive particular
behaviour which are (1) TSW2CM (2) TSW3CM (3) Token Bucket (4) srTCM (5) trTCM
2.1.1. TSW2CM (Time Sliding Window Two Colour Marker)
TSW2CM uses a CIR and two drop precedence. The lower one is used probabilistically when
CIR is exceeded.
2.1.2. TSW3CM (Time Sliding Window Three Colour Marker)
TSW3CM [5] uses a CIR, and PIR and three drop precedence. When the measured traffic is
below the CIR, packets are marked with low drop precedence. If the measured traffic exceeds its
CIR, packets are marked with medium drop precedence. If the traffic exceeds its PIR, packets are
marked with highest drop precedence.
2.1.3. Token Bucket
Token Bucket [6] uses a CIR and CBS, and two drop precedence. The token bucket marker
(TBM) meters a traffic stream based on two parameters: CIR (committed information rate) and
CBS (committed burst size). The meter is specified in terms of a token bucket with size CBS and
token generation rate CIR. Tokens are generated at a rate equal to the CIR and are added to the
token bucket provided it is not full.
2.1.4. srTCM (Single Rate Three Colour Marker)
srTCM [7] uses a CIR, CBS and EBS to choose from three drop precedence.
2.1.5. trTCM (Two Rate Three Colour Marker)
trTCM [8] uses a CIR, CBS, EBS, and PBS to choose from three drop precedence.
3. International Journal of Computer Science, Engineering and Information Technology (IJCSEIT), Vol.2, No.5, October 2012
39
2.2. Performance Metrics
2.2.1. Throughput
Throughput is a generic term used to describe the capacity of the system to transfer data.
Throughput is nothing but the bandwidth of the transmission channel. Throughput is the rate at
which network sends or receives data. Throughput is calculated using packets received divided by
packets forwarded.
Throughput = Packets received / Packets forwarded
2.2.2. End To End Delay
Delay is the amount of time that it takes for a packet to be transmitted from one point in network
to another point in a network. It refers to the time taken for a packet to be transmitted across a
network from source to destination.
2.2.3. Packet Loss
Packet loss is where network traffic fails to reach its destination in a timely manner.
Packet Lost = amount of packets received - amount of packets forwarded
3. SIMULATION ENVIRONMENT
In this research paper, we are comparing different traffic conditioners for the TCP type traffic.
Differentiated Services are implemented in NS2 Simulator. Different traffic conditioners are
configured with same configuration parameters for better analysis. First, we have created a
topology. Then traffic pattern has been defined for that topology. Second Traffic Conditioners are
configured on ingress edge routers. Packet scheduling mechanism FIFO is implemented at egress
edge routers. RED with IN/OUT (RIO), a differentiated dropping algorithm is used in interior
routers. Our simulation is done with TCP type traffic for 20 source nodes which are generating
traffic at same rate. Each source node is connected to a corresponding edge node where traffic is
marked according to the parameters that will be specified. The edge routers are connected to a
bottleneck core router and then through another edge router, to a destination node. Links between
the edge nodes and corresponding source nodes have delays of 10 µsec and 6Mbps bandwidth.
Links between the edge nodes and corresponding destination nodes have delays of 10 µsec and
10Mbps bandwidth. Links between the core node and edge nodes that are attached to the sources
have delays of 0.1 msec and 6Mbps bandwidth. Links between the core node and edge node that
are attached to the destination has delays of 1 msec and 10Mbps bandwidth. Queues can be built
at the bottleneck router, i.e. at the link between the core node and the edge node that connects to
the destination. We choose its size to be of 100 packets. . In the bottleneck queue at the core node,
a multi-RED queue management is used with a RIO-D version. Figures1 represents the network
topology which is used for simulating differentiated services. There are 20 source nodes which
are generating traffic at the same rate.
4. International Journal of Computer Science, Engineering and Information Technology (IJCSEIT), Vol.2, No.5, October 2012
40
Fig 1: Network topology
4. SIMULATION RESULTS
In this section, we present the simulation results with different traffic conditioners that we have
described in the previous section. The simulation is done with discrete event simulation namely
ns2 version 2.34. Models in ns are created by defining nodes and connecting them with links to
form some network topology
4.1. Throughput
Fig 2: Throughput
Simulation time (sec)
Throughputofgenerating
packets
5. International Journal of Computer Science, Engineering and Information Technology (IJCSEIT), Vol.2, No.5, October 2012
41
The minimum assured throughput is given according to the negotiated profile with the client.
TSW2CM, Token Bucket and srTCM bears almost same variation. In case of TSW3CM
throughput is high at start, then it becomes constant. In case of trTCM, throughput is high at start
and after that it starts decreasing because throughput increases as long as there are available
resources and decreases when congestion occurs. Secondly source is generating traffic at more
rate than committed rate. So more packets were marked as out-of-profile i.e when congestion
occurs these can be dropped. In case of srTCM, throughput bears different variations, at some
point it is high and then suddenly decreases and then again starts increasing and at the end
throughput is high because in this case we have more options to mark the packets so We can
assign different drop precedences to different packets. srTCM gives high throughput.
4.2. Packet Loss
Packet Statistics are shown in the tables.
Table 1. TSW2CM
CP TotPkts TxPkts Ldrops edrops
All 60593 58892 140 1561
10 14633 14633 0 0
11 45960 44259 140 1561
Table 2. TSW3CM
CP TotPkts TxPkts Ldrops Edrops
All 60449 58904 125 1420
10 14751 14751 0 0
11 39573 44259 125 1420
12 6125 6125 0 0
Table 3. Token Bucket
CP TotPkts TxPkts Ldrops edrops
All 60433 58653 136 1644
10 14630 14630 0 0
11 45803 44023 136 1644
Table 4. srTCM
CP TotPkts TxPkts Ldrops edrops
All 59603 58734 153 716
10 4027 4014 13 0
11 31471 30683 72 716
12 24105 24037 68 0
6. International Journal of Computer Science, Engineering and Information Technology (IJCSEIT), Vol.2, No.5, October 2012
42
Table 5. trTCM
CP TotPkts TxPkts Ldrops edrops
All 60495 58521 181 1793
10 5332 5332 0 0
11 55163 53189 181 1793
CP stands for code point, TotPkts are amount of total forwarded packets and TxPkts are amount
of total received packets. Ldrops are link drops and edrops are those drops which are due to early
detection. Packet loss is calculated using formula (Packet Loss = amount of packets received –
amount of packets forwarded). In TSW2CM, total Packet Loss is 1701. Link drops are 140 and
edge drops i.e. drop because of early detection are 1561. Edrops are more than ldrops because
more traffic handling is done at edge routers and if packets exceed than its SLA or TCA then they
are dropped at edge routers. Packets marked with code point 10 were marked with low drop
precedence so packet loss is less than packets marked with code point 11 which is marked as high
drop precedence. It means packets marked with high drop precedence are discarded first than
packets marked with low drop precedence in case of congestion. In case of TSW3CM, total
packet loss is 1439. In case of Token Bucket, total packet loss is 1780. In case of srTCM, total
packet loss is 869.. In case of trTCM, total packet loss is 1780. srTCM drops much less packets as
compared to other policers.
Fig 3: Packet Loss
4.3 End To End Delay
Delay is the amount of time that it takes for a packet to be transmitted from one point in network
to another point in a network. End to End delay for different policers is shown in table. For real
time application or critical applications end to end delay should be less. Lesser the end to end
delay, more will the Quality.
NumberofPacketslost
Simulation time
7. International Journal of Computer Science, Engineering and Information Technology (IJCSEIT), Vol.2, No.5, October 2012
43
Figure 4. End to End delay
End to End delay for all Traffic Conditioners is shown in the graph corresponding to the
simulation time. End to End delay bears large variation in the graph, somewhere it is more and
somewhere it is less. End to end delay for TSW2CM is initially 0.05 then it drops to 0.01 and
then again more and at the end to end delay is 0.046. In case of TSW3CM, end to end delay
initially is 0.043 and at the end it is 0.00608. End to End delay for TSW3CM is much less as
commpared to TSW2CM. That means among TSW group, TSW3CM is better than TSW2CM
when comapred according to end to end delay metric.In case of Token Bucket, end to end delay
initially is 0.038, and at the end it is 0.041. In cae of srTCM, end to end delay initially is 0.0395,
and at the end it is 0.0403. In case of trTCM, Initially end to end delay is 0.0123 and at the end it
is 0.05. Among Token Bucket group srTCM has less end to end delay as compared to Token
Bucket and trTCM. And among TSW3CM and srTCM , srTCM provides less end to end delay.
4.4. Combination and Overall Performance
Table 6. Overall Performance
Traffic Conditioners Packet Loss End to End delay Throughput
TSW2CM 1701 0.00811 0.971
TSW3CM 1439 0.00810 0.976
Token Bicket 1780 0.00848 0.970
srTCM 869 0.00114 0.98
trTCM 1974 0.0123 0.96
EndtoEndDelay
Simulation time
8. International Journal of Computer Science, Engineering and Information Technology (IJCSEIT), Vol.2, No.5, October 2012
44
5. CONCLUSIONS
All traffic conditioners are different from each other through target rate or configuration
parameters by which traffic can be marked differently. When performance was measured in terms
of target rate parameters, there was no convincing evidence to suggest that the choice of traffic
conditioner affects a source’s achieved rate. Therefore, if a network designer is only interested in
the relative target rate performance of the traffic conditioners, then he is free to choose any one of
the traffic conditioners. When Traffic Conditioners are compared based on throughput then all
Conditioners gives almost equal throughput because all the conditioners are configured with same
parameters as we are implementing Assured Services, Assured Services are guaranteed to provide
minimum throughput in case of congestion also. srTCM gives high throughput as compared to
others. When Traffic Conditioners are compared according to packet loss, then among TSW
group, TSW3CM drops fewer packets and if compared among Token bucket group then srTCM
drops fewer packets. When Traffic Conditioners are compared based on End- to-End Delay then
token bucket based srTCM experiences less delay and TSW3CM among TSW group bears less
delay. TSW3CM and srTCM gives better performance then other policers. If to choose among
TSW3CM and srTCM then srTCM gives better performance and provide QoS requirements i.e.
Less delay, less packet loss and more throughputs. srTCM is best to choose.
REFERENCES
[1] Blake, S. Black, D. Carlson, M. Davies, E. Wang, Z. and Weiss, WS. (2008) “An architecture for
Differentiated Services”, RFC 2475.
[2] Nichols, K. (1998) “Definition of Differentiated Services Field (DS Field) in the IPv4 and IPv6
Headers”, RFC 2474.
[3] Brim, S. Carpenter, B. and Faucheur, F.le ( 2000) “Per Hop Behavior Codes”, RFC 2836 .
[4] Heinanen, J. Baker, F. Weis, and W. Wroclawski, J. (1999) “Assured forwarding PHB Group”.
[5] Fang, W. Seddigh, N. and Nandy, B. (2000) “Time Sliding Window Three Color Marker
(TSW3CM)”, RFC 2859.
[6] Heinanen, J. and Guerin, R. (2000) “A Single Rate Three Color Marker”, RFC 2697.
[7] Stallings, W. (1999) “High Speed Networks: TCP/IP and ATM Design Principles”, Prentice Hall
Englewood cliffs, NZ.
Authors
Pawansupreet Kaur was born in Ferozepur, Punjab, on July 23, 1989. Pawansupreet
Kaur received her Bachelor of Technology and Engineering Degree from Adesh Institute
of Engineering and Technology, Punjab, India. Currently she is doing Masters in
Computer Science and Engineering from Shaheed Bhagat Singh State Technical Campus,
Ferozepur, Punjab, India. Her Research Interest are in the areas of Networking and
Mobile Telecommunication. Miss Pawansupreet Kaur is member of UACEE.
Monika Sachdeva has done Btech in computer Science Engineering from National
Institute of Technology (NIT), Jalandhar in 1997. She has done her MS software
systems from BITS pilani in 2002. She has done her Phd in Computer Science and
Engineering from Guru Nanak Dev University, Amritsar, Punjab, India in 2012.
Gurjeet Kaur was born in Pehowa, Haryana, on December 1, 1986.Gurjeet Kaur
received her Bachelor of Technology degree in Computer Science and Engineering from
Adesh Institute Of Engineering & Technology, Punjab,India. Currently she is doing
Master’s in Computer Science & Engineering from Shaheed Bhagat Singh State
Technical campus, Ferozepur, Punjab, India. Her research interests are in the area of
Telecommunication Networks (GSM Security), Location Based Services. Miss Gurjeet
Kaur is member of UACEE and SDIWC.