File Download
There are no files associated with this item.
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Capturing the elusive poissonity in web traffic
Title | Capturing the elusive poissonity in web traffic |
---|---|
Authors | |
Issue Date | 2006 |
Citation | Proceedings - IEEE Computer Society's Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, MASCOTS, 2006, p. 189-196 How to Cite? |
Abstract | Numerous studies have shown that the process of packet arrivals from Web traffic exhibits strong long-range dependence, which makes it not amenable to be described using the convenient but necessarily short-range dependent framework of Poisson modeling. However, Web traffic is ultimately driven by independent human behavior, so it seems natural to search for an underlying "seed process", consistent with Poissonity, indirectly driving the packet arrivals of Web traffic. Our study examines Web traffic at different levels of packet aggregation, using powerful statistical analysis tools for identifying the finest level that can be effectively modeled using a homogeneous Poisson process. We show that the arrivals of HTTP responses, TCP connections and Web pages do not provide a satisfactory seed process. However, we find Poissonity in the arrivals of "navigation bursts". A navigation burst is a tightly-spaced sequence of Web pages downloaded by the same Web client, which can be explained by fast navigation through several pages before reaching relevant content. Our analysis suggests that the start times of such navigation bursts, which we identify by detecting user think times between 12 and 30 seconds, can be effectively modeled as a homogeneous Poisson process. We believe that our methodology can be extended to other complex modeling problems where finding Poissonity can greatly simplify parsimonious modeling. © 2006 IEEE. |
Persistent Identifier | http://hdl.handle.net/10722/219632 |
ISSN | 2020 SCImago Journal Rankings: 0.178 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Park, C. | - |
dc.contributor.author | Shen, H. | - |
dc.contributor.author | Marron, J. S. | - |
dc.contributor.author | Hernández-Campos, F. | - |
dc.contributor.author | Veitch, D. | - |
dc.date.accessioned | 2015-09-23T02:57:34Z | - |
dc.date.available | 2015-09-23T02:57:34Z | - |
dc.date.issued | 2006 | - |
dc.identifier.citation | Proceedings - IEEE Computer Society's Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, MASCOTS, 2006, p. 189-196 | - |
dc.identifier.issn | 1526-7539 | - |
dc.identifier.uri | http://hdl.handle.net/10722/219632 | - |
dc.description.abstract | Numerous studies have shown that the process of packet arrivals from Web traffic exhibits strong long-range dependence, which makes it not amenable to be described using the convenient but necessarily short-range dependent framework of Poisson modeling. However, Web traffic is ultimately driven by independent human behavior, so it seems natural to search for an underlying "seed process", consistent with Poissonity, indirectly driving the packet arrivals of Web traffic. Our study examines Web traffic at different levels of packet aggregation, using powerful statistical analysis tools for identifying the finest level that can be effectively modeled using a homogeneous Poisson process. We show that the arrivals of HTTP responses, TCP connections and Web pages do not provide a satisfactory seed process. However, we find Poissonity in the arrivals of "navigation bursts". A navigation burst is a tightly-spaced sequence of Web pages downloaded by the same Web client, which can be explained by fast navigation through several pages before reaching relevant content. Our analysis suggests that the start times of such navigation bursts, which we identify by detecting user think times between 12 and 30 seconds, can be effectively modeled as a homogeneous Poisson process. We believe that our methodology can be extended to other complex modeling problems where finding Poissonity can greatly simplify parsimonious modeling. © 2006 IEEE. | - |
dc.language | eng | - |
dc.relation.ispartof | Proceedings - IEEE Computer Society's Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, MASCOTS | - |
dc.title | Capturing the elusive poissonity in web traffic | - |
dc.type | Conference_Paper | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.scopus | eid_2-s2.0-77953504603 | - |
dc.identifier.spage | 189 | - |
dc.identifier.epage | 196 | - |
dc.identifier.issnl | 1526-7539 | - |