Conferences related to Computer network reliability

Back to Top

ICC 2021 - IEEE International Conference on Communications

IEEE ICC is one of the two flagship IEEE conferences in the field of communications; Montreal is to host this conference in 2021. Each annual IEEE ICC conference typically attracts approximately 1,500-2,000 attendees, and will present over 1,000 research works over its duration. As well as being an opportunity to share pioneering research ideas and developments, the conference is also an excellent networking and publicity event, giving the opportunity for businesses and clients to link together, and presenting the scope for companies to publicize themselves and their products among the leaders of communications industries from all over the world.


2020 42nd Annual International Conference of the IEEE Engineering in Medicine & Biology Society (EMBC)

The conference program will consist of plenary lectures, symposia, workshops and invitedsessions of the latest significant findings and developments in all the major fields of biomedical engineering.Submitted papers will be peer reviewed. Accepted high quality papers will be presented in oral and postersessions, will appear in the Conference Proceedings and will be indexed in PubMed/MEDLINE


2020 IEEE 18th International Conference on Industrial Informatics (INDIN)

INDIN focuses on recent developments, deployments, technology trends, and research results in Industrial Informatics-related fields from both industry and academia


IEEE INFOCOM 2020 - IEEE Conference on Computer Communications

IEEE INFOCOM solicits research papers describing significant and innovative researchcontributions to the field of computer and data communication networks. We invite submissionson a wide range of research topics, spanning both theoretical and systems research.


2020 IEEE International Conference on Image Processing (ICIP)

The International Conference on Image Processing (ICIP), sponsored by the IEEE SignalProcessing Society, is the premier forum for the presentation of technological advances andresearch results in the fields of theoretical, experimental, and applied image and videoprocessing. ICIP 2020, the 27th in the series that has been held annually since 1994, bringstogether leading engineers and scientists in image and video processing from around the world.



Periodicals related to Computer network reliability

Back to Top

Automatic Control, IEEE Transactions on

The theory, design and application of Control Systems. It shall encompass components, and the integration of these components, as are necessary for the construction of such systems. The word `systems' as used herein shall be interpreted to include physical, biological, organizational and other entities and combinations thereof, which can be represented through a mathematical symbolism. The Field of Interest: shall ...


Biomedical Engineering, IEEE Transactions on

Broad coverage of concepts and methods of the physical and engineering sciences applied in biology and medicine, ranging from formalized mathematical theory through experimental science and technological development to practical clinical applications.


Communications Magazine, IEEE

IEEE Communications Magazine was the number three most-cited journal in telecommunications and the number eighteen cited journal in electrical and electronics engineering in 2004, according to the annual Journal Citation Report (2004 edition) published by the Institute for Scientific Information. Read more at http://www.ieee.org/products/citations.html. This magazine covers all areas of communications such as lightwave telecommunications, high-speed data communications, personal communications ...


Communications Surveys & Tutorials, IEEE

Each tutorial reviews currents communications topics in network management and computer and wireless communications. Available tutorials, which are 2.5 to 5 hours in length contains the original visuals and voice-over by the presenter. IEEE Communications Surveys & Tutorials features two distinct types of articles: original articles and reprints. The original articles are exclusively written for IEEE Communications Surveys & Tutorials ...


Communications, IEEE Transactions on

Telephone, telegraphy, facsimile, and point-to-point television, by electromagnetic propagation, including radio; wire; aerial, underground, coaxial, and submarine cables; waveguides, communication satellites, and lasers; in marine, aeronautical, space and fixed station services; repeaters, radio relaying, signal storage, and regeneration; telecommunication error detection and correction; multiplexing and carrier techniques; communication switching systems; data communications; and communication theory. In addition to the above, ...



Most published Xplore authors for Computer network reliability

Back to Top

Xplore Articles related to Computer network reliability

Back to Top

Reliability evaluation algorithms for distributed systems

IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?, 1988

The authors introduce two techniques for computing the reliability of a distributed computing system (DCS). The first scheme uses two steps and requires enumeration of multiterminal connections which, in turn, leads to the reliability expression. The second technique, called FARE (Fast Algorithm for Reliability Evaluation), does not require an a priori knowledge of multiterminal connections for computing the reliability expression. ...


Lifetime distribution of circular consecutive-k-out-of-n:F systems with exchangeable lifetimes

IEEE Transactions on Reliability, 1989

A recursive algorithm for computing the lifetime distribution of a circular consecutive-k-out-of-n:F system with statistically exchangeable component lifetimes is presented. The result applies to a load-sharing model.<<ETX>>


Reliable opportunistic routing

Proceedings of the 31st Chinese Control Conference, 2012

Opportunistic routing is applied to wireless multi-hop network. It makes full use of the characteristic of wireless network, decreasing the retransmission of data packet, increasing the throughput. At present, opportunistic routing is based on the assumption that the node and link are completely reliable. This paper proposes a reliable opportunistic routing, which evaluates reliability of node using terminal-pair reliability index, ...


Performance evaluation of a hierarchical hybrid adaptive routing algorithm for large scale computer communication networks

[1988] Proceedings. Computer Networking Symposium, 1988

A hierarchical hybrid adaptive routing algorithm (HHARA) is presented for dynamic large-scale computer communication networks (LSCCN). The performance of the proposed algorithm is evaluated and compared to that of nonhierarchical routing algorithms by simulation experiments on a 50-node network model. The major evaluation criteria are reliability, communication overhead, computation overhead, and average packet delay. A fixed routing algorithm, the most ...


A consistent history link connectivity protocol

Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing. IPPS/SPDP 1999, 1999

The RAIN (Reliable Array of Independent Nodes) project at Caltech is focusing on creating reliable distributed systems by leveraging commercially available personal computers and interconnect technologies. Fault-tolerance is introduced into the communication infrastructure by using multiple network interfaces per compute node. When using multiple network connections per compute node, the question of how to monitor connectivity between nodes arises. We ...



Educational Resources on Computer network reliability

Back to Top

IEEE-USA E-Books

  • Reliability evaluation algorithms for distributed systems

    The authors introduce two techniques for computing the reliability of a distributed computing system (DCS). The first scheme uses two steps and requires enumeration of multiterminal connections which, in turn, leads to the reliability expression. The second technique, called FARE (Fast Algorithm for Reliability Evaluation), does not require an a priori knowledge of multiterminal connections for computing the reliability expression. A performance parameter called the communication cost index (CCI) is defined. The authors compare algorithms with an existing method in terms of computer time and memory requirement. The results show that FARE outperforms two-step methods.<<ETX>>

  • Lifetime distribution of circular consecutive-k-out-of-n:F systems with exchangeable lifetimes

    A recursive algorithm for computing the lifetime distribution of a circular consecutive-k-out-of-n:F system with statistically exchangeable component lifetimes is presented. The result applies to a load-sharing model.<<ETX>>

  • Reliable opportunistic routing

    Opportunistic routing is applied to wireless multi-hop network. It makes full use of the characteristic of wireless network, decreasing the retransmission of data packet, increasing the throughput. At present, opportunistic routing is based on the assumption that the node and link are completely reliable. This paper proposes a reliable opportunistic routing, which evaluates reliability of node using terminal-pair reliability index, combining the traditional opportunistic routing. The protocol can transmit data packet more reliably by reliable forwarder list, thus, decreases end-to-end delay, increases the throughput. The result of NS2 simulation shows the availability of our protocol.

  • Performance evaluation of a hierarchical hybrid adaptive routing algorithm for large scale computer communication networks

    A hierarchical hybrid adaptive routing algorithm (HHARA) is presented for dynamic large-scale computer communication networks (LSCCN). The performance of the proposed algorithm is evaluated and compared to that of nonhierarchical routing algorithms by simulation experiments on a 50-node network model. The major evaluation criteria are reliability, communication overhead, computation overhead, and average packet delay. A fixed routing algorithm, the most recent ARPANET routing algorithm, and HHARA are compared using simulation experiments. The simulation study indicates that HHARA makes a good balance between the reduction of routing database maintenance overhead, and the global routing capability as well as the local adaptivity to the network changes.<<ETX>>

  • A consistent history link connectivity protocol

    The RAIN (Reliable Array of Independent Nodes) project at Caltech is focusing on creating reliable distributed systems by leveraging commercially available personal computers and interconnect technologies. Fault-tolerance is introduced into the communication infrastructure by using multiple network interfaces per compute node. When using multiple network connections per compute node, the question of how to monitor connectivity between nodes arises. We examine a connectivity protocol that guarantees that each side of a point-to-point connection sees the same history of activity over the communication channel. In other words, we maintain a consistent history of the state of the channel. The history of channel-state is guaranteed to be identical at each endpoint within some bounded slack. Our main contributions are: (i) a simple, stable protocol for monitoring connectivity that maintains a consistent history with bounded slack, and (ii) proofs that this protocol exhibits correctness, bounded slack, and stability.

  • Comments on "Tolerance of double-loop computer networks to multimode failures" by H. Masuyama and T. Ichimori

    H. Masuyama and T. Ichimori (see IEEE Trans. Comput., vol.38, no.5, p.738-41, 1989) quantitatively evaluated the ability of a class of double-loop networks called forward-loop-backward-hop (FLBH) networks to tolerate node failures. Their approach was based on the enumeration of all possible sets of failures. The authors prove that their results are incorrect and demonstrate that it is difficult to solve this problem using an approach based on the enumeration of failure sets, suggesting that other approaches may be preferable.<<ETX>>

  • Efficient ordered broadcasting in reliable CSMA/CD networks

    Ordered broadcast is a communication paradigm which requires that all the nodes in the network receive a message, and that the nodes receive the different messages in the same order. Ordered broadcast is particularly useful for supporting fault tolerance in distributed systems. We present a protocol for ordered broadcasts in a CSMA/CD network that uses the high reliability and collision detection properties of these networks in a novel manner. The control of the protocol is distributed, and even if the sender of a message fails after transmitting a message which is missed by some nodes, the ordered broadcast property is satisfied. The protocol has a small overhead, but requires both hardware and software support for implementation.

  • Reliability comparison of computer networks

    The authors consider networks modeled as directed graphs with a uniform link failure probability (q) and develop an algorithm which permits not only a symbolic reliability evaluation, but also a comparison of different topologies to verify if a particular one is uniformly maximally reliable, i.e. it has the best reliability for any value of q. In the case when the previous property cannot be verified, it is possible to evaluate exactly the range of values of q for which one network is better than the other. The method can be extended also to compare networks with different topological characteristics, namely different number of links and/or nodes.<<ETX>>

  • Towards client-assisted management in large-scale wireless networks [WinMee Workshop]

    None

  • The application of charge balance transmission technology in real time data monitoring system of the power plant

    In this paper, the technology of charge balance transmission for real time data monitoring of the economically run computer network system for 1-2 unit of a power plant is presented and the application of the technology in system communication is explained in detail. Using the advanced technology ensures the reliability and real-time operation of communication in strong electromagnetic environment.