• Title/Summary/Keyword: best effort service

Search Result 218, Processing Time 0.03 seconds

Profit Model for Network Contents Service using QoE (QoE를 이용한 네트워크 콘텐츠 서비스 수익모델 설계 및 분석)

  • Kim, Jong-Won;Lee, Goo-Yeon;Kim, Hwa-Jong
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.48 no.9
    • /
    • pp.73-80
    • /
    • 2011
  • Conventional content-delivering services over the Internet were mainly based on the "best effort" scheme, which have been failed to provide a concrete profit model to the content providers. Mean while, a quality assuring network service is expected to provide reasonable profit model. However the relation between the cost and profit of the quality service is under studies. Recently, the Quality of Experience (QoE) was introduced to measure the real satisfaction level of users and used to develope profit models of quality services. The QoE can be used as a key tool for efficient service providing and also criteria for accurate satisfaction measurement. Especially, the QoE based feedback on the intention to pay for the service will be an important information to the content providers. This paper will introduce a model for the costs of quality services, and a profit model based on the QoE. The result of the paper can be used to develope business models for contents services over the growing networks.

Optimal Packet Price for Differentiated Internet Services

  • Lee, Hoon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.11B
    • /
    • pp.1191-1199
    • /
    • 2009
  • As the Internet service evolves from the best effort data service to a multimedia service such as a mix of voice, data and video, a need for the guarantee of the quality of service to network services became one of the hot issues for the network operators. On the other hand, the introduction of the multimedia services over the IP network requires a managed differentiated service that adopts a prioritized treatment of packets. This incurs a need for a differentiated pricing scheme for the packets that receive different level of quality of service. This work proposes an analytic framework about packet pricing scheme for these services, and investigate the effect of service differentiation to the packet price for each class. Via numerical experiment, we validate our argument and illustrate the implication of the work.

A Traffic Model based on the Differentiated Service Routing Protocol (차별화된 서비스제공을 위한 트래픽 모델)

  • 인치형
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.10B
    • /
    • pp.947-956
    • /
    • 2003
  • The current IP Routing Protocolspacket networks also need to provide the network QoS based of DiffServ, RSVP, MPLStraffic model which is standardized as IETF reference model for NGN. The first topic of this paper is to propose Traffic-Balanced Routing Protocol(TBRP) to process existing best effort traffic. TBRP will process low priority interactive data and background data which is not sensitive to dealy. Secondly Hierarchical Traffic-Traffic-Scheduling Routing Protocol(HTSRP) is also proposed. HTSRP is the hierarchical routing algorithm for backbone and access networkin case of fixed-wireless convergence network. Finally, HTSRP_Q is proposed to meet the QoS requirement when user want interactive or streaming packet service. This protocol will maximize the usage of resources of access layer based on the QoS parameters and process delay-sensitive traffic. Service classes are categorized into 5 types by the user request, such as conversational, streaming, high priority interactive, low priority interactive, and background class. It could be processed efficiently by the routing protocolstraffic model proposed in this paper. The proposed routing protocolstraffic model provides the increase of efficiency and stability of the next generation network thanks to the routing according to the characteristic of the specialized service categories.

Flow-Based Admission Control Algorithm in the DiffServ-Aware ATM-Based MPLS Network

  • Lee, Gyu-Myoung;Choi, Jun-Kyun;Choi, Mun-Kee;Lee, Man-Seop;Jong, Sang-Gug
    • ETRI Journal
    • /
    • v.24 no.1
    • /
    • pp.43-55
    • /
    • 2002
  • This paper proposes a flow-based admission control algorithm through an Asynchronous Transfer Mode (ATM) based Multi-Protocol Label Switching (MPLS) network for multiple service class environments of Integrated Service (IntServ) and Differentiated Service (DiffServ). We propose the Integrated Packet Scheduler to accommodate IntServ and Best Effort traffic through the DiffServ-aware MPLS core network. The numerical results of the proposed algorithm achieve reliable delay-bounded Quality of Service (QoS) performance and reduce the blocking probability of high priority service in the DiffServ model. We show the performance behaviors of IntServ traffic negotiated by end users when their packets are delivered through the DiffServ-aware MPLS core network. We also show that ATM shortcut connections are well tuned with guaranteed QoS service. We validate the proposed method by numerical analysis of its performance in such areas as throughput, end-to-end delay and path utilization.

  • PDF

A Study on the Performance Enhancements of Video Streaming Service in MPLS Network

  • Kwak Kyoung Hwan;Park In Kap;Kim Chung Hyun
    • Proceedings of the IEEK Conference
    • /
    • 2004.08c
    • /
    • pp.549-551
    • /
    • 2004
  • This paper used OPNET to simulate video streaming service a test IP network and MPLS network with the traffic shaping that have with CQ_ LLQ algorithm, LSP of fixed bandwidth, policy of limitation users and measures parameters such as delay, throughput, packet loss. To verify the performance of video streaming service in IP network and MPLS network, two scenario that have same topology and traffic source. One is the simulation for best-effort service in pure IP network. The other is the simulation for QoS-enabled service in MPLS Network. Based on simulation result, the MPLS network with CQ_ LLQ algorithm and fixed LSP show advantage of the video streaming service QoS, specially delay and packet loss

  • PDF

A Capacity Planning Framework for a QoS-Guaranteed Multi-Service IP network (멀티서비스를 제공하는 IP 네트워크에서의 링크용량 산출 기법)

  • Choi, Yong-Min
    • 한국정보통신설비학회:학술대회논문집
    • /
    • 2007.08a
    • /
    • pp.327-330
    • /
    • 2007
  • This article discusses a capacity planning method in QoS-guaranteed IP networks such as BcN (Broadband convergence Network). Since IP based networks have been developed to transport best-effort data traffic, the introduction of multi-service component in BcN requires fundamental modifications in capacity planning and network dimensioning. In this article, we present the key issues of the capacity planning in multi-service IP networks. To provide a foundation for network dimensioning procedure, we describe a systematic approach for classification and modeling of BcN traffic based on the QoS requirements of BcN services. We propose a capacity planning framework considering data traffic and real-time streaming traffic separately. The multi-service Erlang model, an extension of the conventional Erlang B loss model, is introduced to determine required link capacity for the call based real-time streaming traffic. The application of multi-service Erlang model can provide significant improvement in network planning due to sharing of network bandwidth among the different services.

  • PDF

Improvement of fairness between assured service TCP users in a differentiated service network (차별화 서비스 망에서 보장형 서비스의 TCP 사용자들간 공정성 개선 방안)

  • Lee, Ji-Hyoung;Jeong, Choong-Kyo
    • Journal of Industrial Technology
    • /
    • v.20 no.B
    • /
    • pp.139-146
    • /
    • 2000
  • To support Quality of Service (QoS) in the existing Internet, Differentiated Service (Diff-Serv) has been proposed. But, the unfairness between TCP connections remains as a serious problem not only in the conventional best-effort service Internet but also in new Diff-Serv network. In this paper, we propose the Balancing Marker Algorithm (BMA) improving the fairness between individual connections of aggregated sources in a Diff-Serv network. This algorithm is based on the 3-level priority marking method. We compared the 2-level packet priority marker with the Balancing Marker proposed in this paper. And we showed that the BMA improved the fairness and the throughputs between the individual connections with different delays in an aggregated source.

  • PDF

Dual GPS Scheduler for Delay-Constraint Applications in E-PON (이더넷수동형 광 네트워크에서 지연 제약을 고려한 Dual-GPS 스케줄러)

  • An, Eung-Suk;Zhang, Lin;Youn, Chan-Hyun;Yeo, Hwan-Geun;Yang, Sun-Hee;Kim, Young-Sun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.4B
    • /
    • pp.270-281
    • /
    • 2003
  • E-PON supports efficiently the increased Internet data traffic and efficient bandwidth assignment function by which the shared upstream bandwidth in the broadband access networks. In this paper, when different types of incoming sources are mapped into QoS-aware source and Best-Effort(BE) source, we propose the Dual-GPS schedulaer in E-PON that has the characteristics to provide delay and delay-constraint application, and maximizes the bandwidth to best-effort service. When transmit upstream data in E-PON, The proposed scheme supports the control capabilities of delay and delay-variation for required QoS flow through the novel bandwidth assignment scheme. Simulation results show our scheme outperforms the conventional bandwidth allocation scheme in controlling the delay and delay-variation of E-PON system.

A Packet Scheduling Algorithm for High-speed Portable Internet System (휴대 인터넷 시스템에서의 패킷 스케줄링 알고리즘 연구)

  • Choi, Seong-Hoon
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.30 no.1
    • /
    • pp.59-65
    • /
    • 2007
  • HPI (High-speed Portable Internet) system which provides high speed internet services is going to be commercialized soon. Since HPI provides simultaneously four different service types such as UGS (Unsolicited Grant Service), rtPS (real time Polling Service), nrtPS(non-real time Polling Service), and BE (Best Effort) under different QoS (Quality of Service) requirements and limited wireless channel resources, efficient packet scheduling mechanisms are necessary to increase the utilization of channels as well as to satisfy the various QoS requirements. This study regards the traffic data to be served as time series and proposes a new packet scheduling algorithm based on the nonparametric statistical test. The performance of the newly proposed algorithm is evaluated through the simulation analysis using a simulator that can evaluate the performance of packet scheduling mechanisms under various values of system parameters and measures such as packet delay time, data transmission rate, number of loss packets, and channel utilization.

An Efficient Resource Reservation Schemes using PMRSVP in Wireless Mobile Networks (무선 이동 망에서 PMRSVP를 이용한 효율적인 자원 관리)

  • Han, Seung-Jin;Park, Yang-Jae;Rim, Kee-Wook;Lee, Jung-Hyun
    • The KIPS Transactions:PartC
    • /
    • v.10C no.3
    • /
    • pp.355-366
    • /
    • 2003
  • Today's market share of mobile internet service is growing rapidly in internet due to the rapid advances in wireless mobile networks. To guarantee for QoS of Mobile Nodes in wireless mobile networks, we propose the Proxy MRSVP (PMRSVP) which is efficient resource reservation protocol. The PMRSVP using a modified regional registration restrains excessive message generation from existing protocols that propose an alternative plan of existing best effort service in wireless mobile networks. We show that signaling message generation quantities and resource registration costs of the PMRSVP are lower than MRSVP and Hierarchical MRSVP (HMRSVP) because as Mobile Agent (MA) plays a proxy role instead of Corresponding Host (CH). We evaluate resource reservation cost with registration cost of intradomain and interdomain of the proposed method in the paper by comparing to that of the MRSVP and HMRSVP.