A vote-based intrusion-tolerance algorithm for network latency estimation
by Cong Wang; Fengli Zhang
International Journal of Computer Applications in Technology (IJCAT), Vol. 52, No. 2/3, 2015

Abstract: To enhance the survivability of a network coordinate system (NCS) in an unsafe environment, the physical meaning of the latency estimation error is re-explained as the reputation of reference node instead of spring force. Thus, a vote-based model for network latency estimation is proposed, and categorised as a kind of l1 loss function optimising method. By taking the non-differentiability of the loss function into consideration, we introduce a variant of Rosenbrock algorithm to minimise this function and prove its convergence. The experiments show that compared with the traditional model, our model can achieve not only higher accuracy in benign environment but also better robustness in serious unsafe environments with low computing cost, and shows a strong intrusion tolerance capability.

Online publication date: Sat, 26-Sep-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computer Applications in Technology (IJCAT):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com