Spanning Tree Aggregation Using Attribute of Service Boundary Line 


Vol. 18,  No. 6, pp. 441-444, Dec.  2011
10.3745/KIPSTC.2011.18.6.441


PDF
  Abstract

In this study, we present a method for efficiently aggregating network state information. It is especially useful for aggregating links that have both delay and bandwidth in an asymmetric network. Proposed method reduces the information distortion of logical link by integration process after similar measure and grouping of logical links in multi-level topology transformation to reduce the space complexity. It is applied to transform the full mesh topology whose Service Boundary Line (SBL) serves as its logical link into a spanning tree topology. Simulation results show that aggregated information accuracy and query response accuracy are higher than that of other known method.

  Statistics
  Cite this article

[IEEE Style]

S. R. Kwon and C. H. Jeon, "Spanning Tree Aggregation Using Attribute of Service Boundary Line," The KIPS Transactions:PartC, vol. 18, no. 6, pp. 441-444, 2011. DOI: 10.3745/KIPSTC.2011.18.6.441.

[ACM Style]

So Ra Kwon and Chang Ho Jeon. 2011. Spanning Tree Aggregation Using Attribute of Service Boundary Line. The KIPS Transactions:PartC, 18, 6, (2011), 441-444. DOI: 10.3745/KIPSTC.2011.18.6.441.

Forms

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)

Old Journals

Indexing

All publications of TKIPS is indexed in DOI, EBSCO, Google Scholar, Crossref, and CrossCheck.

TKIPS is also selected as the Journal for Accreditation by NRF (National Research Foundation of Korea).

Related Journals