Multicasting is the delivery of a message or information to a group of destination computers simultaneously in a single transmission from the source. The copies of the messages are automatically created in other network elements like routers but only when the topology of the network requires it. Multicast is implemented most commonly in IP multicast which is further could be employed in internet protocol applications of streaming media. In the IP multicast the implementation of the multicast concept occurs at the IP routing level where routers create optimal distribution paths for datagram sent to a multicast destination address. At the Data Link Layer, multicast describes one-to-many distribution such as Ethernet multicast addressing, Asynchronous Transfer Mode (ATM) point-to-multipoint virtual circuits (P2MP) multicast. In this paper we have compared various multicasting mechanisms. The comparison is done on the basis of various factors like complexity, overhead, maintenance, etc. The mechanisms that are part of the paper are a secure ALM P2P multicasting technique for large scale networks using face recognition, IP multicasting techniques and the overlay multicasting techniques. The comparison of these multicasting techniques will help us to design and Implement a Secure Application-Level Multicasting (SALM) P2P Overlay Multicasting for large Scale Network. The main objective of the paper is to discuss all the three above mentioned multicasting phenomenon’s and compare them on the basis of certain criterion so as carved out the best of all which can be further used for designing a secure multicasting technique which can take the best features of all combined together so as to get effective and efficient technique for multicasting the throughput of the network by effective and efficient delivery of the information to all the members of the group. The certain findings can be carved out of the comparison can help us to create a multicasting technique with less incurring of delays so that information can be delivered in limited time span and multicast path length so that efficient paths should be used so as to enhance performance in multicasting. Moreover in this paper we will study & investigate other issues that degrades the performance of Multicasting Techniques for large Scale Network and later we will come to know through the comparison that which technique performs well in these harsh environment and give effective results.
Iaetsd a secured based information sharing scheme viaIaetsd Iaetsd
The document proposes a secured based information sharing scheme for delay tolerant networks using smartphones. It suggests using a discover-predict-deliver (DPD) approach for efficient content sharing. Specifically, DPD employs machine learning to identify meaningful locations from a user's mobility patterns using a hidden Markov model. Simulation results show DPD can discover and deliver 87% of content within two hours when only 30% of nodes initially have the content. The document also aims to reduce energy consumption using asymmetric multicore processors and efficient sensor scheduling with probabilistic optimal multi-parameter duty cycles.
CONGESTION AWARE SPRAY AND WAIT PROTOCOL: A CONGESTION CONTROL MECHANISM FOR ...ijcsit
In the last few years, the Vehicular Ad-hoc Network (VANET) has come to be an important area of research. Significant research has been conducted to improve the performance of VANETS. One output of further research conducted on VANET is the Vehicular Delay Tolerant Network (VDTN). It is an
application of the mobile DTN where nodes relay messages in the network using a store-carry-forward approach. Due to its high mobility, it suffers frequent disconnections and also congestions at nodes which leads to message drops. To minimize the rate of message drops and so optimize the probability of message delivery so that drivers are increasingly aware of the situation of the road, we propose a congestion
control mechanism: Congestion Aware Spray and Wait (CASaW) protocol in this work so as to optimize the
rate of message delivery to its destination and so increase the awareness of drivers in the vehicular environment thereby improve road safety. The results have shown that our proposition performed better than other classical VDTN protocols in terms of message delivery probability and rate of packet drops performance measures. We used the Opportunistic Networking Environment (ONE) simulator to implement the classical VDTN protocols: the PROPHET protocol, the Epidemic protocol, the MaxProp protocol and
the Spray and Wait Protocol. The simulation scenarios shows a better performance for the congestion control mechanism we propose as it maintains a good message delivery rate as well as minimize the rate of packet losses thereby optimizing the chances of messages getting to their destinations and so improve road safety.
Enhanced Multicast routing for QoS in delay tolerant networksIRJET Journal
This document summarizes research on enhanced multicast routing protocols for quality of service in delay tolerant networks. It proposes a novel multicast routing approach using the MAODV protocol and compares its performance to existing QBMR and DTN-DM protocols. Delay tolerant networks experience intermittent connectivity and long delays. Store-carry-forward is commonly used for data transfer between nodes. The proposed MAODV protocol improves storage and forwarding capabilities of mobile nodes and bundle message communication to multiple destinations. Its performance is evaluated based on metrics like throughput, routing load, and packet delivery fraction compared to existing protocols.
Delay Tolerant Networks(DTN) are a class of emerg- ing networks which experience intermittent connectivity and lack end-to-end paths due to absence of well-defined infrastructure. In this paper we explore the nuances of multicasting in DTNs. Multicasting enables efficient distribution of messages to a group of users, a paradigm that can be applicable in the context of DTNs. While multicasting in internet and ad-hoc networks has been studied extensively, realizing the same in DTNs is non- trivial given that many factors have to be considered. This paper, presents an implementation of multicast routing for various protocols in DTNs using ONE simulator. It also provides the analysis and performance results for the various protocols studies against the different movement models.
Content Sharing over Smartphone-Based Delay-Tolerant NetworksIJERA Editor
With the growing number of smartphone end users, peer-to-peer ad hoc content giving is likely to occur often. Thus, new articles sharing mechanisms must be developed since traditional information delivery schemes will not be efficient with regard to content sharing due to the sporadic connectivity between smartphones on the market. To obtain data delivery such challenging environments, researchers include proposed the employment of store-carry-forward methodologies, in which a node stores a communication and holds it until a forwarding prospect arises through an encounter together with other nodes. Most past works in this field have dedicated to the conjecture of whether two nodes could encounter the other, without thinking about the place and also time from the encounter. In this particular paper, we propose to her discover-predict-deliver as a possible efficient articles sharing scheme for delay-tolerant touch screen phone networks. In this proposed scheme, contents are usually shared while using the mobility information of people. Specifically, our strategy employs the mobility understanding algorithm to spot places inside your own home and outdoor.
Performance Evaluation of Binary Spray and Wait OppNet Protocol in the Contex...Dr. Mazlan Abbas
The document discusses the performance evaluation of the Binary Spray and Wait opportunistic network (OppNet) routing protocol in the context of emergency scenarios. It motivates the use of OppNets for emergency communications when traditional infrastructure is unavailable. Simulation results show that the Binary Spray and Wait protocol achieves good delivery probability and latency. The optimal buffer size is found to be 30MB, and speedier nodes like cars can carry larger message sizes like images but not videos. Future work includes testing the protocol on real emergency scenario data and smartphones.
This document summarizes a project seminar presentation on analyzing the performance of the epidemic routing protocol in delay tolerant networks under different mobility models. The key points are:
1) The objective is to evaluate the epidemic routing protocol's delivery probability, overhead ratio, and average buffer time when varying the buffer size and under different mobility models including random waypoint, map-based, shortest path, and map route models.
2) Simulation results show that the shortest path mobility model provides the best performance for the epidemic routing protocol in terms of high delivery probability, low overhead ratio, and efficient buffer usage.
3) Additional analysis varying the number of nodes found that performance is best when more nodes are present and becomes static with
Iaetsd a secured based information sharing scheme viaIaetsd Iaetsd
The document proposes a secured based information sharing scheme for delay tolerant networks using smartphones. It suggests using a discover-predict-deliver (DPD) approach for efficient content sharing. Specifically, DPD employs machine learning to identify meaningful locations from a user's mobility patterns using a hidden Markov model. Simulation results show DPD can discover and deliver 87% of content within two hours when only 30% of nodes initially have the content. The document also aims to reduce energy consumption using asymmetric multicore processors and efficient sensor scheduling with probabilistic optimal multi-parameter duty cycles.
CONGESTION AWARE SPRAY AND WAIT PROTOCOL: A CONGESTION CONTROL MECHANISM FOR ...ijcsit
In the last few years, the Vehicular Ad-hoc Network (VANET) has come to be an important area of research. Significant research has been conducted to improve the performance of VANETS. One output of further research conducted on VANET is the Vehicular Delay Tolerant Network (VDTN). It is an
application of the mobile DTN where nodes relay messages in the network using a store-carry-forward approach. Due to its high mobility, it suffers frequent disconnections and also congestions at nodes which leads to message drops. To minimize the rate of message drops and so optimize the probability of message delivery so that drivers are increasingly aware of the situation of the road, we propose a congestion
control mechanism: Congestion Aware Spray and Wait (CASaW) protocol in this work so as to optimize the
rate of message delivery to its destination and so increase the awareness of drivers in the vehicular environment thereby improve road safety. The results have shown that our proposition performed better than other classical VDTN protocols in terms of message delivery probability and rate of packet drops performance measures. We used the Opportunistic Networking Environment (ONE) simulator to implement the classical VDTN protocols: the PROPHET protocol, the Epidemic protocol, the MaxProp protocol and
the Spray and Wait Protocol. The simulation scenarios shows a better performance for the congestion control mechanism we propose as it maintains a good message delivery rate as well as minimize the rate of packet losses thereby optimizing the chances of messages getting to their destinations and so improve road safety.
Enhanced Multicast routing for QoS in delay tolerant networksIRJET Journal
This document summarizes research on enhanced multicast routing protocols for quality of service in delay tolerant networks. It proposes a novel multicast routing approach using the MAODV protocol and compares its performance to existing QBMR and DTN-DM protocols. Delay tolerant networks experience intermittent connectivity and long delays. Store-carry-forward is commonly used for data transfer between nodes. The proposed MAODV protocol improves storage and forwarding capabilities of mobile nodes and bundle message communication to multiple destinations. Its performance is evaluated based on metrics like throughput, routing load, and packet delivery fraction compared to existing protocols.
Delay Tolerant Networks(DTN) are a class of emerg- ing networks which experience intermittent connectivity and lack end-to-end paths due to absence of well-defined infrastructure. In this paper we explore the nuances of multicasting in DTNs. Multicasting enables efficient distribution of messages to a group of users, a paradigm that can be applicable in the context of DTNs. While multicasting in internet and ad-hoc networks has been studied extensively, realizing the same in DTNs is non- trivial given that many factors have to be considered. This paper, presents an implementation of multicast routing for various protocols in DTNs using ONE simulator. It also provides the analysis and performance results for the various protocols studies against the different movement models.
Content Sharing over Smartphone-Based Delay-Tolerant NetworksIJERA Editor
With the growing number of smartphone end users, peer-to-peer ad hoc content giving is likely to occur often. Thus, new articles sharing mechanisms must be developed since traditional information delivery schemes will not be efficient with regard to content sharing due to the sporadic connectivity between smartphones on the market. To obtain data delivery such challenging environments, researchers include proposed the employment of store-carry-forward methodologies, in which a node stores a communication and holds it until a forwarding prospect arises through an encounter together with other nodes. Most past works in this field have dedicated to the conjecture of whether two nodes could encounter the other, without thinking about the place and also time from the encounter. In this particular paper, we propose to her discover-predict-deliver as a possible efficient articles sharing scheme for delay-tolerant touch screen phone networks. In this proposed scheme, contents are usually shared while using the mobility information of people. Specifically, our strategy employs the mobility understanding algorithm to spot places inside your own home and outdoor.
Performance Evaluation of Binary Spray and Wait OppNet Protocol in the Contex...Dr. Mazlan Abbas
The document discusses the performance evaluation of the Binary Spray and Wait opportunistic network (OppNet) routing protocol in the context of emergency scenarios. It motivates the use of OppNets for emergency communications when traditional infrastructure is unavailable. Simulation results show that the Binary Spray and Wait protocol achieves good delivery probability and latency. The optimal buffer size is found to be 30MB, and speedier nodes like cars can carry larger message sizes like images but not videos. Future work includes testing the protocol on real emergency scenario data and smartphones.
This document summarizes a project seminar presentation on analyzing the performance of the epidemic routing protocol in delay tolerant networks under different mobility models. The key points are:
1) The objective is to evaluate the epidemic routing protocol's delivery probability, overhead ratio, and average buffer time when varying the buffer size and under different mobility models including random waypoint, map-based, shortest path, and map route models.
2) Simulation results show that the shortest path mobility model provides the best performance for the epidemic routing protocol in terms of high delivery probability, low overhead ratio, and efficient buffer usage.
3) Additional analysis varying the number of nodes found that performance is best when more nodes are present and becomes static with
Peer-to-Peer streaming technology has become one of the major Internet applications as it offers the opportunity of broadcasting high quality video content to a large number of peers with low costs. It is widely accepted that with the efficient utilization of peers and server's upload capacities, peers can enjoy watching a high bit rate video with minimal end-to-end delay. In this paper, we present a practical scheduling algorithm that works in the challenging condition where no spare capacity is available, i.e., it maximally utilizes the resources and broadcasts the maximum streaming rate. Each peer contacts with only a small number of neighbours in the overlay network and autonomously subscribes to sub-streams according to a budget-model in such a way that the number of peers forwarding exactly one sub-stream will be maximized. The hop-count delay is also taken into account to construct a short depth trees. Finally, we show through simulation that peers dynamically converge to an efficient overlay structure with a short hop-count delay. Moreover, the proposed scheme gives nice features in the homogeneous case and overcomes SplitStream in all simulated scenarios.
This document discusses routing strategies in delay tolerant networks (DTNs) using wireless sensor network (WSN) nodes for localization applications. It first provides background on WSNs and DTNs, and then reviews common DTN routing protocols like epidemic routing, PROPHET, spray and wait, and MaxProp. The aim of the dissertation is to propose a new routing protocol for DTNs using WSN nodes where GPS is unavailable. It discusses using a hybrid of knowledge-based and additional node-based routing. The document outlines simulating the proposed filtered flooding protocol in NS-2 to evaluate delivery ratio and delay for a mining activity scenario. Results show delivery ratio is high for small networks but decreases with more nodes, while delay is
This document discusses the design of an overlay mesh for peer-to-peer live streaming that achieves low delay, accommodates diverse uplink bandwidths, and is adaptive to peer churn. It aims to minimize the maximum delay from the source to peers. The document proposes Fast-Mesh, a distributed algorithm where peers select parents based on the ratio of throughput to delay to optimize network power and delay. Simulation and experiments show Fast-Mesh substantially outperforms other approaches in terms of delay and source workload.
This presentation covers some of the routing protocols for Delay Tolerant Networks (DTN) along with the overview of the Opportunistic Networking Environment which can be used for performance evaluation/comparison of/among these DTN protocols.
P.S. This presentation is for educational purpose only. It is not meant for any commercialization at all.
Routing protocol for delay tolerant network a survey and comparisonPhearin Sok
Routing protocols for delay tolerant networks can be categorized as either flooding or forwarding strategies. Flooding strategies replicate messages to multiple nodes to increase delivery probability but use more resources, while forwarding strategies select a single path using network knowledge to minimize resource usage but have lower delivery probability. The survey compares these routing protocol categories and their advantages for different applications in delay tolerant networks, which must deal with intermittent connectivity and large delays.
This document summarizes research on Delay Tolerant Networks (DTNs). It discusses DTNs' characteristics including long latency, unstable topology, and lack of end-to-end paths. It also examines challenges like privacy concerns when humans are involved. The document reviews data forwarding techniques in DTNs like store-and-forward and epidemic routing. Potential applications are also discussed, such as providing rural internet access through projects like DakNet that use transportation infrastructure. The document concludes by encouraging further research on DTNs and their applications.
Delay tolerant networks allow communication in environments with intermittent connectivity, tolerating delays of days. They are also called intermittently connected mobile networks. Key challenges include unpredictable encounter schedules between nodes, limited network capacity, storage constraints on nodes, and energy efficiency. Routing protocols for DTNs include epidemic routing, where nodes exchange all data on encounter, and schemes that use knowledge of node locations or mobility patterns to move data closer to destinations opportunistically during encounters. Gradient routing uses metrics representing a node's delivery ability to pass messages to nodes moving the message progressively closer to the destination. Spray and wait limits message copies to control overhead. Security risks in DTNs include denial of service attacks due to long latencies enabling resource depletion, and
Delay tolerant network routing protocol a comprehensive survey with hybrid...eSAT Journals
Abstract
Delay –disruption Tolerant networks are sparse wireless network which is recently being used by the existing /current network for the purpose to connect devices or the underdeveloped area of the world that works in challenging environment. In DTN there majority of time does not exist the total path from source to target which is leads to the difficulty of how to route the packet in such environment. A communications network which is accomplished of storing packets temporarily in intermediate nodes, until the time an end-to-end route is re-established or regenerated is known as a delay tolerant networks. Routing in such network is very difficult and for that different routing protocols are developed. In this Survey paper we discuss about various routing Strategy and at the end compared the different routing protocol with their various performance metrics.
Keywords: Delay tolerant networks (DTNs), Erasure coding, Replication, Routing.
An Extensive Literature Review of Various Routing Protocols in Delay Tolerant...IRJET Journal
This document summarizes an extensive literature review on routing protocols in delay tolerant networks (DTNs). It begins by defining DTNs as wireless networks with intermittent connectivity where nodes use a store-carry-forward mechanism. Common routing protocols for DTNs like epidemic, spray and wait, and prophet are described. The document then reviews several papers that propose and evaluate new routing algorithms or improvements for DTNs, analyzing metrics like delivery ratio, overhead, and latency. Key factors considered include node contact histories, social characteristics, energy constraints, and message prioritization. Finally, it suggests the contact duration between nodes could be an important parameter to further optimize routing in DTNs.
This document evaluates different spray-based routing approaches for delay tolerant networks (DTNs). It summarizes the spray and wait routing algorithm and some variants proposed to improve it. The document performs simulations to compare the delivery ratio, overhead ratio, and average latency of the basic spray and wait approaches to variants that incorporate utility metrics or acknowledgements. The results show that a composite method that includes delivery predictability and acknowledgements outperforms the other variants in terms of delivery ratio and average latency.
These days, the interests in challenged networks are increasing and many researches are performed to seek a reliable end-to-end connectivity under harsh environments, which have a long propagation delay, high error rates, low data rate, and intermittent connectivity. Delay Tolerant Network was introduced to provide challenged networks with reliable transmission and interoperability with an overlay network concept. In this paper, we present comprehensive overview of Delay Tolerant Network and introduce a study case about the implementation of this network. This paper is designed to encourage the exploration of this field by giving basic concept and also motivate to investigate this area by presenting a study case at the end section.
---
Please contact to lailiaidi@gmail.com for download request
PRoPHET uses its delivery predictability of node encounters and transitivity to forward bundles to its neighbor node. Regardless of their distance, it faces delivery dilemmas in a source node and drawbacks of low delivery ratio and high delay in case two or more neighbor nodes carry equal delivery predictability. To solve such consequences, we propose a Distance and Probabilistic Routing Protocol using History of Encounters and Transitivity (DPRoPHET) with the use of cross layer implementation for distance value retrieval. Our simulation results show that, by adding distance metric to the existing delivery predictability vector, DPRoPHET outperforms PRoPHET.
Multicasting in Delay Tolerant Networks: Implementation and Performance AnalysisNagendra Posani
Delay Tolerant Networks(DTN) are a class of emerg- ing networks which experience intermittent connectivity and lack end-to-end paths due to absence of well-defined infrastructure. In this paper we explore the nuances of multicasting in DTNs. Multicasting enables efficient distribution of messages to a group of users, a paradigm that can be applicable in the context of DTNs. While multicasting in internet and ad-hoc networks has been studied extensively, realizing the same in DTNs is non- trivial given that many factors have to be considered. This paper, presents an implementation of multicast routing for various protocols in DTNs using ONE simulator. It also provides the analysis and performance results for the various protocols studies against the different movement models.
Trends and Challenges in Delay Tolerant Network (DTN) or Mobile Opportunistic...Dr. Mazlan Abbas
The document summarizes trends and challenges in delay tolerant networks (DTNs) or mobile opportunistic networks. It discusses the history and motivation for DTNs, which allow communication in disrupted environments without continuous end-to-end connectivity. The talk outlines common DTN routing protocols like epidemic routing, PROPHET, and spray and wait. It also presents example DTN applications for emergency response, wildlife tracking, and rural connectivity. Key challenges discussed include routing, mobility models, and leveraging social network properties for more efficient opportunistic communication.
The document discusses the Network News Transfer Protocol (NNTP), which uses a reliable stream-based transmission method for distributing, posting, and retrieving news articles. NNTP provides fast transmission through less expensive connections and has characteristics like privacy, security, reliability, and ease of use. NNTP facilitates server-to-server exchanges of latest articles and user-to-server connections where users access accessible newsgroups through news readers. In conclusion, NNTP has proven successful for exchanging ideas but needs improvements to meet growing internet demands and is widely used by newsgroups today.
LIVE media streaming applications have become more and more popular. IP multicast is the most efficient mechanism but Due to the practical issues of routers, IP multicast has not been widely deployed in the wide-area network infrastructure. The application-level solution build a peer-to-peer (P2P) overlay network out of unicast tunnels across cooperative participating users. P2P media streaming has become a promising approach to broadcast non interactive live media from one source to a large number of receivers. Design of a live P2P streaming system faces many challenges. Therefore, no single application-level multicast stream can meet the requirements of everyone. The proposed architecture aims to provide higher streaming quality and to provide robustness. In the Proposed System the Parallel efforts have been exerted in the media streaming field and networking field to avoid the problem of distributing LIVE video. The tree-based approaches are vulnerable for dynamic group variation but the gossip based mesh-like topology for overlay network systems allow peers to form multiple neighbors, so multilayered video contents are distributed among mesh-like network. Due to this multisource transmission scheme, packets can be exchanged among clients efficiently. In Proposed, The system can achieve improved performance on video delivery quality, bandwidth utilization, and service reliability when using the peer-assisted multipath transmission.
iaetsd Survey on cooperative relay based data transmissionIaetsd Iaetsd
The document discusses cooperative relay based data transmission and proposes a system to select the most energy efficient relay node for a source node to transmit data through. It analyzes different cooperative relaying techniques like amplify-and-forward, decode-and-forward, and compress-and-forward. The proposed system aims to minimize the source node's cost for cooperation by selecting the relay node that provides the highest energy efficiency. This allows high data transmission over long distances with improved energy efficiency compared to direct transmission without a relay.
Iaetsd an enhancement for content sharing overIaetsd Iaetsd
This document proposes an efficient content sharing scheme called discover-predict-deliver (DPD) for smartphone-based delay tolerant networks (DTNs). It uses a hidden Markov model to predict individual mobility information to improve content discovery and delivery. The existing system results in a 2% CPU overhead and reduces smartphone battery life by 15%. To minimize energy consumption, the document proposes using sensor scheduling schemes in an opportunistic context. It aims to solve problems in content sharing and minimize energy use through sensor scheduling.
Always Offline: Delay-Tolerant Networking for the Internet of ThingsDaniel Austin
Discussion of IoT networks and DTNs, including some speculation on social behavior-based routing and the similarities between the IoT and the ecology of living things.
Deterministic Formulization of End-to-End Delay and Bandwidth Efficiency for ...CSCJournals
End-System multicasting (ESM) is a promising application-layer scheme that has been recently proposed for implementing multicast routing in the application layer as a practical alternative to the IP multicasting. Moreover, ESM is an efficient application layer solution where all the multicast functionality is shifted to the end users. However, the limitation in bandwidth and the fact that the message needs to be forwarded from host-to-host using unicast connection, and consequently incrementing the end-to-end delay of the transmission process, contribute to the price to pay for this new approach. Therefore, supporting high-speed real-time applications such as live streaming multimedia, videoconferencing, distributed simulations, and multiparty games require a sound understanding of these multicasting schemes such as IP multicast and ESM and the factors that might affect the end-user requirements. In this paper, we present both the analytical and the mathematical models for formalizing the end-to-end delay and the bandwidth efficiency of both IP and ESM multicast system. For the sake of the experimental verifications of the proposed models, numerical and simulation results are presented in this paper. Finally, the proposed formulization can be used to design and implement a more robust and efficient multicast systems for the future networks
Classroom Shared Whiteboard System using Multicast Protocolijtsrd
Multiple hosts wish to receive the same data from one or more senders. Multicast routing defines extensions to IP routers to support broadcasting data in IP networks. Multicast data is sent and received at a multicast address which defines a group. Data is sent and received in multicast groups via routing trees from sender s to receivers. Demonstrative lectures require to share the computer screen of the lecturer to the students as well as to make discussion with the students. The Multicast protocol is the most suitable method because of its capability in speed and better synchronized process. The word multicast is typically used to refer to IP multicast which is often employed for streaming media, and Internet television applications. Wit Yee Swe | Khaing Thazin Min | Khin Chan Myae Zin | Yi Yi Aung "Classroom Shared Whiteboard System using Multicast Protocol" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-3 | Issue-5 , August 2019, URL: https://www.ijtsrd.com/papers/ijtsrd27976.pdfPaper URL: https://www.ijtsrd.com/engineering/electronics-and-communication-engineering/27976/classroom-shared-whiteboard-system-using-multicast-protocol/wit-yee-swe
Peer-to-Peer streaming technology has become one of the major Internet applications as it offers the opportunity of broadcasting high quality video content to a large number of peers with low costs. It is widely accepted that with the efficient utilization of peers and server's upload capacities, peers can enjoy watching a high bit rate video with minimal end-to-end delay. In this paper, we present a practical scheduling algorithm that works in the challenging condition where no spare capacity is available, i.e., it maximally utilizes the resources and broadcasts the maximum streaming rate. Each peer contacts with only a small number of neighbours in the overlay network and autonomously subscribes to sub-streams according to a budget-model in such a way that the number of peers forwarding exactly one sub-stream will be maximized. The hop-count delay is also taken into account to construct a short depth trees. Finally, we show through simulation that peers dynamically converge to an efficient overlay structure with a short hop-count delay. Moreover, the proposed scheme gives nice features in the homogeneous case and overcomes SplitStream in all simulated scenarios.
This document discusses routing strategies in delay tolerant networks (DTNs) using wireless sensor network (WSN) nodes for localization applications. It first provides background on WSNs and DTNs, and then reviews common DTN routing protocols like epidemic routing, PROPHET, spray and wait, and MaxProp. The aim of the dissertation is to propose a new routing protocol for DTNs using WSN nodes where GPS is unavailable. It discusses using a hybrid of knowledge-based and additional node-based routing. The document outlines simulating the proposed filtered flooding protocol in NS-2 to evaluate delivery ratio and delay for a mining activity scenario. Results show delivery ratio is high for small networks but decreases with more nodes, while delay is
This document discusses the design of an overlay mesh for peer-to-peer live streaming that achieves low delay, accommodates diverse uplink bandwidths, and is adaptive to peer churn. It aims to minimize the maximum delay from the source to peers. The document proposes Fast-Mesh, a distributed algorithm where peers select parents based on the ratio of throughput to delay to optimize network power and delay. Simulation and experiments show Fast-Mesh substantially outperforms other approaches in terms of delay and source workload.
This presentation covers some of the routing protocols for Delay Tolerant Networks (DTN) along with the overview of the Opportunistic Networking Environment which can be used for performance evaluation/comparison of/among these DTN protocols.
P.S. This presentation is for educational purpose only. It is not meant for any commercialization at all.
Routing protocol for delay tolerant network a survey and comparisonPhearin Sok
Routing protocols for delay tolerant networks can be categorized as either flooding or forwarding strategies. Flooding strategies replicate messages to multiple nodes to increase delivery probability but use more resources, while forwarding strategies select a single path using network knowledge to minimize resource usage but have lower delivery probability. The survey compares these routing protocol categories and their advantages for different applications in delay tolerant networks, which must deal with intermittent connectivity and large delays.
This document summarizes research on Delay Tolerant Networks (DTNs). It discusses DTNs' characteristics including long latency, unstable topology, and lack of end-to-end paths. It also examines challenges like privacy concerns when humans are involved. The document reviews data forwarding techniques in DTNs like store-and-forward and epidemic routing. Potential applications are also discussed, such as providing rural internet access through projects like DakNet that use transportation infrastructure. The document concludes by encouraging further research on DTNs and their applications.
Delay tolerant networks allow communication in environments with intermittent connectivity, tolerating delays of days. They are also called intermittently connected mobile networks. Key challenges include unpredictable encounter schedules between nodes, limited network capacity, storage constraints on nodes, and energy efficiency. Routing protocols for DTNs include epidemic routing, where nodes exchange all data on encounter, and schemes that use knowledge of node locations or mobility patterns to move data closer to destinations opportunistically during encounters. Gradient routing uses metrics representing a node's delivery ability to pass messages to nodes moving the message progressively closer to the destination. Spray and wait limits message copies to control overhead. Security risks in DTNs include denial of service attacks due to long latencies enabling resource depletion, and
Delay tolerant network routing protocol a comprehensive survey with hybrid...eSAT Journals
Abstract
Delay –disruption Tolerant networks are sparse wireless network which is recently being used by the existing /current network for the purpose to connect devices or the underdeveloped area of the world that works in challenging environment. In DTN there majority of time does not exist the total path from source to target which is leads to the difficulty of how to route the packet in such environment. A communications network which is accomplished of storing packets temporarily in intermediate nodes, until the time an end-to-end route is re-established or regenerated is known as a delay tolerant networks. Routing in such network is very difficult and for that different routing protocols are developed. In this Survey paper we discuss about various routing Strategy and at the end compared the different routing protocol with their various performance metrics.
Keywords: Delay tolerant networks (DTNs), Erasure coding, Replication, Routing.
An Extensive Literature Review of Various Routing Protocols in Delay Tolerant...IRJET Journal
This document summarizes an extensive literature review on routing protocols in delay tolerant networks (DTNs). It begins by defining DTNs as wireless networks with intermittent connectivity where nodes use a store-carry-forward mechanism. Common routing protocols for DTNs like epidemic, spray and wait, and prophet are described. The document then reviews several papers that propose and evaluate new routing algorithms or improvements for DTNs, analyzing metrics like delivery ratio, overhead, and latency. Key factors considered include node contact histories, social characteristics, energy constraints, and message prioritization. Finally, it suggests the contact duration between nodes could be an important parameter to further optimize routing in DTNs.
This document evaluates different spray-based routing approaches for delay tolerant networks (DTNs). It summarizes the spray and wait routing algorithm and some variants proposed to improve it. The document performs simulations to compare the delivery ratio, overhead ratio, and average latency of the basic spray and wait approaches to variants that incorporate utility metrics or acknowledgements. The results show that a composite method that includes delivery predictability and acknowledgements outperforms the other variants in terms of delivery ratio and average latency.
These days, the interests in challenged networks are increasing and many researches are performed to seek a reliable end-to-end connectivity under harsh environments, which have a long propagation delay, high error rates, low data rate, and intermittent connectivity. Delay Tolerant Network was introduced to provide challenged networks with reliable transmission and interoperability with an overlay network concept. In this paper, we present comprehensive overview of Delay Tolerant Network and introduce a study case about the implementation of this network. This paper is designed to encourage the exploration of this field by giving basic concept and also motivate to investigate this area by presenting a study case at the end section.
---
Please contact to lailiaidi@gmail.com for download request
PRoPHET uses its delivery predictability of node encounters and transitivity to forward bundles to its neighbor node. Regardless of their distance, it faces delivery dilemmas in a source node and drawbacks of low delivery ratio and high delay in case two or more neighbor nodes carry equal delivery predictability. To solve such consequences, we propose a Distance and Probabilistic Routing Protocol using History of Encounters and Transitivity (DPRoPHET) with the use of cross layer implementation for distance value retrieval. Our simulation results show that, by adding distance metric to the existing delivery predictability vector, DPRoPHET outperforms PRoPHET.
Multicasting in Delay Tolerant Networks: Implementation and Performance AnalysisNagendra Posani
Delay Tolerant Networks(DTN) are a class of emerg- ing networks which experience intermittent connectivity and lack end-to-end paths due to absence of well-defined infrastructure. In this paper we explore the nuances of multicasting in DTNs. Multicasting enables efficient distribution of messages to a group of users, a paradigm that can be applicable in the context of DTNs. While multicasting in internet and ad-hoc networks has been studied extensively, realizing the same in DTNs is non- trivial given that many factors have to be considered. This paper, presents an implementation of multicast routing for various protocols in DTNs using ONE simulator. It also provides the analysis and performance results for the various protocols studies against the different movement models.
Trends and Challenges in Delay Tolerant Network (DTN) or Mobile Opportunistic...Dr. Mazlan Abbas
The document summarizes trends and challenges in delay tolerant networks (DTNs) or mobile opportunistic networks. It discusses the history and motivation for DTNs, which allow communication in disrupted environments without continuous end-to-end connectivity. The talk outlines common DTN routing protocols like epidemic routing, PROPHET, and spray and wait. It also presents example DTN applications for emergency response, wildlife tracking, and rural connectivity. Key challenges discussed include routing, mobility models, and leveraging social network properties for more efficient opportunistic communication.
The document discusses the Network News Transfer Protocol (NNTP), which uses a reliable stream-based transmission method for distributing, posting, and retrieving news articles. NNTP provides fast transmission through less expensive connections and has characteristics like privacy, security, reliability, and ease of use. NNTP facilitates server-to-server exchanges of latest articles and user-to-server connections where users access accessible newsgroups through news readers. In conclusion, NNTP has proven successful for exchanging ideas but needs improvements to meet growing internet demands and is widely used by newsgroups today.
LIVE media streaming applications have become more and more popular. IP multicast is the most efficient mechanism but Due to the practical issues of routers, IP multicast has not been widely deployed in the wide-area network infrastructure. The application-level solution build a peer-to-peer (P2P) overlay network out of unicast tunnels across cooperative participating users. P2P media streaming has become a promising approach to broadcast non interactive live media from one source to a large number of receivers. Design of a live P2P streaming system faces many challenges. Therefore, no single application-level multicast stream can meet the requirements of everyone. The proposed architecture aims to provide higher streaming quality and to provide robustness. In the Proposed System the Parallel efforts have been exerted in the media streaming field and networking field to avoid the problem of distributing LIVE video. The tree-based approaches are vulnerable for dynamic group variation but the gossip based mesh-like topology for overlay network systems allow peers to form multiple neighbors, so multilayered video contents are distributed among mesh-like network. Due to this multisource transmission scheme, packets can be exchanged among clients efficiently. In Proposed, The system can achieve improved performance on video delivery quality, bandwidth utilization, and service reliability when using the peer-assisted multipath transmission.
iaetsd Survey on cooperative relay based data transmissionIaetsd Iaetsd
The document discusses cooperative relay based data transmission and proposes a system to select the most energy efficient relay node for a source node to transmit data through. It analyzes different cooperative relaying techniques like amplify-and-forward, decode-and-forward, and compress-and-forward. The proposed system aims to minimize the source node's cost for cooperation by selecting the relay node that provides the highest energy efficiency. This allows high data transmission over long distances with improved energy efficiency compared to direct transmission without a relay.
Iaetsd an enhancement for content sharing overIaetsd Iaetsd
This document proposes an efficient content sharing scheme called discover-predict-deliver (DPD) for smartphone-based delay tolerant networks (DTNs). It uses a hidden Markov model to predict individual mobility information to improve content discovery and delivery. The existing system results in a 2% CPU overhead and reduces smartphone battery life by 15%. To minimize energy consumption, the document proposes using sensor scheduling schemes in an opportunistic context. It aims to solve problems in content sharing and minimize energy use through sensor scheduling.
Always Offline: Delay-Tolerant Networking for the Internet of ThingsDaniel Austin
Discussion of IoT networks and DTNs, including some speculation on social behavior-based routing and the similarities between the IoT and the ecology of living things.
Deterministic Formulization of End-to-End Delay and Bandwidth Efficiency for ...CSCJournals
End-System multicasting (ESM) is a promising application-layer scheme that has been recently proposed for implementing multicast routing in the application layer as a practical alternative to the IP multicasting. Moreover, ESM is an efficient application layer solution where all the multicast functionality is shifted to the end users. However, the limitation in bandwidth and the fact that the message needs to be forwarded from host-to-host using unicast connection, and consequently incrementing the end-to-end delay of the transmission process, contribute to the price to pay for this new approach. Therefore, supporting high-speed real-time applications such as live streaming multimedia, videoconferencing, distributed simulations, and multiparty games require a sound understanding of these multicasting schemes such as IP multicast and ESM and the factors that might affect the end-user requirements. In this paper, we present both the analytical and the mathematical models for formalizing the end-to-end delay and the bandwidth efficiency of both IP and ESM multicast system. For the sake of the experimental verifications of the proposed models, numerical and simulation results are presented in this paper. Finally, the proposed formulization can be used to design and implement a more robust and efficient multicast systems for the future networks
Classroom Shared Whiteboard System using Multicast Protocolijtsrd
Multiple hosts wish to receive the same data from one or more senders. Multicast routing defines extensions to IP routers to support broadcasting data in IP networks. Multicast data is sent and received at a multicast address which defines a group. Data is sent and received in multicast groups via routing trees from sender s to receivers. Demonstrative lectures require to share the computer screen of the lecturer to the students as well as to make discussion with the students. The Multicast protocol is the most suitable method because of its capability in speed and better synchronized process. The word multicast is typically used to refer to IP multicast which is often employed for streaming media, and Internet television applications. Wit Yee Swe | Khaing Thazin Min | Khin Chan Myae Zin | Yi Yi Aung "Classroom Shared Whiteboard System using Multicast Protocol" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-3 | Issue-5 , August 2019, URL: https://www.ijtsrd.com/papers/ijtsrd27976.pdfPaper URL: https://www.ijtsrd.com/engineering/electronics-and-communication-engineering/27976/classroom-shared-whiteboard-system-using-multicast-protocol/wit-yee-swe
Edge device multi-unicasting for video streamingTal Lavian Ph.D.
After a decade of research and development, IP multicast has still not been deployed widely in the global Internet due to many open technical issues: lack of admission control, poorly scaled with large number of groups, and requiring substantial infrastructure modifications. To provide the benefits of IP multicast without requiring direct router support or the presence of a physical broadcast medium, various Application Level Multicast (ALM) models have been attempted. However, there are still several problems with ALM: unnecessary coupling between an application and its multicasting supports, bottleneck problem at network access links and considerable processing power required at the end nodes to support ALM mechanisms. This paper proposes an architecture to address these problems by delegating application-multicasting support mechanisms to smart edge devices associated with the application end nodes. The architecture gives rise to an interesting Edge Device Any-casting technology that lies between the IP-multicasting and the Application Layer Multicasting and enjoys the benefits of both. Furthermore, the architecture may provide sufficient cost-benefit for adoption by service providers. The paper presents initial results obtained from the implementation of a video streaming application over the testbed that implements the proposed architecture.
Multicast data transmission using the Distance Vector Multicast Routing Protocol (DVMRP) is described. DVMRP combines features of RIP routing with the Truncated Reverse Path Broadcasting algorithm to efficiently transmit multicast datagrams from sources to receivers through minimum cost paths. There are several ways to implement multicast including one-to-all unicast, application-level multicast using receiver replication, and explicit multicast using router replication. DVMRP provides reliable and fast data transfer between sources and destinations in a network.
A Novel High Order Tree for Securing Key Management for Multicast ServicesIOSR Journals
The document proposes a novel high order tree scheme called MKE-MGKM for securing key management in multiple multicast group environments. The MKE-MGKM scheme uses asymmetric master and slave keys generated from a master key encryption algorithm. This asymmetry allows rekeying overhead to be reduced by modifying only the master key when a slave key is updated, while keeping other slave keys unchanged. Numerical analysis and simulations show the MKE-MGKM scheme can reduce the storage overhead of a key distribution center by 75% and the storage overhead of a user by up to 85%, as well as communication overhead by 60%, compared to existing schemes. The scheme aims to address limitations of existing group key management schemes for multiple co-existing multicast
Multi-path TCP (MP-TCP) has the prospective to
significantly advance applications performance by using multiple
paths evidently. Multipath TCP was intended and employed as a
backward compatible replacement for TCP. For this reason, it
exposes the standard socket API to the applications that cannot
control the utilization of the different paths. This is a key feature
for applications that are unaware of the multipath nature of the
network. On the contrary, this is a limitation for applications
that could benefit from specific knowledge to use multiple paths
in a way that fits their needs. Therefore, hosts are often
connected by multiple paths, but TCP restricts communications
to a single path per transport connection. Resource usage within
the network would be more efficient where these multiple paths
able to be used concurrently. This should enhance user
experience through improved resilience to network failure and
higher throughput. In this paper, we have focused on MPTCP
and discussed the performance issues and its solution. We believe
our concept will be useful for future works of MPTCP
performance evaluation.
This document analyzes the performance of various application protocols for mobile ad hoc networks (MANETs) using network simulation software. It simulates MANETs with different numbers of nodes (3, 5, 10 nodes) running the File Transfer Protocol (FTP) and Hypertext Transfer Protocol (HTTP). The simulation measures three performance metrics - traffic received, network load, and media access delay - for each protocol as the number of nodes increases. The results show that as node count increases, network load and media access delay increase for both protocols, while traffic received decreases for FTP but does not change linearly for HTTP. The document concludes that increasing nodes degrades performance for MANET applications.
This document analyzes the performance of application protocols like HTTP and FTP in a mobile ad hoc network (MANET) using the network simulation tool OPNET. It describes 6 simulation scenarios with varying numbers of nodes. Traffic is generated using FTP and HTTP applications. Key metrics like throughput, network load, and media access delay are observed. The document finds that as the number of nodes increases, these performance metrics are affected.
A Machine Learning based Network Sharing System Design with MPTCPIJMREMJournal
The information and communication technologies (ICT) integrate different types of wireless communication to
provide IT-enabled services and applications. The great majority end devices are equipped with multiple network
interfaces such as Wi-Fi and 4G. Our goal is to integrate the available network interfaces and technologies to
enhance seamless communication efficiency and increase resources utilization. We proposed a heterogeneous
network management algorithm based on machine learning methods which includes roaming and sharing
functions. The roaming function provides the multiple network resources in physical and media access control
layers. The sharing function supports multiple network resources allocation and the service handover process
based on the Multi-Path TCP protocol. The simulation result also shows that the proposed scheme can increase
the network bandwidth utilization effectively. The sharing system could be used in home, mobile and vehicular
environments to realize ubiquitous social sharing networks.
A Machine Learning based Network Sharing System Design with MPTCPIJMREMJournal
1) The document describes a machine learning-based network sharing system that uses Multipath TCP to integrate multiple network interfaces and allocate bandwidth resources for multiple users.
2) The system includes roaming and sharing functions, where roaming chooses the best network and sharing allocates resources across available networks.
3) A heterogeneous network management algorithm is proposed that monitors network status, predicts handovers between networks, and uses a machine learning approach to optimize resource utilization and load balancing across different network interfaces.
This document discusses implementing a multicast communication system using an existing data network to provide free TV channels. It describes how a company can set up such a system to offer IP television services, saving money compared to proprietary TV systems. The document outlines the advantages of multicast communication like reduced bandwidth usage compared to unicast. It also discusses challenges like lack of reliability and potential security issues. It provides an overview of the IGMP and PIM routing protocols that enable multicast routing and how they work with unicast routing.
Implementing multicast communication system making use of an existing data ne...iosrjce
This document discusses implementing a multicast communication system using an existing data network to offer free TV channels. It describes how a company can use multicast routing protocols like PIM and IGMP to efficiently stream video to multiple devices. The key advantages of multicast are reducing bandwidth usage and server load compared to unicast. It also discusses challenges like lack of reliability and potential security issues. The document provides an overview of PIM sparse and dense modes and how to configure a prototype multicast network with load balancing and failover between multiple rendezvous points for high availability.
This document proposes a mechanism for distributing limited bandwidth among cloud computing users effectively. It divides users into three groups based on their network usage capacities. The groups were assigned different bandwidth allotments: administrators received 1000BaseT, medium users received 100BaseT, and normal users received 10BaseT. Simulations measured the network performance for each group in terms of throughput, response time, and utilization. The results showed the bandwidth was managed optimally, with each group achieving maximum cloud service usage within their allotted capacities.
Bandwidth Management on Cloud Computing 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.
Computer network is becoming more popular and common, the need to use the broadband connection services (e-learning - online training, video conferencing - online conference, IPTV - digital TV ...) of organizations and individuals is increasing. Multicast is an effective mechanism for the transmission of information and data to many recipients simultaneously. Multicast is a routing problem from a source node to a receiver node set, also known as the routing from one point to multipoint. The advances in technology and multimedia applications emerge quickly has provided great motivation for the application of new real-time multi-point. Many multi-point applications will not function properly if the QoS (quality of service) can not be guaranteed. Therefore, multi-point algorithms must be able to meet the QoS constraints (cost, reliability, bandwidth, jitter, delay...). The objective of multicast routing algorithms guarantee QoS is to provide routing algorithms have the ability to recognize the tree to satisfy the maximum of traffic streams with QoS requirements. Most multicast algorithms on MPLS (MultiProtocol Label Switching) considered the unique QoS constraint as bandwidth. The other QoS constraints can be converted into bandwidth efficiency. Starting from this reality, this paper research multicast routing algorithms guarantee bandwidth and propose new algorithm compares with existing ones.
This document discusses traffic engineering with Multi-Protocol Label Switching (MPLS) in core networks. It begins with an introduction to traffic engineering and defines problems in current IP networks like network congestion and IP address shortage. The document then discusses existing approaches like IP networks and Open Shortest Path First (OSPF) routing protocol, highlighting their benefits and limitations. The aim and objectives of exploring MPLS as an improved solution are provided.
Audio Video Conferencing in Distributed Brokering SystemsVideoguy
This document discusses using a distributed brokering system called NaradaBrokering to support audio/video conferencing. It describes how NaradaBrokering can encapsulate multimedia content in specialized events that facilitate fast routing while incorporating relevant headers. The paper aims to draw on performance-enhancing features while avoiding degrading ones. It presents benchmarks and observations from a real-time test to explore NaradaBrokering's deployability for real-time multimedia systems.
Video transmission over wireless networks is considered the most interesting application in our daily life nowadays. As
mobile data rates continue to increase and more people rely on wireless transmission, the amount of video transmitted over at least one
wireless hop will likely continue to increase. This kind of application needs large bandwidth, efficient routing protocols, and content
delivery methods to provide smooth video playback to the receivers. Current generation wireless networks are likely to operate on
internet technology combined with various access technologies. Achieving effective bandwidth aggregation in wireless environments
raises several challenges related to deployment, link heterogeneity, Network congestion, network fluctuation, and energy consumption.
In this work, an overview of technical challenges of over wireless networks is presented. A survey of wireless networks in recent video
transmission schemes is introduced. Demonstration results of few scenarios are showed.
Video streaming over Ad hoc on-demand distance vector routing protocoljournalBEEI
Video streaming is content sent in compressed form over the netwoks and viwed the users progressively. The transmission of video with the end goal that it can be prepared as consistent and nonstop stream. The point is that to give client support to client at anyplace and at whatever time. Mobile Ad hoc Networks (MANETs) are considered an attractive nertwork for information transmission in many applications where the customer programme can begin showing the information before the whole record has been transmitted.
Ad hoc On-demand Distance Vector (AODV) protocol is considered as one of the most important routing protocols in MANET. However, routing protocols assume a crucial part in transmission of information over the network. This paper investigates the performance of AODV Routing Protocol under video traffic over PHY IEEE 802.11g. The protocol model was developed in OPNET. Different outcomes from simulation based models are analyzed and appropriate reasons are also discussed. A different scenarios of video streaming were used. The metric in terms of throughput, end to end delay, packet delivery ratio and routing overhead were measured.
A comparision with GRP and GRP are also reported.
This document describes the development of a hybrid architecture called WebCOM that supports group communication over the internet. WebCOM combines client-server and peer-to-peer architectures to address issues of performance, scalability, reliability and accessibility. It integrates a reliable multicast protocol called LRMP to enable direct communication between clients. The hybrid architecture reduces server load and improves response times as the number of users increases by allowing direct peer-to-peer communication when possible.
Similar to Comparative Analysis and Secure ALM P2P Overlay Multicasting of Various Multicast Routing Techniques (20)
A Novel Method for Prevention of Bandwidth Distributed Denial of Service AttacksIJERD Editor
Distributed Denial of Service (DDoS) Attacks became a massive threat to the Internet. Traditional
Architecture of internet is vulnerable to the attacks like DDoS. Attacker primarily acquire his army of Zombies,
then that army will be instructed by the Attacker that when to start an attack and on whom the attack should be
done. In this paper, different techniques which are used to perform DDoS Attacks, Tools that were used to
perform Attacks and Countermeasures in order to detect the attackers and eliminate the Bandwidth Distributed
Denial of Service attacks (B-DDoS) are reviewed. DDoS Attacks were done by using various Flooding
techniques which are used in DDoS attack.
The main purpose of this paper is to design an architecture which can reduce the Bandwidth
Distributed Denial of service Attack and make the victim site or server available for the normal users by
eliminating the zombie machines. Our Primary focus of this paper is to dispute how normal machines are
turning into zombies (Bots), how attack is been initiated, DDoS attack procedure and how an organization can
save their server from being a DDoS victim. In order to present this we implemented a simulated environment
with Cisco switches, Routers, Firewall, some virtual machines and some Attack tools to display a real DDoS
attack. By using Time scheduling, Resource Limiting, System log, Access Control List and some Modular
policy Framework we stopped the attack and identified the Attacker (Bot) machines
Hearing loss is one of the most common human impairments. It is estimated that by year 2015 more
than 700 million people will suffer mild deafness. Most can be helped by hearing aid devices depending on the
severity of their hearing loss. This paper describes the implementation and characterization details of a dual
channel transmitter front end (TFE) for digital hearing aid (DHA) applications that use novel micro
electromechanical- systems (MEMS) audio transducers and ultra-low power-scalable analog-to-digital
converters (ADCs), which enable a very-low form factor, energy-efficient implementation for next-generation
DHA. The contribution of the design is the implementation of the dual channel MEMS microphones and powerscalable
ADC system.
Influence of tensile behaviour of slab on the structural Behaviour of shear c...IJERD Editor
-A composite beam is composed of a steel beam and a slab connected by means of shear connectors
like studs installed on the top flange of the steel beam to form a structure behaving monolithically. This study
analyzes the effects of the tensile behavior of the slab on the structural behavior of the shear connection like slip
stiffness and maximum shear force in composite beams subjected to hogging moment. The results show that the
shear studs located in the crack-concentration zones due to large hogging moments sustain significantly smaller
shear force and slip stiffness than the other zones. Moreover, the reduction of the slip stiffness in the shear
connection appears also to be closely related to the change in the tensile strain of rebar according to the increase
of the load. Further experimental and analytical studies shall be conducted considering variables such as the
reinforcement ratio and the arrangement of shear connectors to achieve efficient design of the shear connection
in composite beams subjected to hogging moment.
Gold prospecting using Remote Sensing ‘A case study of Sudan’IJERD Editor
Gold has been extracted from northeast Africa for more than 5000 years, and this may be the first
place where the metal was extracted. The Arabian-Nubian Shield (ANS) is an exposure of Precambrian
crystalline rocks on the flanks of the Red Sea. The crystalline rocks are mostly Neoproterozoic in age. ANS
includes the nations of Israel, Jordan. Egypt, Saudi Arabia, Sudan, Eritrea, Ethiopia, Yemen, and Somalia.
Arabian Nubian Shield Consists of juvenile continental crest that formed between 900 550 Ma, when intra
oceanic arc welded together along ophiolite decorated arc. Primary Au mineralization probably developed in
association with the growth of intra oceanic arc and evolution of back arc. Multiple episodes of deformation
have obscured the primary metallogenic setting, but at least some of the deposits preserve evidence that they
originate as sea floor massive sulphide deposits.
The Red Sea Hills Region is a vast span of rugged, harsh and inhospitable sector of the Earth with
inimical moon-like terrain, nevertheless since ancient times it is famed to be an abode of gold and was a major
source of wealth for the Pharaohs of ancient Egypt. The Pharaohs old workings have been periodically
rediscovered through time. Recent endeavours by the Geological Research Authority of Sudan led to the
discovery of a score of occurrences with gold and massive sulphide mineralizations. In the nineties of the
previous century the Geological Research Authority of Sudan (GRAS) in cooperation with BRGM utilized
satellite data of Landsat TM using spectral ratio technique to map possible mineralized zones in the Red Sea
Hills of Sudan. The outcome of the study mapped a gossan type gold mineralization. Band ratio technique was
applied to Arbaat area and a signature of alteration zone was detected. The alteration zones are commonly
associated with mineralization. The alteration zones are commonly associated with mineralization. A filed check
confirmed the existence of stock work of gold bearing quartz in the alteration zone. Another type of gold
mineralization that was discovered using remote sensing is the gold associated with metachert in the Atmur
Desert.
Reducing Corrosion Rate by Welding DesignIJERD Editor
This document summarizes a study on reducing corrosion rates in steel through welding design. The researchers tested different welding groove designs (X, V, 1/2X, 1/2V) and preheating temperatures (400°C, 500°C, 600°C) on ferritic malleable iron samples. Testing found that X and V groove designs with 500°C and 600°C preheating had corrosion rates of 0.5-0.69% weight loss after 14 days, compared to 0.57-0.76% for 400°C preheating. Higher preheating reduced residual stresses which decreased corrosion. Residual stresses were 1.7 MPa for optimal X groove and 600°C
Router 1X3 – RTL Design and VerificationIJERD Editor
Routing is the process of moving a packet of data from source to destination and enables messages
to pass from one computer to another and eventually reach the target machine. A router is a networking device
that forwards data packets between computer networks. It is connected to two or more data lines from different
networks (as opposed to a network switch, which connects data lines from one single network). This paper,
mainly emphasizes upon the study of router device, it‟s top level architecture, and how various sub-modules of
router i.e. Register, FIFO, FSM and Synchronizer are synthesized, and simulated and finally connected to its top
module.
Active Power Exchange in Distributed Power-Flow Controller (DPFC) At Third Ha...IJERD Editor
This paper presents a component within the flexible ac-transmission system (FACTS) family, called
distributed power-flow controller (DPFC). The DPFC is derived from the unified power-flow controller (UPFC)
with an eliminated common dc link. The DPFC has the same control capabilities as the UPFC, which comprise
the adjustment of the line impedance, the transmission angle, and the bus voltage. The active power exchange
between the shunt and series converters, which is through the common dc link in the UPFC, is now through the
transmission lines at the third-harmonic frequency. DPFC multiple small-size single-phase converters which
reduces the cost of equipment, no voltage isolation between phases, increases redundancy and there by
reliability increases. The principle and analysis of the DPFC are presented in this paper and the corresponding
simulation results that are carried out on a scaled prototype are also shown.
Mitigation of Voltage Sag/Swell with Fuzzy Control Reduced Rating DVRIJERD Editor
Power quality has been an issue that is becoming increasingly pivotal in industrial electricity
consumers point of view in recent times. Modern industries employ Sensitive power electronic equipments,
control devices and non-linear loads as part of automated processes to increase energy efficiency and
productivity. Voltage disturbances are the most common power quality problem due to this the use of a large
numbers of sophisticated and sensitive electronic equipment in industrial systems is increased. This paper
discusses the design and simulation of dynamic voltage restorer for improvement of power quality and
reduce the harmonics distortion of sensitive loads. Power quality problem is occurring at non-standard
voltage, current and frequency. Electronic devices are very sensitive loads. In power system voltage sag,
swell, flicker and harmonics are some of the problem to the sensitive load. The compensation capability
of a DVR depends primarily on the maximum voltage injection ability and the amount of stored
energy available within the restorer. This device is connected in series with the distribution feeder at
medium voltage. A fuzzy logic control is used to produce the gate pulses for control circuit of DVR and the
circuit is simulated by using MATLAB/SIMULINK software.
Study on the Fused Deposition Modelling In Additive ManufacturingIJERD Editor
Additive manufacturing process, also popularly known as 3-D printing, is a process where a product
is created in a succession of layers. It is based on a novel materials incremental manufacturing philosophy.
Unlike conventional manufacturing processes where material is removed from a given work price to derive the
final shape of a product, 3-D printing develops the product from scratch thus obviating the necessity to cut away
materials. This prevents wastage of raw materials. Commonly used raw materials for the process are ABS
plastic, PLA and nylon. Recently the use of gold, bronze and wood has also been implemented. The complexity
factor of this process is 0% as in any object of any shape and size can be manufactured.
Spyware triggering system by particular string valueIJERD Editor
This computer programme can be used for good and bad purpose in hacking or in any general
purpose. We can say it is next step for hacking techniques such as keylogger and spyware. Once in this system if
user or hacker store particular string as a input after that software continually compare typing activity of user
with that stored string and if it is match then launch spyware programme.
A Blind Steganalysis on JPEG Gray Level Image Based on Statistical Features a...IJERD Editor
This paper presents a blind steganalysis technique to effectively attack the JPEG steganographic
schemes i.e. Jsteg, F5, Outguess and DWT Based. The proposed method exploits the correlations between
block-DCTcoefficients from intra-block and inter-block relation and the statistical moments of characteristic
functions of the test image is selected as features. The features are extracted from the BDCT JPEG 2-array.
Support Vector Machine with cross-validation is implemented for the classification.The proposed scheme gives
improved outcome in attacking.
Secure Image Transmission for Cloud Storage System Using Hybrid SchemeIJERD Editor
- Data over the cloud is transferred or transmitted between servers and users. Privacy of that
data is very important as it belongs to personal information. If data get hacked by the hacker, can be
used to defame a person’s social data. Sometimes delay are held during data transmission. i.e. Mobile
communication, bandwidth is low. Hence compression algorithms are proposed for fast and efficient
transmission, encryption is used for security purposes and blurring is used by providing additional
layers of security. These algorithms are hybridized for having a robust and efficient security and
transmission over cloud storage system.
Application of Buckley-Leverett Equation in Modeling the Radius of Invasion i...IJERD Editor
A thorough review of existing literature indicates that the Buckley-Leverett equation only analyzes
waterflood practices directly without any adjustments on real reservoir scenarios. By doing so, quite a number
of errors are introduced into these analyses. Also, for most waterflood scenarios, a radial investigation is more
appropriate than a simplified linear system. This study investigates the adoption of the Buckley-Leverett
equation to estimate the radius invasion of the displacing fluid during waterflooding. The model is also adopted
for a Microbial flood and a comparative analysis is conducted for both waterflooding and microbial flooding.
Results shown from the analysis doesn’t only records a success in determining the radial distance of the leading
edge of water during the flooding process, but also gives a clearer understanding of the applicability of
microbes to enhance oil production through in-situ production of bio-products like bio surfactans, biogenic
gases, bio acids etc.
Gesture Gaming on the World Wide Web Using an Ordinary Web CameraIJERD Editor
- Gesture gaming is a method by which users having a laptop/pc/x-box play games using natural or
bodily gestures. This paper presents a way of playing free flash games on the internet using an ordinary webcam
with the help of open source technologies. Emphasis in human activity recognition is given on the pose
estimation and the consistency in the pose of the player. These are estimated with the help of an ordinary web
camera having different resolutions from VGA to 20mps. Our work involved giving a 10 second documentary to
the user on how to play a particular game using gestures and what are the various kinds of gestures that can be
performed in front of the system. The initial inputs of the RGB values for the gesture component is obtained by
instructing the user to place his component in a red box in about 10 seconds after the short documentary before
the game is finished. Later the system opens the concerned game on the internet on popular flash game sites like
miniclip, games arcade, GameStop etc and loads the game clicking at various places and brings the state to a
place where the user is to perform only gestures to start playing the game. At any point of time the user can call
off the game by hitting the esc key and the program will release all of the controls and return to the desktop. It
was noted that the results obtained using an ordinary webcam matched that of the Kinect and the users could
relive the gaming experience of the free flash games on the net. Therefore effective in game advertising could
also be achieved thus resulting in a disruptive growth to the advertising firms.
Hardware Analysis of Resonant Frequency Converter Using Isolated Circuits And...IJERD Editor
-LLC resonant frequency converter is basically a combo of series as well as parallel resonant ckt. For
LCC resonant converter it is associated with a disadvantage that, though it has two resonant frequencies, the
lower resonant frequency is in ZCS region[5]. For this application, we are not able to design the converter
working at this resonant frequency. LLC resonant converter existed for a very long time but because of
unknown characteristic of this converter it was used as a series resonant converter with basically a passive
(resistive) load. . Here, it was designed to operate in switching frequency higher than resonant frequency of the
series resonant tank of Lr and Cr converter acts very similar to Series Resonant Converter. The benefit of LLC
resonant converter is narrow switching frequency range with light load[6] . Basically, the control ckt plays a
very imp. role and hence 555 Timer used here provides a perfect square wave as the control ckt provides no
slew rate which makes the square wave really strong and impenetrable. The dead band circuit provides the
exclusive dead band in micro seconds so as to avoid the simultaneous firing of two pairs of IGBT’s where one
pair switches off and the other on for a slightest period of time. Hence, the isolator ckt here is associated with
each and every ckt used because it acts as a driver and an isolation to each of the IGBT is provided with one
exclusive transformer supply[3]. The IGBT’s are fired using the appropriate signal using the previous boards
and hence at last a high frequency rectifier ckt with a filtering capacitor is used to get an exact dc
waveform .The basic goal of this particular analysis is to observe the wave forms and characteristics of
converters with differently positioned passive elements in the form of tank circuits.
Simulated Analysis of Resonant Frequency Converter Using Different Tank Circu...IJERD Editor
LLC resonant frequency converter is basically a combo of series as well as parallel resonant ckt. For
LCC resonant converter it is associated with a disadvantage that, though it has two resonant frequencies, the
lower resonant frequency is in ZCS region [5]. For this application, we are not able to design the converter
working at this resonant frequency. LLC resonant converter existed for a very long time but because of
unknown characteristic of this converter it was used as a series resonant converter with basically a passive
(resistive) load. . Here, it was designed to operate in switching frequency higher than resonant frequency of the
series resonant tank of Lr and Cr converter acts very similar to Series Resonant Converter. The benefit of LLC
resonant converter is narrow switching frequency range with light load[6] . Basically, the control ckt plays a
very imp. role and hence 555 Timer used here provides a perfect square wave as the control ckt provides no
slew rate which makes the square wave really strong and impenetrable. The dead band circuit provides the
exclusive dead band in micro seconds so as to avoid the simultaneous firing of two pairs of IGBT’s where one
pair switches off and the other on for a slightest period of time. Hence, the isolator ckt here is associated with
each and every ckt used because it acts as a driver and an isolation to each of the IGBT is provided with one
exclusive transformer supply[3]. The IGBT’s are fired using the appropriate signal using the previous boards
and hence at last a high frequency rectifier ckt with a filtering capacitor is used to get an exact dc
waveform .The basic goal of this particular analysis is to observe the wave forms and characteristics of
converters with differently positioned passive elements in the form of tank circuits. The supported simulation
is done through PSIM 6.0 software tool
Amateurs Radio operator, also known as HAM communicates with other HAMs through Radio
waves. Wireless communication in which Moon is used as natural satellite is called Moon-bounce or EME
(Earth -Moon-Earth) technique. Long distance communication (DXing) using Very High Frequency (VHF)
operated amateur HAM radio was difficult. Even with the modest setup having good transceiver, power
amplifier and high gain antenna with high directivity, VHF DXing is possible. Generally 2X11 YAGI antenna
along with rotor to set horizontal and vertical angle is used. Moon tracking software gives exact location,
visibility of Moon at both the stations and other vital data to acquire real time position of moon.
“MS-Extractor: An Innovative Approach to Extract Microsatellites on „Y‟ Chrom...IJERD Editor
Simple Sequence Repeats (SSR), also known as Microsatellites, have been extensively used as
molecular markers due to their abundance and high degree of polymorphism. The nucleotide sequences of
polymorphic forms of the same gene should be 99.9% identical. So, Microsatellites extraction from the Gene is
crucial. However, Microsatellites repeat count is compared, if they differ largely, he has some disorder. The Y
chromosome likely contains 50 to 60 genes that provide instructions for making proteins. Because only males
have the Y chromosome, the genes on this chromosome tend to be involved in male sex determination and
development. Several Microsatellite Extractors exist and they fail to extract microsatellites on large data sets of
giga bytes and tera bytes in size. The proposed tool “MS-Extractor: An Innovative Approach to extract
Microsatellites on „Y‟ Chromosome” can extract both Perfect as well as Imperfect Microsatellites from large
data sets of human genome „Y‟. The proposed system uses string matching with sliding window approach to
locate Microsatellites and extracts them.
Importance of Measurements in Smart GridIJERD Editor
- The need to get reliable supply, independence from fossil fuels, and capability to provide clean
energy at a fixed and lower cost, the existing power grid structure is transforming into Smart Grid. The
development of a smart energy distribution grid is a current goal of many nations. A Smart Grid should have
new capabilities such as self-healing, high reliability, energy management, and real-time pricing. This new era
of smart future grid will lead to major changes in existing technologies at generation, transmission and
distribution levels. The incorporation of renewable energy resources and distribution generators in the existing
grid will increase the complexity, optimization problems and instability of the system. This will lead to a
paradigm shift in the instrumentation and control requirements for Smart Grids for high quality, stable and
reliable electricity supply of power. The monitoring of the grid system state and stability relies on the
availability of reliable measurement of data. In this paper the measurement areas that highlight new
measurement challenges, development of the Smart Meters and the critical parameters of electric energy to be
monitored for improving the reliability of power systems has been discussed.
Study of Macro level Properties of SCC using GGBS and Lime stone powderIJERD Editor
The document summarizes a study on the use of ground granulated blast furnace slag (GGBS) and limestone powder to replace cement in self-compacting concrete (SCC). Tests were conducted on SCC mixes with 0-50% replacement of cement with GGBS and 0-20% replacement with limestone powder. The results showed that replacing 30% of cement with GGBS and 15% with limestone powder produced SCC with the highest compressive strength of 46MPa, meeting fresh property requirements. The study concluded that this ternary blend of cement, GGBS and limestone powder can improve SCC properties while reducing costs.
The Microsoft 365 Migration Tutorial For Beginner.pptxoperationspcvita
This presentation will help you understand the power of Microsoft 365. However, we have mentioned every productivity app included in Office 365. Additionally, we have suggested the migration situation related to Office 365 and how we can help you.
You can also read: https://www.systoolsgroup.com/updates/office-365-tenant-to-tenant-migration-step-by-step-complete-guide/
Must Know Postgres Extension for DBA and Developer during MigrationMydbops
Mydbops Opensource Database Meetup 16
Topic: Must-Know PostgreSQL Extensions for Developers and DBAs During Migration
Speaker: Deepak Mahto, Founder of DataCloudGaze Consulting
Date & Time: 8th June | 10 AM - 1 PM IST
Venue: Bangalore International Centre, Bangalore
Abstract: Discover how PostgreSQL extensions can be your secret weapon! This talk explores how key extensions enhance database capabilities and streamline the migration process for users moving from other relational databases like Oracle.
Key Takeaways:
* Learn about crucial extensions like oracle_fdw, pgtt, and pg_audit that ease migration complexities.
* Gain valuable strategies for implementing these extensions in PostgreSQL to achieve license freedom.
* Discover how these key extensions can empower both developers and DBAs during the migration process.
* Don't miss this chance to gain practical knowledge from an industry expert and stay updated on the latest open-source database trends.
Mydbops Managed Services specializes in taking the pain out of database management while optimizing performance. Since 2015, we have been providing top-notch support and assistance for the top three open-source databases: MySQL, MongoDB, and PostgreSQL.
Our team offers a wide range of services, including assistance, support, consulting, 24/7 operations, and expertise in all relevant technologies. We help organizations improve their database's performance, scalability, efficiency, and availability.
Contact us: info@mydbops.com
Visit: https://www.mydbops.com/
Follow us on LinkedIn: https://in.linkedin.com/company/mydbops
For more details and updates, please follow up the below links.
Meetup Page : https://www.meetup.com/mydbops-databa...
Twitter: https://twitter.com/mydbopsofficial
Blogs: https://www.mydbops.com/blog/
Facebook(Meta): https://www.facebook.com/mydbops/
QA or the Highway - Component Testing: Bridging the gap between frontend appl...zjhamm304
These are the slides for the presentation, "Component Testing: Bridging the gap between frontend applications" that was presented at QA or the Highway 2024 in Columbus, OH by Zachary Hamm.
AppSec PNW: Android and iOS Application Security with MobSFAjin Abraham
Mobile Security Framework - MobSF is a free and open source automated mobile application security testing environment designed to help security engineers, researchers, developers, and penetration testers to identify security vulnerabilities, malicious behaviours and privacy concerns in mobile applications using static and dynamic analysis. It supports all the popular mobile application binaries and source code formats built for Android and iOS devices. In addition to automated security assessment, it also offers an interactive testing environment to build and execute scenario based test/fuzz cases against the application.
This talk covers:
Using MobSF for static analysis of mobile applications.
Interactive dynamic security assessment of Android and iOS applications.
Solving Mobile app CTF challenges.
Reverse engineering and runtime analysis of Mobile malware.
How to shift left and integrate MobSF/mobsfscan SAST and DAST in your build pipeline.
Dandelion Hashtable: beyond billion requests per second on a commodity serverAntonios Katsarakis
This slide deck presents DLHT, a concurrent in-memory hashtable. Despite efforts to optimize hashtables, that go as far as sacrificing core functionality, state-of-the-art designs still incur multiple memory accesses per request and block request processing in three cases. First, most hashtables block while waiting for data to be retrieved from memory. Second, open-addressing designs, which represent the current state-of-the-art, either cannot free index slots on deletes or must block all requests to do so. Third, index resizes block every request until all objects are copied to the new index. Defying folklore wisdom, DLHT forgoes open-addressing and adopts a fully-featured and memory-aware closed-addressing design based on bounded cache-line-chaining. This design offers lock-free index operations and deletes that free slots instantly, (2) completes most requests with a single memory access, (3) utilizes software prefetching to hide memory latencies, and (4) employs a novel non-blocking and parallel resizing. In a commodity server and a memory-resident workload, DLHT surpasses 1.6B requests per second and provides 3.5x (12x) the throughput of the state-of-the-art closed-addressing (open-addressing) resizable hashtable on Gets (Deletes).
Introduction of Cybersecurity with OSS at Code Europe 2024Hiroshi SHIBATA
I develop the Ruby programming language, RubyGems, and Bundler, which are package managers for Ruby. Today, I will introduce how to enhance the security of your application using open-source software (OSS) examples from Ruby and RubyGems.
The first topic is CVE (Common Vulnerabilities and Exposures). I have published CVEs many times. But what exactly is a CVE? I'll provide a basic understanding of CVEs and explain how to detect and handle vulnerabilities in OSS.
Next, let's discuss package managers. Package managers play a critical role in the OSS ecosystem. I'll explain how to manage library dependencies in your application.
I'll share insights into how the Ruby and RubyGems core team works to keep our ecosystem safe. By the end of this talk, you'll have a better understanding of how to safeguard your code.
"NATO Hackathon Winner: AI-Powered Drug Search", Taras KlobaFwdays
This is a session that details how PostgreSQL's features and Azure AI Services can be effectively used to significantly enhance the search functionality in any application.
In this session, we'll share insights on how we used PostgreSQL to facilitate precise searches across multiple fields in our mobile application. The techniques include using LIKE and ILIKE operators and integrating a trigram-based search to handle potential misspellings, thereby increasing the search accuracy.
We'll also discuss how the azure_ai extension on PostgreSQL databases in Azure and Azure AI Services were utilized to create vectors from user input, a feature beneficial when users wish to find specific items based on text prompts. While our application's case study involves a drug search, the techniques and principles shared in this session can be adapted to improve search functionality in a wide range of applications. Join us to learn how PostgreSQL and Azure AI can be harnessed to enhance your application's search capability.
Northern Engraving | Modern Metal Trim, Nameplates and Appliance PanelsNorthern Engraving
What began over 115 years ago as a supplier of precision gauges to the automotive industry has evolved into being an industry leader in the manufacture of product branding, automotive cockpit trim and decorative appliance trim. Value-added services include in-house Design, Engineering, Program Management, Test Lab and Tool Shops.
"$10 thousand per minute of downtime: architecture, queues, streaming and fin...Fwdays
Direct losses from downtime in 1 minute = $5-$10 thousand dollars. Reputation is priceless.
As part of the talk, we will consider the architectural strategies necessary for the development of highly loaded fintech solutions. We will focus on using queues and streaming to efficiently work and manage large amounts of data in real-time and to minimize latency.
We will focus special attention on the architectural patterns used in the design of the fintech system, microservices and event-driven architecture, which ensure scalability, fault tolerance, and consistency of the entire system.
Conversational agents, or chatbots, are increasingly used to access all sorts of services using natural language. While open-domain chatbots - like ChatGPT - can converse on any topic, task-oriented chatbots - the focus of this paper - are designed for specific tasks, like booking a flight, obtaining customer support, or setting an appointment. Like any other software, task-oriented chatbots need to be properly tested, usually by defining and executing test scenarios (i.e., sequences of user-chatbot interactions). However, there is currently a lack of methods to quantify the completeness and strength of such test scenarios, which can lead to low-quality tests, and hence to buggy chatbots.
To fill this gap, we propose adapting mutation testing (MuT) for task-oriented chatbots. To this end, we introduce a set of mutation operators that emulate faults in chatbot designs, an architecture that enables MuT on chatbots built using heterogeneous technologies, and a practical realisation as an Eclipse plugin. Moreover, we evaluate the applicability, effectiveness and efficiency of our approach on open-source chatbots, with promising results.
What is an RPA CoE? Session 2 – CoE RolesDianaGray10
In this session, we will review the players involved in the CoE and how each role impacts opportunities.
Topics covered:
• What roles are essential?
• What place in the automation journey does each role play?
Speaker:
Chris Bolin, Senior Intelligent Automation Architect Anika Systems
In our second session, we shall learn all about the main features and fundamentals of UiPath Studio that enable us to use the building blocks for any automation project.
📕 Detailed agenda:
Variables and Datatypes
Workflow Layouts
Arguments
Control Flows and Loops
Conditional Statements
💻 Extra training through UiPath Academy:
Variables, Constants, and Arguments in Studio
Control Flow in Studio
Essentials of Automations: Exploring Attributes & Automation ParametersSafe Software
Building automations in FME Flow can save time, money, and help businesses scale by eliminating data silos and providing data to stakeholders in real-time. One essential component to orchestrating complex automations is the use of attributes & automation parameters (both formerly known as “keys”). In fact, it’s unlikely you’ll ever build an Automation without using these components, but what exactly are they?
Attributes & automation parameters enable the automation author to pass data values from one automation component to the next. During this webinar, our FME Flow Specialists will cover leveraging the three types of these output attributes & parameters in FME Flow: Event, Custom, and Automation. As a bonus, they’ll also be making use of the Split-Merge Block functionality.
You’ll leave this webinar with a better understanding of how to maximize the potential of automations by making use of attributes & automation parameters, with the ultimate goal of setting your enterprise integration workflows up on autopilot.
Essentials of Automations: Exploring Attributes & Automation Parameters
Comparative Analysis and Secure ALM P2P Overlay Multicasting of Various Multicast Routing Techniques
1. International Journal of Engineering Research and Development
e-ISSN: 2278-067X, p-ISSN: 2278-800X, www.ijerd.com
Volume 11, Issue 03 (March 2015), PP.70-78
70
Comparative Analysis and Secure ALM P2P Overlay
Multicasting of Various Multicast Routing Techniques
Lovedeep Singh1
, Er.Palwinder Singh Maan2
, Mandeep Kaur3
1
Student, M TECH Department of CSE DAVIET, Jalandhar, Punjab, India 144008
2
Department of Information Technology, DAVIET, Jalandhar, Punjab, India 144008
3
Student, M TECH Department of CSE DAVIET, Jalandhar, Punjab, India 144008
Abstract:- Multicasting is the delivery of a message or information to a group of destination computers
simultaneously in a single transmission from the source. The copies of the messages are automatically created
in other network elements like routers but only when the topology of the network requires it. Multicast is
implemented most commonly in IP multicast which is further could be employed in internet protocol
applications of streaming media. In the IP multicast the implementation of the multicast concept occurs at the
IP routing level where routers create optimal distribution paths for datagram sent to a multicast destination
address. At the Data Link Layer, multicast describes one-to-many distribution such as Ethernet multicast
addressing, Asynchronous Transfer Mode (ATM) point-to-multipoint virtual circuits (P2MP) multicast. In this
paper we have compared various multicasting mechanisms. The comparison is done on the basis of various
factors like complexity, overhead, maintenance, etc. The mechanisms that are part of the paper are a secure
ALM P2P multicasting technique for large scale networks using face recognition, IP multicasting techniques
and the overlay multicasting techniques. The comparison of these multicasting techniques will help us to design
and Implement a Secure Application-Level Multicasting (SALM) P2P Overlay Multicasting for large Scale
Network. The main objective of the paper is to discuss all the three above mentioned multicasting phenomenon’s
and compare them on the basis of certain criterion so as carved out the best of all which can be further used for
designing a secure multicasting technique which can take the best features of all combined together so as to get
effective and efficient technique for multicasting the throughput of the network by effective and efficient delivery
of the information to all the members of the group. The certain findings can be carved out of the comparison can
help us to create a multicasting technique with less incurring of delays so that information can be delivered in
limited time span and multicast path length so that efficient paths should be used so as to enhance performance
in multicasting. Moreover in this paper we will study & investigate other issues that degrades the performance
of Multicasting Techniques for large Scale Network and later we will come to know through the comparison that
which technique performs well in these harsh environment and give effective results.
Keywords: - Multicasting, Application Level Multicasting, IP Multicasting, Overlay Multicasting
I. INTRODUCTION
Multicast technology today days is driving the interest of Internet Service Providers (ISP) and users
from around the world. It is used in IP networks to send information to multiple receivers simultaneously. It is
possible to have a single or multiple senders in multicast technologies. It supports a variety of applications, such
as web caching and live streaming, which were not possible with uni-cast technology in which data can only be
sent from one sender to one receiver. Multicast on the other hand enables the transfer of data between one
sender and many receivers as well as transfer from many senders to many receivers. [1] The concept of
multicasting was started when there was a need for group communication in which one member could send data
to all other members at same time to work more efficiently in a shorter period of time. First multicast
applications allow the sender to send a single copy of the data to the router and switches, then these in turn make
several copies of the data to send them to all the group members. This kind of application has many benefits
such as it saving a significant amount of bandwidth usage on the network because the server is only sending a
single copy of the data to the router, rather than sending a copy to each individual member.
This feature of multicast technology decreases the computational load on the server and enables the network to
perform more efficiently.
1) Importance of Multicasting
Today the whole world is interlinked through the internet. There are many applications through which
we can communicate and share data with each other, for instance through multimedia applications and social
networking websites. Everything that is happening around the world is available online and various activities
2. Comparative Analysis and Secure ALM P2P Overlay Multicasting of Various Multicast Routing
71
taking place in countries around the world are tracked and posted online in a matter of minutes. Let’s consider
the example of the most common video streaming website at this time, YouTube. People upload their videos on
this website for various reasons such as communicating with others, providing useful information to world,
sharing their resources, expressing themselves and much more [2]. With the increase in multimedia content
available on the web every day, one- to-many and many-tomany traffic on the internet is also on the rise.
Fig.1: Scenario Representing Uni-casting and Multicasting
As more and more users started connecting to such websites every day, the need for advanced
technology which could implement the concept of group communication in efficient way became evident.
Implementation of multicast technologies has not only fulfilled this need but has also helped in widespread use
of audio/video conferencing in many applications with limited use of network resources. All this would not have
been possible without the deployment of multicast technologies.
2) Advantages of Multicasting
Multicast has greatly helped Internet service providers (ISP) and the content providers. As it is an
efficient method of group communication and delivering data from one sender to multiple receivers. In case the
server receives a request for the same data from multiple users, it only has to send one data stream to the router
and switches; these routers and switches themselves can make copies of the data and distribute amongst the
users. Imagine how much of a computational load is decreased on the server as compared to unicast
technologies in which server has to send as many copies of data individually as the number of users requesting
the data. Unlike unicast technology therefore, multicast also decreases the bandwidth utilization on the network
and reduces the response time for requests made by users. Furthermore, the ISP also gets assistance in tackling
the problem of congestion on the network when there were so many requests that the pipelines are
overwhelmed. It is possible for the network to go down as well due to low bandwidth or higher than manageable
computational load on the server [4]. Therefore, development of multicast has not only increased the life of the
server, but also decreased the cost of maintenance of the server.
• One to Many
IP multicast is a technique for one-to-many communication over an IP infrastructure in a network. The
destination nodes send join and leave messages, for example in the case of Internet television when the user
changes TV channel. IP multicast scales to a larger receiver population by not requiring prior knowledge of
whom or how many receivers there are. Multicast uses network infrastructure efficiently by requiring the source
to send a packet only once, even if it needs to be delivered to a large number of receivers. The nodes in the
network take care of replicating the packet to reach multiple receivers only when necessary [3].
• Many to Many
Many-to-many multicast routing can be extensively applied in computer or communication networks
supporting various continuous multimedia applications. The paper focuses on the case where all users share a
common communication channel while each user is both a sender and a receiver of messages in multicasting as
well as an end user. In this case, the multicast tree appears as a terminal Steiner tree (TeST). The problem of
finding a TeST with a qualityof-service (QoS) optimization is frequently NP-hard. However, we discover that it
is a good idea to find a many-to-many multicast tree with QoS optimization under a fixed topology. In this
paper, we are concerned with three kinds of QoS optimization objectives of multicast tree, that is, the minimum
3. Comparative Analysis and Secure ALM P2P Overlay Multicasting of Various Multicast Routing
72
cost, minimum diameter, and maximum reliability. All of three optimization problems are distributed into two
types, the centralized and decentralized version [7]. This paper uses the dynamic programming method to devise
an exact algorithm, respectively, for the centralized and decentralized versions of each optimization problem.
1.3 Applications of Multicasting
Now, let us discuss the kind of applications that require multicasting. Multicasting can be linked to all
the applications that require broadcasting. Broadcasting which is carried out in a reliable, controlled, secured
and efficient manner is referred to as multicasting. This is so because in multicasting, the sender has complete
control over the data to be sent to the desired users. There is no doubt that multicast can be used in any
application in which same kind of data is requested many users. So multicasting is an excellent method of
transmission for such things as video conferencing, software distribution, stock quote streaming [12], satellite
television broadcasting, internet radio broadcasting etc [5]. So it is clear that multicasting is mostly and widely
used for multimedia applications. Apart from the above mentioned applications, other widely used applications
that employ multicast technology are Microsoft Windows Media Player, RealPlayer, Apple QuickTime, Cisco's
IP/TV and Apple's MacTV have multicast capabilities. Using such applications millions of users around the
world are connected to each other through the sharing of their resources.
II. MULTICASTING TECHNIQUES
The various multicasting techniques we are going to discuss here consist of:
• IP Multicasting.
• ALM Multicasting
• Overlay Multicasting.
1) IP Multicasting
Multicast is a communication pattern in which a source (Sender) sends some data to all the interested
members (Host) of a certain group. There are certain protocols which we need to know for better understanding
of the complete structural design of the multicast network. In a typical multicast network (One-to-many) there is
a source which is connected to a router which need to know its RP addresses and on the receivers side the RP
collects the information from those host’s which are interested in receiving data from the sender. The host is
also connected to RP via router [6]. RP connects the sender and receiver for transmission of data in the form of
packets and it keeps a track of the number of hosts entering and leaving the network. The range of Addresses
between 224.0.0.0 – 224.0.0.225 is inclusively reserved for the use of routing protocols and other low level
topology discovery or maintenance protocol. Multicast routers should not forward any multicast datagram with
destination address in this range.
Whenever some host is interested in receiving data from a source, it needs to know the multicast group
addresses using MSDP. The host then passes on information to the first-hop router using the IGMP. Then the
router passes the information to the RP which contains information about all the available sources for that
particular group. After receiving transmission of data from the source RP duplicates the data and pass the copies
to all the interested receivers using the MFIB [8].
1.1 Multicast Addressing
An IP multicast group is identified by a class D address. The size of the Class D multicast address space is
therefore 228
or 268,435,456 multicast groups [31]. The first four bits of the address are fixed and rest 28 bits
vary. So, all multicast addresses always begin with “1110”.
Fig2: Multicast Addressing
1.2 Multicast Address Types
Multicast groups are identified by the IP addresses in range 224.0.0.0 – 239.255.255.255. There are
some special and reserved addresses out of above given range which are used for different purposes [11].
4. Comparative Analysis and Secure ALM P2P Overlay Multicasting of Various Multicast Routing
73
224.0.0.1 All systems on this subnet
224.0.0.2 All routers on this subnet
224.0.1.1 NTP (Network time Protocol)
224.0.0.9 RIP-2 (Routing Protocol)
a. The range of Addresses between 224.0.0.0 – 224.0.0.225 is inclusively reserved for the use of routing
protocols and other low level topology discovery or maintenance protocol. Multicast routers should not forward
any multicast datagram with destination address in this range.
b. The range of Addresses between 224.0.1.0 – 238.255.255.255 is used internet wide for all the
transmissions.
c. The range of Addresses between 239.0.0.0 – 239.255.255.255 is used for the administrative purposes.
2) ALM Multicasting
In recent times, the deployment of network-layer multicast (IP Multicast) has not been widely adopted
by most commercial ISP’s because of the high cost of implementation involved in the deployment of routers,
and thus large parts of the Internet are still incapable of using multicast applications. Application layer multicast
protocols do not change the network infrastructure, instead they implement multicast forwarding functionality
exclusively at endhosts using ALM. Simply it can be defined as the implementation of multicasting as the
application service instead of network service.
P2P Multicast: In p2p multicast end-hosts (peers) handles all the basic functionality of the system like
group membership, routing and addressing. Two terms p2p multicasting and application level multicasting have
been used together in various algorithms, such as orchard. In which the ALM is implemented in the p2p
networks decentralized structured environment to share the video stream [9]. Earlier p2p technology was used
only for offline file sharing but with the advancements brought about with time and the increase in demand for
video streaming and multimedia sharing applications, it started being used online as well [31]. A stream of video
can be divided into several sub-streams and spanning trees are formed with each sub-stream to deliver data. In
the orchard algorithm, p2p multicasting using the application level multicasting has proved to be very successful
as it has solved two major problems that were encountered during the data sharing in p2p networks. First
problem deals with free riding as peers are not ready to donate their resources (uploading), but regardless they
want to be able to download data. Another problem is with the peers joining and leaving the network at a very
high rate. Further p2p multicast can also be referred as end system multicast (ESM) in which the end host is
both downloading and uploading the data to other end host at the same time.
3) Overlay Multicasting
The overlay multicasting being a broad concept but is very efficient and gained attention as one of the
mechanisms to overcome the barriers of deployment to the router level solutions for various networks issues.
The overlay solutions for multicasting consists of content distribution and content sharing are extensively
studied in recent times. There are a number of overlay application-layer multicast approaches which have been
proposed over the last few years and the amendments are still going on for better performances. In the overlay
multicast the hosts participating in a multicast session form an overlay network which only utilizes unicasts
among pairs of hosts for the data dissemination and also the hosts in overlay multicast handle group
management, tree construction and routing, exclusively, without any support from Internet routers [10]. The
advantages of overlays comprises of its adaptive features, ease of deployment and flexibility. The overlays
mainly impose a performance penalty over router-level alternatives as the data packet forwarding mainly occurs
at the end hosts. Also the overlay multicast consumes more network bandwidth and also increases latency over
IP multicast, so little attention has been paid to precisely justify this overlay performance penalty. Moreover
there is no work on characterizing overlays multicast tree structure and such characterization is important to gain
insight into overlay properties and their causes at both the application layer and the underlying network layer so
as to tackle various network related issues. There is also importance in comparing different overlay multicast
strategies s0 as to determine how to meet the goals of target applications. The overlay networks have recently
emerged as available solution to the various challenging problems which includes routing, multicasting, peer-to-
peer services and content distribution. The application-level overlays do incur performance degradation over
router level solutions. The recent studies in overlays illustrate that the mean number of hops and mean per-hop
delay between parent and its child hosts in overlay trees gradually decreases as the level of the host in the
overlay tree increases and the overlay host distribution, internet topology and overlay multicast routing
strategies characteristics are recognized as three primary causes of the observed phenomenon [14].
III. RESTORABILITY AND DESIGNING ISSUES
Various issues that are incorporated during the designing of a multicast routing are discussed in this
section. These issues should be considered prior to working on a multicast routing phenomenon. Such issues can
5. Comparative Analysis and Secure ALM P2P Overlay Multicasting of Various Multicast Routing
74
degrade the performance metrics during the multicast routing so this part of paper will elaborate such issues.
1) Restorability: The restorability mainly occurs due to two reasons: link failure and node failure. As we all
know that in wireless scenario node failure is a common issue. The nodes can lead to failure mainly due to
restriction on power that a node possesses. So whenever nodes run out of power that results in restoration.
Similarly when a node in a network fails it results in the failure of the link between the failed node and the other
nodes of the network that again leads to the restoration [13]. So mainly in restoration the routing table of the
each node which are participating the network is updated and the obsolete routes to all the other nodes in the
network are removed.
Fig 3: Link:
Failure and Node
Though restoration incurs a lot of bandwidth consumption it is necessary to restore for effective
communication. So while designing a multicast routing protocol these problems should be kept in mind as they
can degrade the performance of the protocol.
2) Design Issues: The following are some of the performance issues that degrade the performance in the
multicast routing:
• Overhead
The routing protocols especially in multicasting incurs heavy overloads as they carry information about the all
the member in the multicast group. This led to the higher consumption of available bandwidth and processing
power and hence results in the inefficiency in the performance of the protocol.
• Bandwidth
As we all know the bandwidth in the wireless networks are very limited. A lot of the bandwidth gets wasted in
the restoration that occurs mainly due to link or node failure and resulting in the degradation of the performance.
• Delay
In wireless medium the chances of collision are vibrant. There is no presence of central arbitrator than can
monitor the communicating nodes. So at the same time more than one node can initiate the communication that
results in collision which further results in subsequent delays.
• Looping
Looping occurs only when there are more than one path available between source and destination during a
communication. The looping can result in performance degradation when source tries to send data to destination
using second path when he comes to know that the first path is down. But meanwhile first path becomes active
again and source gets acknowledgement from first path.
• Data Loss
As in wireless medium there is no arbitrator than can monitor the communicating nodes. So at the same time
more than one node can initiate the communication that results in collision which further results in loss of data.
• Stress or Load
The over stress over a link or over a communicating network having limited bandwidth can result in degradation
of performance. If there is limited bandwidth but the load is more than it will slow down all the process
occurring over the network.
6. Comparative Analysis and Secure ALM P2P Overlay Multicasting of Various Multicast Routing
75
Fig 4: Block diagram Multicasting Network with Face Detection and Recognition
Architecture: The structure of P2P overlay network architecture is different from the client server
architecture. It has more of distributed architecture as peers are present in random locations and there is no fixed
pattern use of face recognition. A secure ALM Simulator design with Emgu CV library is a cross platform .Net
wrapper to the OpenCV image processing library. Allowing OpenCV functions to be called from .NET
compatible languages such as C#, VB, VC++, IronPython etc. The wrapper can be compiled by Visual Studio,
Xamarin Studio and Unity, it can run on Windows, Linux, Mac OS X, iOS. Its architecture can be described in
five layer model with network communication layer at the bottom. It keeps a track of all the peers in the network
and describes the network characteristics. Above networking layer is the Overlay nodes management layer
which tracks all the existing and new peers, manage them and provide the routing algorithms for optimization
IV. PERFORMANCE METRICS
In this section we will discuss various performance metrics on the basis of which the IP multicasting,
ALM Multicasting and the overlay multicasting is to be compared. The result will display which multicasting
technique produces the best when measured against these metrics:
1. Multicast Efficiency
The multicast efficiency will measure which of the all the three multicasting techniques would
multicast more efficiently to all the members of the multicast group.
2. Ease of Deployment
The ease of development will tell which of the above mentioned multicasting technique is easy to
implement according to the environment around. As discussed in Section III there are lot of performance factors
that can affect the performance. So in such environment the technique which can v deployed easily will be
shown by this metric [15].
3. Complexity and Overhead
More Complex a technique would be more it would be difficult to implement it mainly in the wireless
environment. Similarly if there is more overhead than it degrades the performance straight away.
4. Maintenance
This metric will measure which of the above technique is easy to maintain. The more easily a technique could be
maintained more easily it can give efficient performance results.
5. Adaptability
There are lot of factors in the wireless medium on which entire communication relies. Sometimes there could be
heavy traffic so a technique should be highly adaptive so that it can adapt according to the current situation of
the network and yet been able to produce better results.
6. Robustness
The wireless medium is full of uncertainties. The time where a communication is going well next moment the
network can lead to some failure. So the technique used for the multicasting should be reliable enough so as it
can take it out of such failures. So this metric will tell us out of these three techniques which perform the best.
7. Comparative Analysis and Secure ALM P2P Overlay Multicasting of Various Multicast Routing
76
7. Data packet Forwarding
The data packet forwarding will tell where in each of the above mentioned techniques the data packet
forwarding will take place. It is another important metric as it will tell which multicast technique uses less time
to wrap or un-wrap the data packets and hence influences the performance.
V. RESULT
The result shows the behavior of the multicast routing techniques on the basis of the performance
metrics. The table shows that how the three techniques differ from each other on the metrics discussed earlier:
Performance Metrics IP Multicasting ALM OM
1.Multicast Efficiency High Low Medium
2.Ease of Deployment Difficult Easier Medium
3.Complexity & Overhead Low High Medium
4.Maintenance High Low Low
5.Adaptability Low High High
6.Robustness High Low High
7.Data Packet Forwarding At Routers End Hosts End Hosts
Tab. 1: Comparison of Multicasting Techniques
We have conducted preliminary simulations to examine large scale multicast tree formation using this
technique. A 4000-kilometer wide square-shaped area was assumed to approximate the size of Punjab. The area
was divided into K regions, and a regional server was placed in a random location in each region. One of the
regional servers was picked as the multicast source. Then a total of N host locations were randomly generated.
We assumed that at the beginning of multicast only the regional servers were present, and then the hosts joined
one by one. We limited the egress capacity for each server to 2Kstreams, and for each participating host to five
streams. Therefore in these simulations the nodal degree of a user host in the overlay network would be six or
less. We also calculated the initial set up time for each host, based on the round trip delay of the messages they
must send to the root, their regional server and their parent candidates until a viable parent is found.
Fig 5: Average multicast path length for different core and network sizes
Simulations were run for K= 4 (sparse-core) and 16 (dense-core), each in N= 1000, 10000 and 100000
hosts. In all cases, a new host was able to find a parent with available capacity. The initial setup delay was
between 26.9 to90 milliseconds in different scenarios. The average label length (which indicates the average
8. Comparative Analysis and Secure ALM P2P Overlay Multicasting of Various Multicast Routing
77
root path length – indicating the data path delay) decreased almost by 35% when number of servers quadrupled,
but increased with the number of users. Figure 3 shows the results of average root path length (in hops) for
different scenarios. The strict maximum nodal degree protects each host against being overloaded by its child
nodes. Next, we simulated node drop or failure in these scenarios. For each scenario (sparse- or dense-core,
N=10000,10000 or 100000) we failed nodes one by one, and had downstream nodes apply our algorithm to find
new parents and reconnect to the multicast tree. Tree repairs were first done locally, i.e. by connecting to a
backup parent in the same region as the node seeking a new parent.
However there is a special case where all other end-nodes in the region are in the child tree of the node
seeking a new parent. Obviously, a node cannot choose a parent form its own child tree because that would
partition the multicast tree. In such case, after a number of unsuccessful reconnection attempts within the region
(10 in our simulations), the parent-seeking node will have to connect to another regional server. Accordingly, as
long as at least two regional servers are up and running, a node can always recover from the failure of its parent.
In our simulation, we assumed that regional servers did not fail (e.g. stand-by servers were available at each
location).
As mentioned, a key approach to simplify the operation of the algorithm was based on the decision that
the regional server need not maintain a topology map of the nodes under its domain and will not check for loops
when sending lists of potential backup parents to end-nodes. In this approach the regional server randomly
selects Knodes (10 in our simulations) that still have capacity, and send them as potential backup parents to each
node. This list will be updated periodically. In our simulations, without loss of generality, we assumed that the
regional server generated a new random list per node in every period, and that the new list would be entirely
independent of the old list. This approach allows further saving on the regional server memory because it does
not have to maintain tables of current backup parent nodes for each node. However it could pose a potential
problem: that a potential backup parent node could be allocated to many nodes, and upon a failure that affects all
of them, it may not have enough capacity to accommodate them all. This problem is resolved by the fact that the
selection of backup parent node must be acknowledged, therefore once the potential backup parent node runs
out of capacity, it will refuse any further requests, and the parent-seeing nodes will move to the next potential
parent on their list. As mentioned before, loop-checking is also performed by each parent-seeking node based on
the hierarchical addresses. If none of the parents in the list have enough capacity or are eligible parents, the
parent-seeking node contacts the regional server for a new list, which adds to the restoration delay.
Therefore, it was important to find out how many times on average a node will have to contact the
regional server. We expected the multiple connection attempt incidents to be small, for two reasons: First, the
egress capacity for each node was limited to five; therefore a node failure would affect at most five downstream
nodes who would be seeking new parents. If the regional server creates the parents list in a genuinely random
manner, the probability of five nodes receiving similar backup parent (with insufficient egress capacity) out of
hundreds of potential candidates would be small. The probability of multiple connection attempts would
increase for the nodes in the higher layers of the tree, because they have more child nodes (that are ineligible as
backup parent).However the number of nodes decreases as we move higher in the tree; therefore the probability
of such incidents remain small; and our simulation results confirmed it. Figure 5 shows the distribution of the
number of connection attempts for different nodal failure ratios from 10% of all nodes to 90% of all nodes, in a
sparse-core 1000-node scenario. For a scenario in which 10% of all nodes failed, only 8% of nodes had to
attempt more than once to reconnect, and no node had to attempt more than twice. As failure ratio increased, the
possibility of multiple attempts increased too. However even for a failure ratio of 50%, no node had to attempt
more than five times, and over 60% of nodes reconnected in the first attempt. At failure ratio of 70% or higher
in this scenario, some nodes had to connect to another regional server.
Fig 6: Distribution of Connection Attempts
9. Comparative Analysis and Secure ALM P2P Overlay Multicasting of Various Multicast Routing
78
Our results indicate that in large scale ALM networks, a lightweight simple algorithm could still
guarantee robustness against failure without a need for resource-intensive preprocessing of nodes for initial or
post-failure parent assignment. In particular, random selection of parents from a pool of local candidates seems
to be a viable possibility. We have not yet established a clear trend in our simulation results regarding the
restoration performance based on the number of regional server (sparse or dense). However more simulations
based on larger networks are being conducted for this purpose.
VI. CONCLUSION
Multicast enables the transfer of secure data between one sender and many receivers as well as transfer
from many senders to many receivers as we have discussed the various techniques in the multicasting. We come
to know that multicast efficiency in IP multicasting is high as compared to the ALM and the Overlay
multicasting with face detection. The deployment of ALM is easier than overlay and IP multicasting. From the
above discussion we come to know that the complexity of IP multicasting is lower than its counterparts and also
possess low overheads whereas ALM and Overlay multicasting requires less maintenance. The comparison
shows that the ALM and the OM are highly adaptive to the networks conditions whereas the IP multicasting is
less adaptive to the situations. OM and IP multicasting are highly robust in nature as compared to the ALM and
in IP multicast the data packet forwarding are done at router whereas in its counterparts it is done at the end
hosts. So this paper on whole discusses various techniques that are part of multicasting and using this study one
can easily design a multicast routing protocol that keeps in mind all the metrics that results in degradation of
performance and also those factors that can massively endeavor the efficiency in performance of the protocol.
REFERENCES
[1]. L. Sahasrabuddhe and B. Mukherjee, “Multicast Routing Algorithms and Protocols: A Tutorial”, IEEE
Network, Jan/Feb 2000, pg. 90-102.
[2]. V. N. Padmanabhan, H. J. Wang, and P. A. Chou. “Resilient Peer-to-Peer Streaming”. In roceedings of
the 11th ICNP, Atlanta, Georgia, USA, 2003.
[3]. J. Buford J, “Survey of ALM, OM, hybrid technologies” SAM (Scalable Adaptive Multicast) RG
meeting at IETF 66, Montreal, January 2006, pg 161-166
[4]. C.K. Yeo, B.S. Lee, M.H. Er, “A survey of application level multicast techniques”, Computer
Communications 27 (2004) pg. 1547–1568.
[5]. W. Jia, W. Zhao, D. Xuan, G. Xu,"An Efficient Fault- Tolerant Multicast Routing Protocol with Core-
Based Tree Techniques," IEEE Transactions on Parallel and Distributed Systems, October 1999, vol.
10, , pg. 984 – 1000.
[6]. A. Fei, J. Cui, M. Gerla, and D. Cavendish, “”A dual-tree scheme for fault-tolerant
multicast”,Proceedings of IEEE International Conference on Communications, 2001, vol. 3,Pg .690-
694
[7]. V. N. Padmanabhan, H. J. Wang, and P. A. Chou. “Resilient Peer-to-Peer Streaming”, 11th ICNP,
Atlanta, Georgia, USA, 2003 pg 129-134.
[8]. S. Banerjee, B. Bhattacharjee, and C. Kommareddy, “Scalable application layer multicast,” ACM
SIGCOMM, Pittsburgh, PA, Aug. 2002, pg. 205-217.
[9]. J. Jannotti, D.K. Gifford, K.L. Johnson, Overcast: Reliable Multicasting with an Overlay Network,
Proc. Oper. Syst. Des. Implement. (OSDI) October 2000, Pg. 197–212.
[10]. M Castro, P Druschel, AM Kermarrec, SCRIBE: A largescale and decentralized application-level
multicast, IEEE Journal on Selected Areas in Communications, October 2002, Vol. 20, pg. 100-110.
[11]. Shahram Shah Heydari, Supreet Singh Baweja, “Lightweight Reliable Overlay Multicasting in Large-
scale P2P Networks” University of Ontario Institute of Technology C3S2E-10 2012, Pg. 207-21l.
[12]. S. Jain, R. Mahajan, D. Wetherall, G. Borriello, S.D. Gribble, A comparison of largescale overlay
management techniques, Technical Report UV-CSE 02-02-02, University of Washington, February
2002, Pg. 1-7.
[13]. S. Shah-Heydari, O. Yang, “Hierarchical protection tree scheme for failure recovery in mesh
networks,” Photonic Network Communications, March 2004 vol. 7, Issue 2, pg. 145159.
[14]. Z. Fei and M. Yang. “A proactive tree recovery mechanism for resilient overlay multicast”, IEEE/ACM
Transactions on Networking, 2007, vol. 15, no.1, pg. 173–186.
[15]. K. Walkowiak, “Survivability of P2P Multicasting”, Proc. Of Workshop on Design of Reliable
Communication Networks, Washington, DC, October 2009, pg. 92- 99.