Efficient visualization of large routing topologies
As the Internet grows in size and complexity, network managers face a significant challenge in trying to understand the behaviour of routing protocols in large networks. In this paper, we present a tool called VLNT (visualizing large network topologies), which helps network managers to analyse compl...
Gespeichert in:
| Veröffentlicht in: | International journal of network management 2004-03, Vol.14 (2), p.105-118 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 118 |
|---|---|
| container_issue | 2 |
| container_start_page | 105 |
| container_title | International journal of network management |
| container_volume | 14 |
| creator | Au, Siew Cheong Leckie, Christopher Parhar, Ajeet Wong, Gerard |
| description | As the Internet grows in size and complexity, network managers face a significant challenge in trying to understand the behaviour of routing protocols in large networks. In this paper, we present a tool called VLNT (visualizing large network topologies), which helps network managers to analyse complex routing topologies. A key contribution of our system is a novel hybrid layout algorithm, which significantly reduces the computation time required to layout large network topologies in comparison to conventional layout approaches. In addition our algorithm includes a novel termination criterion that avoids unnecessary iterations when optimizing the network layout. We demonstrate how the visualization features of VLNT can be used to analyse and improve BGP routing topologies, and provide examples using real‐life routing data. Copyright © 2004 John Wiley & Sons, Ltd. |
| doi_str_mv | 10.1002/nem.511 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_29375607</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>29375607</sourcerecordid><originalsourceid>FETCH-LOGICAL-c2761-d2229c4729a7105d22419d9399b240e6cf760ea12b2fd4a6b3e34767a90eaae3</originalsourceid><addsrcrecordid>eNp90FFLwzAQB_AgCs4pfoU-qSCduaRNlkeZcypzigx8DFl3HdGumUmnzk9vRsU3fcrl-HF3_Ak5BtoDStlFjcteDrBDOkCVSgEU3d3WeZ5KyPr75CCEFxolKNkhfFiWtrBYN8m7DWtT2S_TWFcnrkwq4xeYeLdubL1IGrdylVtYDIdkrzRVwKOft0um18Pp4CYdP4xuB5fjtGBSQDpnjKkik0wZGdfHbwZqrrhSM5ZRFEUpBUUDbMbKeWbEjCPPpJBGxa5B3iUn7diVd29rDI1e2lBgVZka3TpoprjMBZURnv0LQUhgWV_kNNLTlhbeheCx1Ctvl8ZvNFC9jU_H-HSML8rzVn7YCjd_MT0Z3rc6bbUNDX7-auNftZDxTP08GWn2JPKrO_6oB_wb1Mp-Eg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1671248650</pqid></control><display><type>article</type><title>Efficient visualization of large routing topologies</title><source>Wiley Online Library - AutoHoldings Journals</source><creator>Au, Siew Cheong ; Leckie, Christopher ; Parhar, Ajeet ; Wong, Gerard</creator><creatorcontrib>Au, Siew Cheong ; Leckie, Christopher ; Parhar, Ajeet ; Wong, Gerard</creatorcontrib><description>As the Internet grows in size and complexity, network managers face a significant challenge in trying to understand the behaviour of routing protocols in large networks. In this paper, we present a tool called VLNT (visualizing large network topologies), which helps network managers to analyse complex routing topologies. A key contribution of our system is a novel hybrid layout algorithm, which significantly reduces the computation time required to layout large network topologies in comparison to conventional layout approaches. In addition our algorithm includes a novel termination criterion that avoids unnecessary iterations when optimizing the network layout. We demonstrate how the visualization features of VLNT can be used to analyse and improve BGP routing topologies, and provide examples using real‐life routing data. Copyright © 2004 John Wiley & Sons, Ltd.</description><identifier>ISSN: 1055-7148</identifier><identifier>ISSN: 1099-1190</identifier><identifier>EISSN: 1099-1190</identifier><identifier>DOI: 10.1002/nem.511</identifier><language>eng</language><publisher>Chichester, UK: John Wiley & Sons, Ltd</publisher><subject>Algorithms ; Computer networks ; Internet ; Networks ; Optimization ; Routing (telecommunications) ; Topology ; Visualization</subject><ispartof>International journal of network management, 2004-03, Vol.14 (2), p.105-118</ispartof><rights>Copyright © 2004 John Wiley & Sons, Ltd.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c2761-d2229c4729a7105d22419d9399b240e6cf760ea12b2fd4a6b3e34767a90eaae3</citedby><cites>FETCH-LOGICAL-c2761-d2229c4729a7105d22419d9399b240e6cf760ea12b2fd4a6b3e34767a90eaae3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://onlinelibrary.wiley.com/doi/pdf/10.1002%2Fnem.511$$EPDF$$P50$$Gwiley$$H</linktopdf><linktohtml>$$Uhttps://onlinelibrary.wiley.com/doi/full/10.1002%2Fnem.511$$EHTML$$P50$$Gwiley$$H</linktohtml><link.rule.ids>314,780,784,1416,27922,27923,45572,45573</link.rule.ids></links><search><creatorcontrib>Au, Siew Cheong</creatorcontrib><creatorcontrib>Leckie, Christopher</creatorcontrib><creatorcontrib>Parhar, Ajeet</creatorcontrib><creatorcontrib>Wong, Gerard</creatorcontrib><title>Efficient visualization of large routing topologies</title><title>International journal of network management</title><addtitle>Int. J. Network Mgmt</addtitle><description>As the Internet grows in size and complexity, network managers face a significant challenge in trying to understand the behaviour of routing protocols in large networks. In this paper, we present a tool called VLNT (visualizing large network topologies), which helps network managers to analyse complex routing topologies. A key contribution of our system is a novel hybrid layout algorithm, which significantly reduces the computation time required to layout large network topologies in comparison to conventional layout approaches. In addition our algorithm includes a novel termination criterion that avoids unnecessary iterations when optimizing the network layout. We demonstrate how the visualization features of VLNT can be used to analyse and improve BGP routing topologies, and provide examples using real‐life routing data. Copyright © 2004 John Wiley & Sons, Ltd.</description><subject>Algorithms</subject><subject>Computer networks</subject><subject>Internet</subject><subject>Networks</subject><subject>Optimization</subject><subject>Routing (telecommunications)</subject><subject>Topology</subject><subject>Visualization</subject><issn>1055-7148</issn><issn>1099-1190</issn><issn>1099-1190</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2004</creationdate><recordtype>article</recordtype><recordid>eNp90FFLwzAQB_AgCs4pfoU-qSCduaRNlkeZcypzigx8DFl3HdGumUmnzk9vRsU3fcrl-HF3_Ak5BtoDStlFjcteDrBDOkCVSgEU3d3WeZ5KyPr75CCEFxolKNkhfFiWtrBYN8m7DWtT2S_TWFcnrkwq4xeYeLdubL1IGrdylVtYDIdkrzRVwKOft0um18Pp4CYdP4xuB5fjtGBSQDpnjKkik0wZGdfHbwZqrrhSM5ZRFEUpBUUDbMbKeWbEjCPPpJBGxa5B3iUn7diVd29rDI1e2lBgVZka3TpoprjMBZURnv0LQUhgWV_kNNLTlhbeheCx1Ctvl8ZvNFC9jU_H-HSML8rzVn7YCjd_MT0Z3rc6bbUNDX7-auNftZDxTP08GWn2JPKrO_6oB_wb1Mp-Eg</recordid><startdate>200403</startdate><enddate>200403</enddate><creator>Au, Siew Cheong</creator><creator>Leckie, Christopher</creator><creator>Parhar, Ajeet</creator><creator>Wong, Gerard</creator><general>John Wiley & Sons, Ltd</general><scope>BSCLL</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>200403</creationdate><title>Efficient visualization of large routing topologies</title><author>Au, Siew Cheong ; Leckie, Christopher ; Parhar, Ajeet ; Wong, Gerard</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c2761-d2229c4729a7105d22419d9399b240e6cf760ea12b2fd4a6b3e34767a90eaae3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2004</creationdate><topic>Algorithms</topic><topic>Computer networks</topic><topic>Internet</topic><topic>Networks</topic><topic>Optimization</topic><topic>Routing (telecommunications)</topic><topic>Topology</topic><topic>Visualization</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Au, Siew Cheong</creatorcontrib><creatorcontrib>Leckie, Christopher</creatorcontrib><creatorcontrib>Parhar, Ajeet</creatorcontrib><creatorcontrib>Wong, Gerard</creatorcontrib><collection>Istex</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>International journal of network management</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Au, Siew Cheong</au><au>Leckie, Christopher</au><au>Parhar, Ajeet</au><au>Wong, Gerard</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Efficient visualization of large routing topologies</atitle><jtitle>International journal of network management</jtitle><addtitle>Int. J. Network Mgmt</addtitle><date>2004-03</date><risdate>2004</risdate><volume>14</volume><issue>2</issue><spage>105</spage><epage>118</epage><pages>105-118</pages><issn>1055-7148</issn><issn>1099-1190</issn><eissn>1099-1190</eissn><abstract>As the Internet grows in size and complexity, network managers face a significant challenge in trying to understand the behaviour of routing protocols in large networks. In this paper, we present a tool called VLNT (visualizing large network topologies), which helps network managers to analyse complex routing topologies. A key contribution of our system is a novel hybrid layout algorithm, which significantly reduces the computation time required to layout large network topologies in comparison to conventional layout approaches. In addition our algorithm includes a novel termination criterion that avoids unnecessary iterations when optimizing the network layout. We demonstrate how the visualization features of VLNT can be used to analyse and improve BGP routing topologies, and provide examples using real‐life routing data. Copyright © 2004 John Wiley & Sons, Ltd.</abstract><cop>Chichester, UK</cop><pub>John Wiley & Sons, Ltd</pub><doi>10.1002/nem.511</doi><tpages>14</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1055-7148 |
| ispartof | International journal of network management, 2004-03, Vol.14 (2), p.105-118 |
| issn | 1055-7148 1099-1190 1099-1190 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_29375607 |
| source | Wiley Online Library - AutoHoldings Journals |
| subjects | Algorithms Computer networks Internet Networks Optimization Routing (telecommunications) Topology Visualization |
| title | Efficient visualization of large routing topologies |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-14T13%3A17%3A15IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Efficient%20visualization%20of%20large%20routing%20topologies&rft.jtitle=International%20journal%20of%20network%20management&rft.au=Au,%20Siew%20Cheong&rft.date=2004-03&rft.volume=14&rft.issue=2&rft.spage=105&rft.epage=118&rft.pages=105-118&rft.issn=1055-7148&rft.eissn=1099-1190&rft_id=info:doi/10.1002/nem.511&rft_dat=%3Cproquest_cross%3E29375607%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1671248650&rft_id=info:pmid/&rfr_iscdi=true |