Pretražite po imenu i prezimenu autora, mentora, urednika, prevoditelja

Napredna pretraga

Pregled bibliografske jedinice broj: 1192717

An Approach To Build Stable Spanning Tree Topology


Segaric, K.; Knezevic, P.; Blaskovic, B.
An Approach To Build Stable Spanning Tree Topology // Proceedings of EUROCON'2001
Bratislava, Slovačka: IEEE, 2001. str. 400-403 doi:10.1109/eurcon.2001.938148 (predavanje, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)


CROSBI ID: 1192717 Za ispravke kontaktirajte CROSBI podršku putem web obrasca

Naslov
An Approach To Build Stable Spanning Tree Topology
(An approach to build stable spanning tree topology)

Autori
Segaric, K. ; Knezevic, P. ; Blaskovic, B.

Vrsta, podvrsta i kategorija rada
Radovi u zbornicima skupova, cjeloviti rad (in extenso), znanstveni

Izvornik
Proceedings of EUROCON'2001 / - : IEEE, 2001, 400-403

Skup
EUROCON 2001 - Intl. Conf. on Trends in Communications

Mjesto i datum
Bratislava, Slovačka, 4-7.07.2001

Vrsta sudjelovanja
Predavanje

Vrsta recenzije
Međunarodna recenzija

Ključne riječi
stability problem ; network topology ; spanning tree

Sažetak
This paper considers stability problems regarding topology produced by spanning tree algorithm in transparent bridged networks, and presents an approach to build stable spanning tree structure that is not dependent on a root bridge. This approach rely on tuning spanning-tree port cost in a way that produced topology is resistible to possible attacks or newly connected missconfigured bridges. Special care was taken to ensure stability in transition periods, where bridges negotiate about new root. This approach is completely standards- based and requires only that is possible to tune link costs of switch/bridge ports.

Izvorni jezik
Engleski

Znanstvena područja
Elektrotehnika, Računarstvo



POVEZANOST RADA


Ustanove:
Fakultet elektrotehnike i računarstva, Zagreb

Poveznice na cjeloviti tekst rada:

doi ieeexplore.ieee.org

Citiraj ovu publikaciju:

Segaric, K.; Knezevic, P.; Blaskovic, B.
An Approach To Build Stable Spanning Tree Topology // Proceedings of EUROCON'2001
Bratislava, Slovačka: IEEE, 2001. str. 400-403 doi:10.1109/eurcon.2001.938148 (predavanje, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)
Segaric, K., Knezevic, P. & Blaskovic, B. (2001) An Approach To Build Stable Spanning Tree Topology. U: Proceedings of EUROCON'2001 doi:10.1109/eurcon.2001.938148.
@article{article, author = {Segaric, K. and Knezevic, P. and Blaskovic, B.}, year = {2001}, pages = {400-403}, DOI = {10.1109/eurcon.2001.938148}, keywords = {stability problem, network topology, spanning tree}, doi = {10.1109/eurcon.2001.938148}, title = {An Approach To Build Stable Spanning Tree Topology}, keyword = {stability problem, network topology, spanning tree}, publisher = {IEEE}, publisherplace = {Bratislava, Slova\v{c}ka} }
@article{article, author = {Segaric, K. and Knezevic, P. and Blaskovic, B.}, year = {2001}, pages = {400-403}, DOI = {10.1109/eurcon.2001.938148}, keywords = {stability problem, network topology, spanning tree}, doi = {10.1109/eurcon.2001.938148}, title = {An approach to build stable spanning tree topology}, keyword = {stability problem, network topology, spanning tree}, publisher = {IEEE}, publisherplace = {Bratislava, Slova\v{c}ka} }

Citati:





    Contrast
    Increase Font
    Decrease Font
    Dyslexic Font