On the Internet delay-based clustering

Nattaphol Jariyakul, Taieb Znati

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)


The scalability of routing in large scale networks, such as the Interne, is critical to achieve low delay and high throughput. The lack of scalability of routing protocols in large-scale networks results from the prohibitive overhead incurred during dissemination of path metric values across the network. This paper addresses this problem and proposes a cluster-based scheme, referred to as d-median, which strikes a balance between scalability and routing efficiency. In this scheme, the link metric information is exchanged on a per-cluster basis, rather than on a per-node basis thereby reducing considerably the routing overhead. The simulation results show that the scheme exhibits better performance compared to existing models.

Original languageEnglish
Title of host publicationProceedings - 38th Annual Simulation Symposium, ANSS-38 2005
Number of pages9
Publication statusPublished - 2005
Externally publishedYes
Event38th Annual Simulation Symposium, ANSS-38 2005 - San Diego, CA, United States
Duration: Apr 4 2005Apr 6 2005

Publication series

NameProceedings - Simulation Symposium
ISSN (Print)1080-241X


Conference38th Annual Simulation Symposium, ANSS-38 2005
Country/TerritoryUnited States
CitySan Diego, CA

ASJC Scopus subject areas

  • General Engineering


Dive into the research topics of 'On the Internet delay-based clustering'. Together they form a unique fingerprint.

Cite this