Network Availability and Reliability Research Papers (original) (raw)

2025, Optical Switching and Networking

For several decades, optical networks, due to their high capacity and long-distance transmission range, have been used as the major communication technology to serve network traffic, especially in the core and metro segments of communication networks. Unfortunately, our society has often experienced how the correct functioning of these critical infrastructures can be substantially hindered by massive failures triggered by natural disasters, weather-related disruptions and malicious human activities. In this position paper, we discuss the impact on optical networks of all major classes of disaster events mentioned above, and we overview recent relevant techniques that have been proposed to increase the disaster resilience of optical networks against the various classes of disaster events. We start by presenting some proactive methods to be applied before the occurrence of a disaster. Then we move our focus also on other preparedness methods that can be executed in the (typically short) time frame between the occurrence of an early alert of an incoming disaster and the time a disaster actually hits the network. Finally, we discuss reactive procedures that allow performing post-disaster recovery operations effectively. The analysis of disaster resilience mechanisms provided in this paper covers both wired and optical wireless communication infrastructures and also contains explicit remarks covering the role of emerging technologies (e.g., fixed-mobile convergence in the 5G era and beyond) in disaster resilience.

2025, 2023 Moratuwa Engineering Research Conference (MERCon)

With increasing competition and diminishing returns in revenue for mobile network operators, optimization of cost invested in the development of telecommunication networks is an important topic. Recent research suggests that developing electrical systems for telecommunication base stations can be optimized using adaptive power management strategies, power saving strategies and infrastructure sharing strategies. This paper proposes a novel model with a parametric and base station categorization approach to determine the optimum electrical system configuration with the least investment cost incurred for developing a telecommunication base station. In this study, the considered electrical system configuration is grid-connected and consists of a diesel generator and a battery bank. The proposed model is analyzed and validated using twenty combinations of different geographical locations and base station severity categories. The Genetic Algorithm in MATLAB was used for the optimization of the proposed model. The optimization results evidenced that the proposed model dynamically optimizes the electrical system and selects the most cost effective investment option based on grid power availability and customer categories, which guide mobile network operators to optimize their scarce resources for higher returns in revenue and customer satisfaction.

2025, IJSRA

The rapid evolution of data processing demands has led to innovative approaches in enterprise-scale data anonymization and protection. This comprehensive examination explores the implementation of Delphix across diverse cloud environments, focusing on its technical architecture, performance metrics, and compliance features. The platform demonstrates exceptional capabilities in handling sensitive data through advanced machine learning algorithms and sophisticated processing pipelines. The architecture incorporates robust security mechanisms, parallel processing capabilities, and intelligent resource optimization across multiple geographical regions. Integration with major cloud providers enables seamless scalability while maintaining strict data protection standards. The implementation showcases significant improvements in processing efficiency, reduced data breach risks, and enhanced compliance adherence through automated controls. Best practices and deployment guidelines ensure optimal performance through carefully calibrated infrastructure requirements and monitoring systems. The solution addresses the critical challenges of data privacy and security while maintaining high throughput rates and system availability across distributed environments.

2024, KNOM …

Abstract. In this paper, we have analyzed network availability of sensor grids in the context of criticality of individual nodes in ensuring network connectivity that form such grids. By assuming staircase traversal to adjacent neighbors... more

2024, … Software Engineering Journal Selected full …

Role-based trust management languages define a formalism, which uses credentials to handle trust in decentralized, distributed access control systems. A credential provides information about the privileges of users and the security policies issued by one or more trusted authorities. The main topic of this paper is RT T , a language which supports manifold roles and role-product operators to express threshold and separation of duties policies. The core part of the paper defines a relational, set-theoretic semantics for the language, and introduces a deductive system, in which credentials can be derived from an initial set of credentials using a set of inference rules. The soundness and the completeness of the deductive system with respect to the semantics of RT T is proved.

2024, Romanian Journal of Information Science and Technology (ROMJIST)

This paper addresses the problem of testing n × 1 RAMs in which complex models of unlinked static three or four-cell coupling faults are considered. As in other papers, it is assumed that only physically neighboring memory cells could be involved in a three or four-cell coupling fault. For this reason, these fault models can also be considered to be of the neighborhood pattern sensitive type. As extensions of the well-known model of all unlinked static two-cell coupling faults, the fault models addressed in this paper are complex including faults sensitized by a transition write operation as well as faults sensitized by a nontransition write or a read operation. For these complex models, near-optimal multirun march tests are proposed. This optimality assessment is based on the fact that, for any group of cells corresponding to the considered fault model, the state graph is completely covered, and each arc is traversed only once, which means that the graph is of the Eulerian type. Additional write operations are only required for data background changes.

2024, IEEE Wireless Communications Letters

This paper proposes a novel scalable digit-serial inverter structure with low space complexity to perform inversion operation in GF(2 m ) based on a previously modified extended Euclidean algorithm. This structure is suitable for fixed size processor that only reuse the core and does not require to modulate the core size when m modified. This structure is extracted by applying a nonlinear methodology that gives the designer more flexibility to control the processing element workload and also reduces the overhead of communication between processing elements. Implementation results of the proposed scalable design and previously reported efficient designs show that the proposed scalable structure achieves a significant reduction in the area ranging from 83.0% to 88.3% and also achieves a significant saving in energy ranging from 75.0% to 85.0% over them, but it has lower throughput compared to them. This makes the proposed design more suitable for constrained implementations of cryptographic primitives in ultra-low power devices such as wireless sensor nodes and radio frequency identification (RFID) devices. INDEX TERMS Scalable systolic arrays, hardware security, finite field inversion, ultra-low power devices, ASIC.

2024, Revista Facultad de Ingeniería - Universidad de Tarapacá

Published work on computer network reliability frequently uses availability as a performance measure. However, although several ways of defining availability have been proposed, none capture the overall level of service obtained by client hosts in a modern n-tier client/server architecture. We propose such a measure by calculating the fraction of client hosts receiving complete services from the network. We also extend a published, efficient heuristic method for calculating availability to take into account our new proposed measure. The end result is a procedure of polynomial complexity O(n t 4), where n t is the total number of components (hosts, links and interconnection equipment) in the network. Numerical results of applying the method to several networks are given.

2024

Published work on computer network dependability frequently uses availability as a performance measure. However, although several ways of defining availability have been proposed, none capture the overall level of service obtained by client hosts in a modern n-tier client/server architecture. We propose such a measure by calculating the fraction of client hosts receiving complete services from the network. We also extend a published, efficient heuristic method for calculating availability to take into account our new proposed measure. The end result is a procedure of polynomial complexity O(n t 4), where n t is the total number of components (hosts, links and interconnection equipment) in the network. Numerical results of applying the method to several networks are given.

2024, KNOM …

2024

Network Design involves the practice of designing and optimizing network infrastructure to efficiently manage the flow of data across a network. This process focuses on balancing network resources to ensure optimal performance and minimize congestion. By employing various techniques such as route optimization, load balancing, and Quality of Service (QoS) mechanisms, network engineers can control and prioritize traffic based on specific criteria. Furthermore, Network Design plays a crucial role in ensuring that network capacity meets current and future demand requirements, thereby enhancing overall network performance and user experience. Implementation of Network Design strategies requires a comprehensive understanding of network protocols, traffic patterns, and utilization metrics to effectively identify and address potential bottlenecks. Through proper planning and management, network engineers can achieve greater efficiency, reliability, and scalability in the network infrastructure

2024, International journal of interactive mobile technologies

Vehicle Ad-hoc Networks (VANET) are considered among recent wireless communication technologies. Nowadays, vehicles are no more than simple means of transport, they are endowed with a source of intelligence through their interaction with the road environment due to embedded equipment on board vehicles and integrated into stations along roads and highways. The mechanisms of security and protection of messages exchanged in VANET, thus preserving the privacy of users and satisfying the various security requirements, are a prerequisite for the deployment of vehicle networks. Increasingly, several research have been proposed to improve protocols for maintaining security and preserving privacy. This paper presents a hierarchical revocable infrastructure based privacy preservation authentication protocol for vehicles that involves authentication of each vehicle and the corresponding Road Side Unit (RSU) by a Certification Authority (CA). The proposed protocol used Elliptic Curve Diffie Hellman (ECDH) algorithm for reliable key exchange and Edwards-curve Digital Signature Algorithm (EdDSA) to speed up the execution of the authentication process especially at the key management level, message signing and verification of this signature. On the other hand, the creation of sub-lists of revoked certificates based on vehicle type makes it possible to minimize the response time by looking for a certificate if it is revoked or not. Our solution was checked by the security verification tool, Automated Validation of Internet Security Protocols and Applications (AVISPA), which indicated that it is a very secure level. Performance analysis illustrates that the protocol greatly saves computation resources.

2024, International Journal of Interactive Mobile Technologies (iJIM)

2024, International Journal of Computer Theory and Engineering

2024

This document provides a framework for the development of IP fastreroute mechanisms that provide protection against link or router failure by invoking locally determined repair paths. Unlike MPLS fast-reroute, the mechanisms are applicable to a network employing conventional IP routing and forwarding. Status of This Memo This document is not an Internet Standards Track specification; it is published for informational purposes. This document is a product of the Internet Engineering Task Force (IETF). It represents the consensus of the IETF community. It has received public review and has been approved for publication by the Internet Engineering Steering Group (IESG). Not all documents approved by the IESG are a candidate for any level of Internet Standard; see Section 2 of RFC 5741. Information about the current status of this document, any errata, and how to provide feedback on it may be obtained at http://www.rfc-editor.org/info/rfc5714.

2024, Revista Facultad de Ingeniería - Universidad de Tarapacá

2024

2024, International Journal of Computer Applications

The vision for Web 3.0 (also known as Semantic Web) is the ability to create meaning out of huge quantity of qualitative data. Existing data can be interconnected for further uses. Web 2.0 focused on the users interaction with others whereas Web 3.0 focus more on the users themselves. The advantages of Semantic Web and E-commerce give rise to social commerce (also referred as f-commerce). The future of business lies on the "social" factor and it is this factor which gives rise to a new kind of connected consumers who are becoming influential in their own right. This paper explores a very specific instance of Semantic Web-Social Recommender System. This paper discusses the likelihood of converting social data into quantitative information and using this information to power social recommendations. This paper first outlines the benefits of social commerce over ecommerce platform. Then the related literature work regarding hybrid recommenders is discussed. Next it is discussed how to predict ratings from a user-item rating network and friend's network and then how to unify similarity matrices obtained from different networks. And lastly this paper covers the social hybrid product recommender algorithm and its experimental evaluations to predict its efficiency.

2024, Journal of Computers

The practical Internet voting protocols should have: privacy, completeness, soundness, unreusability, fairness, eligibility, and invariableness, universal verifiability, receipt-freeness, coercion-resistant. Receiptfreeness is a key property. Receipt-freeness means that the voter can't produce a receipt to prove that he votes a special ballot. Its purpose is to protect against vote buying. Formal method is an important tool to assess receipt-freeness of Internet voting protocols. In this paper we give a formal logic framework for receipt-freeness based on V. Kessler and H. Neumann logic. The framework is then applied to analyze receipt-freeness of two typical voting protocols: FOO and Meng Internet voting protocol.

2023, 2018 17th IEEE International Conference On Trust, Security And Privacy In Computing And Communications/ 12th IEEE International Conference On Big Data Science And Engineering (TrustCom/BigDataSE)

Authentication and revocation of users in Vehicular Adhoc Networks (VANETS) are two vital security aspects. It is extremely important to perform these actions promptly and efficiently. The past works addressing these issues lack in mitigating the reliance on the centralized trusted authority and therefore do not provide distributed and decentralized security. This paper proposes a blockchain based authentication and revocation framework for vehicular networks, which not only reduces the computation and communication overhead by mitigating dependency on a trusted authority for identity verification, but also speedily updates the status of revocated vehicles in the shared blockchain ledger. In the proposed framework, vehicles obtain their Pseudo IDs from the Certificate Authority (CA), which are stored along with their certificate in the immutable authentication blockchain and the pointer corresponding to the entry in blockchain, enables the Road Side Units (RSUs) to verify the identity of a vehicle on road. The efficiency and performance of the framework has been validated using the Omnet++ simulation environment.

2023

Vehicular Ad-Hoc Networks (VANETs) require advanced cryptographic techniques in order to meet the conflicting requirements of simultaneous user anonymity and accountability. In this paper, we present a novel group signature scheme that meets these requirements. It provides constant-time revocation, much more efficient than what is achieved in existing schemes. It also provides exculpability so that the authority is not able to forge signatures on behalf of the users. In addition, it provides an efficient distributed tracing mechanism that does not violate the privacy of innocent users. While designed for VANETs, our signature scheme is suitable for any ad-hoc network with similar requirements.

2023, IEEE Access

Existing conditional privacy-preserving authentication schemes utilized in Vehicular Ad-hoc Networks (VANETs) to satisfy security and privacy requirements essentially depend on point multiplication operations. Achieving repaid verification method of the message is commonly suffer performance efficiency from resulting overheads. We propose a conditional privacy-preserving authentication scheme to secure communication and perform better performance efficiency in this article. The proposed scheme only depends on an elliptic curve cryptography (ECC) based on a point addition operation instead of a point multiplication operation during signing and verifying messages. In the joining phase of the proposed scheme, the vehicle requires the joining process for the broadcasting traffic-related message to others or nearby RSU within its communication range. After obtaining the pseudonym and secret key from RSU, the vehicle is considered as a registered node in VANET. This article utilizes a Burrows-Abadi-Needham (BAN) logic to evidence that the proposed scheme fulfill successfully mutual authentication. The formal security phase shows that security and privacy requirements are satisfied by the proposed scheme. The performance efficiency shows that our proposed scheme has lower overhead in terms of computation cost compared with other recent schemes since a point multiplication operations based o ECC are not used. Therefore, the computation costs of the message signing, individual-authentication and batch-authentication in our proposed scheme are decreased by 99.3%, 99.7% and 98.1%, respectively. INDEX TERMS Vehicular ad-hoc network (VANET), VANET storage, VANET elliptic curve, VANET security, VANET identity-based cryptography, VANET privacy-preserving.

2023, IEEE Access

Several group signature or identity schemes have been proposed for addressing the issues of security in a vehicular ad hoc network (VANET). Nonetheless, none of these schemes suitably cope with the performance efficient during the signing and verifying safety-messages. Furthermore, adversaries could acquire sensitive data stored in a tamper-proof device (TPD) by utilizing side-channel attacks. An efficient conditional privacy-preserving authentication scheme is proposed for the prevention of side-channel attacks and reducing the performance efficiency of the system in this paper. Moreover, to resist side-channel attacks, critical data stored in the TPD is frequently and periodically updated. Lastly, due to our work employs the one-way hash function and the elliptic curve cryptography, its performance evaluation has lower computation and communication cost compared to other schemes. INDEX TERMS identity-based cryptography, side-channel attack, privacy-preserving, vehicular ad-hoc networks (VANETs).

2023, Zenodo (CERN European Organization for Nuclear Research)

The processing of primary user mobility with static or mobile secondary user in the context of cognitive radio (CR) has recently been the subject of several studies and discussions all over the world. These studies are seeking to broaden the horizons of CR implementation beyond the formalism described in the diverse existing standards. The mobility of primary users is likely to reduce the overall performance of the Cognitive Radio Network (CRN) and affects the different phases of the cognitive cycle. Said mobility alters the network's topology, the channel's availability, and affects spectrum sensing. This makes any endeavor aiming to implement CR technology complicated. This paper is devoted to the analysis and discussion of the scientific literature that has addressed the issue of the primary user's mobility.

2023

This paper suggests a probabilistic criterion, deemed useful for the short-term operations of power systems.

2023, Networks

The exact calculation of all-terminal reliability is not feasible in large networks. Hence estimation techniques and lower and upper bounds for all-terminal reliability have been utilized. Here, we propose using an ordered subset of the mincuts and an ordered subset of the minpaths to calculate an all-terminal reliability upper and lower bound, respectively. The advantage of the proposed new approach results from the fact that it does not require the enumeration of all mincuts or all minpaths as re-1

2023, 2011 Sixth International Conference on Availability, Reliability and Security

This paper presents JavaSPI, a "model-driven" development framework that allows the user to reliably develop security protocol implementations in Java, starting from abstract models that can be verified formally. The main novelty of this approach stands in the use of Java as both a modeling language and the implementation language. By using the SSL handshake protocol as a reference example, this paper illustrates the JavaSPI framework.

2023

Spam is considered an invasion of privacy. Its changeable structures and variability raise the need for new spam classification techniques. The present study proposes using Bayesian Additive Regression Trees (BART) for spam classification and evaluates its performance against other classification methods, including Logistic Regression, Support Vector Machines, Classification and Regression Trees, Neural Networks, Random Forests, and Naive Bayes. BART in its original form is not designed for such problems, hence we modify BART and make it applicable to classification problems. We evaluate the classifiers using three spam datasets; Ling-Spam, PU1, and Spambase to determine the predictive accuracy and the false positive rate.

2023, Computer Communications

Internet routing protocols, such as Open Shortest Path First (OSPF), compute a shortest path tree from each node to other nodes in the network, using link-state information. Such protocols do not consider the queueing situation at a given node. An alternate path of higher cost may be more convenient to use than the optimum path when a long queue is present at the node. This paper proposes a new Multiple Path Routing Algorithm (MPRA), which uses dynamic shortest path tree mechanisms, load balancing among alternative paths to destination, and path feasibility analysis to avoid network loops. A better-cost model is also introduced. Computer simulations show that MPRA measured parameters (throughput, packet delay, etc.) improve over OSPF by amounts close to 30% for unbalanced networks, and close to 20% for balanced networks.

2023, IJCSNS

This proposal provides new Signaling System No. 7 (SS7) to IP based Signaling Transport (SIGTRAN) protocol interchanger software and hardware to implement an improved communication infrastructure connecting the supervisory system to the... more

2023

The mobile phone banking services in Kenya is a relatively new concept in the banking sector and it has the potential to drive banks’ success. The introduction of this concept by some commercial banks was aimed at taking advantage of the increased number of mobile phone subscribers. Generally, out of 24,968,891 Kenyans having access to a mobile phone (CCK, 2010), only approximately 9.66 million have bank accounts. Other reasons driving banks to adopt this concept is to increase competitiveness, efficiency and speed in provision of financial services to the banks’ customers for both personal and retail banking and offer them a 24 hours and 7 days a week accessibility to their bank accounts. The purpose of the research study was to enhance information system security in the mobile phone banking services in Kenya with the view of evaluating the current information system security and the mobile phone technologies available in Kenya. The research adopted the descriptive approach. Questi...

2023, 2017 IEEE International Symposium on Software Reliability Engineering Workshops (ISSREW)

Security protocols are critical components for the construction of secure and dependable distributed applications, but their implementation is challenging and error prone. Therefore, tools for formal modelling and analysis of security protocols can be potentially very useful to support software engineers. However, despite such tools having been available for a long time, their adoption outside the research community has been very limited. In fact, most practitioners find such applications too complex and hardly usable for their daily work. In this paper, we present an Integrated Development Environment for the design, verification and implementation of security protocols, aimed at lowering the adoption barrier of formal methods tools for security. In the spirit of Model Driven Development, the environment supports the user in the specification of the model using the simple and intuitive language AnB (and its extension AnBx). Moreover, it provides a pushbutton solution for the formal verification of the abstract and concrete models, and for the automatic generation of Java implementation. This Eclipse-based IDE leverages on existing languages and tools for the modelling and verification of security protocols, such as the AnBx Compiler and Code Generator, the model checker OFMC and the cryptographic protocol verifier ProVerif.

2023, Proceedings - First International Conference on Availability, Reliability and Security, ARES 2006

The availability of some critical equipments like gateways, firewalls and proxies must be guaranteed in operational networks. In early equipments, the routing and filtering decisions were maded based on the packet information, nowadays this static approach is not longer safe. Existing High Availability (HA) solutions do not cover all the aspects to ensure availability of advanced settings that are being deployed these days. Some important issues like the reduction of unavailability time and the need for failure detection in such scenarios must be studied. This paper describes the implementation of high available stateful network equipments: these systems apply policies based on the state of the connections, such information is gathered in runtime by means of packet inspection. This work specifically focus on Linux systems and firewalls because the IT industry is trusting more and more OpenSource solutions to deploy critical services because of its quality and the access to the source code. We propose the SNE library (Stateful Network Equipment), which is an add-on to current HA protocols, to solve the existing limitations. In this paper, we introduce describe the proposed arquitecture and we detail a set problematic scenarios supported by our library, first experiments and evaluation.

2023, 2019 IEEE International Conference on Communications Workshops (ICC Workshops)

With the increasing development of advanced communication technologies, vehicles are becoming smarter and more connected. Due to the tremendous growth of various vehicular applications, a huge amount of data is generated through advanced on-board devices and is deemed critical to improve driving safety and enhance vehicular services. However, cloud based models often fall short in applications where latency and mobility are critical. In order to fully realize the potential of vehicular networks, the challenges of efficient communication and computation need to be addressed. In this direction, vehicular fog computing (VFC) has emerged which extends the concept of fog computing to conventional vehicular networks. It is a geographically distributed paradigm that has the potential to conduct time-critical and data-intensive tasks by pushing intelligence (i.e. computing resources, storage, and application services) in the vicinity of end vehicles. However secure and reliable transmission are of significant importance in highly-mobile vehicular networks in order to ensure the optimal Quality of Service (QoS). In this direction, several authentication mechanisms have been proposed in the literature but most of them are found unfit due to absence of decentralization, anonymity, and trust characteristics. Thus, an effective cross-datacenter authentication and key-exchange scheme based on blockchain and elliptic curve cryptography (ECC) is proposed in this paper. Here, the distributed ledger of blockchain is used for maintaining the network information while the highly secure ECC is employed for mutual authentication between vehicles and road side units (RSUs). Additionally, the proposed scheme is lightweight and scalable for the considered VFC setup. The performance evaluation results against the existing state-of-the-art reveal that the proposed scheme accomplishes enhanced security features with reduced computational and communicational overheads. Further, its extensive evaluation on the widely applicable Automated Validation of Internet Security Protocols and Applications (AVISPA) tool guarantee its safeness against different attack vectors.

2023, Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems

Source-controlled routing has been proposed as a way to improve flexibility of future network architectures, as well as simplifying the data plane. However, if a packet specifies its path, this precludes fast local rerouting within the network. We propose SlickPackets, a novel solution that allows packets to slip around failures by specifying alternate paths in their headers, in the form of compactlyencoded directed acyclic graphs. We show that this can be accomplished with reasonably small packet headers for real network topologies, and results in responsiveness to failures that is competitive with past approaches that require much more state within the network. Our approach thus enables fast failure response while preserving the benefits of source-controlled routing.

2023, IEEE Transactions on Intelligent Transportation Systems

In this paper, we propose a new privacy preservation scheme, named pseudonymous authentication-based conditional privacy (PACP), which allows vehicles in a vehicular ad hoc network (VANET) to use pseudonyms instead of their true identity to obtain provably good privacy. In our scheme, vehicles interact with roadside units to help them generate pseudonyms for anonymous communication. In our setup, the pseudonyms are only known to the vehicles but have no other entities in the network. In addition, our scheme provides an efficient revocation mechanism that allows vehicles to be identified and revoked from the network if needed. Thus, we provide conditional privacy to the vehicles in the system, that is, the vehicles will be anonymous in the network until they are revoked, at which point, they cease to be anonymous.

2023, Computer Communications

2023, 2011 Sixth International Conference on Availability, Reliability and Security

2023

This document describes an LDAP schema for X.509 attribute certificates (ACs). Each AC is broken down into a set of attribute types. These attributes can then be stored in an AC entry. An object class is defined for this AC entry. Each... more

2023, The IEEE symposium on Computers and Communications

In this paper, we propose a routing technique, "recursive Loop-Free Alternates (rLFAs)", to alleviate packet loss due to transient link failures. The technique consists of a backup path calculation with corresponding rerouting scheme based on the Loop-Free Condition (LFC) as defined in the basic specification for IP Fast ReRoute (IPFRR). Under this routing strategy, nodes calculate backup paths by modifying the weights of links in the primary shortest path tree. If a failure occurs, the detecting node determines the number of recursions, which indicates the number of times packets must be forwarded along the alternate next hops to bypass the failed link. This technique guarantees full repair coverage for single link failures. We evaluate the performance of our proposed technique through simulations and show that the incurred overheads, the stretch of its pre-computed alternate paths, and the failure-state Maximum Link Utilisation (MLU) are minimal.

2023, Proceedings of the 9th ACM SIGCOMM Workshop on Hot Topics in Networks

This paper presents Packet Recycling (PR), a technique that takes advantage of cellular graph embeddings to reroute packets that would otherwise be dropped in case of link or node failures. The technique employs only one bit in the packet header to cover any single link failures, and in the order of log 2 (d) bits to cover all non-disconnecting failure combinations, where d is the diameter of the network. We show that our routing strategy is effective and that its path length stretch is acceptable for realistic topologies. The packet header overhead incurred by PR is very small, and the extra memory and packet processing time required to implement it at each router are insignificant. This makes PR suitable for loss-sensitive, mission-critical network applications.

2023, KNOM …

2023

The short-lived failures are reasonably common in IP networks, there are many ways with which local rerouting can be provided for high availability but most of them are for single link failure. Here, we are suggesting a Localized On-demand Link State (LOLS) routing to safeguard the forwarding continuity even with multiple failures limiting the propagation of failure information to just a few hops. LOLS cannot guarantee loop-free forwarding during route convergence and this is the reason why we are working on integrating Fast Convergence Fast Reroute (FCFR) technique with LOLS to ensure loop free rerouting and convergence even with multiple failures. Fast Convergence with Fast Reroute (FCFR), which uses a fast reroute scheme such as Not-Via and desires just one additional bit in the packet header with much less per-packet overhead. Integrating LOLS with FCFR is going to hold the quality of LOLS of loop free forwarding and overcome drawback of LOLS by ensuring loop free convergence.

2023

The short-lived failures are reasonably common in IP networks, there are many ways with which local rerouting can be provided for high availability but most of them are for single link failure. Here, we are suggesting a Localized Ondemand Link State (LOLS) routing to safeguard the forwarding continuity even with multiple failures limiting the propagation of failure information to just a few hops. LOLS cannot guarantee loop-free forwarding during route convergence and this is the reason why we are working on integrating Fast Convergence Fast Reroute (FCFR) technique with LOLS to ensure loop free rerouting and convergence even with multiple failures. Fast Convergence with Fast Reroute (FCFR), which uses a fast reroute scheme such as Not-Via and desires just one additional bit in the packet header with much less per-packet overhead. Integrating LOLS with FCFR is going to hold the quality of LOLS of loop free forwarding and overcome drawback of LOLS by ensuring loop free convergence.

2023, Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems

2023, International Journal of Computer Applications

distributed systems, that are based on constructing a network of heterogeneous computers, suffer from the problem of failing components during the system run time. In case of failure, the distributed applications must be restarted from the scratch. The main goal of this research is to add the dynamic failure recovery technique to the JavaSpaces server. So, the client continues its jobs while failures occur in the system. Also, the new technique in JavaSpaces is evaluated by analyzing and testing.

2023, Int. J. Netw. Secur.

Vehicular Ad hoc Network (VANET) is identified as a key part of Intelligent Transport framework. VANET plays a significant role to establish communication between Vehicle to Vehicle (V2V) and Vehicle to Infrastructure (V2I). Keeping in mind the end goal to build an effective network, it is expected to have steadiness of security and transmission of unwavering quality in VANET. In this paper, a discrete event based threat driven authentication approach to provide secure communication between V2V and V2I is proposed. A combination of re-encryption key, public key, private key and session key is used by this approach for guaranteeing a secure communication between vehicle to vehicle and vehicle to Road side Unit (RSU). The analysis of the proposed approach is realized by using Petri nets and Veins framework. The proposed approach is also compared with the related works on the basis of computational overhead (CO), throughput, packet delivery ratio and average delay. The evaluated result...