Approximation to a behavioral model for estimating traffic aggregation scenarios

This article provides a comparison among different methods for estimating the aggregation of Internet traffic resulting from different users, network-access types and corresponding services. Some approximate models usually used as isolated methods are combined with a temporally scaled ON-OFF model w...

Descripción completa

Detalles Bibliográficos
Autores: García Gutiérrez, Alberto Eloy|||0000-0002-5708-9558 , Hackbarth Planeta, Klaus Dietrich
Tipo de recurso: artículo
Fecha de publicación:2008
País:España
Institución:Universidad de Cantabria (UC)
Repositorio:UCrea Repositorio Abierto de la Universidad de Cantabria
Idioma:inglés
OAI Identifier:oai:repositorio.unican.es:10902/1578
Acceso en línea:http://hdl.handle.net/10902/1578
Access Level:acceso abierto
Palabra clave:Network planning
Traffic modeling
Traffic aggregation
Network scenario
id ES_3100ece3dae3e8f2e0af71eaf2085694
oai_identifier_str oai:repositorio.unican.es:10902/1578
network_acronym_str ES
network_name_str España
repository_id_str
spelling Approximation to a behavioral model for estimating traffic aggregation scenariosGarcía Gutiérrez, Alberto Eloy|||0000-0002-5708-9558 Hackbarth Planeta, Klaus DietrichNetwork planningTraffic modelingTraffic aggregationNetwork scenarioThis article provides a comparison among different methods for estimating the aggregation of Internet traffic resulting from different users, network-access types and corresponding services. Some approximate models usually used as isolated methods are combined with a temporally scaled ON-OFF model with binomial approximations. The aggregation problem is solved using a new form of parameterization based on the composition of the source traffic accordingly to the concrete characteristics of the users, the accesses and the services. This is a new concept, called CASUAL, included within an overall network planning methodology for the design and dimensioning of Next Generation Internet.Graz University of Technology-Institut für Informationssysteme und Computer Medien (IICM)Universidad de Cantabria20082008-01-01journal articlehttp://purl.org/coar/resource_type/c_6501NAhttp://purl.org/coar/version/c_be7fb7dd8ff6fe43info:eu-repo/semantics/articlehttp://hdl.handle.net/10902/1578Journal of Universal Computer Science, 2008, 14(5), 731-744reponame:UCrea Repositorio Abierto de la Universidad de Cantabriainstname:Universidad de Cantabria (UC)Inglésengopen accesshttp://purl.org/coar/access_right/c_abf2info:eu-repo/semantics/openAccessoai:repositorio.unican.es:10902/15782026-06-02T12:39:31Z
dc.title.none.fl_str_mv Approximation to a behavioral model for estimating traffic aggregation scenarios
title Approximation to a behavioral model for estimating traffic aggregation scenarios
spellingShingle Approximation to a behavioral model for estimating traffic aggregation scenarios
García Gutiérrez, Alberto Eloy|||0000-0002-5708-9558 
Network planning
Traffic modeling
Traffic aggregation
Network scenario
title_short Approximation to a behavioral model for estimating traffic aggregation scenarios
title_full Approximation to a behavioral model for estimating traffic aggregation scenarios
title_fullStr Approximation to a behavioral model for estimating traffic aggregation scenarios
title_full_unstemmed Approximation to a behavioral model for estimating traffic aggregation scenarios
title_sort Approximation to a behavioral model for estimating traffic aggregation scenarios
dc.creator.none.fl_str_mv García Gutiérrez, Alberto Eloy|||0000-0002-5708-9558 
Hackbarth Planeta, Klaus Dietrich
author García Gutiérrez, Alberto Eloy|||0000-0002-5708-9558 
author_facet García Gutiérrez, Alberto Eloy|||0000-0002-5708-9558 
Hackbarth Planeta, Klaus Dietrich
author_role author
author2 Hackbarth Planeta, Klaus Dietrich
author2_role author
dc.contributor.none.fl_str_mv Universidad de Cantabria
dc.subject.none.fl_str_mv Network planning
Traffic modeling
Traffic aggregation
Network scenario
topic Network planning
Traffic modeling
Traffic aggregation
Network scenario
description This article provides a comparison among different methods for estimating the aggregation of Internet traffic resulting from different users, network-access types and corresponding services. Some approximate models usually used as isolated methods are combined with a temporally scaled ON-OFF model with binomial approximations. The aggregation problem is solved using a new form of parameterization based on the composition of the source traffic accordingly to the concrete characteristics of the users, the accesses and the services. This is a new concept, called CASUAL, included within an overall network planning methodology for the design and dimensioning of Next Generation Internet.
publishDate 2008
dc.date.none.fl_str_mv 2008
2008-01-01
dc.type.none.fl_str_mv journal article
http://purl.org/coar/resource_type/c_6501
NA
http://purl.org/coar/version/c_be7fb7dd8ff6fe43
dc.type.openaire.fl_str_mv info:eu-repo/semantics/article
format article
dc.identifier.none.fl_str_mv http://hdl.handle.net/10902/1578
url http://hdl.handle.net/10902/1578
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
eu_rights_str_mv openAccess
dc.publisher.none.fl_str_mv Graz University of Technology-
Institut für Informationssysteme und Computer Medien (IICM)
publisher.none.fl_str_mv Graz University of Technology-
Institut für Informationssysteme und Computer Medien (IICM)
dc.source.none.fl_str_mv Journal of Universal Computer Science, 2008, 14(5), 731-744
reponame:UCrea Repositorio Abierto de la Universidad de Cantabria
instname:Universidad de Cantabria (UC)
instname_str Universidad de Cantabria (UC)
reponame_str UCrea Repositorio Abierto de la Universidad de Cantabria
collection UCrea Repositorio Abierto de la Universidad de Cantabria
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869405583051849728
score 15.301603