Efficient end-to-end QoS mechanism using egress node resource prediction in NGN network

被引:0
|
作者
Ban, SY
Choi, JK
Kim, HS
机构
关键词
nGN; end-to-end QoS; admission control; differential service;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper proposes an efficient end-to-end QoS mechanism using egress node resource prediction via probe method in Next Generation Network (NGN). As we want more smart and intelligent network, NGN is the most important issue to provide users converged and guaranteed services. To provide these services, NGN should support proper end-to-end mechanism to support heterogeneous QoS environment in packet networks. We have studied in IPv6 DiffServ, MPLS DiffServ and other end-to-end QoS with differential service and, there are four ways to provide end-to-end QoS from current best-effort network to NGN; Best-effort QoS in traditional IP network, QoS classification with priority in DiffServ network, QoS aggregation/TE in MPLS network and individual QoS/TE. One of current problems to evolve NGN are there are many legacy equipments which we can not replace at once and various QoS differential service among networks. To address this, there should be proper admission control mechanism to protect core network and support end-to-end QoS in access network. While Planning-based admission is simple but not efficient, and probed-based admission control is efficient but overhead in network, Egress resource prediction-based admission control is efficient and less overhead compared to the previous mechanisms. Egress resource prediction-based admission control mechanism has two parts. First, it checks utilization of egress node by probing. But not like probe-based admission control, it does not send probe as always as there are QoS requests. It handles a bundle of requests with probing, predicts state of egress node and sends probe to handle next bundle of requests. In this mechanism, how to measure current state of egress node and predict its future state.
引用
下载
收藏
页码:U480 / U483
页数:4
相关论文
共 50 条
  • [21] End-to-End QoS Management Proposal for the ITU-T IMS/NGN Architecture
    Vallejo, Alex
    Zaballos, Agustin
    Canaleta, Xavi
    Dalmau, Jordi
    2008 INTERNATIONAL CONFERENCE ON SOFTWARE, TELECOMMUNICATIONS AND COMPUTER NETWORKS, 2008, : 145 - +
  • [22] End-to-End QoS Prediction of Vertical Service Composition in the Cloud
    Karim, Raed
    Ding, Chen
    Miri, Ali
    2015 IEEE 8TH INTERNATIONAL CONFERENCE ON CLOUD COMPUTING, 2015, : 229 - 236
  • [23] An access network design problem with end-to-end QoS constraints
    Park, Chanwoo
    Lee, Youngho
    Kim, Youngjin
    Park, Gigyoung
    OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2014, 48 : 36 - 48
  • [24] On optimal end-to-end QoS budget partitioning in network dimensioning
    Cho, H
    Girard, A
    Rosenberg, C
    PERFORMANCE CHALLENGES FOR EFFICIENT NEXT GENERATION NETWORKS, VOLS 6A-6C, 2005, 6A-6C : 1445 - 1454
  • [25] Impact of alliances on end-to-end QoS satisfaction in an interdomain network
    Barth, Dominique
    Mautor, Thierry
    Monteiro, Daniel Villa
    2009 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-8, 2009, : 1179 - 1184
  • [26] Design and Implementation of an Intelligent End-to-End Network QoS System
    Sharma, Sushant
    Katramatos, Dimitrios
    Yu, Dantong
    Shi, Li
    2012 INTERNATIONAL CONFERENCE FOR HIGH PERFORMANCE COMPUTING, NETWORKING, STORAGE AND ANALYSIS (SC), 2012,
  • [27] A scalable end-to-end QoS management over Diffserv network
    Zhang, G
    Mouftah, HT
    PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-V, 2000, : 2939 - 2945
  • [28] Algorithms for IP network design with end-to-end QoS constraints
    Wille, ECG
    Mellia, M
    Leonardi, E
    Marsan, MA
    COMPUTER NETWORKS, 2006, 50 (08) : 1086 - 1103
  • [30] Efficient monitoring of end-to-end network properties
    Chua, DB
    Kolaczyk, ED
    Crovella, M
    IEEE INFOCOM 2005: THE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-4, PROCEEDINGS, 2005, : 1701 - 1711