In the last few years, video streaming facilities over TCP or UDP, such as YouTube, Facetime, Daily-motion, Mobile video calling have become more and more popular. The important
challenge in streaming broadcasting over the Internet is to spread the uppermost potential quality,
observe to the broadcasting play out time limitation, and efficiently and equally share the offered
bandwidth with TCP or UDP, and additional traffic types. This work familiarizes the Streaming
Media Data Congestion Control protocol (SMDCC), a new adaptive broadcasting streaming
congestion management protocol in which the connection’s data packets transmission frequency is
adjusted allowing to the dynamic bandwidth share of connection using SMDCC, the bandwidth share
of a connection is projected using algorithms similar to those introduced in TCP Westwood. SMDCC
avoids the Slow Jump phase in TCP. As a result, SMDCC does not show the pronounced rate
alternations distinguishing of modern TCP, so providing congestion control that is more appropriate
for streaming broadcasting applications. Besides, SMDCC is fair, sharing the bandwidth equitably
among a set of SMDCC connections. Main benefit is robustness when packet harms are due to
indiscriminate errors, which is typical of wireless links and is becoming an increasing concern due to
the emergence of wireless Internet access. In the presence of indiscriminate errors, SMDCC is also
approachable to TCP Tahoe and Reno (TTR). We provide simulation results using the ns3 simulator
for our protocol running together with TCP Tahoe and Reno.
This document discusses different types of routing protocols for mobile ad hoc networks. It begins by classifying routing protocols into four categories: proactive (table-driven), reactive (on-demand), hybrid, and geographic location-assisted. It then provides more details on proactive protocols like DSDV, and reactive protocols like DSR and AODV. For DSDV, it describes how routing tables are regularly exchanged and updated when link breaks occur. For DSR and AODV, it explains how routes are discovered on-demand via route requests and replies. Key differences between DSR and AODV are also summarized.
Static routing tables require manual configuration and cannot automatically update when network changes occur. Dynamic routing tables use protocols like RIP, OSPF, or BGP to periodically update routing tables across routers when links or routers fail. Routing tables contain information like the network address, next hop address, interface, and flags to determine the best path for packet delivery.
This document provides an overview of different routing protocols. It discusses IP routing, static routing, and dynamic routing. It also covers proactive routing protocols like DSDV which maintain routing tables and periodically update them. Reactive protocols like DSR and AODV establish routes on demand. Hybrid protocols combine proactive and reactive approaches. The document describes the key processes, advantages, and disadvantages of DSDV, DSR, AODV, and zone routing protocol.
Mobile Ad-hoc Network (MANET) Routing Algorithms─ Part 2Sushant Kushwaha
The document discusses several routing algorithms for mobile ad-hoc networks: TORA is a reactive protocol that reacts to changes and link reversals in highly dynamic networks; CGSR is a hierarchical and proactive protocol where routing tables are pre-built so paths are immediately available; flat routing table based protocols pre-build routing tables showing all paths while optimized link state protocols only update required routing data to reduce overhead.
The document compares the AODV and OLSR routing protocols for mobile ad hoc networks. AODV is a reactive protocol that establishes routes on demand, while OLSR is a proactive protocol that maintains routes to all nodes. OLSR generally has lower latency than AODV but higher overhead. Both protocols elect multipoint relays to reduce flooding. AODV uses less bandwidth but requires route discovery, while OLSR maintains all routes continuously.
The document summarizes several routing protocols used in wireless networks. It discusses both table-driven protocols like DSDV and on-demand protocols like AODV. It provides details on how each protocol performs routing and maintains routes. It also outlines some advantages and disadvantages of protocols like DSDV, AODV, DSR, and TORA.
This document discusses different types of routing protocols for mobile ad hoc networks. It begins by classifying routing protocols into four categories: proactive (table-driven), reactive (on-demand), hybrid, and geographic location-assisted. It then provides more details on proactive protocols like DSDV, and reactive protocols like DSR and AODV. For DSDV, it describes how routing tables are regularly exchanged and updated when link breaks occur. For DSR and AODV, it explains how routes are discovered on-demand via route requests and replies. Key differences between DSR and AODV are also summarized.
Static routing tables require manual configuration and cannot automatically update when network changes occur. Dynamic routing tables use protocols like RIP, OSPF, or BGP to periodically update routing tables across routers when links or routers fail. Routing tables contain information like the network address, next hop address, interface, and flags to determine the best path for packet delivery.
This document provides an overview of different routing protocols. It discusses IP routing, static routing, and dynamic routing. It also covers proactive routing protocols like DSDV which maintain routing tables and periodically update them. Reactive protocols like DSR and AODV establish routes on demand. Hybrid protocols combine proactive and reactive approaches. The document describes the key processes, advantages, and disadvantages of DSDV, DSR, AODV, and zone routing protocol.
Mobile Ad-hoc Network (MANET) Routing Algorithms─ Part 2Sushant Kushwaha
The document discusses several routing algorithms for mobile ad-hoc networks: TORA is a reactive protocol that reacts to changes and link reversals in highly dynamic networks; CGSR is a hierarchical and proactive protocol where routing tables are pre-built so paths are immediately available; flat routing table based protocols pre-build routing tables showing all paths while optimized link state protocols only update required routing data to reduce overhead.
The document compares the AODV and OLSR routing protocols for mobile ad hoc networks. AODV is a reactive protocol that establishes routes on demand, while OLSR is a proactive protocol that maintains routes to all nodes. OLSR generally has lower latency than AODV but higher overhead. Both protocols elect multipoint relays to reduce flooding. AODV uses less bandwidth but requires route discovery, while OLSR maintains all routes continuously.
The document summarizes several routing protocols used in wireless networks. It discusses both table-driven protocols like DSDV and on-demand protocols like AODV. It provides details on how each protocol performs routing and maintains routes. It also outlines some advantages and disadvantages of protocols like DSDV, AODV, DSR, and TORA.
This thesis presents a simulation based analysis of these protocols. We used the combination of EIGRP&IS-IS, RIP&IS-IS routing protocols on the Hybrid network in order to reveal the advantage of one over the other as well as the robustness of each protocol combination and how this is measured.
This document provides an overview of routing concepts and protocols. It discusses the basic components of routing including algorithms, databases, and protocols. It describes different routing algorithm types such as static, distance vector, and link state. Specific routing protocols covered include RIP, OSPF, and BGP. It also discusses routing within autonomous systems and between autonomous systems on the internet.
Mobile Ad-hoc Network (MANET) Routing Algorithms─ Part 1Sushant Kushwaha
DSR deploys source routing, reacting dynamically to changes by maintaining only active routing addresses from source to destination. AODV is also a reactive protocol that maintains only active routes, with each node keeping a next-hop routing table. Route entries expire after a time limit. AODV adopts destination sequence numbers to ensure loop-free and up-to-date routes.
Performance Analysis and Simulation of OLSR Routing Protocol in MANET ijcnac
Mobile ad hoc network is a collection of wireless nodes that are communicate other
nodes (router) without using access point, infrastructure . Mobile ad-hoc network is an
autonomous system that means no need for depaentd other nodes it have own capability
to handle and controlling all funcitionlity, to sending and receiving all information form
one device to other device. MANET has power full feature that controlling itself by
dynamic nature, multihop,low power and configuration of the system. In this paper we
analyzing, simulation and implements the TC messages and HELLO Message by MPR of
OLSR routing performance checked at 200 nodes on Qualnet 5.0.2 simulator. In Qualnet
simulator to simulate and implement the performance of OLSR routing protocols takes
various performance metrics like hello message sent (HMS) , hello message received
(HMR), TC message generated (TCMG), TC message replied (TCMR), TC messages
received on Constant Bit Rate (CBR) using random waypoint model. In this paper check
the performance OLSR routing protocol gives effective performance for lage networks.
The document discusses on-demand driven reactive routing protocols. It provides an overview of table-driven vs on-demand routing protocols and describes two popular on-demand protocols - Dynamic Source Routing (DSR) and Ad Hoc On-Demand Distance Vector Routing (AODV) in detail. DSR uses source routing by adding the complete route to packet headers. AODV maintains routing tables at nodes and relies on dynamically establishing next hop information for routes.
This document discusses various MAC protocols for ad hoc wireless networks. It begins by outlining key issues in designing MAC protocols for these networks, such as bandwidth efficiency, quality of service support, and the hidden and exposed terminal problems. It then covers classifications of MAC protocols including contention-based, contention-based with reservation mechanisms, and contention-based with scheduling mechanisms. Specific protocols are discussed within each category.
Routing is the operation of transferring information transversely through an internetwork from a source to a destination. Alongside the approach, as a minimum one middle node normally is found. Routing is frequently compared with bridging, Copy the link given below and paste it in new browser window to get more information on Network Routing:- http://www.transtutors.com/homework-help/computer-science/network-routing.aspx
The document discusses routing and routing protocols. It defines routing as the process routers use to forward packets toward their destination network based on the destination IP address. It describes static routing, where network administrators manually configure routes, as well as dynamic routing protocols, where routers automatically share information to build and update routing tables. It outlines common routing protocols including RIP, IGRP, EIGRP, OSPF, and BGP and their key characteristics such as the metrics and timers they use.
This document discusses routing protocols for mobile ad-hoc networks (MANETs). It introduces several routing protocols including proactive (table-driven) protocols like Destination-Sequenced Distance Vector (DSDV), reactive (on-demand) protocols like Ad-hoc On-Demand Distance Vector (AODV) and Dynamic Source Routing (DSR), and hybrid protocols like Zone Routing Protocol (ZRP) that use both proactive and reactive approaches. For each protocol, it provides a brief overview of the routing approach and algorithm. It also compares the characteristics of proactive, reactive and hybrid routing protocols.
Simulation & comparison of aodv & dsr protocolPrafull Johri
This document summarizes and compares two reactive routing protocols - AODV and DSR. It discusses how NS2 was extended to simulate wireless networks and the two protocols. AODV uses route discovery to find paths, maintains route tables, and can locally repair broken links. DSR also uses route discovery but source routes are carried in packet headers. While AODV has lower initial packet loss, DSR performance improves over time, so either protocol can be used for longer simulations.
This document provides an overview of high speed networks including Frame Relay networks, Asynchronous Transfer Mode (ATM), ATM protocol architecture, logical connections, cells, service categories, and high speed LANs. It discusses the architecture, user data transfer, and call control of Frame Relay networks. For ATM, it describes the protocol model, logical connections, cells, adaptation layer, and service categories. It also provides an introduction to emerging high speed LAN technologies.
The document discusses several routing protocols for mobile ad hoc networks:
- DSR allows nodes to cache and share routing information for more efficient routing but has larger packet headers due to source routing. AODV uses only next hop information, keeping routing tables smaller.
- Both protocols use route discovery and maintenance, but AODV proactively refreshes routes while DSR reacts to failures. AODV also uses sequence numbers to prevent loops and choose fresher routes.
- Overall, DSR is better for networks where routes change infrequently while AODV scales better and maintains only active routes, at the cost of higher routing overhead during route discovery. Security remains a challenge for both protocols.
Dynamic routing is necessary for large networks to automatically update routing tables when network changes occur. However, dynamic routing introduces security problems that need to be addressed. The document discusses static and dynamic routing, routing tables, common routing algorithms, and the need for a new secure routing algorithm that can adapt to topology changes while protecting sensitive network information from hackers.
The network layer provides the means to transfer variable length data sequences between sources and destinations across one or more networks. It performs functions like network routing, fragmentation and reassembly of data, and reporting delivery errors. Routers operate at this layer to send data throughout an extended network. A key protocol at this layer is the Internet Protocol (IP), which manages the connectionless transfer of data between end systems and routers. It is also responsible for detecting and discarding errored packets. Management protocols at this layer include routing protocols, multicast group management, and network address assignment.
This document discusses various MAC protocols for ad hoc wireless networks. It begins by outlining the key issues in designing such protocols, including bandwidth efficiency, quality of service support, and addressing hidden and exposed terminal problems. It then classifies MAC protocols into contention-based, contention-based with reservation, and contention-based with scheduling categories. Several examples of protocols are described for each category. The document provides an overview of the operation and key aspects of many MAC protocols proposed for ad hoc wireless networks.
The document discusses different routing methods used in computer networks, including:
- Network-specific routing which treats all hosts on the same network as a single entity in the routing table.
- Host-specific routing which explicitly defines routes to individual host addresses in the routing table.
- Default routing which uses a single default route for all unknown destinations.
It also covers routing protocols like RIP and OSPF, explaining how they establish and maintain routing tables dynamically as the network changes. Distance vector protocols like RIP propagate full routing tables between routers, while link-state protocols like OSPF flood link state information to build independent views of the network topology.
he Optimized Link State Routing Protocol (OLSR)[1] is an IP routing protocol optimized for mobile ad hoc networks, which can also be used on other wireless ad hoc networks. OLSR is a proactive link-state routing protocol, which uses hello and topology control (TC) messages to discover and then disseminate link state information throughout the mobile ad hoc network. Individual nodes use this topology information to compute next hop destinations for all nodes in the network using shortest hop forwarding paths.
Distance vector and link state routing protocolCCNAStudyGuide
Distance vector routing protocols exchange routing updates periodically regardless of topology changes, which can increase convergence time and the risk of routing loops. Link state routing protocols send triggered updates only when there is a topology change, minimizing convergence time and eliminating routing loops. Distance vector protocols rely solely on information from directly connected neighbors to calculate routes, while link state protocols use a system of databases and can detect media types, increasing overhead compared to distance vector protocols. Examples of the protocols are RIP and IGRP for distance vector, and OSPF for link state.
The document summarizes routing tables and routing algorithms. It discusses how routing tables are structured with an array of buckets containing linked lists of route records. It describes the data fields within each route record and how routing lookups and maintenance are performed using procedures like netnum, netmatch, netmask, rthash, and rtget.
WIRELESS NETWORKS _ BABU M_ unit 3 ,4 & 5 PPT
EC 6802 WIRELESS NETWORKS PPT
POWER POINT PRESENTAION ON WIRELESS NETWORKS
BABU M
ASST PROFESSOR/ ELECTRONICS AND COMMUNICATION ENGINEERING,
RMK COLLEGE OF ENGINEERING AND TECHNOLOGY
CHENNAI, THIRUVALLUR DISTRICT
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
This thesis presents a simulation based analysis of these protocols. We used the combination of EIGRP&IS-IS, RIP&IS-IS routing protocols on the Hybrid network in order to reveal the advantage of one over the other as well as the robustness of each protocol combination and how this is measured.
This document provides an overview of routing concepts and protocols. It discusses the basic components of routing including algorithms, databases, and protocols. It describes different routing algorithm types such as static, distance vector, and link state. Specific routing protocols covered include RIP, OSPF, and BGP. It also discusses routing within autonomous systems and between autonomous systems on the internet.
Mobile Ad-hoc Network (MANET) Routing Algorithms─ Part 1Sushant Kushwaha
DSR deploys source routing, reacting dynamically to changes by maintaining only active routing addresses from source to destination. AODV is also a reactive protocol that maintains only active routes, with each node keeping a next-hop routing table. Route entries expire after a time limit. AODV adopts destination sequence numbers to ensure loop-free and up-to-date routes.
Performance Analysis and Simulation of OLSR Routing Protocol in MANET ijcnac
Mobile ad hoc network is a collection of wireless nodes that are communicate other
nodes (router) without using access point, infrastructure . Mobile ad-hoc network is an
autonomous system that means no need for depaentd other nodes it have own capability
to handle and controlling all funcitionlity, to sending and receiving all information form
one device to other device. MANET has power full feature that controlling itself by
dynamic nature, multihop,low power and configuration of the system. In this paper we
analyzing, simulation and implements the TC messages and HELLO Message by MPR of
OLSR routing performance checked at 200 nodes on Qualnet 5.0.2 simulator. In Qualnet
simulator to simulate and implement the performance of OLSR routing protocols takes
various performance metrics like hello message sent (HMS) , hello message received
(HMR), TC message generated (TCMG), TC message replied (TCMR), TC messages
received on Constant Bit Rate (CBR) using random waypoint model. In this paper check
the performance OLSR routing protocol gives effective performance for lage networks.
The document discusses on-demand driven reactive routing protocols. It provides an overview of table-driven vs on-demand routing protocols and describes two popular on-demand protocols - Dynamic Source Routing (DSR) and Ad Hoc On-Demand Distance Vector Routing (AODV) in detail. DSR uses source routing by adding the complete route to packet headers. AODV maintains routing tables at nodes and relies on dynamically establishing next hop information for routes.
This document discusses various MAC protocols for ad hoc wireless networks. It begins by outlining key issues in designing MAC protocols for these networks, such as bandwidth efficiency, quality of service support, and the hidden and exposed terminal problems. It then covers classifications of MAC protocols including contention-based, contention-based with reservation mechanisms, and contention-based with scheduling mechanisms. Specific protocols are discussed within each category.
Routing is the operation of transferring information transversely through an internetwork from a source to a destination. Alongside the approach, as a minimum one middle node normally is found. Routing is frequently compared with bridging, Copy the link given below and paste it in new browser window to get more information on Network Routing:- http://www.transtutors.com/homework-help/computer-science/network-routing.aspx
The document discusses routing and routing protocols. It defines routing as the process routers use to forward packets toward their destination network based on the destination IP address. It describes static routing, where network administrators manually configure routes, as well as dynamic routing protocols, where routers automatically share information to build and update routing tables. It outlines common routing protocols including RIP, IGRP, EIGRP, OSPF, and BGP and their key characteristics such as the metrics and timers they use.
This document discusses routing protocols for mobile ad-hoc networks (MANETs). It introduces several routing protocols including proactive (table-driven) protocols like Destination-Sequenced Distance Vector (DSDV), reactive (on-demand) protocols like Ad-hoc On-Demand Distance Vector (AODV) and Dynamic Source Routing (DSR), and hybrid protocols like Zone Routing Protocol (ZRP) that use both proactive and reactive approaches. For each protocol, it provides a brief overview of the routing approach and algorithm. It also compares the characteristics of proactive, reactive and hybrid routing protocols.
Simulation & comparison of aodv & dsr protocolPrafull Johri
This document summarizes and compares two reactive routing protocols - AODV and DSR. It discusses how NS2 was extended to simulate wireless networks and the two protocols. AODV uses route discovery to find paths, maintains route tables, and can locally repair broken links. DSR also uses route discovery but source routes are carried in packet headers. While AODV has lower initial packet loss, DSR performance improves over time, so either protocol can be used for longer simulations.
This document provides an overview of high speed networks including Frame Relay networks, Asynchronous Transfer Mode (ATM), ATM protocol architecture, logical connections, cells, service categories, and high speed LANs. It discusses the architecture, user data transfer, and call control of Frame Relay networks. For ATM, it describes the protocol model, logical connections, cells, adaptation layer, and service categories. It also provides an introduction to emerging high speed LAN technologies.
The document discusses several routing protocols for mobile ad hoc networks:
- DSR allows nodes to cache and share routing information for more efficient routing but has larger packet headers due to source routing. AODV uses only next hop information, keeping routing tables smaller.
- Both protocols use route discovery and maintenance, but AODV proactively refreshes routes while DSR reacts to failures. AODV also uses sequence numbers to prevent loops and choose fresher routes.
- Overall, DSR is better for networks where routes change infrequently while AODV scales better and maintains only active routes, at the cost of higher routing overhead during route discovery. Security remains a challenge for both protocols.
Dynamic routing is necessary for large networks to automatically update routing tables when network changes occur. However, dynamic routing introduces security problems that need to be addressed. The document discusses static and dynamic routing, routing tables, common routing algorithms, and the need for a new secure routing algorithm that can adapt to topology changes while protecting sensitive network information from hackers.
The network layer provides the means to transfer variable length data sequences between sources and destinations across one or more networks. It performs functions like network routing, fragmentation and reassembly of data, and reporting delivery errors. Routers operate at this layer to send data throughout an extended network. A key protocol at this layer is the Internet Protocol (IP), which manages the connectionless transfer of data between end systems and routers. It is also responsible for detecting and discarding errored packets. Management protocols at this layer include routing protocols, multicast group management, and network address assignment.
This document discusses various MAC protocols for ad hoc wireless networks. It begins by outlining the key issues in designing such protocols, including bandwidth efficiency, quality of service support, and addressing hidden and exposed terminal problems. It then classifies MAC protocols into contention-based, contention-based with reservation, and contention-based with scheduling categories. Several examples of protocols are described for each category. The document provides an overview of the operation and key aspects of many MAC protocols proposed for ad hoc wireless networks.
The document discusses different routing methods used in computer networks, including:
- Network-specific routing which treats all hosts on the same network as a single entity in the routing table.
- Host-specific routing which explicitly defines routes to individual host addresses in the routing table.
- Default routing which uses a single default route for all unknown destinations.
It also covers routing protocols like RIP and OSPF, explaining how they establish and maintain routing tables dynamically as the network changes. Distance vector protocols like RIP propagate full routing tables between routers, while link-state protocols like OSPF flood link state information to build independent views of the network topology.
he Optimized Link State Routing Protocol (OLSR)[1] is an IP routing protocol optimized for mobile ad hoc networks, which can also be used on other wireless ad hoc networks. OLSR is a proactive link-state routing protocol, which uses hello and topology control (TC) messages to discover and then disseminate link state information throughout the mobile ad hoc network. Individual nodes use this topology information to compute next hop destinations for all nodes in the network using shortest hop forwarding paths.
Distance vector and link state routing protocolCCNAStudyGuide
Distance vector routing protocols exchange routing updates periodically regardless of topology changes, which can increase convergence time and the risk of routing loops. Link state routing protocols send triggered updates only when there is a topology change, minimizing convergence time and eliminating routing loops. Distance vector protocols rely solely on information from directly connected neighbors to calculate routes, while link state protocols use a system of databases and can detect media types, increasing overhead compared to distance vector protocols. Examples of the protocols are RIP and IGRP for distance vector, and OSPF for link state.
The document summarizes routing tables and routing algorithms. It discusses how routing tables are structured with an array of buckets containing linked lists of route records. It describes the data fields within each route record and how routing lookups and maintenance are performed using procedures like netnum, netmatch, netmask, rthash, and rtget.
WIRELESS NETWORKS _ BABU M_ unit 3 ,4 & 5 PPT
EC 6802 WIRELESS NETWORKS PPT
POWER POINT PRESENTAION ON WIRELESS NETWORKS
BABU M
ASST PROFESSOR/ ELECTRONICS AND COMMUNICATION ENGINEERING,
RMK COLLEGE OF ENGINEERING AND TECHNOLOGY
CHENNAI, THIRUVALLUR DISTRICT
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Iaetsd an effective approach to eliminate tcp incastIaetsd Iaetsd
This document proposes an Incast Congestion Control for TCP (ICTCP) scheme to eliminate TCP incast collapse in datacenter environments. TCP incast collapse occurs when multiple synchronized servers send data to the same receiver in parallel, overwhelming the switch buffer and causing packet loss. ICTCP is a receiver-side approach that proactively adjusts the TCP receive window size of connections to control their aggregate burstiness and prevent switch buffer overflow before packet loss occurs. It estimates available bandwidth and uses this as a quota to coordinate receive window increases. For each connection, the receive window is adjusted based on the ratio of the difference between measured and expected throughput. This allows adaptive tuning of receive windows to meet sender throughput needs while avoiding congest
Study on Performance of Simulation Analysis on Multimedia NetworkIRJET Journal
This document summarizes a study that simulated voice communication over wired networks using the NS-2 network simulator. The study modeled VoIP traffic between nodes using the SCTP protocol and added background traffic to evaluate its effects. Key findings from the simulation included:
1) Average latency was 0.98 seconds and 98 packets were dropped, indicating degraded performance when background traffic was added.
2) Average jitter (packet delay variation) was calculated to be 0.006 seconds, showing instability in the network with changing traffic patterns.
3) A graph of latency over time demonstrated increased delays and bottlenecks as background traffic overloaded network links.
This document summarizes a review paper on congestion control approaches for real-time streaming applications on the Internet. It discusses how TCP is not well-suited for real-time streaming due to its reliance on packet loss and variable bitrates. The paper reviews different end-to-end and active queue management approaches for congestion control that aim to reduce latency and jitter. It covers issues with single and shared bottlenecks on the Internet that can lead to congestion and the need for new transport protocols and congestion control for real-time media streaming.
Proposition of an Adaptive Retransmission Timeout for TCP in 802.11 Wireless ...IJERA Editor
The Transport Control Protocol (TCP) is used to establish and control a session between two endpoints. The problem is that in 802.11 wireless environments TCP always considers that the packet loss is caused by network congestion. However, in these networks packet loss are usually caused by the high bit error rate, and the wireless link failures. Researchers found out that TCP performance in wireless networks can be highly enhanced as long as it is feasible to identify the packet loss causes; hence appropriate measures can be dynamically applied during an established TCP session in order to adjust the session parameters. This paper proposes an endto-end adaptive mechanism that allows the TCP session to dynamically adjust the RTO (Retransmission Timeout) of a TCP session; the server will have to adjust the timers based on feedbacks from clients. Feedbacks are piggybacked in the TCP Options header field of the ACK (Acknowledgment) messages. A feedback is an approximation of the time needed by the wireless channel to get the errors fixed. The mechanism has been validated using numerical analysis and simulations, and then compared to the original TCP protocol. Simulation results have shown better performance in terms of number of retransmissions at the server side due to the decrease in the number of timeouts; and thus lowest congestion on the wireless access point.
Comparative Analysis of Different TCP Variants in Mobile Ad-Hoc Network partha pratim deb
The document analyzes the performance of different TCP variants (New Reno, Reno, Tahoe) with MANET routing protocols (AODV, DSR, TORA) through simulation. It finds that in scenarios with 3 and 5 nodes, AODV has better throughput than DSR and TORA for all TCP variants. Throughput decreases for all variants as node count increases. New Reno provides multiple packet loss recovery and is the best choice for AODV in MANETs due to its consistent performance with changes in node count. Further analysis of additional protocols and TCP variants is recommended.
Recital Study of Various Congestion Control Protocols in wireless networkiosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
This document discusses and compares several congestion control protocols for wireless networks, including TCP, RCP, and RCP+. It implemented an enhanced version of RCP+ in the NS-2 simulator. Simulation results showed that the proposed approach achieved higher throughput and packet delivery ratio than TCP and RCP+ in a wireless network with 10-50 nodes, with performance degrading as the number of nodes increased beyond 20 due to increased congestion. The paper analyzes the mechanisms and equations of each protocol and argues the proposed approach combines benefits of improved AIMD and RCP+ to address their individual shortcomings.
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.
Sky X products provide performance enhancement for data transmissions over satellite networks by replacing TCP with a custom protocol called Sky X that is optimized for satellite conditions like long latency and high bit error rates. The Sky X Gateway intercepts TCP connections and converts the data to the Sky X protocol for transmission over the satellite. This solution increases web and file transfer speeds by 3 to 100 times compared to TCP over satellite. The Sky X products transparently replace TCP and do not require any client or server modifications.
IRJET- Simulation Analysis of a New Startup Algorithm for TCP New RenoIRJET Journal
This document presents a simulation analysis of a new startup algorithm for TCP New Reno to improve responsiveness for short-lived applications. The proposed TCP SYN Loss (TSL) startup algorithm uses a less conservative congestion response than standard TCP when connection setup packets are lost. Simulations are conducted using the ns-2 network simulator to evaluate the performance of TSL variants under different levels of congestion. The main results show that TSL variants can achieve an average latency gain of 15 round-trip times compared to standard TCP at up to 90% link utilization with a packet loss rate of 1%.
IMPACT OF CONTENTION WINDOW ON CONGESTION CONTROL ALGORITHMS FOR WIRELESS ADH...cscpconf
TCP congestion control mechanism is highly dependent on MAC layer Backoff algorithms that
predict the optimal Contention Window size to increase the TCP performance in wireless adhoc
network. This paper critically examines the impact of Contention Window in TCP congestion
control approaches. The modified TCP congestion control method gives the stability of
congestion window which provides higher throughput and shorter delay than the traditional TCP. Various Backoff algorithms that are used to adjust Contention Window are simulatedusing NS2 along with modified TCP and their performance are analyzed to depict the influence of Contention Window in TCP performance considering the metrics such as throughput, delay, packet loss and end-to-end delay
VEGAS: Better Performance than other TCP Congestion Control Algorithms on MANETsCSCJournals
The document analyzes the performance of six TCP congestion control algorithms (BIC, Cubic, Compound, Vegas, Reno, and Westwood) on mobile ad hoc networks (MANETs) using network simulator 2 (NS2). Simulation results show that the Vegas algorithm provided better and more stable throughput than the other algorithms over the entire simulation time, both with and without node mobility. While BIC achieved the highest throughput after 75 seconds, Vegas was the only algorithm that maintained almost constant throughput from the start to end of the 200 second simulations. Therefore, the document concludes that Vegas is the most suitable algorithm for MANET scenarios.
Performance Evaluation of TCP with Adaptive Pacing and LRED in Multihop Wirel...ijwmn
Transmission Control Protocol (TCP) was designed to provide reliable end-to-end delivery of
data over unreliable networks. In practice, most TCP deployments have been carefully designed in the
context of wired networks. Ignoring the properties of wireless and Ad-hoc Networks can lead to TCP
implementations with poor performance. In a wireless network, however packet losses occur more often
due to unreliable wireless links than due to congestion. When using TCP over wireless links, each packet
loss on the wireless link results in congestion control measures being invoked at the source. This causes
severe performance degradation. If there is any packet loss in wireless networks, then the reason for that
has to be found out. If there is congestion, then only congestion control mechanism has to be applied.
This work shows the performance of TCP with Adaptive Pacing (TCP-AP) and Link Random Early
Discard (LRED) as queuing model in multihop transmission when the source and destination nodes are
in mobile nature. The adaptive pacing technique seeks to improve spatial reuse. The LRED technique
seeks to react earlier to link overload. This paper consists of simulated environment results under
different network scenarios. This work proves that the combination of TCP-AP and LRED give much
better result than as the individual technique. Simulations are done with the use of NS-2.
This document summarizes a survey and analysis of various host-to-host congestion control proposals for TCP data transmission. It discusses the basic principles that underlie current host-to-host algorithms, including probing available network resources, estimating congestion through packet loss or delay, and quickly detecting packet losses. The document then analyzes specific algorithms like slow start, congestion avoidance, and fast recovery. It also examines calculating retransmission timeout and round-trip time, congestion avoidance and packet recovery techniques, and data transmission in TCP. The overall goal of these proposals is to control congestion in a distributed manner without relying on explicit network notifications.
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.
Performing Network Simulators of TCP with E2E Network Model over UMTS NetworksAM Publications,India
Wireless links losses result in poor TCP throughput since losses are perceived as congestion by TCP with the evolution of 3G technologies like Universal Mobile Telecommunication System (UMTS), the usage of TCP has become more popular for a reliable end-to-end (e2e) data delivery. However, TCP was initially designed for wired networks and therefore it suffers performance degradation due to the radio signal getting affected by fading, shadowing and interference. There are many strategies proposed by the research community on how to improve the performance of TCP over wireless links such as introducing link-layer retransmission, explicitly notifying the sender of network conditions or using new variants of TCP. As UMTS network coverage and availability are currently experiencing rapid growth, optimization of various internal components of its wireless network is very important. One of the optimization is the introduction of High Speed Downlink Packet Access (HSDPA). This architecture not only allows higher data rates but also more reliable data transfer by the introduction of Hybrid ARQ (HARQ). With this enhancement to the UMTS network, it becomes vital to see the performance of TCP in such a network. Therefore in this thesis, we try to evaluate two aspects of UMTS networks: first, the impact of HSDPA parameters like scheduling algorithm and RLC/MAC-hs buffer size on overall performance of TCP and second, to study the behaviour of two categories of TCP rate and flow control: loss based and delay based. Our simulation shows that delay based TCP tends to perform better than loss based TCP in our selected scenarios. The simulations are performed using the network simulator NS-2 with an e2e network model for enhanced UMTS (EURANE).
This document summarizes a research paper that proposes a new algorithm for calculating TCP timeout over wireless ad hoc networks. The current TCP timeout calculation does not adapt well to the unstable nature of wireless networks where factors like node mobility can cause estimated round trip times to vary greatly. The proposed algorithm aims to make timeout calculation more adaptive to network conditions in wireless ad hoc networks to improve TCP performance and quality of service for real-time multimedia applications. It describes challenges with existing TCP timeout approaches over wireless networks and reviews related literature before introducing the novel algorithm developed and tested through simulation.
Transmission Control Protocol (TCP) is a fundamental protocol of the Internet Protocol Suite. TCP complements the Internet Protocol (IP), therefore it is common to refer to the internet protocol suit as TCP/IP. TCP is used for error detection, detection of packet loss or out of order delivery of data. TCP requests retransmission, rearranges data and helps with network congestion.
Several congestion control algorithms have been developed, over the last years, to improve TCP's performance over various technologies and network conditions.
The purpose of this assignment is to present TCP, network congestion, congestion algorithms and simulate different algorithms in different network conditions to measure their performance. For this assignment's needs, OPNET IT Guru Academic Edition software was used to accomplish the reproduction of projects that have been already published and gave the wanted results.
Similar to MANET, Unicast Routing Protocol, Multicast Routing Protocol. (20)
A NEW DATA ENCODER AND DECODER SCHEME FOR NETWORK ON CHIPEditor IJMTER
System-on-chip (soc) based system has so many disadvantages in power-dissipation as
well as clock rate while the data transfer from one system to another system in on-chip. At the same
time, a higher operated system does not support the lower operated bus network for data transfer.
However an alternative scheme is proposed for high speed data transfer. But this scheme is limited to
SOCs. Unlike soc, network-on-chip (NOC) has so many advantages for data transfer. It has a special
feature to transfer the data in on-chip named as transitional encoder. Its operation is based on input
transitions. At the same time it supports systems which are higher operated frequencies. In this
project, a low-power encoding scheme is proposed. The proposed system yields lower dynamic
power dissipation due to the reduction of switching activity and coupling switching activity when
compared to existing system. Even-though many factors which is based on power dissipation, the
dynamic power dissipation is only considerable for reasonable advantage. The proposed system is
synthesized using quartus II 9.1 software. Besides, the proposed system will be extended up to
interlink PE communication with help of routers and PE’s which are performed by various
operations. To implement this system in real NOC’s contains the proposed encoders and decoders for
data transfer with regular traffic scenarios should be considered.
A RESEARCH - DEVELOP AN EFFICIENT ALGORITHM TO RECOGNIZE, SEPARATE AND COUNT ...Editor IJMTER
Coins are important part of our life. We use coins in a places like stores, banks, buses, trains
etc. So it becomes a basic need that coins can be sorted, counted automatically. For this, there is
necessary that the coins can be recognized automatically. Automated Coin Recognition System for the
Indian Coins of Rs. 1, 2, 5 and 10 with the rotation invariance. We have taken images from the both
sides of coin. So this system is capable to recognizing coins from both sides. Features are taken from the
images using techniques as a Hough Transformation, Pattern Averaging etc.
Analysis of VoIP Traffic in WiMAX EnvironmentEditor IJMTER
This document reviews several studies that analyzed the performance of VoIP traffic over WiMAX networks using different VoIP codecs and WiMAX service classes. It summarizes the findings of various papers on how QoS parameters like throughput, delay, jitter compared for codecs like G.711, G.723, G.729 when using the UGS, rtPS, nrtPS and BE service classes. Most studies found that UGS generally performed best for VoIP due to its ability to guarantee bandwidth and minimize jitter and delay, while G.711 typically provided the best voice quality. The document aims to compare the results across different service classes and codecs.
A Hybrid Cloud Approach for Secure Authorized De-DuplicationEditor IJMTER
The cloud backup is used for the personal storage of the people in terms of reducing the
mainlining process and managing the structure and storage space managing process. The challenging
process is the deduplication process in both the local and global backup de-duplications. In the prior
work they only provide the local storage de-duplication or vice versa global storage de-duplication in
terms of improving the storage capacity and the processing time. In this paper, the proposed system
is called as the ALG- Dedupe. It means the Application aware Local-Global Source De-duplication
proposed system to provide the efficient de-duplication process. It can provide the efficient deduplication process with the low system load, shortened backup window, and increased power
efficiency in the user’s personal storage. In the proposed system the large data is partitioned into
smaller part which is called as chunks of data. Here the data may contain the redundancy it will be
avoided before storing into the storage area.
Aging protocols that could incapacitate the InternetEditor IJMTER
The biggest threat to the Internet is the fact that it was never really designed. For e.g., the
BGP protocol is used by Internet routers to exchange information about changes to the Internet's
network topologies. However, it also is among the most fundamentally broken; as Internet routing
information can be poisoned with bogus routing information. Instead, it evolved in fits and start,
thanks to various protocols that have been cobbled together to fulfill the needs of the moment. Few
of protocols from them were designed with security in mind. or if they were sported no more than
was needed to keep out a nosy neighbor, not a malicious attacker. The result is a welter of aging
protocols susceptible to exploit on an Internet scale. Here are six Internet protocols that could stand
to be replaced sooner rather than later or are (mercifully) on the way out.
A Cloud Computing design with Wireless Sensor Networks For Agricultural Appli...Editor IJMTER
1. The document proposes a design for using wireless sensor networks and cloud computing together for agricultural applications. It describes how sensor nodes can collect environmental data and send it to the cloud for storage, analysis and decision making.
2. The proposed system has three main components - a sensing cluster with various sensors to collect data, a cloud service cluster to process and analyze the data, and a mechanism cluster with actuator nodes that can take actions based on the cloud's decisions.
3. Some potential applications discussed are image processing of unhealthy plants, predicting crop diseases based on sensor readings, and automatically controlling the cultivation environment through actuators. The system is aimed to help farmers optimize resources and increase productivity.
A CAR POOLING MODEL WITH CMGV AND CMGNV STOCHASTIC VEHICLE TRAVEL TIMESEditor IJMTER
Carpooling (also car-sharing, ride-sharing, lift-sharing), is the sharing of car journeys so
that more than one person travels in a car. It helps to resolve a variety of problems that continue to
plague urban areas, ranging from energy demands and traffic congestion to environmental pollution.
Most of the existing method used stochastic disturbances arising from variations in vehicle travel
times for carpooling. However it doesn’t deal with the unmet demand with uncertain demand of the
vehicle for car pooling. To deal with this the proposed system uses Chance constrained
formulation/Programming (CCP) approach of the problem with stochastic demand and travel time
parameters, under mild assumptions on the distribution of stochastic parameters; and relates it with a
robust optimization approach. Since real problem sizes can be large, it could be difficult to find
optimal solutions within a reasonable period of time. Therefore solution algorithm using tabu
heuristic solution approach is developed to solve the model. Therefore, we constructed a stochastic
carpooling model that considers the in- fluence of stochastic travel times. The model is formulated as
an integer multiple commodity network flow problem. Since real problem sizes can be large, it could
be difficult to find optimal solutions within a reasonable period of time.
Sustainable Construction With Foam Concrete As A Green Green Building MaterialEditor IJMTER
This document discusses the use of foam concrete as a sustainable building material. Foam concrete is produced using cement, fine sand, water, and aluminium powder, which reacts to produce hydrogen gas bubbles that lighten the concrete. It has benefits like lower carbon dioxide emissions in production than traditional concrete, good thermal and sound insulation, fire resistance, and cost-effectiveness. The document reports on tests showing that foam concrete made with quarry dust has higher compressive strength than that made with sand. Strength generally decreases as aluminium powder content increases. Foam concrete is proposed as a sustainable alternative building material.
USE OF ICT IN EDUCATION ONLINE COMPUTER BASED TESTEditor IJMTER
A good education system is required for overall prosperity of a nation. A tremendous
growth in the education sector had made the administration of education institutions complex. Any
researches reveal that the integration of ICT helps to reduce the complexity and enhance the overall
administration of education. This study has been undertaken to identify the various functional areas
to which ICT is deployed for information administration in education institutions and to find the
current extent of usage of ICT in all these functional areas pertaining to information administration.
The various factors that contribute to these functional areas were identified. A theoretical model was
derived and validated.
Textual Data Partitioning with Relationship and Discriminative AnalysisEditor IJMTER
Data partitioning methods are used to partition the data values with similarity. Similarity
measures are used to estimate transaction relationships. Hierarchical clustering model produces tree
structured results. Partitioned clustering produces results in grid format. Text documents are
unstructured data values with high dimensional attributes. Document clustering group ups unlabeled text
documents into meaningful clusters. Traditional clustering methods require cluster count (K) for the
document grouping process. Clustering accuracy degrades drastically with reference to the unsuitable
cluster count.
Textual data elements are divided into two types’ discriminative words and nondiscriminative
words. Only discriminative words are useful for grouping documents. The involvement of
nondiscriminative words confuses the clustering process and leads to poor clustering solution in return.
A variation inference algorithm is used to infer the document collection structure and partition of
document words at the same time. Dirichlet Process Mixture (DPM) model is used to partition
documents. DPM clustering model uses both the data likelihood and the clustering property of the
Dirichlet Process (DP). Dirichlet Process Mixture Model for Feature Partition (DPMFP) is used to
discover the latent cluster structure based on the DPM model. DPMFP clustering is performed without
requiring the number of clusters as input.
Document labels are used to estimate the discriminative word identification process. Concept
relationships are analyzed with Ontology support. Semantic weight model is used for the document
similarity analysis. The system improves the scalability with the support of labels and concept relations
for dimensionality reduction process.
Testing of Matrices Multiplication Methods on Different ProcessorsEditor IJMTER
There are many algorithms we found for matrices multiplication. Until now it has been
found that complexity of matrix multiplication is O(n3). Though Further research found that this
complexity can be decreased. This paper focus on the algorithm and its complexity of matrices
multiplication methods.
Malware is a worldwide pandemic. It is designed to damage computer systems without
the knowledge of the owner using the system. Software‟s from reputable vendors also contain
malicious code that affects the system or leaks information‟s to remote servers. Malware‟s includes
computer viruses, spyware, dishonest ad-ware, rootkits, Trojans, dialers etc. Malware detectors are
the primary tools in defense against malware. The quality of such a detector is determined by the
techniques it uses. It is therefore imperative that we study malware detection techniques and
understand their strengths and limitations. This survey examines different types of Malware and
malware detection methods.
SURVEY OF TRUST BASED BLUETOOTH AUTHENTICATION FOR MOBILE DEVICEEditor IJMTER
Practical requirements for securely demonstrating identities between two handheld
devices are an important concern. The adversary can inject a Man-In- The-Middle (MITM) attack to
intrude the protocol. Protocols that employ secret keys require the devices to share private
information in advance, in which it is not feasible in the above scenario. Apart from insecurely
typing passwords into handheld devices or comparing long hexadecimal keys displayed on the
devices’ screen, many other human-verifiable protocols have been proposed in the literature to solve
the problem. Unfortunately, most of these schemes are unsalable to more users. Even when there are
only three entities attempt to agree a session key, these protocols need to be rerun for three times.
So, in the existing method a bipartite and a tripartite authentication protocol is presented using a
temporary confidential channel. Besides, further extend the system into a transitive authentication
protocol that allows multiple handheld devices to establish a conference key securely and efficiently.
But this method detects only the outsider attacks. Method does not consider the insider attacks. So,
in the proposed method trust score based method is introduced which computes the trust values for
the nodes and provide the security. The trust score is computed has a positive influence on the
confidence with which an entity conducts transactions with that node. Network the behavior of the
node will be monitored periodically and its trust value is also updated .So depending on the behavior
of the node in the network trust relation will be established between two nodes.
GLAUCOMA is a chronic eye disease that can damage optic nerve. According to WHO It
is the second leading cause of blindness, and is predicted to affect around 80 million people by 2020.
Development of the disease leads to loss of vision, which occurs increasingly over a long period of
time. As the symptoms only occur when the disease is quite advanced so that glaucoma is called the
silent thief of sight. Glaucoma cannot be cured, but its development can be slowed down by
treatment. Therefore, detecting glaucoma in time is critical. However, many glaucoma patients are
unaware of the disease until it has reached its advanced stage. In this paper, some manual and
automatic methods are discussed to detect glaucoma. Manual analysis of the eye is time consuming
and the accuracy of the parameter measurements also varies with different clinicians. To overcome
these problems with manual analysis, the objective of this survey is to introduce a method to
automatically analyze the ultrasound images of the eye. Automatic analysis of this disease is much
more effective than manual analysis.
Survey: Multipath routing for Wireless Sensor NetworkEditor IJMTER
Reliability is playing very vital role in some application of Wireless Sensor Networks
and multipath routing is one of the ways to increase the probability of reliability. More over energy
consumption is constraint. In this paper, we provide a survey of the state-of-the-art of proposed
multipath routing algorithm for Wireless Sensor Networks. We study the design, analyze the tradeoff
of each design, and overview several presenting algorithms.
Step up DC-DC Impedance source network based PMDC Motor DriveEditor IJMTER
This paper is devoted to the Quasi Z source network based DC Drive. The cascaded
(two-stage) Quasi Z Source network could be derived by the adding of one diode, one inductor,
and two capacitors to the traditional quasi-Z-source inverter The proposed cascaded qZSI inherits all
the advantages of the traditional solution (voltage boost and buck functions in a single stage,
continuous input current, and improved reliability). Moreover, as compared to the conventional qZSI,
the proposed solution reduces the shoot-through duty cycle by over 30% at the same voltage boost
factor. Theoretical analysis of the two-stage qZSI in the shoot-through and non-shoot-through
operating modes is described. The proposed and traditional qZSI-networks are compared. A
prototype of a Quasi Z Source network based DC Drive was built to verify the theoretical
assumptions. The experimental results are presented and analyzed.
SPIRITUAL PERSPECTIVE OF AUROBINDO GHOSH’S PHILOSOPHY IN TODAY’S EDUCATIONEditor IJMTER
The paper reflects the spiritual philosophy of Aurobindo Ghosh which is helpful in today’s
education. In 19th century he wrote about spirituality, in accordance with that it is a core and vital part
of today’s education. It is very much essential for today’s kid. Here I propose the overview of that
philosophy.At the utmost regeneration of those values in today’s generation is the great deal with
education system. To develop the values and spiritual education in the youngers is the great moto of
mine. It is the materialistic world and without value redefinition among them is the harder task but not
difficult.
Software Quality Analysis Using Mutation Testing SchemeEditor IJMTER
The software test coverage is used measure the safety measures. The safety critical analysis is
carried out for the source code designed in Java language. Testing provides a primary means for
assuring software in safety-critical systems. To demonstrate, particularly to a certification authority, that
sufficient testing has been performed, it is necessary to achieve the test coverage levels recommended or
mandated by safety standards and industry guidelines. Mutation testing provides an alternative or
complementary method of measuring test sufficiency, but has not been widely adopted in the safetycritical industry. The system provides an empirical evaluation of the application of mutation testing to
airborne software systems which have already satisfied the coverage requirements for certification.
The system mutation testing to safety-critical software developed using high-integrity subsets of
C and Ada, identify the most effective mutant types and analyze the root causes of failures in test cases.
Mutation testing could be effective where traditional structural coverage analysis and manual peer
review have failed. They also show that several testing issues have origins beyond the test activity and
this suggests improvements to the requirements definition and coding process. The system also
examines the relationship between program characteristics and mutation survival and considers how
program size can provide a means for targeting test areas most likely to have dormant faults. Industry
feedback is also provided, particularly on how mutation testing can be integrated into a typical
verification life cycle of airborne software. The system also covers the safety and criticality levels of
Java source code.
Software Defect Prediction Using Local and Global AnalysisEditor IJMTER
The software defect factors are used to measure the quality of the software. The software
effort estimation is used to measure the effort required for the software development process. The defect
factor makes an impact on the software development effort. Software development and cost factors are
also decided with reference to the defect and effort factors. The software defects are predicted with
reference to the module information. Module link information are used in the effort estimation process.
Data mining techniques are used in the software analysis process. Clustering techniques are used
in the property grouping process. Rule mining methods are used to learn rules from clustered data
values. The “WHERE” clustering scheme and “WHICH” rule mining scheme are used in the defect
prediction and effort estimation process. The system uses the module information for the defect
prediction and effort estimation process.
The proposed system is designed to improve the defect prediction and effort estimation process.
The Single Objective Genetic Algorithm (SOGA) is used in the clustering process. The rule learning
operations are carried out sing the Apriori algorithm. The system improves the cluster accuracy levels.
The defect prediction and effort estimation accuracy is also improved by the system. The system is
developed using the Java language and Oracle relation database environment.
Software Cost Estimation Using Clustering and Ranking SchemeEditor IJMTER
Software cost estimation is an important task in the software design and development process.
Planning and budgeting tasks are carried out with reference to the software cost values. A variety of
software properties are used in the cost estimation process. Hardware, products, technology and
methodology factors are used in the cost estimation process. The software cost estimation quality is
measured with reference to the accuracy levels.
Software cost estimation is carried out using three types of techniques. They are regression based
model, anology based model and machine learning model. Each model has a set of technique for the
software cost estimation process. 11 cost estimation techniques fewer than 3 different categories are
used in the system. The Attribute Relational File Format (ARFF) is used maintain the software product
property values. The ARFF file is used as the main input for the system.
The proposed system is designed to perform the clustering and ranking of software cost
estimation methods. Non overlapped clustering technique is enhanced with optimal centroid estimation
mechanism. The system improves the clustering and ranking process accuracy. The system produces
efficient ranking results on software cost estimation methods.
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.
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.
Literature Review Basics and Understanding Reference Management.pptxDr Ramhari Poudyal
Three-day training on academic research focuses on analytical tools at United Technical College, supported by the University Grant Commission, Nepal. 24-26 May 2024
Presentation of IEEE Slovenia CIS (Computational Intelligence Society) Chapte...University of Maribor
Slides from talk presenting:
Aleš Zamuda: Presentation of IEEE Slovenia CIS (Computational Intelligence Society) Chapter and Networking.
Presentation at IcETRAN 2024 session:
"Inter-Society Networking Panel GRSS/MTT-S/CIS
Panel Session: Promoting Connection and Cooperation"
IEEE Slovenia GRSS
IEEE Serbia and Montenegro MTT-S
IEEE Slovenia CIS
11TH INTERNATIONAL CONFERENCE ON ELECTRICAL, ELECTRONIC AND COMPUTING ENGINEERING
3-6 June 2024, Niš, Serbia
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.
DEEP LEARNING FOR SMART GRID INTRUSION DETECTION: A HYBRID CNN-LSTM-BASED MODELgerogepatton
As digital technology becomes more deeply embedded in power systems, protecting the communication
networks of Smart Grids (SG) has emerged as a critical concern. Distributed Network Protocol 3 (DNP3)
represents a multi-tiered application layer protocol extensively utilized in Supervisory Control and Data
Acquisition (SCADA)-based smart grids to facilitate real-time data gathering and control functionalities.
Robust Intrusion Detection Systems (IDS) are necessary for early threat detection and mitigation because
of the interconnection of these networks, which makes them vulnerable to a variety of cyberattacks. To
solve this issue, this paper develops a hybrid Deep Learning (DL) model specifically designed for intrusion
detection in smart grids. The proposed approach is a combination of the Convolutional Neural Network
(CNN) and the Long-Short-Term Memory algorithms (LSTM). We employed a recent intrusion detection
dataset (DNP3), which focuses on unauthorized commands and Denial of Service (DoS) cyberattacks, to
train and test our model. The results of our experiments show that our CNN-LSTM method is much better
at finding smart grid intrusions than other deep learning algorithms used for classification. In addition,
our proposed approach improves accuracy, precision, recall, and F1 score, achieving a high detection
accuracy rate of 99.50%.
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.
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.
Advanced control scheme of doubly fed induction generator for wind turbine us...IJECEIAES
This paper describes a speed control device for generating electrical energy on an electricity network based on the doubly fed induction generator (DFIG) used for wind power conversion systems. At first, a double-fed induction generator model was constructed. A control law is formulated to govern the flow of energy between the stator of a DFIG and the energy network using three types of controllers: proportional integral (PI), sliding mode controller (SMC) and second order sliding mode controller (SOSMC). Their different results in terms of power reference tracking, reaction to unexpected speed fluctuations, sensitivity to perturbations, and resilience against machine parameter alterations are compared. MATLAB/Simulink was used to conduct the simulations for the preceding study. Multiple simulations have shown very satisfying results, and the investigations demonstrate the efficacy and power-enhancing capabilities of the suggested control system.
1. Scientific Journal Impact Factor (SJIF): 1.711
International Journal of Modern Trends in Engineering
and Research
www.ijmter.com
@IJMTER-2014, All rights Reserved 352
e-ISSN: 2349-9745
p-ISSN: 2393-8161
Congestion Control for Streaming Data Broadcasting over Internet
Ashish Parejiya1
, Dr. Vinod Desai2
1
Ph.D Research Scholar-CSS, Mewar University, Rajasthan, India,
2
Computer Science Department, Govt. Science College, Navsari, India
Abstract- In the last few years, video streaming facilities over TCP or UDP, such as YouTube, Face-
time, Daily-motion, Mobile video calling have become more and more popular. The important
challenge in streaming broadcasting over the Internet is to spread the uppermost potential quality,
observe to the broadcasting play out time limitation, and efficiently and equally share the offered
bandwidth with TCP or UDP, and additional traffic types. This work familiarizes the Streaming
Media Data Congestion Control protocol (SMDCC), a new adaptive broadcasting streaming
congestion management protocol in which the connection’s data packets transmission frequency is
adjusted allowing to the dynamic bandwidth share of connection using SMDCC, the bandwidth share
of a connection is projected using algorithms similar to those introduced in TCP Westwood. SMDCC
avoids the Slow Jump phase in TCP. As a result, SMDCC does not show the pronounced rate
alternations distinguishing of modern TCP, so providing congestion control that is more appropriate
for streaming broadcasting applications. Besides, SMDCC is fair, sharing the bandwidth equitably
among a set of SMDCC connections. Main benefit is robustness when packet harms are due to
indiscriminate errors, which is typical of wireless links and is becoming an increasing concern due to
the emergence of wireless Internet access. In the presence of indiscriminate errors, SMDCC is also
approachable to TCP Tahoe and Reno (TTR). We provide simulation results using the ns3 simulator
for our protocol running together with TCP Tahoe and Reno.
Keywords- Streaming Broadcasting application, Congestion, Streaming Media Congestion Control
protocol (SMDCC), TCP Tahoe and Reno (TTR), Quality of Service, End-to-end protocols,
I. INTRODUCTION
TCP has effectively maintained data applications through end-to-end consistent in-order packet
communication. With increase in link bandwidth above the past period many interactive program
broadcasting applications that stream video and audio over the Internet have emerged. The popularity
of such type of applications has produced multimedia data to be progressively present in the Internet.
Protocols need to be advanced that for equally share network bandwidth between multimedia and
other connection types such as TCP, UDP, etc.
Multimedia is regularly not transferred using the uncontaminated TCP standard because the services
providing by TCP are more helpful to applications requiring dependable data transfer, such as the
HTTP, E-mail, and FTP. The latter applications place greater priority on reliable delivery, rather than
the data transfer time. In contrast, the video streaming application has severer transfer potential
requirements. The key specific characteristic of such applications is that audio and video data needs
to be nonstop played out at the client machine. This connections a play out time with each
transmitted data packet. If the packet arrives late, it is unusable to the application, and might as well
have been missing. A streaming data transfer rate that does not fluctuate radically is therefore more
suited for multimedia communications.
2. International Journal of Modern Trends in Engineering and Research (IJMTER)
Volume 01, Issue 05, [November - 2014] e-ISSN: 2349-9745, p-ISSN: 2393-8161
@IJMTER-2014, All rights Reserved 353
SMDCC approximate the bottleneck bandwidth segment of a connection at the client machine
(receiver machine) like Smart Phone, laptop, tablet, etc. by algorithms similar to those announced in
TCP Westwood [4]. The receiver machine does not send response acknowledgement to the
broadcaster for every one received stream data packets. Instead, negative responses acknowledge
(NRACK) is returned to the broadcaster when the client perceives a data packet loss. This NRACK
serves two resolutions. First, it is a request for retransmission of the data lost packet. Depending on
whether it can be delivered on time the broadcaster may or may not retransmit the packet. Secondly,
in SMDCC, a NRACK brings to the broadcaster the current Bandwidth Share Estimate (BSE). Thus
a NRACK message conveys a measure of congestion, and the broadcaster adjusts its sending rate
accordingly.
At always time being0, the sender simulators TCP’s congestion avoidance stage by increasing its
data sending rate by one packet per round trip time (RTT) until a NRACK message is received, upon
which the sending rate is set to the BSE. After this modification in the sending rate, the server
resumes a linear sending rate increase of one packet per RTT.
As will be exposed in the remainder this paper work content, each SMDCC sender gets an accurate
estimation of the connection’s fair-minded share of the bottleneck bandwidth, and effectually fine-
tunes the data sending rate to the changing estimate. This enables the receiver to continuously play
out the delivered media content, although at fluctuating quality, even further down highly dynamic
network conditions. SMDCC is also a fair protocol in that it shares the bottleneck bandwidth equally
between a set of SMDCC connection networks. As a final point of view, SMDCC performs well in
random loss in background environment, since the bandwidth approximate is strong to sporadic data
packet loss, unlike TCP Reno-like adaptive schemes, which tend to overdramatize to random errors
with substantial data throughput degradation. Furthermore, SMDCC is TCP friendly when packet
losses are due to random errors.
The remainder of this research paper work as follows: Part 2 summaries related work. Part 3 presents
SMDCC, the streaming protocol proposed in this research paper. This is followed by an assessment
of SMDCC bandwidth estimation accuracy, throughput performance, objectivity, and its
responsiveness to TCP, all in Part 4. Part 5 concludes by summarizing outcomes and discussing
existing and thinks about future research work.
II. CORRELATED WORK
A latest research has target on designing TCP responsive protocols that meet the demands of
multimedia streaming applications for video streaming facilities over TCP or UDP, such as
YouTube, Face-time, Daily-motion, Mobile video calling have become more and more popular. In
many cases these efforts have produced multimedia streaming protocols that behave very close
related to TCP.
Time-lined TCP (TL-TCP) [11] is one such protocol that follows exactingly to the TCP congestion
mechanism for streaming data application of broadcaster, while allowing data to be linked with
target deadline or receiver end. Once the deadline of a unit of data has distributed the rest of the data
linked with that
Broadcast a Streaming Data Congestion Control using Bandwidth Estimation
Targeted or receiver machine is dropped a stream data. Although this protocol rejects some of the
timing duration issues introduced by TCP, it still stands by to the dependability and in-order
distribution constraints of TCP, which hinder the transfer of streaming data.
SCTP [7] get used to the basic mechanisms of TCP congestion controlling to multimedia
stream of traffic necessities. SCTP allows the disabling of in-order packet transfer and reliable
3. International Journal of Modern Trends in Engineering and Research (IJMTER)
Volume 01, Issue 05, [November - 2014] e-ISSN: 2349-9745, p-ISSN: 2393-8161
@IJMTER-2014, All rights Reserved 354
packet distribution, in the times of network congestion. However, SCTP still employs the slow-start
mechanism of TCP, foremost to detrimental sending rate fluctuations in streaming data for
broadcasting.
RAP [13] also simulators the additive increase multiplicative decrease congestion system of TCP.
While in congestion escaping point, the sending or broadcasting rate is increased by one per round-
trip-time. Upon detection of congestion, the broadcasting rate is multiplicatively decreased. RAP
filters out the throughput difference level, caused by the multiplicatively sending rate reductions, by
depend on receiver machine buffering strategies.
Feaster et al. [3] cover the RAP protocol by using non-AIMD algorithms end to end receiver buffer
management to further decrease sending rate fluctuations. Their SQRT algorithm in specific
progresses throughput differences by decreasing the sending rate by sort (window size), as opposite
to AIMD algorithms where the decline in broadcast transmission rate is related to the window size.
TCP Friendly Rate Control (TFRC) [6] adjusts the server’s broadcasting data rate upon bottleneck
according to a TCP throughput calculation. This equation formula contains packet loss rate (due to
congestion) and RTT, which are observed and maintained at the receiver machine. TFRC however
cannot control random losses in the sense that such losses will cause unnecessary loss of quantity
stream data.
One key design difference between SMDCC and the protocols mentioned overhead is that SMDCC
does not require the receiver data packet acknowledgement of every data packet sent by sender of
broadcaster. This is an important saving since multimedia data packets are typically small in size,
~200 bytes. Requiring a 40byte acknowledgment for each data packet automatically adds a 20%
overhead to the protocol of SMDCC.
A new issue has been spoken by Tang in the Rate Control Scheme (RCS) and proposed by him. [13]
Is robustness of the rate adaptation algorithm to high link loss rates on wireless channels with high
Bandwidth X Delay products. Such cases correspond to satellite links as well as wireless access links
to remote Internet servers. This scenario is likely to attract considerable interest as wireless Internet
access to multimedia services is gaining popularity. The RCS scheme is a clever mechanism based
on dummy packets to distinguish between congestion loss and random loss. The proper operation of
RCS, however, requires the implementation of a priority level “below TCP best effort” in the router.
Such support is not provided by most Internet routers. SMDCC on the other hand provides
robustness to random errors by virtue of the intrinsic insensitivity of the Bandwidth Share Estimate
to isolated losses. No extra network level support is required.
III. STREAMING MEDIA DATA CONGESTION CONTROL PROTOCOL (SMDCC)
In this paper we are propose the SMDCC protocol, 1) is adept to adept the sending stream data rate
according to the linked estimated bandwidth on sharing base, 2) is fait to existing connection, and 3)
does not suffer from pronounced data sending rate fluctuations data send typical of most window
protocols.
There is no congestion window in SMDCC, although SMDCC adjusts its sending rate so as to
simulator TCP’s congestion escaping phase with its linear bandwidth analytical,
i.e. one extra packet is sent via broadcaster application on per round trip time so long as no
congestion is identified. When congestion is encountered in SMDCC, the sending data rate is going
down to the current Bandwidth Share Estimate (BSE), and linear probing is continuous. Never is
the sending data rate dropped to 1 packet per round trip time following a timeout, as in the TCP
protocol, unless the existing BSE dictates this summaries value. In other words, the “slow-start”
phase with exponential progress as in TCP is not present in SMDCC.
4. International Journal of Modern Trends in Engineering and Research (IJMTER)
Volume 01, Issue 05, [November - 2014] e-ISSN: 2349-9745, p-ISSN: 2393-8161
@IJMTER-2014, All rights Reserved 355
3.1 SMDCC Broadcaster or sender Procedure
In this protocol, after getting acknowledgement connection setup using a three-way-handshake
between SMDCC broadcaster server and receiver machine is complete, the broadcaster starts to send
stream media content. In this execution process, we assume the network can handle the lowest
quality data sending rate, and use that rate as the primary sending rate. The preliminary round trip
time approximation is gathered from the handshaking connection process in between broadcaster and
receiver machine. After each sequential RTT, the broadcaster increases the speed of one by one data
packet sending rate. This has the consequence of mimicking TCP congestion escaping phase. The
broadcaster settles in its RTT approximation each and every round trip time, by requesting a
responds acknowledgement for the first data packet in every new RTT window.
At whatever time the broadcaster receives a NRACK, it arrange differently the sending rate to the
BSE contained in the NRACK message (the BSE calculation is discussed below), and resumes linear
inquisitive. The broadcaster can control if there is enough time to retransmit the lost packet, based
on information it gets from the receivers machine regarding the receiver’s current buffer and current
play out time.
3.2 SMDCC Client or Receiver Machine Procedure
As we know for all data packet received, the receiver machine may recalculate the BSE. Upon
getting a data packet that the broadcaster requests to be acknowledged, the receiver sends an ACK
for that received data packets. As said above, this message interchange is used to set the RTT at the
broadcaster side. Once a lost or dropped packet is identified, a NRACK message is sent enclosing
the current bandwidth approximation. As said above, it is responsibility of broadcaster to control if
the packet should be resending.
3.3 Bandwidth Calculation in SMDCC
Just as in TCP Westwood, the Bandwidth Sharing Approximation, i.e. the approximation of the data
rate to be used by the broadcaster in order to share the bottleneck bandwidth fairly, is
resolute by exponentially be an average of data rate samples. Though, where TCP Westwood
measures ACK comings at the broadcaster, SMDCC uses the inter-arrival time between two
subsequent packets at the receiver machine (Client) to calculate a data rate sample on Streaming
Media Data Congestion Control using Bandwidth Approximation.
The onward path of the linked connection. The benefit of the SMDCC approach is that it measures
the data rate on the forward path of the linked connection, clarifying out the effects of congestion on
the same reserve path.
Fundamentally, the receiver side calculates the connection bandwidth share using the Receiver Based
Packet Pair (RBPP) method described in [12]. RBPP requires the use of two consecutively sent
packets to determine a bandwidth share sample. The adherence of SMCC to the RBPP sequence
number requirement is fundamental for not overestimating bandwidth share and thus enhancing
fairness and friendliness of SMCC.
A second another restraint is to make sure that ‘time compression’ has not happened on the
successive packets. Here we try to define time compression as stirring when the difference between
arrival times of the packets is less than the difference between sending times of the packets [12]. If
the packets are time compressed, they are not used in the BSE calculation method as the resulting
approximate would be too destructive. The intent is to estimate bandwidth only up to the server’s
known as broadcaster instantaneous sending data packet rate, even if more bandwidth is available.
If two successively received packets have passed the two tests above, they are used to calculate a
bandwidth sample as follows:
5. International Journal of Modern Trends in Engineering and Research (IJMTER)
Volume 01, Issue 05, [November - 2014] e-ISSN: 2349-9745, p-ISSN: 2393-8161
@IJMTER-2014, All rights Reserved 356
Bandwidth = x2 / (a2-a1) (1)
Where x2 is the size of the second packet, a1 and a2 are the arrival times of the first and second
packet individually. This bandwidth taster is then used just as the data packet rate estimation in TCP
Westwood; it is plugged into the exponential strainer to produce the current BSE.
IV. EXPERIMENTAL OUTCOMES
We had executed several simulation experiments to assess the performance of SMDCC with respect
to relevant output, equality, and TCP-friendliness. Unless otherwise stated, all simulations test result
use the topology shown in Figure 1, thru all linked connections going through the same bottleneck
link using RED line management, and broadcasting data in the same track of destination of receiver
machine. Simulations were run for 200sec. To filter out transitory system behavior, all simulations
were run for 100 seconds earlier measurements were taken. Table 1 shows the constant configuration
parameters.
Table 1 : Simulation Properties
Delay of all side links 3ms
Side links capacity 5Mbps
Bottleneck buffer 10*RTT*bottleneck B/W
FTP/SMDCC data packets 200 bytes
FTP/SMDCC ack packet size 40 bytes
Min. Threshold 0.05*Bottleneck buffer
Max. Threshold 0.5*Bottleneck buffer
weight 0.002
4.1 Precision of Bandwidth Estimation Result
At experiment stage First of all, we need to confirm the accuracy of SMDCC’s bandwidth
approximation result. This is completed by changing the link data broadcasting volume during the
lifetime of a SMDCC connection. We modify the link capacity by introducing CBR transportation
load at different rates over the bottleneck link. Figure 2 shows how SMDCC become accustomed to
changing bottleneck bandwidth with no competing SMDCC or TCP connections. The figure shows
both SMDCC’s BSE value, and its output data result as a function of time. The figure shows that
SMDCC calculation method the BSE precisely reach to within 10% of the available bottleneck
bandwidth.
A
B
C
X
A
B
C
Y
Figure 1: Simulation Topology
6. International Journal of Modern Trends in Engineering and Research (IJMTER)
Volume 01, Issue 05, [November - 2014] e-ISSN: 2349-9745, p-ISSN: 2393-8161
@IJMTER-2014, All rights Reserved 357
Figure 2 Adaptation of BSE to changing bottleneck bandwidth
4.2 Output Performance
Figure 3 Output curvatures of 1 SMDCC and 1 FTP/TCP New Reno connections
Figure 3 plots the output curve of one SMDCC and one TCP New Reno connection, in 1-second
intermissions for a 120 second simulation. A total of 5 TCP and 5 SMDCC connections were
actively work, but only one output curve of each type of connection is shown if Figure 3. The
bottleneck volume size was 1Mbps, with a 10msec delay accordingly the fair share per connection is
100Kbps. Figure 3 shows that while still getting its fair share value of 100Kbps, SMDCC’s output
curvature is much smoother than TCP New Reno’s oscillatory data sending rate. This is because
SMDCC does not reduce its data broadcasting rate by one half or to a minimum of one packet per
round trip time as TCP does. Rather, SMDCC adjusts its data broadcasting rate to the BSE, and
never performs an exponential rate increase. As a result, SMDCC takes longer to reach the fair share
value size, but it does not suffer from marked sending rate fluctuations, and accordingly make
suitable for streaming media data such as audio and video.
7. International Journal of Modern Trends in Engineering and Research (IJMTER)
Volume 01, Issue 05, [November - 2014] e-ISSN: 2349-9745, p-ISSN: 2393-8161
@IJMTER-2014, All rights Reserved 358
TCP was formerly aimed to work in a totally wired environment, where a packet loss meant that a
buffer overflow, when happened somewhere in the network, and for that reason, served as a sign of
congestion. However, in the case of loss links of connectivity, packets may not only be lost due to
congestion, but also due to random errors. TCP Reno incorrectly interprets this event as congestion,
and unnecessarily reduces its window size with consequent reduction in output. This prohibits TCP
from fully exploiting the error-prone link.
SMDCC is more forceful to random loss because of the relative inconsiderateness of bandwidth
estimation to irregular errors. In fact as per result, the loss of an isolated packet has only marginal
impact on the bandwidth estimation. No time out and slow start are suffered in SMDCC.
To clarify the strength of SMDCC in the wireless domain, Figure 4 presents results from a
simulation result with one SMDCC and one TCP New Reno connection running over a 0.3Mbps
blockage link with 35ms delay, and an error rate varying from 1 to 20%. We see that SMDCC is
competent to maintain a large percentage of the 150Kbps fair share value self-regulating of the error
rate, while TCP output continues to reduce as the error rate rises.
Figure 4 One SMDCC versus One TCP New Reno connection running over a 300Kbps bottleneck lossy link with a
35ms delay
4.3 SMDCC Objectivity
The objectivity of a protocol is a check and measurement of how many number of connections
successively linked in the same protocol share the bottleneck bandwidth. The objective of SMDCC is
calculated below by simultaneously running 10 SMDCC connections. The time is an average of the
out and BSE of each connection is shown in Figure 5. The results show that the connections very
little in their output and BSE averages. We also entered different value and make experiments
changing the number of connections from 2 to 50. The bottleneck volume size is scaled to maintain a
fair share value of 100Kbps, while the delay was held continuous at 10ms. All runs showed good
equality output behavior: Jain’s Fairness Index was higher than .99 for all runs of instruction.
8. International Journal of Modern Trends in Engineering and Research (IJMTER)
Volume 01, Issue 05, [November - 2014] e-ISSN: 2349-9745, p-ISSN: 2393-8161
@IJMTER-2014, All rights Reserved 359
Figure 5 Time being an average of BSE and Output on 10 SMDCC connections
4.4 TCP Friendliness
We also tried and tested approachability for a different selection of network conditions, together with
number of flows, bottleneck connection link delay, bottleneck bandwidth, and random irregular
errors. Varying the number of flows did not show major impact on responsiveness. As a result we
will limit our discussion in this section to how bottleneck delay, bandwidth and random errors impact
approachability. All simulations in this section were performed using a balanced set of 10 SMDCC
and 10 TCP New Reno connections.
We use the Efficiency Interchange Graph introduced in [4] to better visualize the productivity
tradeoff behavior when introducing SMDCC connections to share a common bottleneck link with
TCP New Reno connections. The following two tests produce a single point on the chart:
A. A simulation with 20 TCP New Reno flows is run for standardization connection, to establish
a reference value. The result output of each flow, and the total link consumption, are
measured.
B. Another simulation is then run with half of the TCP flows replaced with SMDCC flows. The
new result outputs and utilization are measured.
Let tR1 be the average output of the TCP New Reno flows in the first testing simulation, and U1 be
the total link used in experiment operations. In the same way, let tR2 be the average output of the
TCP New Reno flows in the second simulation, and U2 be the total link consumption by all
connections that is SMDCC as well as TCP connections. We then define:
Efficiency Improvement EI = U2/U1 (2)
Friendliness FL = (tR2/tR1) (3)
For each network situation of interest, EI and F are determined and an (FL, EI) point is placed on the
Efficiency / Friendliness Tradeoff graph. We expect that, in most cases, an increase in Efficiency
Improvement (EI) is compensated for by a decrease in Friendliness (F).
We had executed a set of experiments, varying the bottleneck capacity from 5 to 20Mbps. The
bottleneck delay was also varied between 10, 50, 100 and 150ms. We also make known to random
data packet dropping of media data over the bottleneck link to simulate random loss connected with
data transfer over a wireless channel.
9. International Journal of Modern Trends in Engineering and Research (IJMTER)
Volume 01, Issue 05, [November - 2014] e-ISSN: 2349-9745, p-ISSN: 2393-8161
@IJMTER-2014, All rights Reserved 360
Figure 6 shows the Efficiency / Friendliness adjustment behavior when SMDCC connections share a
bottleneck link with TCP New Reno connections. Each curve in Figure 6 relates to fixed bottleneck
bandwidth and error rate. Furthermore, the points on each curve represent the impact of successively
changing the traffic jam delay. For expediency, the arrows mark the direction of increasing
bottleneck delay.
We see that for all three 0% error rate cases, as the delay increases, SMDCC decreases TCP’s output
without any resulting improvement in efficiency. The reason for this is that in these situations there
is not much room for enhancement in efficiency, since TCP by itself can accomplish a high operation
of the bottleneck link. There is a friendliness problem in the current version of SMDCC, signified by
the flat portions of the 0% error curves. This is one area of further required enhancement, and can be
addressed by applying adaptive share estimation methods, as in [4, 5], as opposed to the current
packet pair model. The packet pair model and the related available bandwidth approximation have
been shown to be too aggressive at times. Results presented in [4, 5] have shown major
developments in friendliness using the rate estimation model.
Figure 6 also shows that SMDCC is approachable to TCP New Reno in the irregular error case
(wireless network situation).
As we said in Section 4.2, when a data packet loss is due to irregular unexpected error, TCP
unnecessarily decreases its window size, with resulting reduction in output. This forbids TCP from
fully exploiting the capacity of an error-prone link. This incompetence is more noticeable as the
bandwidth X delay product increases.
Figure 6: Efficiency / Friendliness tradeoff graph
In SMDCC, the loss of an isolated data packet has only marginal impact on the bandwidth
approximation, so it achieves a higher operation of an error-prone link. When SMDCC connections
are presented, they readily use the residual bandwidth that TCP is incapable of utilizing. This is
apparent in Figure 6 where the 1% error rate curves show that SMDCC remains friendly to TCP
irrespective of bottleneck volume capacity and delay. Also, the gain in total consumption resulting
from the introduction of SMDCC increases as the bandwidth X delay product increases.
4.5 Evaluation of SMDCC to other Streaming Protocols
As mentioned in Section 2, the common experiment for any media data streaming protocol is to fine-
tune its sending rate to a correct value once congestion occurs. Most protocols so far proposed
adhere to the multiplicative reduction paradigm of TCP. Others, such as TFRC attempt to calculate
10. International Journal of Modern Trends in Engineering and Research (IJMTER)
Volume 01, Issue 05, [November - 2014] e-ISSN: 2349-9745, p-ISSN: 2393-8161
@IJMTER-2014, All rights Reserved 361
the output that TCP would achieve on the same connection, and use that calculation to set the data
sending rate. The downside of these methods is that in striving to achieve the same output as TCP
with worse sending rate vacillations, such protocols can inherit the fundamental limits of TCP. [13]
Shows that the RAP protocol using fine-grain rate revision can achieve the same output as TCP
regardless of the bottleneck delay. Similarly, TFRC [6] is based on an essential control equation that
make sure that the protocol uses no more bandwidth, in steady-state, than a TCP conforming
protocol running similar conditions. From figures 5 and 6, we see that in the random and unexpected
error cases, reaching the same output as TCP. leaves the bottleneck link severely underutilized.
SMDCC allows the media data streaming application to access this unexploited bandwidth in these
cases, without hindering prevailing TCP connections. As wireless Internet access becomes
progressively standard and technology increases the capacity of links, this issue will become all the
time more important. Naturally, in the try to improve utilization, SMDCC at times also grabs
bandwidth from TCP and vice-versa. We think to address these issues in depth in future work.
V. CONCLUSION
In this paper, we had tried to present on Streaming Media Data Congestion Control (SMCC), a
protocol based on bandwidth approximation concepts, which provides flat sending rate changes and
good utilization when available network bandwidth fluctuates. SMDCC is fair with respect to other
SMDCC flows. It is practically friendly to TCP, particularly with lossy connection links. SMDCC
mimics the linear probing for additional bandwidth in TCP congestion escaping phase. Upon finding
of a lost data packets, which the receiver explicitly NRACKs along with the existing BSE, the
broadcaster adjusts its data broadcasting rate to the present Bandwidth Share Estimation. SMDCC
impersonators the Congestion Prevention phase of TCP congestion control, but never the Slow Start
phase.
SMDCC dictates the broadcasting rate of a streaming media data application, but not the quality of
the stream. The quality reworking is a separate issue. It not only depends upon the existing
broadcasting rate, but also upon the receiver’s or client machines buffer, and the user preferences and
profile as well.
The resulting performance shows that SMDCC output is quite flat and smooth, as equaled to the
unstable behavior of predictable TCP. This is a required property for media data streaming
applications. Toughness to link errors and random loss was also revealed via simulations.
Areas of additional research include: friendliness of bandwidth approximation method particularly
when congestion, not irregular error, is the predominant basis of packet losses; and the extension to
multicast broadcasting applications (both single and multi-source). This protocol will also be tried on
interactive media data, while the tight time delay limitations will introduce more severe buffer space
requirements.
REFERENCES
1. Roberto Canonico, Carmen Guerrero, and Andreas Mauthe. Content distribution infrastructures for
community networks. Computer Networks, 53(4):431–433, 2009.
2. D. Bansal, H. Balakrishnan, S. Floyd, and S. Shenker. Dynamic Behavior of Slowly-Responsive
Congestion Control Algorithms. In Proceedings of Sigcomm 2012.
3. N. Feamster, D. Bansal, and H. Balakrishnan. On The Interactions Between Layered Quality Adaptation
and Congestion Control for Streaming Video. 11th International Packet Video Workshop, Kyongju,
Korea. May 2009.
4. M. Gerla, M. Sanadidi, K. Ng, M. Valla, R.Wang. Efficiency/Friendliness Tradeoff in TCP Westwood.
ISCC 2012.
11. International Journal of Modern Trends in Engineering and Research (IJMTER)
Volume 01, Issue 05, [November - 2014] e-ISSN: 2349-9745, p-ISSN: 2393-8161
@IJMTER-2014, All rights Reserved 362
5. M. Handley, J. Padhya, S. Floyd, and J. Widmer. TCP Friendly Rate Control (TFRC): Protocol
Specification. Internet Engineering Task Force, July 2010.
6. Parth H. Pathak and Rudra Dutta. A survey of network design problems and joint design approaches in
wireless mesh networks. IEEE mmunications Surveys and Tutorials, 13(3):396–428, 2011.
7. Thomas Plagemann, Roberto Canonico, Jordi Domingo-pascual, Carmen Guerrero, and Andreas Mauthe.
Chapter 15 Infrastructures for Community Networks.
8. V. Paxon. Measurements and Analysis of End-to-End Internet Dynamics. Ph.D. thesis, University of
California, Berkeley, April 1977.
9. R. Rejaie, M. Handley, D. Estrin. RAP: An End-to-end Rate-based Congestion Control Mechanism for
Realtime Streams in the Internet. University of Southern California, Information Sciences Institute. July
1998.