Using non-random associations for predicting latency in WANs

Vladimir Zadorozhny, Louiqa Raschid, Avigdor Gal, Qiang Ye, Hyma Murthy

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In this paper, we propose a scalable performance management tool for Wide Area Applications. Our objective is to scalably identify non-random associations between pairs of individual Latency Profiles (iLPs) (i.e., latency distributions experienced by clients when connecting to a server) and exploit them in latency prediction. Our approach utilizes Relevance Networks (RNs) to manage tens of thousands of iLPs. Non-random associations between iLPs can be identified by topology-independent measures such as correlation and mutual information. We demonstrate that these non-random associations do indeed have a significant impact in improving the error of latency prediction.

Original languageEnglish
Title of host publicationWeb Information Systems Engineering, WISE 2005 - 6th International Conference on Web Information Systems Engineering, Proceedings
Pages560-568
Number of pages9
DOIs
StatePublished - 2005
Event6th International Conference on Web Information Systems Engineering, WISE 2005 - New York, NY, United States
Duration: 20 Nov 200522 Nov 2005

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3806 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference6th International Conference on Web Information Systems Engineering, WISE 2005
Country/TerritoryUnited States
CityNew York, NY
Period20/11/0522/11/05

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Using non-random associations for predicting latency in WANs'. Together they form a unique fingerprint.

Cite this