Performance modeling of rule-based architectures as discrete-time quasi birth-death processes
This paper deals with the examination and mathematical modeling of rule-based systems and list topologies applied in software architectures as well as in hardware solutions. In our investigation we focus on telecommunication applications utilizing list topologies. We introduce quasi birth-death proc...
Gespeichert in:
Hauptverfasser: | , |
---|---|
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 | 6 |
---|---|
container_issue | |
container_start_page | 6 pp. |
container_title | |
container_volume | |
creator | Palugyai, S. Csorba, M.J. |
description | This paper deals with the examination and mathematical modeling of rule-based systems and list topologies applied in software architectures as well as in hardware solutions. In our investigation we focus on telecommunication applications utilizing list topologies. We introduce quasi birth-death processes as the mathematical formalism behind our models. Besides, we extend the simple model of list topologies with respect to the input and output interfaces of the implementation. Furthermore, we present our model on the example of access control lists applied in IP routers and we show results that can be derived from the model |
doi_str_mv | 10.1109/LANMAN.2005.1541542 |
format | Conference Proceeding |
fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_1541542</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1541542</ieee_id><sourcerecordid>1541542</sourcerecordid><originalsourceid>FETCH-LOGICAL-i90t-2a77fb5ff6390c602ab5b932f0861bc9e5b3c47026b91a1eb11f18dd23e2ea7f3</originalsourceid><addsrcrecordid>eNo9kM1OAjEUhRt_EhF5AjZ9geJtO51Ol4SomCC6YGtI27mVGobBtrPw7cVIPPmSs_iSsziETDnMOAdzv5qvX-brmQBQM66qE-KCjLipKgZSq0tyC7oBaVStqqt_UesbMsn5E075dbwZkfc3TKFPnT14pF3f4j4ePmgfaBr2yJzN2FKb_C4W9GVImKnNtI3ZJyzISuyQfg02R-piKjvWoi07eky9x5wx35HrYPcZJ-cek83jw2axZKvXp-fFfMWigcKE1To4FUItDfgahHXKGSkCNDV33qBy0lcaRO0Mtxwd54E3bSskCrQ6yDGZ_s1GRNweU-xs-t6ej5E_ZwxXWw</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Performance modeling of rule-based architectures as discrete-time quasi birth-death processes</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Palugyai, S. ; Csorba, M.J.</creator><creatorcontrib>Palugyai, S. ; Csorba, M.J.</creatorcontrib><description>This paper deals with the examination and mathematical modeling of rule-based systems and list topologies applied in software architectures as well as in hardware solutions. In our investigation we focus on telecommunication applications utilizing list topologies. We introduce quasi birth-death processes as the mathematical formalism behind our models. Besides, we extend the simple model of list topologies with respect to the input and output interfaces of the implementation. Furthermore, we present our model on the example of access control lists applied in IP routers and we show results that can be derived from the model</description><identifier>ISSN: 1944-0367</identifier><identifier>ISBN: 0780395654</identifier><identifier>ISBN: 9780780395657</identifier><identifier>EISSN: 1944-0375</identifier><identifier>DOI: 10.1109/LANMAN.2005.1541542</identifier><language>eng</language><publisher>IEEE</publisher><subject>Access control ; Application software ; Communication system traffic control ; Data structures ; Hardware ; Mathematical model ; Software architecture ; TCPIP ; Topology ; Traffic control</subject><ispartof>2005 14th IEEE Workshop on Local & Metropolitan Area Networks, 2005, p.6 pp.-6</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/1541542$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2052,4036,4037,27902,54895</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1541542$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Palugyai, S.</creatorcontrib><creatorcontrib>Csorba, M.J.</creatorcontrib><title>Performance modeling of rule-based architectures as discrete-time quasi birth-death processes</title><title>2005 14th IEEE Workshop on Local & Metropolitan Area Networks</title><addtitle>LANMAN</addtitle><description>This paper deals with the examination and mathematical modeling of rule-based systems and list topologies applied in software architectures as well as in hardware solutions. In our investigation we focus on telecommunication applications utilizing list topologies. We introduce quasi birth-death processes as the mathematical formalism behind our models. Besides, we extend the simple model of list topologies with respect to the input and output interfaces of the implementation. Furthermore, we present our model on the example of access control lists applied in IP routers and we show results that can be derived from the model</description><subject>Access control</subject><subject>Application software</subject><subject>Communication system traffic control</subject><subject>Data structures</subject><subject>Hardware</subject><subject>Mathematical model</subject><subject>Software architecture</subject><subject>TCPIP</subject><subject>Topology</subject><subject>Traffic control</subject><issn>1944-0367</issn><issn>1944-0375</issn><isbn>0780395654</isbn><isbn>9780780395657</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2005</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNo9kM1OAjEUhRt_EhF5AjZ9geJtO51Ol4SomCC6YGtI27mVGobBtrPw7cVIPPmSs_iSsziETDnMOAdzv5qvX-brmQBQM66qE-KCjLipKgZSq0tyC7oBaVStqqt_UesbMsn5E075dbwZkfc3TKFPnT14pF3f4j4ePmgfaBr2yJzN2FKb_C4W9GVImKnNtI3ZJyzISuyQfg02R-piKjvWoi07eky9x5wx35HrYPcZJ-cek83jw2axZKvXp-fFfMWigcKE1To4FUItDfgahHXKGSkCNDV33qBy0lcaRO0Mtxwd54E3bSskCrQ6yDGZ_s1GRNweU-xs-t6ej5E_ZwxXWw</recordid><startdate>2005</startdate><enddate>2005</enddate><creator>Palugyai, S.</creator><creator>Csorba, M.J.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>2005</creationdate><title>Performance modeling of rule-based architectures as discrete-time quasi birth-death processes</title><author>Palugyai, S. ; Csorba, M.J.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i90t-2a77fb5ff6390c602ab5b932f0861bc9e5b3c47026b91a1eb11f18dd23e2ea7f3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Access control</topic><topic>Application software</topic><topic>Communication system traffic control</topic><topic>Data structures</topic><topic>Hardware</topic><topic>Mathematical model</topic><topic>Software architecture</topic><topic>TCPIP</topic><topic>Topology</topic><topic>Traffic control</topic><toplevel>online_resources</toplevel><creatorcontrib>Palugyai, S.</creatorcontrib><creatorcontrib>Csorba, M.J.</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>Palugyai, S.</au><au>Csorba, M.J.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Performance modeling of rule-based architectures as discrete-time quasi birth-death processes</atitle><btitle>2005 14th IEEE Workshop on Local & Metropolitan Area Networks</btitle><stitle>LANMAN</stitle><date>2005</date><risdate>2005</risdate><spage>6 pp.</spage><epage>6</epage><pages>6 pp.-6</pages><issn>1944-0367</issn><eissn>1944-0375</eissn><isbn>0780395654</isbn><isbn>9780780395657</isbn><abstract>This paper deals with the examination and mathematical modeling of rule-based systems and list topologies applied in software architectures as well as in hardware solutions. In our investigation we focus on telecommunication applications utilizing list topologies. We introduce quasi birth-death processes as the mathematical formalism behind our models. Besides, we extend the simple model of list topologies with respect to the input and output interfaces of the implementation. Furthermore, we present our model on the example of access control lists applied in IP routers and we show results that can be derived from the model</abstract><pub>IEEE</pub><doi>10.1109/LANMAN.2005.1541542</doi></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISSN: 1944-0367 |
ispartof | 2005 14th IEEE Workshop on Local & Metropolitan Area Networks, 2005, p.6 pp.-6 |
issn | 1944-0367 1944-0375 |
language | eng |
recordid | cdi_ieee_primary_1541542 |
source | IEEE Electronic Library (IEL) Conference Proceedings |
subjects | Access control Application software Communication system traffic control Data structures Hardware Mathematical model Software architecture TCPIP Topology Traffic control |
title | Performance modeling of rule-based architectures as discrete-time quasi birth-death processes |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-13T08%3A31%3A26IST&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=Performance%20modeling%20of%20rule-based%20architectures%20as%20discrete-time%20quasi%20birth-death%20processes&rft.btitle=2005%2014th%20IEEE%20Workshop%20on%20Local%20&%20Metropolitan%20Area%20Networks&rft.au=Palugyai,%20S.&rft.date=2005&rft.spage=6%20pp.&rft.epage=6&rft.pages=6%20pp.-6&rft.issn=1944-0367&rft.eissn=1944-0375&rft.isbn=0780395654&rft.isbn_list=9780780395657&rft_id=info:doi/10.1109/LANMAN.2005.1541542&rft_dat=%3Cieee_6IE%3E1541542%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=1541542&rfr_iscdi=true |