On modeling local area networks
The study of network throughput and utilization requires the modeling of packets being transmitted along the media. Modeling such a system can be quite logically demanding, especially that packets can move along the media in opposite directions at almost the speed of light; and when collisions are a...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 849 |
|---|---|
| container_issue | |
| container_start_page | 842 |
| container_title | |
| container_volume | |
| creator | Tsui, Louis Y. Ulgen, Onur M. |
| description | The study of network throughput and utilization requires the modeling of packets being transmitted along the media. Modeling such a system can be quite logically demanding, especially that packets can move along the media in opposite directions at almost the speed of light; and when collisions are allowed, a packet may collide with another that is beyond its control.
Two modeling approaches are presented in this paper. One results in programs that closely follow the behavior of the physical system, yet require significant CPU time to execute. The second approach results in programs that may seem to be 'unnatural', yet more time-efficient.
Examples on token-ring and CSMA/CD networks are given in pseudo codes, followed by comparison of run times. |
| doi_str_mv | 10.1145/318123.318333 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>proquest_acm_b</sourceid><recordid>TN_cdi_proquest_miscellaneous_31371703</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>31371703</sourcerecordid><originalsourceid>FETCH-LOGICAL-a2063-a7f58f7776aa1fd7780bbc736a43f6534a26b8797264eb78962ce6ba7b8bbd033</originalsourceid><addsrcrecordid>eNqFjz1PwzAURS0hJKB0ZCYTEyl-fomfM6KKL6lSF5it58RGoW4McSv-PoUgMXKXuxwd6QhxAXIBUNU3CAYULg6HiEfiTDYARkKl4ETMc36Th9W1MRJPxeV6KLap87EfXouYWo4Fj56Lwe8-07jJ5-I4cMx-_vsz8XJ_97x8LFfrh6fl7apkJTWWTKE2gYg0M4SOyEjnWkLNFQZdY8VKO0MNKV15R6bRqvXaMTnjXCcRZ-Jq8r6P6WPv885u-9z6GHnwaZ8tAhLQD3g9gdxurUtpky1I-91tp247dVs39j78ef_B8Qu4m1Yd</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype><pqid>31371703</pqid></control><display><type>conference_proceeding</type><title>On modeling local area networks</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Tsui, Louis Y. ; Ulgen, Onur M.</creator><contributor>Abrams, Michael A. ; Comfort, John C. ; Haigh, Peter L.</contributor><creatorcontrib>Tsui, Louis Y. ; Ulgen, Onur M. ; Abrams, Michael A. ; Comfort, John C. ; Haigh, Peter L.</creatorcontrib><description>The study of network throughput and utilization requires the modeling of packets being transmitted along the media. Modeling such a system can be quite logically demanding, especially that packets can move along the media in opposite directions at almost the speed of light; and when collisions are allowed, a packet may collide with another that is beyond its control.
Two modeling approaches are presented in this paper. One results in programs that closely follow the behavior of the physical system, yet require significant CPU time to execute. The second approach results in programs that may seem to be 'unnatural', yet more time-efficient.
Examples on token-ring and CSMA/CD networks are given in pseudo codes, followed by comparison of run times.</description><identifier>ISBN: 0911801421</identifier><identifier>ISBN: 9780911801422</identifier><identifier>DOI: 10.1145/318123.318333</identifier><language>eng</language><publisher>New York, NY, USA: ACM</publisher><subject>Computer systems organization -- Dependable and fault-tolerant systems and networks ; Computing methodologies -- Modeling and simulation ; General and reference -- Cross-computing tools and techniques -- Performance ; General and reference -- Document types -- Computing standards, RFCs and guidelines ; Networks ; Networks -- Network performance evaluation ; Networks -- Network properties -- Network range -- Local area networks ; Networks -- Network properties -- Network range -- Wide area networks ; Networks -- Network protocols</subject><ispartof>Proceedings of the 20th conference on Winter simulation, 1988, p.842-849</ispartof><rights>1988 ACM</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>309,310,780,784,789,790,27925</link.rule.ids></links><search><contributor>Abrams, Michael A.</contributor><contributor>Comfort, John C.</contributor><contributor>Haigh, Peter L.</contributor><creatorcontrib>Tsui, Louis Y.</creatorcontrib><creatorcontrib>Ulgen, Onur M.</creatorcontrib><title>On modeling local area networks</title><title>Proceedings of the 20th conference on Winter simulation</title><description>The study of network throughput and utilization requires the modeling of packets being transmitted along the media. Modeling such a system can be quite logically demanding, especially that packets can move along the media in opposite directions at almost the speed of light; and when collisions are allowed, a packet may collide with another that is beyond its control.
Two modeling approaches are presented in this paper. One results in programs that closely follow the behavior of the physical system, yet require significant CPU time to execute. The second approach results in programs that may seem to be 'unnatural', yet more time-efficient.
Examples on token-ring and CSMA/CD networks are given in pseudo codes, followed by comparison of run times.</description><subject>Computer systems organization -- Dependable and fault-tolerant systems and networks</subject><subject>Computing methodologies -- Modeling and simulation</subject><subject>General and reference -- Cross-computing tools and techniques -- Performance</subject><subject>General and reference -- Document types -- Computing standards, RFCs and guidelines</subject><subject>Networks</subject><subject>Networks -- Network performance evaluation</subject><subject>Networks -- Network properties -- Network range -- Local area networks</subject><subject>Networks -- Network properties -- Network range -- Wide area networks</subject><subject>Networks -- Network protocols</subject><isbn>0911801421</isbn><isbn>9780911801422</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>1988</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNqFjz1PwzAURS0hJKB0ZCYTEyl-fomfM6KKL6lSF5it58RGoW4McSv-PoUgMXKXuxwd6QhxAXIBUNU3CAYULg6HiEfiTDYARkKl4ETMc36Th9W1MRJPxeV6KLap87EfXouYWo4Fj56Lwe8-07jJ5-I4cMx-_vsz8XJ_97x8LFfrh6fl7apkJTWWTKE2gYg0M4SOyEjnWkLNFQZdY8VKO0MNKV15R6bRqvXaMTnjXCcRZ-Jq8r6P6WPv885u-9z6GHnwaZ8tAhLQD3g9gdxurUtpky1I-91tp247dVs39j78ef_B8Qu4m1Yd</recordid><startdate>19881201</startdate><enddate>19881201</enddate><creator>Tsui, Louis Y.</creator><creator>Ulgen, Onur M.</creator><general>ACM</general><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>19881201</creationdate><title>On modeling local area networks</title><author>Tsui, Louis Y. ; Ulgen, Onur M.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a2063-a7f58f7776aa1fd7780bbc736a43f6534a26b8797264eb78962ce6ba7b8bbd033</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>1988</creationdate><topic>Computer systems organization -- Dependable and fault-tolerant systems and networks</topic><topic>Computing methodologies -- Modeling and simulation</topic><topic>General and reference -- Cross-computing tools and techniques -- Performance</topic><topic>General and reference -- Document types -- Computing standards, RFCs and guidelines</topic><topic>Networks</topic><topic>Networks -- Network performance evaluation</topic><topic>Networks -- Network properties -- Network range -- Local area networks</topic><topic>Networks -- Network properties -- Network range -- Wide area networks</topic><topic>Networks -- Network protocols</topic><toplevel>online_resources</toplevel><creatorcontrib>Tsui, Louis Y.</creatorcontrib><creatorcontrib>Ulgen, Onur M.</creatorcontrib><collection>Computer and Information Systems 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></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Tsui, Louis Y.</au><au>Ulgen, Onur M.</au><au>Abrams, Michael A.</au><au>Comfort, John C.</au><au>Haigh, Peter L.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>On modeling local area networks</atitle><btitle>Proceedings of the 20th conference on Winter simulation</btitle><date>1988-12-01</date><risdate>1988</risdate><spage>842</spage><epage>849</epage><pages>842-849</pages><isbn>0911801421</isbn><isbn>9780911801422</isbn><abstract>The study of network throughput and utilization requires the modeling of packets being transmitted along the media. Modeling such a system can be quite logically demanding, especially that packets can move along the media in opposite directions at almost the speed of light; and when collisions are allowed, a packet may collide with another that is beyond its control.
Two modeling approaches are presented in this paper. One results in programs that closely follow the behavior of the physical system, yet require significant CPU time to execute. The second approach results in programs that may seem to be 'unnatural', yet more time-efficient.
Examples on token-ring and CSMA/CD networks are given in pseudo codes, followed by comparison of run times.</abstract><cop>New York, NY, USA</cop><pub>ACM</pub><doi>10.1145/318123.318333</doi><tpages>8</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISBN: 0911801421 |
| ispartof | Proceedings of the 20th conference on Winter simulation, 1988, p.842-849 |
| issn | |
| language | eng |
| recordid | cdi_proquest_miscellaneous_31371703 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Computer systems organization -- Dependable and fault-tolerant systems and networks Computing methodologies -- Modeling and simulation General and reference -- Cross-computing tools and techniques -- Performance General and reference -- Document types -- Computing standards, RFCs and guidelines Networks Networks -- Network performance evaluation Networks -- Network properties -- Network range -- Local area networks Networks -- Network properties -- Network range -- Wide area networks Networks -- Network protocols |
| title | On modeling local area networks |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-27T10%3A47%3A36IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_acm_b&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=On%20modeling%20local%20area%20networks&rft.btitle=Proceedings%20of%20the%2020th%20conference%20on%20Winter%20simulation&rft.au=Tsui,%20Louis%20Y.&rft.date=1988-12-01&rft.spage=842&rft.epage=849&rft.pages=842-849&rft.isbn=0911801421&rft.isbn_list=9780911801422&rft_id=info:doi/10.1145/318123.318333&rft_dat=%3Cproquest_acm_b%3E31371703%3C/proquest_acm_b%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=31371703&rft_id=info:pmid/&rfr_iscdi=true |