A master redundancy technique in IEEE 1588 synchronization with a link congestion estimation

2010 ◽  
Author(s):  
Takahide Murakami ◽  
Yukio Horiuchi
Keyword(s):  
Ieee 1588 ◽  
Link Congestion

μPMU based on wireless IEEE 1588 PTP

2020 ◽  
Author(s):  
khaoula Hassini ◽  
Ahmed Fakhfakh ◽  
Faouzi Derbel
Keyword(s):  
Ieee 1588

Surviving switch failures in cloud datacenters

2021 ◽  
Vol 51 (2) ◽  
pp. 2-9
Author(s):  
Rachee Singh ◽  
Muqeet Mukhtar ◽  
Ashay Krishna ◽  
Aniruddha Parkhi ◽  
Jitendra Padhye ◽  
...  
Keyword(s):  
Operating System ◽  
Network Traffic ◽  
Survival Rates ◽  
Cloud Provider ◽  
Significant Heterogeneity ◽  
Power Losses ◽  
Software Bugs ◽  
Hardware Impairments ◽  
Link Congestion

Switch failures can hamper access to client services, cause link congestion and blackhole network traffic. In this study, we examine the nature of switch failures in the datacenters of a large commercial cloud provider through the lens of survival theory. We study a cohort of over 180,000 switches with a variety of hardware and software configurations and find that datacenter switches have a 98% likelihood of functioning uninterrupted for over 3 months since deployment in production. However, there is significant heterogeneity in switch survival rates with respect to their hardware and software: the switches of one vendor are twice as likely to fail compared to the others. We attribute the majority of switch failures to hardware impairments and unplanned power losses. We find that the in-house switch operating system, SONiC, boosts the survival likelihood of switches in datacenters by 1% by eliminating switch failures caused by software bugs in vendor switch OSes.

Implementation of IEEE-1588 timing and synchronization for ATCA control and data acquisition systems

2012 ◽  
Vol 87 (12) ◽  
pp. 2178-2181 ◽  
Author(s):  
Miguel Correia ◽  
Jorge Sousa ◽  
Álvaro Combo ◽  
António P. Rodrigues ◽  
Bernardo B. Carvalho ◽  
...  
Keyword(s):  
Data Acquisition ◽  
Ieee 1588 ◽  
Data Acquisition Systems

Routing algorithm of minimizing maximum link congestion on grid networks

2014 ◽  
Vol 21 (5) ◽  
pp. 1713-1732 ◽  
Author(s):  
Jun Xu ◽  
Jianfeng Yang ◽  
Chengcheng Guo ◽  
Yann-Hang Lee ◽  
Duo Lu
Keyword(s):  
Routing Algorithm ◽  
Grid Networks ◽  
Link Congestion

scholarly journals Congested Link Inference Algorithms in Dynamic Routing IP Network

2017 ◽  
Vol 2017 ◽  
pp. 1-17
Author(s):  
Yu Chen ◽  
Zhe-min Duan
Keyword(s):  
Markov Property ◽  
Variable Structure ◽  
Dynamic Routing ◽  
Simplified Model ◽  
Maximum A Posteriori ◽  
A Posteriori ◽  
Bayesian Network Model ◽  
Inference Algorithms ◽  
Ip Network ◽  
Link Congestion

The performance descending of current congested link inference algorithms is obviously in dynamic routing IP network, such as the most classical algorithm CLINK. To overcome this problem, based on the assumptions of Markov property and time homogeneity, we build a kind of Variable Structure Discrete Dynamic Bayesian (VSDDB) network simplified model of dynamic routing IP network. Under the simplified VSDDB model, based on the Bayesian Maximum A Posteriori (BMAP) and Rest Bayesian Network Model (RBNM), we proposed an Improved CLINK (ICLINK) algorithm. Considering the concurrent phenomenon of multiple link congestion usually happens, we also proposed algorithm CLILRS (Congested Link Inference algorithm based on Lagrangian Relaxation Subgradient) to infer the set of congested links. We validated our results by the experiments of analogy, simulation, and actual Internet.

Sign in / Sign up

Export Citation Format

Share Document