New topology aggregation mechanisms for delay-bandwidth sensitive networks

Today¿s networks are often hierarchically modeled for both scalability and security considerations. Topology aggregation is introduced for the purpose of simplifying routing by summering and compressing information of lower levels and advertising them to higher logical levels. However, the balance b...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Jingjun Zhang, Yuanbin Han, Liguo Wang
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 742
container_issue
container_start_page 737
container_title
container_volume
creator Jingjun Zhang
Yuanbin Han
Liguo Wang
description Today¿s networks are often hierarchically modeled for both scalability and security considerations. Topology aggregation is introduced for the purpose of simplifying routing by summering and compressing information of lower levels and advertising them to higher logical levels. However, the balance between performance and accuracy of state information must be taken into account since topology aggregation will ineluctably give rise to distortion. In this paper, new approximation methods based on approximation staircase formed by power-transformed linear regression model and hyperbolic-transformed linear regression model are proposed to approximate the service efficient frontier in the full mesh approach, and then the full mesh topology is transformed to a simpler tree structure and star structure. The proposed methods are shown to be valuable by performance analysis and comparison with existing methods.
doi_str_mv 10.1109/ICCS.2008.4737283
format Conference Proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_4737283</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4737283</ieee_id><sourcerecordid>4737283</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-4d02afa5787a3b4b9d7c779e490f62f560004b8d7f1512413995e943c313c5753</originalsourceid><addsrcrecordid>eNpFUF9LwzAcjMhAN_cBxJd8gc78bZJHKeomQx_U55E2v3TRthlNsfTbu-HA4-A4OI7jELqlZEUpMfebonhfMUL0SiiumOYXaE4FE0cyQS7_DWczND8FDeFC6Cu0TOmLHCEk1zS_Ri-vMOIhHmIT6wnbuu6htkOIHW6h2tsupDZhH3vsoLFTVtrOjcENe5ygS2EIP4A7GMbYf6cbNPO2SbA86wJ9Pj1-FOts-_a8KR62WaBKDplwhFlvpdLK8lKUxqlKKQPCEJ8zL_PTulI75amkTFBujAQjeMUpr6SSfIHu_noDAOwOfWhtP-3OR_BfSSdPWg</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>New topology aggregation mechanisms for delay-bandwidth sensitive networks</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Jingjun Zhang ; Yuanbin Han ; Liguo Wang</creator><creatorcontrib>Jingjun Zhang ; Yuanbin Han ; Liguo Wang</creatorcontrib><description>Today¿s networks are often hierarchically modeled for both scalability and security considerations. Topology aggregation is introduced for the purpose of simplifying routing by summering and compressing information of lower levels and advertising them to higher logical levels. However, the balance between performance and accuracy of state information must be taken into account since topology aggregation will ineluctably give rise to distortion. In this paper, new approximation methods based on approximation staircase formed by power-transformed linear regression model and hyperbolic-transformed linear regression model are proposed to approximate the service efficient frontier in the full mesh approach, and then the full mesh topology is transformed to a simpler tree structure and star structure. The proposed methods are shown to be valuable by performance analysis and comparison with existing methods.</description><identifier>ISBN: 1424424232</identifier><identifier>ISBN: 9781424424238</identifier><identifier>EISBN: 1424424240</identifier><identifier>EISBN: 9781424424245</identifier><identifier>DOI: 10.1109/ICCS.2008.4737283</identifier><identifier>LCCN: 2008903448</identifier><language>eng</language><publisher>IEEE</publisher><subject>Bandwidth ; Circuit topology ; Delay ; Electronic mail ; hierarchical networks ; information ditortion ; Large-scale systems ; Linear regression ; Network topology ; Quality of service ; Routing protocols ; Scalability ; topology aggregation</subject><ispartof>2008 11th IEEE Singapore International Conference on Communication Systems, 2008, p.737-742</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/4737283$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2051,27904,54898</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4737283$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Jingjun Zhang</creatorcontrib><creatorcontrib>Yuanbin Han</creatorcontrib><creatorcontrib>Liguo Wang</creatorcontrib><title>New topology aggregation mechanisms for delay-bandwidth sensitive networks</title><title>2008 11th IEEE Singapore International Conference on Communication Systems</title><addtitle>ICCS</addtitle><description>Today¿s networks are often hierarchically modeled for both scalability and security considerations. Topology aggregation is introduced for the purpose of simplifying routing by summering and compressing information of lower levels and advertising them to higher logical levels. However, the balance between performance and accuracy of state information must be taken into account since topology aggregation will ineluctably give rise to distortion. In this paper, new approximation methods based on approximation staircase formed by power-transformed linear regression model and hyperbolic-transformed linear regression model are proposed to approximate the service efficient frontier in the full mesh approach, and then the full mesh topology is transformed to a simpler tree structure and star structure. The proposed methods are shown to be valuable by performance analysis and comparison with existing methods.</description><subject>Bandwidth</subject><subject>Circuit topology</subject><subject>Delay</subject><subject>Electronic mail</subject><subject>hierarchical networks</subject><subject>information ditortion</subject><subject>Large-scale systems</subject><subject>Linear regression</subject><subject>Network topology</subject><subject>Quality of service</subject><subject>Routing protocols</subject><subject>Scalability</subject><subject>topology aggregation</subject><isbn>1424424232</isbn><isbn>9781424424238</isbn><isbn>1424424240</isbn><isbn>9781424424245</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2008</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNpFUF9LwzAcjMhAN_cBxJd8gc78bZJHKeomQx_U55E2v3TRthlNsfTbu-HA4-A4OI7jELqlZEUpMfebonhfMUL0SiiumOYXaE4FE0cyQS7_DWczND8FDeFC6Cu0TOmLHCEk1zS_Ri-vMOIhHmIT6wnbuu6htkOIHW6h2tsupDZhH3vsoLFTVtrOjcENe5ygS2EIP4A7GMbYf6cbNPO2SbA86wJ9Pj1-FOts-_a8KR62WaBKDplwhFlvpdLK8lKUxqlKKQPCEJ8zL_PTulI75amkTFBujAQjeMUpr6SSfIHu_noDAOwOfWhtP-3OR_BfSSdPWg</recordid><startdate>200811</startdate><enddate>200811</enddate><creator>Jingjun Zhang</creator><creator>Yuanbin Han</creator><creator>Liguo Wang</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>200811</creationdate><title>New topology aggregation mechanisms for delay-bandwidth sensitive networks</title><author>Jingjun Zhang ; Yuanbin Han ; Liguo Wang</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-4d02afa5787a3b4b9d7c779e490f62f560004b8d7f1512413995e943c313c5753</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2008</creationdate><topic>Bandwidth</topic><topic>Circuit topology</topic><topic>Delay</topic><topic>Electronic mail</topic><topic>hierarchical networks</topic><topic>information ditortion</topic><topic>Large-scale systems</topic><topic>Linear regression</topic><topic>Network topology</topic><topic>Quality of service</topic><topic>Routing protocols</topic><topic>Scalability</topic><topic>topology aggregation</topic><toplevel>online_resources</toplevel><creatorcontrib>Jingjun Zhang</creatorcontrib><creatorcontrib>Yuanbin Han</creatorcontrib><creatorcontrib>Liguo Wang</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Jingjun Zhang</au><au>Yuanbin Han</au><au>Liguo Wang</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>New topology aggregation mechanisms for delay-bandwidth sensitive networks</atitle><btitle>2008 11th IEEE Singapore International Conference on Communication Systems</btitle><stitle>ICCS</stitle><date>2008-11</date><risdate>2008</risdate><spage>737</spage><epage>742</epage><pages>737-742</pages><isbn>1424424232</isbn><isbn>9781424424238</isbn><eisbn>1424424240</eisbn><eisbn>9781424424245</eisbn><abstract>Today¿s networks are often hierarchically modeled for both scalability and security considerations. Topology aggregation is introduced for the purpose of simplifying routing by summering and compressing information of lower levels and advertising them to higher logical levels. However, the balance between performance and accuracy of state information must be taken into account since topology aggregation will ineluctably give rise to distortion. In this paper, new approximation methods based on approximation staircase formed by power-transformed linear regression model and hyperbolic-transformed linear regression model are proposed to approximate the service efficient frontier in the full mesh approach, and then the full mesh topology is transformed to a simpler tree structure and star structure. The proposed methods are shown to be valuable by performance analysis and comparison with existing methods.</abstract><pub>IEEE</pub><doi>10.1109/ICCS.2008.4737283</doi><tpages>6</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISBN: 1424424232
ispartof 2008 11th IEEE Singapore International Conference on Communication Systems, 2008, p.737-742
issn
language eng
recordid cdi_ieee_primary_4737283
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Bandwidth
Circuit topology
Delay
Electronic mail
hierarchical networks
information ditortion
Large-scale systems
Linear regression
Network topology
Quality of service
Routing protocols
Scalability
topology aggregation
title New topology aggregation mechanisms for delay-bandwidth sensitive networks
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-25T13%3A46%3A46IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=New%20topology%20aggregation%20mechanisms%20for%20delay-bandwidth%20sensitive%20networks&rft.btitle=2008%2011th%20IEEE%20Singapore%20International%20Conference%20on%20Communication%20Systems&rft.au=Jingjun%20Zhang&rft.date=2008-11&rft.spage=737&rft.epage=742&rft.pages=737-742&rft.isbn=1424424232&rft.isbn_list=9781424424238&rft_id=info:doi/10.1109/ICCS.2008.4737283&rft_dat=%3Cieee_6IE%3E4737283%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=1424424240&rft.eisbn_list=9781424424245&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=4737283&rfr_iscdi=true