نتایج جستجو برای: backup nodes

تعداد نتایج: 136625  

Journal: :CoRR 2016
Marcel Caria Admela Jukan

IP networks with a hybrid control plane deploy a distributed routing protocol like OSPF and the centralized paradigm of SDN in parallel. The advantages and disadvantages of a hybrid control plane have already been extensively discussed in the literature. This paper examines to what extent hybrid SDN/OSPF can solve the IP traffic matrix and related monitoring problems, inherent to the IP layer. ...

2015
Xinyan Zhang Zhipeng Tan Shan Fan

The first layer of defense against data loss is the backup data. This paper implements an agent-based network backup system used the backup, server-storage and server-backup agent these tripartite construction, and the snapshot and hierarchical index are used in the NSBS. It realizes the control command and data flow separation, balances the system load, thereby improving efficiency of the syst...

2011
M. SENTHILKUMAR

This paper presents a source based reactive protocol called “Energy aware Multipath QoS Routing Protocol with Mobility Prediction (EMQRPMP)” for MANET. It is the enhanced version of the existing protocol called “Power aware Multiple QoS constraints Routing Protocol with Mobility Prediction (PMQRPMP)”. It considers quality of service constraints namely delay, delay-jitter, bandwidth, and cost fo...

Journal: :Mathematics 2021

This paper deals with the design of secure network in an Enhanced Internet Vehicles by using Blockchain Governance Game (BGG). The BGG is a system model stochastic game to find best strategies towards preparation preventing malfunction attacker and applies this into connected vehicle security. Analytically tractable results for decision-making parameters enable predict moment safety operations ...

2008
Oriana Riva Josiane Nzouonta Cristian Borcea

Mobile ad hoc networks can be leveraged to provide ubiquitous services capable of acquiring, processing, and sharing real-time information from the physical world. Unlike Internet services, these services have to survive frequent and unpredictable faults such as disconnections, crashes, or users turning off their devices. This paper describes a contextaware fault tolerance mechanism for our mig...

2009
Marc-Olivier Killijian Matthieu Roy

In this paper, we present a middleware for dependable mobile systems and an experimentation platform for its evaluation. Our middleware is based on three original building blocks: a Proximity Map, a Trust and Cooperation Oracle, and a Cooperative Data Backup service. A Distributed Black-box application is used as an illustrative application of our architecture, and is evaluated on top of our mo...

Journal: :International Journal of Informatics and Communication Technology 2021

<span>In wireless sensor networks (WSNs), energy, connectivity, and coverage are the three most important constraints for guaranteed data forwarding from every node to base station. Due continuous sensing transmission tasks, nodes deplete more quickly hence they seek help of nodes, called relay nodes. However, a given set finding optimal locations place is very challenging problem. Moreov...

2001
Juan R. Pimentel Teodoro Sacristan

A new fault management protocol that makes use of native fault tolerant features of TTP/C has been developed. It can tolerate multiple nodes failures no matter how close in time and in minimum time. The time it takes to detect a node failure and to reconfigure the system is minimum and it is fixed by the TTP/C protocol. The protocol tolerates that several nodes, including the active management ...

2005
Torsten Braun Vijay Arya Thierry Turletti

We propose the so-called backup tree algorithm to compute a set of n-1 backup multicast delivery trees from the default multicast tree for application level multicast. For each backup multicast tree exactly one link of the default multicast tree is replaced by a backup link from the set of available links. The backup tree algorithm calculates the n-1 trees with a complexity of O (m log n).

Journal: :European Journal of Operational Research 2008
Srinivas R. Chakravarthy Saligrama R. Agnihothri

We consider a finite capacity queueing system with one main server who is supported by a backup server. We assume Markovian arrivals, phase type services, and a threshold-type server backup policy with two pre-determined lower and upper thresholds. A request for a backup server is made whenever the buffer size (number of customers in the queue) hits the upper threshold and the backup server is ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید