Routing algorithm for a clustered network

A. R. Hemanth Kumar, G. Sudhakara, B. S. Satyanarayana

Research output: Contribution to journalArticle

Abstract

The Cluster Dimension of a network is defined as, which is the minimum cardinality of a subset S of the set of nodes having the property that for any two distinct nodes x and y, there exist the node s1, s2 (need not be distinct) in S such that {pipe}d(x:,s1) - d(y, s1){pipe} ≥ 1 and d(x,S2) < d(x,s) for all s {small element of} S - {s2}. In this paper, strictly non overlap- ping clusters are constructed. The concept of LandMarks for Unique Addressing and Clustering (LMUAC) routing scheme is developed. With the help of LMUAC routing scheme, It is shown that path length (upper bound)PLN,d < PLD, Maximum memory space requirement for the networkMSlmuac(Δi) < MSLMUAC < MSH3L < MSnc and Maximum Link utilization factor MLLMUAC(i=j) < MLLMUAC(i≠j) < MLC < MLnc.

Original languageEnglish
Pages (from-to)821-829
Number of pages9
JournalWorld Academy of Science, Engineering and Technology
Volume46
Publication statusPublished - 01-12-2010

Fingerprint

Routing algorithms
Pipe
Pulsed laser deposition
Data storage equipment

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Cite this

Hemanth Kumar, A. R. ; Sudhakara, G. ; Satyanarayana, B. S. / Routing algorithm for a clustered network. In: World Academy of Science, Engineering and Technology. 2010 ; Vol. 46. pp. 821-829.
@article{b47f55bc8b62474c8abb8e965d0e2075,
title = "Routing algorithm for a clustered network",
abstract = "The Cluster Dimension of a network is defined as, which is the minimum cardinality of a subset S of the set of nodes having the property that for any two distinct nodes x and y, there exist the node s1, s2 (need not be distinct) in S such that {pipe}d(x:,s1) - d(y, s1){pipe} ≥ 1 and d(x,S2) < d(x,s) for all s {small element of} S - {s2}. In this paper, strictly non overlap- ping clusters are constructed. The concept of LandMarks for Unique Addressing and Clustering (LMUAC) routing scheme is developed. With the help of LMUAC routing scheme, It is shown that path length (upper bound)PLN,d < PLD, Maximum memory space requirement for the networkMSlmuac(Δi) < MSLMUAC < MSH3L < MSnc and Maximum Link utilization factor MLLMUAC(i=j) < MLLMUAC(i≠j) < MLC < MLnc.",
author = "{Hemanth Kumar}, {A. R.} and G. Sudhakara and Satyanarayana, {B. S.}",
year = "2010",
month = "12",
day = "1",
language = "English",
volume = "46",
pages = "821--829",
journal = "World Academy of Science, Engineering and Technology",
issn = "2010-376X",
publisher = "World Academy of Science Engineering and Technology",

}

Routing algorithm for a clustered network. / Hemanth Kumar, A. R.; Sudhakara, G.; Satyanarayana, B. S.

In: World Academy of Science, Engineering and Technology, Vol. 46, 01.12.2010, p. 821-829.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Routing algorithm for a clustered network

AU - Hemanth Kumar, A. R.

AU - Sudhakara, G.

AU - Satyanarayana, B. S.

PY - 2010/12/1

Y1 - 2010/12/1

N2 - The Cluster Dimension of a network is defined as, which is the minimum cardinality of a subset S of the set of nodes having the property that for any two distinct nodes x and y, there exist the node s1, s2 (need not be distinct) in S such that {pipe}d(x:,s1) - d(y, s1){pipe} ≥ 1 and d(x,S2) < d(x,s) for all s {small element of} S - {s2}. In this paper, strictly non overlap- ping clusters are constructed. The concept of LandMarks for Unique Addressing and Clustering (LMUAC) routing scheme is developed. With the help of LMUAC routing scheme, It is shown that path length (upper bound)PLN,d < PLD, Maximum memory space requirement for the networkMSlmuac(Δi) < MSLMUAC < MSH3L < MSnc and Maximum Link utilization factor MLLMUAC(i=j) < MLLMUAC(i≠j) < MLC < MLnc.

AB - The Cluster Dimension of a network is defined as, which is the minimum cardinality of a subset S of the set of nodes having the property that for any two distinct nodes x and y, there exist the node s1, s2 (need not be distinct) in S such that {pipe}d(x:,s1) - d(y, s1){pipe} ≥ 1 and d(x,S2) < d(x,s) for all s {small element of} S - {s2}. In this paper, strictly non overlap- ping clusters are constructed. The concept of LandMarks for Unique Addressing and Clustering (LMUAC) routing scheme is developed. With the help of LMUAC routing scheme, It is shown that path length (upper bound)PLN,d < PLD, Maximum memory space requirement for the networkMSlmuac(Δi) < MSLMUAC < MSH3L < MSnc and Maximum Link utilization factor MLLMUAC(i=j) < MLLMUAC(i≠j) < MLC < MLnc.

UR - http://www.scopus.com/inward/record.url?scp=84871449421&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84871449421&partnerID=8YFLogxK

M3 - Article

VL - 46

SP - 821

EP - 829

JO - World Academy of Science, Engineering and Technology

JF - World Academy of Science, Engineering and Technology

SN - 2010-376X

ER -