• Journal of Broadcast Engineering
• /
• v.20 no.1
• /
• pp.40-47
• /
• 2015

This paper discusses QoS enhancement in the Best-effort services of the service plan provided by MPEG Media Transport (MMT) systems for video streaming applications. Among MMT services, i.e. per-flow, per-class, and best-effort services, the server does not provide guaranteed bandwidth for the best-effort service only. Therefore, in the best-effort services, a bandwidth access priority is defined for various services, where the lowest priority is assigned to the low-level video services. To alleviate the issue of bandwidth limitation in the best-effort services, this paper investigates transmission of low-resolution video with low bitrate and up-sampling. Our experimental results prove the superiority of the proposed method in terms of delivered video quality.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2001.10a
• /
• pp.150-153
• /
• 2001

Today Internet is only Best-Effort service. During the past few years, new types of internet applications which require performance beyond the best-effort service that is provided by the current internet have emerged. These applications required QoS(Quality of Services) guarantee and Security between end-to-end. In this paper simulations Differentiated Services that IETF(Internet Engineering Task Forte) has proposed one of QoS(Quality of Services) guarantee VPN(Virtual private Network) using QoS(Quality of Services) guarantee and IP Security between end-to-end.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.6
• /
• pp.19-19
• /
• 2002

In this paper the authors explore the effect of bandwidth sharing to the utility of the customer for the best-effort Internet services and draw a basis for the pricing principle in Internet Protocol networks. Especially, we investigate the behavior of a customer′s utility in case an arbitrary amount of additional bandwidth is allowed to each customer for the elastic traffic, which is the typical example of the non-real time Internet data traffic. After drawing the utility curve, which will be proved to follow the concave curve, we will apply it to the pricing of Internet traffic. Finally, via numerical experiments, we will illustrate the validity and implication of the proposed method.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.6
• /
• pp.277-284
• /
• 2002

In this paper the authors explore the effect of bandwidth sharing to the utility of the customer for the best-effort Internet services and draw a basis for the pricing principle in Internet Protocol networks. Especially, we investigate the behavior of a customer's utility in case an arbitrary amount of additional bandwidth is allowed to each customer for the elastic traffic, which is the typical example of the non-real time Internet data traffic. After drawing the utility curve, which will be proved to follow the concave curve, we will apply it to the pricing of Internet traffic. Finally, via numerical experiments, we will illustrate the validity and implication of the proposed method.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.1
• /
• pp.9-19
• /
• 1999

An increase of the number of the real time applications and the Internet hosts make the Internet architecture changed. Current Internet architecture has some problems to process the real time traffics. To solve these problem, a new Internet architecture is proposed as the Integrated Service model. In the current Internet, as multicast protocols, the QoS multicast and the best-effort multicast have been studied in their separate network environments. But, the Integrated Service Packet Network is a heterogeneous network composed of the QoS delivery domain and the best-effort delivery domain. Thus, those separated multicast protocols have limitations in an ISPN. In this paper, we propose a multicast protocol for the ISPN with the QoS and the best-effort multicasting, and analyze the performance of this protocol. As a result, we find that the packet losses are same for hybrid multicast and best-effort multicast when the bandwidth is sufficient. But, if there exist some background traffics, the hybrid multicast has less packet loss than of the best-effort multicast.

• Proceedings of the IEEK Conference
• /
• 2003.11c
• /
• pp.168-171
• /
• 2003

IEEE 802.16 Wireless MAN standard specifies the air interface of fixed point-to-multipoint broadband wireless access systems providing multiple services. Among the service classes supported by the wireless MAN, the best effort service class is ranked on the lowest position in priority and is assisted by a MAC scheme based on reservation ALOHL Such MAC scheme must include a number of components, while many of them are not specified in the standard. In this paper, we thus reveal main components of a MAC scheme supporting the best effort service and present candidate schemes implementing such components. Combining schemes for implementing components, we then construct distinctive MAC schemes supporting best effort service. In designing a MAC scheme, the delay performance induced by the scheme should be considered since scarce resource may be available for the best effort service after the preemptive resource occupation by other service classes. In this paper, we focus on the delay fairness among the subscriber stations using the best effort service. For evaluating a MAC scheme in delay fairness, we present two definitions of delay fairness and provide a criterion for optimal MAC scheme according to each definition of delay fairness. Using a simulation method we investigate the mean delay performance exhibited by each MAC scheme arid find an optimal scheme in delay fairness. From numerical examples, we observe that SR/ED/PG＋P scheme has strong delay fairness compared with MR/ED/PG＋P and SR/ED/PG＋D schemes according to a definition of delay fairness. However, other schemes are rather shown to have better delay fairness when the other definition is adopted.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.11 s.353
• /
• pp.128-140
• /
• 2006

In the IEEE 802.16 Wireless MAN standard specifies the air interface of fixed point-to-multipoint broadband wireless access systems providing multiple services. Among the service classes supported between the base station and subscriber stations in the wireless MAN, the best effort service class is ranked on the lowest position in priority and is assisted by a MAC scheme based on reservation ALOHA. The wireless MAN standard, however, does not reveal every detail of the MAC scheme but only describes the skeleton of the MAC scheme. Focusing on the amount of resource that a subscriber demands by a request and the amount of resource that the base grants to a request we thus present a number of resource demand rules and resource grant rules. Also, we construct a candidate MAC scheme by implanting a pair of resource demand and grant rules into the skeleton of the MAC scheme. Meanwhile a difficult situation for the best effort service is expected wherein only scarce resource is available after most of the resource is already preempted by other services. Perceiving such a situation, we evaluate the throughput and delay performance of each candidate MAC scheme. Especially we develop an analytical method to approximately calculate the throughput in the saturated environment. From the numerical results, we observe that the candidate MAC scheme which adopts the non-gated exhaustive demand rule paired with the full grant rule attains superior performance at the expense of the fairness.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.6B
• /
• pp.586-592
• /
• 2002

In this paper, new channel scheduling algorithms which reduce transmission delay caused by wireless network are proposed in AMC/TDM wireless data communication. The concept of the Proposed algorithms is based on the proportional fairness, M-LWDF, and performance-guaranteeing algorithm proposed by Xin Liu. The proposed algorithm can be applied to QoS guaranteeing services as well as best-effort services. Simulation results show that new algorithm reduced transmission delay upto 11.5% in case of proportional fairness algorithm and also decreased transmission delay unto 9% in case of M-LWBF algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.11A
• /
• pp.859-866
• /
• 2003

In this paper, we designed the bandwidth allocation scheme with priority consideration for upstream channel access of EthernetPON. The objective of our scheme is to control the multi services in more effective way according to their CoS(Class of Service) or QoS(Quality of Service). The designed scheme considers transmission priority in the both side of OLT and ONU. In the OLT's view, the Two-step scheduling algorithm is applied with which we can support multiple bandwidth allocation policies simultaneously, i.e. SBA for the time-sensitive, constant rate transmission services and DBA for the best-effort services. This Two-step scheduling algorithm reduces the scheduling complexity by separating the process of transmission start time decision from the process of grant generation. In the ONU's view, the proposed scheme controls 8 priority queues of the 802.1d recommended 8 service classes. Higher priority queue is serviced in prior during the allowed GATE time from OLT. The OPNET modeling and simulation result compares the performance of each bandwidth allocation policy with SBA or DBA only approach.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.12B
• /
• pp.1017-1027
• /
• 2006

Recently, Internet service providers are offering triple play service which combines voice and video services with the existing high speed Internet service under the common network infrastructure of IP protocol, so that they can create more benefit from operating a single network architecture. In line with this movement in the convergence of network and services, in this work we propose a bandwidth dimensioning method for the subscriber network of the IP network at flow level. To that purpose, let us propose a series of bandwidth dimensioning methods: bandwidth for best effort service only, bandwidth dimensioning for premium services, and bandwidth dimensioning schemes for the premium Internet services as well as the best effort service which comprise the TPS. Our link dimensioning method is based on the flow level that incorporates the flow blocking probability as a measure of grade of services(GoS), and investigates the characteristics of the proposed methods via extensive numerical experiments. After that, let us carry out a simulation experiment concerning the delay and loss performance of the packet scheduling for the premium services (QoS) using the bandwidth designed by our proposed method, via which the packet level quality of service (QoS) for the proposed link dimensioning method can be observed.