Routing with Wavelet-Based Self-Similarity Estimation
Fuente:
Redalyc
Saved in:
| Main Author: | |
|---|---|
| Format: | Artículo científico |
| Language: | en |
| Published: |
Instituto Politécnico Nacional
2004
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1876476836421042176 |
|---|---|
| author | César Vargas Rosales |
| author_facet | César Vargas Rosales |
| contents | Routing with Wavelet-Based Self-Similarity Estimation César Vargas Rosales Luis J. Manzanero Computación Self Routing Traffic similarity The discovery of self-similar behavior in data traffic has initiated strong research in the area of traffic modeling. However, the way it affects the routing process is a subject not yet studied. This work presents the idea of providing intelligence to routers by estimating the Hurst Parameter using wavelets in a data link and uses this value as part of the routing metric. The motivation is to keep packets from using paths with high values of the Hurst Parameter, since in those paths the traffic tends to be bursty and therefore being more probable to drop packets and increase delay due to congestion. The algorithm is implemented for the Open Shortest Path First (OSPF) routing protocol in a simulation environment. Numerical results show that this technique is useful to provide traffic with low values of end-to-end delay and with smaller variance than those obtained when using traditional routing protocols. 2004 artículo científico 1405-5546 https://www.redalyc.org/articulo.oa?id=61580204 en http://www.redalyc.org/revista.oa?id=615 Computación y Sistemas application/pdf Instituto Politécnico Nacional Computación y Sistemas (México) Num.2 Vol.8 |
| format | Artículo científico |
| id | redalyc_61580204 |
| institution | Redalyc |
| language | en |
| publishDate | 2004 |
| publisher | Instituto Politécnico Nacional |
| spellingShingle | Routing with Wavelet-Based Self-Similarity Estimation César Vargas Rosales Computación Self Routing Traffic similarity Routing with Wavelet-Based Self-Similarity Estimation César Vargas Rosales Luis J. Manzanero Computación Self Routing Traffic similarity The discovery of self-similar behavior in data traffic has initiated strong research in the area of traffic modeling. However, the way it affects the routing process is a subject not yet studied. This work presents the idea of providing intelligence to routers by estimating the Hurst Parameter using wavelets in a data link and uses this value as part of the routing metric. The motivation is to keep packets from using paths with high values of the Hurst Parameter, since in those paths the traffic tends to be bursty and therefore being more probable to drop packets and increase delay due to congestion. The algorithm is implemented for the Open Shortest Path First (OSPF) routing protocol in a simulation environment. Numerical results show that this technique is useful to provide traffic with low values of end-to-end delay and with smaller variance than those obtained when using traditional routing protocols. 2004 artículo científico 1405-5546 https://www.redalyc.org/articulo.oa?id=61580204 en http://www.redalyc.org/revista.oa?id=615 Computación y Sistemas application/pdf Instituto Politécnico Nacional Computación y Sistemas (México) Num.2 Vol.8 |
| title | Routing with Wavelet-Based Self-Similarity Estimation |
| topic | Computación Self Routing Traffic similarity |
| url | https://www.redalyc.org/articulo.oa?id=61580204 |