Efficient and reliable link state information dissemination

Nirwan Ansari; Gang Cheng; Ram N. Krishnan

doi:10.1109/LCOMM.2004.827446

Efficient and reliable link state information dissemination

Nirwan Ansari, Gang Cheng, Ram N. Krishnan

Electrical and Computer Engineering

Research output: Contribution to journal › Article › peer-review

28 Scopus citations

Abstract

Distributing link state information may place a heavy burden on the network resource. In this letter, based on the tree-based reliable topology (TRT), we propose a simple but efficient and reliable scheme for disseminating link state information. We show that the computational complexity of computing the subnet topology over which link state information is distributed is the same as that of computing the minimum spanning tree.

Original language	English (US)
Pages (from-to)	317-319
Number of pages	3
Journal	IEEE Communications Letters
Volume	8
Issue number	5
DOIs	https://doi.org/10.1109/LCOMM.2004.827446
State	Published - May 2004

All Science Journal Classification (ASJC) codes

Modeling and Simulation
Computer Science Applications
Electrical and Electronic Engineering

Keywords

Link state update
Minimum spanning tree
Protection
Quality-of-service (QoS) routing

Access to Document

10.1109/LCOMM.2004.827446

Cite this

@article{a0f00b38c8b042a39db9e6e1b7ee0065,

title = "Efficient and reliable link state information dissemination",

abstract = "Distributing link state information may place a heavy burden on the network resource. In this letter, based on the tree-based reliable topology (TRT), we propose a simple but efficient and reliable scheme for disseminating link state information. We show that the computational complexity of computing the subnet topology over which link state information is distributed is the same as that of computing the minimum spanning tree.",

keywords = "Link state update, Minimum spanning tree, Protection, Quality-of-service (QoS) routing",

author = "Nirwan Ansari and Gang Cheng and Krishnan, {Ram N.}",

note = "Funding Information: Manuscript received August 20, 2003. The associate editor coordinating the review of this letter and approving it for publication was Prof. J. Choe. This work has been supported in part by the New Jersey Commission on Higher Education via the NJI-TOWER project, and by the New Jersey Commission on Science and Technology via NJWINS.",

year = "2004",

month = may,

doi = "10.1109/LCOMM.2004.827446",

language = "English (US)",

volume = "8",

pages = "317--319",

journal = "IEEE Communications Letters",

issn = "1089-7798",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "5",

}

TY - JOUR

T1 - Efficient and reliable link state information dissemination

AU - Ansari, Nirwan

AU - Cheng, Gang

AU - Krishnan, Ram N.

N1 - Funding Information: Manuscript received August 20, 2003. The associate editor coordinating the review of this letter and approving it for publication was Prof. J. Choe. This work has been supported in part by the New Jersey Commission on Higher Education via the NJI-TOWER project, and by the New Jersey Commission on Science and Technology via NJWINS.

PY - 2004/5

Y1 - 2004/5

N2 - Distributing link state information may place a heavy burden on the network resource. In this letter, based on the tree-based reliable topology (TRT), we propose a simple but efficient and reliable scheme for disseminating link state information. We show that the computational complexity of computing the subnet topology over which link state information is distributed is the same as that of computing the minimum spanning tree.

AB - Distributing link state information may place a heavy burden on the network resource. In this letter, based on the tree-based reliable topology (TRT), we propose a simple but efficient and reliable scheme for disseminating link state information. We show that the computational complexity of computing the subnet topology over which link state information is distributed is the same as that of computing the minimum spanning tree.

KW - Link state update

KW - Minimum spanning tree

KW - Protection

KW - Quality-of-service (QoS) routing

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

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

U2 - 10.1109/LCOMM.2004.827446

DO - 10.1109/LCOMM.2004.827446

M3 - Article

AN - SCOPUS:2942539325

SN - 1089-7798

VL - 8

SP - 317

EP - 319

JO - IEEE Communications Letters

JF - IEEE Communications Letters

IS - 5

ER -

Efficient and reliable link state information dissemination

Abstract

All Science Journal Classification (ASJC) codes

Keywords

Access to Document

Other files and links

Fingerprint

Cite this