Filters








6,319 Hits in 4.4 sec

An analysis of the average message overhead in replica control protocols

D. Saha, S. Rangarajan, S.K. Tripathi
1996 IEEE Transactions on Parallel and Distributed Systems  
In this paper we derive expressions for computing the average message overhead of several well known replica control protocols and provide a comparative study of the di erent protocols with respect to  ...  both average message overhead and system availabilities.  ...  We compare the average case message overhead of some of the well known replica control protocols and also consider the trade-o between the average message overhead and availability.  ... 
doi:10.1109/71.539734 fatcat:s2xfkbhsgjamdnx6f3yppb4ypq

Effective Controlling Scheme to Mitigate Flood Attack in Delay Tolerant Network

Hanane ZEKKORI, Saïd AGOUJIL, Youssef QARAAI
2021 International Journal of Advanced Computer Science and Applications  
We also ran a large number of simulations with the ONE simulator to investigate how changing buffer capacity, message lifetime, message size, and message replicas affect DTN network performance metrics  ...  Malicious nodes may flood the network as possible by a huge number of unwanted bundles (messages) or bundle replicas which waste the limited resources.  ...  The delivery rate, overhead ratio, and latency average for the Epidemic protocol are invariant to the number of replicas, which is due to the nature of this protocol, which floods the network with an unbounded  ... 
doi:10.14569/ijacsa.2021.0121083 fatcat:ipmjh5hkmzc53lxhhgc5ofemei

Routing Protocols For Delay Tolerant Networks: Survey And Performance Evaluation

Luming Wan, Feiyang Liu, Yawen Chen, Haibo Zhang
2015 International Journal of Wireless & Mobile Networks  
However, these schemes commonly suffer from large communication overhead due to the lack of efficient mechanisms to control message replication.  ...  Most existing routing schemes for DTNs exploit the advantage of message replication to achieve high message delivery rate.  ...  Average Latency We also conduct a set of simulations to measure the routing efficiency of each DTN protocol in term of the average message delivery delay.  ... 
doi:10.5121/ijwmn.2015.7305 fatcat:rvdcczd3nrgtxacm64rmodeiym

Performance Improvement of DTN Routing Protocols with Enhanced Buffer Management Policy

2019 International journal of recent technology and engineering  
The simulation results show that delivery probability of messages has increased with reduced buffer time average and minimized latency.  ...  There is no efficient approach is available for estimation of message replication count. In this work an efficient approach is proposed to estimate total number of copies of the message.  ...  Message drop control source relay (MDC-SR) routing protocol [22] was proposed to maximize the delivery probability and buffer time average.  ... 
doi:10.35940/ijrte.d9145.118419 fatcat:w2lfnnciwjfbjdkbehlq6k25qq

Replica Node Detection Using Enhanced Single Hop Detection with Clonal Selection Algorithm in Mobile Wireless Sensor Networks

L. S. Sindhuja, G. Padmavathi
2016 Journal of Computer Networks and Communications  
The performance of the proposed work is measured using detection ratio, false detection ratio, packet delivery ratio, average delay, control overheads, and throughput.  ...  These methods incur control overheads and the detection accuracy is low when the replica is selected as a witness node.  ...  Conflict of Interests The authors declare that there is no conflict of interests regarding the publication of this paper.  ... 
doi:10.1155/2016/1620343 fatcat:e2bzzq2v3zclrkf4txk7oz6yby

Requirements and Open Issues in Distributed Detection of Node Identity Replicas in WSN

Mauro Conti, Roberto Di Pietro, Luigi V. Mancini, Alessandro Mei
2006 2006 IEEE International Conference on Systems, Man and Cybernetics  
Hence, the design of efficient and distributed protocols to detect node identity replicas is still an open and demanding issue.  ...  These replicas can then be deployed in all (or a part of) the network area.  ...  Table I shows in the first row the asymptotic overhead analysis of one round of the LSM Protocol, while the second row reports the averaged overhead generated by one round of the LSM Protocol, for a network  ... 
doi:10.1109/icsmc.2006.384924 dblp:conf/smc/ContiPMM06 fatcat:l7ljoqr5z5cnfnnjdzipkorpry

Independent DTNs message deletion mechanism for multi-copy routing scheme

Sathita Kaveevivitchai, Hiroshi Esaki
2010 Proceedings of the Sixth Asian Internet Engineering Conference on - AINTEC '10  
The result shows signicant improvement in message delivery (10-50%) while reduces the resource consumption (overhead) by 30-70%.  ...  Its independent characteristic makes it possible to be applied with any multi-copy routing protocol though the degree of impact is varied based on the underlying routing scheme.  ...  Since Spray and Wait is a ooding-control routing algorithm, it is less likely to be devastated by the message replicas as in other routing protocols.  ... 
doi:10.1145/1930286.1930293 dblp:conf/aintec/SathitaE10 fatcat:4bqizrohj5crtlgjzc7eex2j7a

Encounter-Based Routing in DTNs

S. C. Nelson, M. Bakht, R. Kravets
2009 IEEE INFOCOM 2009 - The 28th Conference on Computer Communications  
of message delivery.  ...  Current work in routing protocols for delay and disruption tolerant networks leverage epidemic-style algorithms that trade off injecting many copies of messages into the network for increased probability  ...  injected into the network and control overhead, as well as minimizing latency as a second order metric.  ... 
doi:10.1109/infcom.2009.5061994 dblp:conf/infocom/NelsonBK09 fatcat:nsb3he6agbhjnirielkgudvu4u

Persistent content-based information dissemination in hybrid vehicular networks

Ilias Leontiadis, Paolo Costa, Cecilia Mascolo
2009 2009 IEEE International Conference on Pervasive Computing and Communications  
Results show that our protocol achieves high message delivery while introducing low overhead, even in scenarios where no infrastructure is available.  ...  The protocol takes advantage of both the infrastructure (i.e., wireless base stations), if this exists, and the decentralized vehicle-to-vehicle communication technologies.  ...  Acknowledgments: We would like to acknowledge the support of the EPSRC through the Project CREAM.  ... 
doi:10.1109/percom.2009.4912758 dblp:conf/percom/LeontiadisCM09 fatcat:hhqhkol6gzfllhhksq2d6akem4

BFT Protocols for Heterogeneous Resource Allocations in Distributed SDN Control Plane [article]

Ermin Sakic, Wolfgang Kellerer
2019 arXiv   pre-print
Distributed Software Defined Networking (SDN) controllers aim to solve the issue of single-point-of-failure and improve the scalability of the control plane.  ...  We show a clear decrease in the system response time and communication overhead with the proposed models, compared to a state-of-the-art approach.  ...  MPBFT suffers further since the commands execute on each of the controller replicas. Hence, its consensus requires on average an inclusion of a larger number of replicas compared to SBFT and OBFT.  ... 
arXiv:1902.02519v2 fatcat:cg6wqc67yja55n3buhhubtdwge

A General and Specific Utility-Based Adaptive Routing for Delay Tolerant Networks

Lei You, Jianbo Li, Changjiang Wei, Chenqu Dai, Jixing Xu
2014 International Journal of Distributed Sensor Networks  
We theoretically analyze the nodes' spraying process and discover the relationship between the initial number of copies and the latency of the message distribution process, by which we can further control  ...  In this paper, an adaptive routing protocol that makes use of both self-aware and destination-aware utility metrics to evaluate the potential throughput between every pair of nodes is proposed.  ...  Conflict of Interests  ... 
doi:10.1155/2014/742047 fatcat:oayvyj67kreczhho3jrdcximbu

Design and Implementation of a Pluggable Fault-Tolerant CORBA Infrastructure

W. Zhao, L.E. Moser, P.M. Melliar-Smith
2004 Cluster Computing  
In this paper we present the design and implementation of a Pluggable Fault Tolerant CORBA Infrastructure that provides fault tolerance for CORBA applications by utilizing the pluggable protocols framework  ...  The Pluggable Fault Tolerant CORBA Infrastructure achieves performance that is similar to, or better than, that of other Fault Tolerant CORBA systems, while providing strong replica consistency.  ...  The control message informs the surviving replicas of the failure of the primary and the decision as to which replica is to serve as the new primary.  ... 
doi:10.1023/b:clus.0000039492.80219.e5 fatcat:vmyfnvuubvecnlkcjol57nhlo4

Design and implementation of a pluggable fault tolerant CORBA infrastructure

W. Zhao, L. E. Moser, P. M. Melliar-Smith
2002 Proceedings 16th International Parallel and Distributed Processing Symposium  
In this paper we present the design and implementation of a Pluggable Fault Tolerant CORBA Infrastructure that provides fault tolerance for CORBA applications by utilizing the pluggable protocols framework  ...  The Pluggable Fault Tolerant CORBA Infrastructure achieves performance that is similar to, or better than, that of other Fault Tolerant CORBA systems, while providing strong replica consistency.  ...  The control message informs the surviving replicas of the failure of the primary and the decision as to which replica is to serve as the new primary.  ... 
doi:10.1109/ipdps.2002.1015513 dblp:conf/ipps/ZhaoMM02 fatcat:2bhgm7nivrdjfbcvieema3ry6u

Efficient lookup on unstructured topologies

Ruggero Morselli, Bobby Bhattacharjee, Aravind Srinivasan, Michael A. Marsh
2005 Proceedings of the twenty-fourth annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing - PODC '05  
The overhead incurred by LMS is negligible, and its performance approaches that of DHTs on networks of similar size.  ...  We present analytic bounds for the worst-case performance of our protocol. Through detailed simulations, we show that the actual performance on realistic topologies is significantly better.  ...  and the average number of search probes needed (Section 4).The overhead of this protocol is minimal, aside from any additionally needed replica placements, as it leverages actions already performed by  ... 
doi:10.1145/1073814.1073828 dblp:conf/podc/MorselliBSM05 fatcat:676qfjyuwbfblkgg3r6mzrhhua

PERFORMANCE EVALUATION OF RAPID AND SPRAY-AND-WAIT DTN ROUTING PROTOCOLS UNDER BLACK HOLE ATTACK

Shally .
2014 International Journal of Research in Engineering and Technology  
The overhead ratio increases using Spray and Wait Protocol but with RAPID protocol, it decreases with increasing black hole attacking nodes.  ...  The performance of routing protocols (RAPID and Spray and Wait) are tested for different number of attacking nodes.  ...  Buffer time average Spray and Wait protocol than RAPID protocol because spray and wait protocol create n replicas unlike RAPID protocol which creates replicas upon utility check of packet. E.  ... 
doi:10.15623/ijret.2014.0301007 fatcat:gpfslzbulbeelkfqexjl5qyfs4
« Previous Showing results 1 — 15 out of 6,319 results