Algorithms for network service guarantee under minimal link usage information
- Autores
- Hong, Sugwon; Lee, Hwang-Kyu; Paek, Seonuck
- Año de publicación
- 2006
- Idioma
- inglés
- Tipo de recurso
- documento de conferencia
- Estado
- versión publicada
- Descripción
- One way to guaranteeing service for an application flow even if a network happens to fail is to establish a restoration path with the bandwidth that amounts to the same of the flow. If the flows can share the bandwidth for their restoration paths with others, we can reduce bandwidth consumption required for restoration. It is also required that deciding sharable bandwidth among flows should be done using controllable link information at each node. This paper proposes an algorithm to determine the sharable bandwidth among application flows given local link usage information at each node, validates the results of the algorithm and analyze the conditions required to achieve the goal by simulation.
5th IFIP International Conference on Network Control & Engineering for QoS, Security and Mobility
Red de Universidades con Carreras en Informática (RedUNCI) - Materia
-
Ciencias Informáticas
bandwidth
application flows - Nivel de accesibilidad
- acceso abierto
- Condiciones de uso
- http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
- Repositorio
- Institución
- Universidad Nacional de La Plata
- OAI Identificador
- oai:sedici.unlp.edu.ar:10915/24140
Ver los metadatos del registro completo
id |
SEDICI_e52af3805bdaa54a5388c68ed67d8d7e |
---|---|
oai_identifier_str |
oai:sedici.unlp.edu.ar:10915/24140 |
network_acronym_str |
SEDICI |
repository_id_str |
1329 |
network_name_str |
SEDICI (UNLP) |
spelling |
Algorithms for network service guarantee under minimal link usage informationHong, SugwonLee, Hwang-KyuPaek, SeonuckCiencias Informáticasbandwidthapplication flowsOne way to guaranteeing service for an application flow even if a network happens to fail is to establish a restoration path with the bandwidth that amounts to the same of the flow. If the flows can share the bandwidth for their restoration paths with others, we can reduce bandwidth consumption required for restoration. It is also required that deciding sharable bandwidth among flows should be done using controllable link information at each node. This paper proposes an algorithm to determine the sharable bandwidth among application flows given local link usage information at each node, validates the results of the algorithm and analyze the conditions required to achieve the goal by simulation.5th IFIP International Conference on Network Control & Engineering for QoS, Security and MobilityRed de Universidades con Carreras en Informática (RedUNCI)2006-08info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdfhttp://sedici.unlp.edu.ar/handle/10915/24140enginfo:eu-repo/semantics/altIdentifier/isbn/0-387-34825-5info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/2.5/ar/Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-29T10:55:45Zoai:sedici.unlp.edu.ar:10915/24140Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-29 10:55:45.443SEDICI (UNLP) - Universidad Nacional de La Platafalse |
dc.title.none.fl_str_mv |
Algorithms for network service guarantee under minimal link usage information |
title |
Algorithms for network service guarantee under minimal link usage information |
spellingShingle |
Algorithms for network service guarantee under minimal link usage information Hong, Sugwon Ciencias Informáticas bandwidth application flows |
title_short |
Algorithms for network service guarantee under minimal link usage information |
title_full |
Algorithms for network service guarantee under minimal link usage information |
title_fullStr |
Algorithms for network service guarantee under minimal link usage information |
title_full_unstemmed |
Algorithms for network service guarantee under minimal link usage information |
title_sort |
Algorithms for network service guarantee under minimal link usage information |
dc.creator.none.fl_str_mv |
Hong, Sugwon Lee, Hwang-Kyu Paek, Seonuck |
author |
Hong, Sugwon |
author_facet |
Hong, Sugwon Lee, Hwang-Kyu Paek, Seonuck |
author_role |
author |
author2 |
Lee, Hwang-Kyu Paek, Seonuck |
author2_role |
author author |
dc.subject.none.fl_str_mv |
Ciencias Informáticas bandwidth application flows |
topic |
Ciencias Informáticas bandwidth application flows |
dc.description.none.fl_txt_mv |
One way to guaranteeing service for an application flow even if a network happens to fail is to establish a restoration path with the bandwidth that amounts to the same of the flow. If the flows can share the bandwidth for their restoration paths with others, we can reduce bandwidth consumption required for restoration. It is also required that deciding sharable bandwidth among flows should be done using controllable link information at each node. This paper proposes an algorithm to determine the sharable bandwidth among application flows given local link usage information at each node, validates the results of the algorithm and analyze the conditions required to achieve the goal by simulation. 5th IFIP International Conference on Network Control & Engineering for QoS, Security and Mobility Red de Universidades con Carreras en Informática (RedUNCI) |
description |
One way to guaranteeing service for an application flow even if a network happens to fail is to establish a restoration path with the bandwidth that amounts to the same of the flow. If the flows can share the bandwidth for their restoration paths with others, we can reduce bandwidth consumption required for restoration. It is also required that deciding sharable bandwidth among flows should be done using controllable link information at each node. This paper proposes an algorithm to determine the sharable bandwidth among application flows given local link usage information at each node, validates the results of the algorithm and analyze the conditions required to achieve the goal by simulation. |
publishDate |
2006 |
dc.date.none.fl_str_mv |
2006-08 |
dc.type.none.fl_str_mv |
info:eu-repo/semantics/conferenceObject info:eu-repo/semantics/publishedVersion Objeto de conferencia http://purl.org/coar/resource_type/c_5794 info:ar-repo/semantics/documentoDeConferencia |
format |
conferenceObject |
status_str |
publishedVersion |
dc.identifier.none.fl_str_mv |
http://sedici.unlp.edu.ar/handle/10915/24140 |
url |
http://sedici.unlp.edu.ar/handle/10915/24140 |
dc.language.none.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
info:eu-repo/semantics/altIdentifier/isbn/0-387-34825-5 |
dc.rights.none.fl_str_mv |
info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by-nc-sa/2.5/ar/ Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5) |
eu_rights_str_mv |
openAccess |
rights_invalid_str_mv |
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/ Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5) |
dc.format.none.fl_str_mv |
application/pdf |
dc.source.none.fl_str_mv |
reponame:SEDICI (UNLP) instname:Universidad Nacional de La Plata instacron:UNLP |
reponame_str |
SEDICI (UNLP) |
collection |
SEDICI (UNLP) |
instname_str |
Universidad Nacional de La Plata |
instacron_str |
UNLP |
institution |
UNLP |
repository.name.fl_str_mv |
SEDICI (UNLP) - Universidad Nacional de La Plata |
repository.mail.fl_str_mv |
alira@sedici.unlp.edu.ar |
_version_ |
1844615817083224064 |
score |
13.070432 |