The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Les réseaux superposés créés dynamiquement sur des réseaux IP sous-jacents sont de plus en plus utilisés pour fournir des contenus multimédias car ils peuvent fournir plusieurs services supplémentaires définissables par l'utilisateur. De multiples chemins de superposition entre une paire de nœuds de superposition source-destination sont conçus pour améliorer la robustesse du service contre les pannes et les fluctuations de bande passante des réseaux sous-jacents. Le trafic multimédia peut être distribué sur ces multiples chemins afin de maximiser l'utilisation des chemins et d'augmenter les débits des applications. La plupart des algorithmes de routage basés sur les flux ne prennent en compte que des mesures courantes telles que la bande passante ou le délai des chemins, qui peuvent être efficaces pour les applications de données, mais pas pour les applications en temps réel telles que la voix sur IP (VoIP), dans lesquelles différents niveaux de ces mesures de performances peut donner le même niveau de performances rencontré par les utilisateurs finaux. Cet article se concentre sur de tels réseaux de superposition VoIP et propose un nouvel algorithme de routage de flux basé sur un chemin alternatif utilisant une métrique de trafic spécifique à l'application, à savoir la « capacité du chemin VoIP (VPCap) », pour calculer le nombre maximum de flux VoIP satisfaits à la QoS qui peuvent être distribués. sur chaque chemin de superposition disponible à un moment donné. Les résultats de la simulation ont prouvé qu'un plus grand nombre de sessions VoIP satisfaisant la qualité de service peuvent être établies sur les mêmes multiples chemins de superposition, par rapport aux approches traditionnelles.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copier
Komwut WIPUSITWARAKUN, Sanon CHIMMANEE, "Application Oriented Flow Routing Algorithm for VoIP Overlay Networks" in IEICE TRANSACTIONS on Communications,
vol. E92-B, no. 6, pp. 2054-2064, June 2009, doi: 10.1587/transcom.E92.B.2054.
Abstract: Overlay networks which are dynamically created over underlying IP networks are becoming widely used for delivering multimedia contents since they can provide several additional user-definable services. Multiple overlay paths between a source-destination overlay node pair are designed to improve service robustness against failures and bandwidth fluctuation of the underlying networks. Multimedia traffic can be distributed over those multiple paths in order to maximize paths' utilization and to increase application throughputs. Most of flow-based routing algorithms consider only common metrics such as paths' bandwidth or delay, which may be effective for data applications but not for real-time applications such as Voice over IP (VoIP), in which different levels of such performance metrics may give the same level of the performance experienced by end users. This paper focuses on such VoIP overlay networks and proposes a novel alternative path based flow routing algorithm using an application-specific traffic metric, i.e. "VoIP Path Capacity (VPCap)," to calculate the maximum number of QoS satisfied VoIP flows which may be distributed over each available overlay path at a moment. The simulation results proved that more QoS-satisfied VoIP sessions can be established over the same multiple overlay paths, comparing to traditional approaches.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E92.B.2054/_p
Copier
@ARTICLE{e92-b_6_2054,
author={Komwut WIPUSITWARAKUN, Sanon CHIMMANEE, },
journal={IEICE TRANSACTIONS on Communications},
title={Application Oriented Flow Routing Algorithm for VoIP Overlay Networks},
year={2009},
volume={E92-B},
number={6},
pages={2054-2064},
abstract={Overlay networks which are dynamically created over underlying IP networks are becoming widely used for delivering multimedia contents since they can provide several additional user-definable services. Multiple overlay paths between a source-destination overlay node pair are designed to improve service robustness against failures and bandwidth fluctuation of the underlying networks. Multimedia traffic can be distributed over those multiple paths in order to maximize paths' utilization and to increase application throughputs. Most of flow-based routing algorithms consider only common metrics such as paths' bandwidth or delay, which may be effective for data applications but not for real-time applications such as Voice over IP (VoIP), in which different levels of such performance metrics may give the same level of the performance experienced by end users. This paper focuses on such VoIP overlay networks and proposes a novel alternative path based flow routing algorithm using an application-specific traffic metric, i.e. "VoIP Path Capacity (VPCap)," to calculate the maximum number of QoS satisfied VoIP flows which may be distributed over each available overlay path at a moment. The simulation results proved that more QoS-satisfied VoIP sessions can be established over the same multiple overlay paths, comparing to traditional approaches.},
keywords={},
doi={10.1587/transcom.E92.B.2054},
ISSN={1745-1345},
month={June},}
Copier
TY - JOUR
TI - Application Oriented Flow Routing Algorithm for VoIP Overlay Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 2054
EP - 2064
AU - Komwut WIPUSITWARAKUN
AU - Sanon CHIMMANEE
PY - 2009
DO - 10.1587/transcom.E92.B.2054
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E92-B
IS - 6
JA - IEICE TRANSACTIONS on Communications
Y1 - June 2009
AB - Overlay networks which are dynamically created over underlying IP networks are becoming widely used for delivering multimedia contents since they can provide several additional user-definable services. Multiple overlay paths between a source-destination overlay node pair are designed to improve service robustness against failures and bandwidth fluctuation of the underlying networks. Multimedia traffic can be distributed over those multiple paths in order to maximize paths' utilization and to increase application throughputs. Most of flow-based routing algorithms consider only common metrics such as paths' bandwidth or delay, which may be effective for data applications but not for real-time applications such as Voice over IP (VoIP), in which different levels of such performance metrics may give the same level of the performance experienced by end users. This paper focuses on such VoIP overlay networks and proposes a novel alternative path based flow routing algorithm using an application-specific traffic metric, i.e. "VoIP Path Capacity (VPCap)," to calculate the maximum number of QoS satisfied VoIP flows which may be distributed over each available overlay path at a moment. The simulation results proved that more QoS-satisfied VoIP sessions can be established over the same multiple overlay paths, comparing to traditional approaches.
ER -