Comparative Analysis and Comparison of Various AQM Algorithm for High Speed
The main objective of the paper is to study existing AQM algorithm and develop a new AQM algorithm that gives better result than the existing algorithm. AQM are the router based mechanism for early detection of congestion in the computer network. The basic idea of AQM is to sense and detect congesti...
Gespeichert in:
| Veröffentlicht in: | Indian journal of science and technology 2015-12, Vol.8 (35), p.1-1 |
|---|---|
| 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 | 1 |
|---|---|
| container_issue | 35 |
| container_start_page | 1 |
| container_title | Indian journal of science and technology |
| container_volume | 8 |
| creator | Pujeri, Uma R. Palaniswamy, V. Ramanathan, P. Pujeri, Ramachandra |
| description | The main objective of the paper is to study existing AQM algorithm and develop a new AQM algorithm that gives better result than the existing algorithm. AQM are the router based mechanism for early detection of congestion in the computer network. The basic idea of AQM is to sense and detect congestion in advance and to inform the sender to reduce its sending rate, thereby reducing the number of packets sent in the network and control the congestion. There are several AQM algorithms that controls the congestion. In this paper, we have surveyed, compared and analyzed Random Early Detection (RED), Flow Random Early Detection (FRED), Stabilized Random Early Detection (SRED), Stochastic Fair Queuing (SFQ), Random Exponential Marking (REM), BLUE, Stochastic Fair BLUE (SFB) AQM algorithms. Performance parameter are tested and evaluated in NS2 simulator. After analyzing it was found that RED AQM compared with SFQ and REM achieved best result in terms of delay. |
| doi_str_mv | 10.17485/ijst/2015/v8i35/81476 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1786161042</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1786161042</sourcerecordid><originalsourceid>FETCH-LOGICAL-c2516-40adce4700904e67ec8246f960c5d63714a471e7804f55c76779a1552fed5fb53</originalsourceid><addsrcrecordid>eNotkMtqwzAUREVpoSHNLxQtu3F9ZevlpQltE5pSSh9bodpSomBbruQE8vd1HrO5AzNchoPQPYFHIqhkqdvGIc2AsHQvXc5SSajgV2gChaAJ45RdXzyXlN-iWYxbGJVnEgRM0Ovct70OenB7g8tON4foItZdjc-Bi77D3uKf0fpdxOXHGy6btQ9u2LTY-oAXbr3Bn70x9R26sbqJZna5U_T9_PQ1XySr95flvFwlVcYITyjoujJUABRADRemkhnltuBQsZrnglBNBTFCArWMVYILUWjCWGZNzewvy6fo4fy3D_5vZ-KgWhcr0zS6M-NGRYTkhBOg2Vjl52oVfIzBWNUH1-pwUATUCaA6AlRHgOoEUJ0A5v-eAmQ1</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1786161042</pqid></control><display><type>article</type><title>Comparative Analysis and Comparison of Various AQM Algorithm for High Speed</title><source>Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals</source><creator>Pujeri, Uma R. ; Palaniswamy, V. ; Ramanathan, P. ; Pujeri, Ramachandra</creator><creatorcontrib>Pujeri, Uma R. ; Palaniswamy, V. ; Ramanathan, P. ; Pujeri, Ramachandra</creatorcontrib><description>The main objective of the paper is to study existing AQM algorithm and develop a new AQM algorithm that gives better result than the existing algorithm. AQM are the router based mechanism for early detection of congestion in the computer network. The basic idea of AQM is to sense and detect congestion in advance and to inform the sender to reduce its sending rate, thereby reducing the number of packets sent in the network and control the congestion. There are several AQM algorithms that controls the congestion. In this paper, we have surveyed, compared and analyzed Random Early Detection (RED), Flow Random Early Detection (FRED), Stabilized Random Early Detection (SRED), Stochastic Fair Queuing (SFQ), Random Exponential Marking (REM), BLUE, Stochastic Fair BLUE (SFB) AQM algorithms. Performance parameter are tested and evaluated in NS2 simulator. After analyzing it was found that RED AQM compared with SFQ and REM achieved best result in terms of delay.</description><identifier>ISSN: 0974-6846</identifier><identifier>EISSN: 0974-5645</identifier><identifier>DOI: 10.17485/ijst/2015/v8i35/81476</identifier><language>eng</language><subject>Algorithms ; Computer simulation ; Congestion ; Delay ; High speed ; Networks ; Routers ; Stochasticity</subject><ispartof>Indian journal of science and technology, 2015-12, Vol.8 (35), p.1-1</ispartof><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c2516-40adce4700904e67ec8246f960c5d63714a471e7804f55c76779a1552fed5fb53</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Pujeri, Uma R.</creatorcontrib><creatorcontrib>Palaniswamy, V.</creatorcontrib><creatorcontrib>Ramanathan, P.</creatorcontrib><creatorcontrib>Pujeri, Ramachandra</creatorcontrib><title>Comparative Analysis and Comparison of Various AQM Algorithm for High Speed</title><title>Indian journal of science and technology</title><description>The main objective of the paper is to study existing AQM algorithm and develop a new AQM algorithm that gives better result than the existing algorithm. AQM are the router based mechanism for early detection of congestion in the computer network. The basic idea of AQM is to sense and detect congestion in advance and to inform the sender to reduce its sending rate, thereby reducing the number of packets sent in the network and control the congestion. There are several AQM algorithms that controls the congestion. In this paper, we have surveyed, compared and analyzed Random Early Detection (RED), Flow Random Early Detection (FRED), Stabilized Random Early Detection (SRED), Stochastic Fair Queuing (SFQ), Random Exponential Marking (REM), BLUE, Stochastic Fair BLUE (SFB) AQM algorithms. Performance parameter are tested and evaluated in NS2 simulator. After analyzing it was found that RED AQM compared with SFQ and REM achieved best result in terms of delay.</description><subject>Algorithms</subject><subject>Computer simulation</subject><subject>Congestion</subject><subject>Delay</subject><subject>High speed</subject><subject>Networks</subject><subject>Routers</subject><subject>Stochasticity</subject><issn>0974-6846</issn><issn>0974-5645</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2015</creationdate><recordtype>article</recordtype><recordid>eNotkMtqwzAUREVpoSHNLxQtu3F9ZevlpQltE5pSSh9bodpSomBbruQE8vd1HrO5AzNchoPQPYFHIqhkqdvGIc2AsHQvXc5SSajgV2gChaAJ45RdXzyXlN-iWYxbGJVnEgRM0Ovct70OenB7g8tON4foItZdjc-Bi77D3uKf0fpdxOXHGy6btQ9u2LTY-oAXbr3Bn70x9R26sbqJZna5U_T9_PQ1XySr95flvFwlVcYITyjoujJUABRADRemkhnltuBQsZrnglBNBTFCArWMVYILUWjCWGZNzewvy6fo4fy3D_5vZ-KgWhcr0zS6M-NGRYTkhBOg2Vjl52oVfIzBWNUH1-pwUATUCaA6AlRHgOoEUJ0A5v-eAmQ1</recordid><startdate>20151201</startdate><enddate>20151201</enddate><creator>Pujeri, Uma R.</creator><creator>Palaniswamy, V.</creator><creator>Ramanathan, P.</creator><creator>Pujeri, Ramachandra</creator><scope>AAYXX</scope><scope>CITATION</scope><scope>8BQ</scope><scope>8FD</scope><scope>JG9</scope></search><sort><creationdate>20151201</creationdate><title>Comparative Analysis and Comparison of Various AQM Algorithm for High Speed</title><author>Pujeri, Uma R. ; Palaniswamy, V. ; Ramanathan, P. ; Pujeri, Ramachandra</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c2516-40adce4700904e67ec8246f960c5d63714a471e7804f55c76779a1552fed5fb53</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2015</creationdate><topic>Algorithms</topic><topic>Computer simulation</topic><topic>Congestion</topic><topic>Delay</topic><topic>High speed</topic><topic>Networks</topic><topic>Routers</topic><topic>Stochasticity</topic><toplevel>online_resources</toplevel><creatorcontrib>Pujeri, Uma R.</creatorcontrib><creatorcontrib>Palaniswamy, V.</creatorcontrib><creatorcontrib>Ramanathan, P.</creatorcontrib><creatorcontrib>Pujeri, Ramachandra</creatorcontrib><collection>CrossRef</collection><collection>METADEX</collection><collection>Technology Research Database</collection><collection>Materials Research Database</collection><jtitle>Indian journal of science and technology</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Pujeri, Uma R.</au><au>Palaniswamy, V.</au><au>Ramanathan, P.</au><au>Pujeri, Ramachandra</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Comparative Analysis and Comparison of Various AQM Algorithm for High Speed</atitle><jtitle>Indian journal of science and technology</jtitle><date>2015-12-01</date><risdate>2015</risdate><volume>8</volume><issue>35</issue><spage>1</spage><epage>1</epage><pages>1-1</pages><issn>0974-6846</issn><eissn>0974-5645</eissn><abstract>The main objective of the paper is to study existing AQM algorithm and develop a new AQM algorithm that gives better result than the existing algorithm. AQM are the router based mechanism for early detection of congestion in the computer network. The basic idea of AQM is to sense and detect congestion in advance and to inform the sender to reduce its sending rate, thereby reducing the number of packets sent in the network and control the congestion. There are several AQM algorithms that controls the congestion. In this paper, we have surveyed, compared and analyzed Random Early Detection (RED), Flow Random Early Detection (FRED), Stabilized Random Early Detection (SRED), Stochastic Fair Queuing (SFQ), Random Exponential Marking (REM), BLUE, Stochastic Fair BLUE (SFB) AQM algorithms. Performance parameter are tested and evaluated in NS2 simulator. After analyzing it was found that RED AQM compared with SFQ and REM achieved best result in terms of delay.</abstract><doi>10.17485/ijst/2015/v8i35/81476</doi><tpages>1</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0974-6846 |
| ispartof | Indian journal of science and technology, 2015-12, Vol.8 (35), p.1-1 |
| issn | 0974-6846 0974-5645 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_1786161042 |
| source | Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals |
| subjects | Algorithms Computer simulation Congestion Delay High speed Networks Routers Stochasticity |
| title | Comparative Analysis and Comparison of Various AQM Algorithm for High Speed |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-19T14%3A58%3A52IST&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=Comparative%20Analysis%20and%20Comparison%20of%20Various%20AQM%20Algorithm%20for%20High%20Speed&rft.jtitle=Indian%20journal%20of%20science%20and%20technology&rft.au=Pujeri,%20Uma%20R.&rft.date=2015-12-01&rft.volume=8&rft.issue=35&rft.spage=1&rft.epage=1&rft.pages=1-1&rft.issn=0974-6846&rft.eissn=0974-5645&rft_id=info:doi/10.17485/ijst/2015/v8i35/81476&rft_dat=%3Cproquest_cross%3E1786161042%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=1786161042&rft_id=info:pmid/&rfr_iscdi=true |