• Journal of Korean Institute of Industrial Engineers
• /
• v.24 no.2
• /
• pp.241-249
• /
• 1998

In this paper, we seek to find an optimal allocation of link capacity in a data communication network. The architecture of the data communication network considered in the study is an online-service network based on public switched telephone network(PSTN) and packet switched data network(PSDN). In designing the architecture of the network, we need to deal with various measures of quality of service(QoS). Two important service measures are the call blocking probability in PSTN and the data transfer delay time in PSDN. Considering the tradeoff between the call blocking probability and the data transfer delay time in the network, we have developed the optimal link capacity allocation model that minimizes the total link cost, while guarantees the call blocking probability and the data transfer delay time within an acceptable level of QoS. This problem can be formulated as a non-linear integer programming model. We have solved the problem with tabu search and simulated annealing methods. In addition, we have analyzed the sensitivity of the model and provided the insight of the model along with computational results.

• Journal of KIISE:Information Networking
• /
• v.31 no.5
• /
• pp.501-510
• /
• 2004

While the Internet keeps its permeation into every aspect of human life, two things stand out. One is the requirement for high quality of services to support multimedia data service.'The other is the desire for ubiquitous network connection. Combining the two things makes the Internet possible in supporting multimedia communications for nomadic users on the locomotion. To support QoS communication for mobile users by applying RSVP to Mobile IP, RSVP Tunnel, which specifies building separately a RSVP session between the home agent and the foreign agent, was proposed. However, the RSVP Tunnel method breeds bandwidth overhead and association problems in tunnel because of duplicated RSVP messages use. To resolve these problems, in this paper, we propose the new encapsulation method, the RSVP-in-IP Encapsulation (RIPE) that can support QoS guaranteed service efficicntly in Mobile IP networks. The proposed method supports RSVP mobility to Mobile If tunneling mechanism efficiently without any additional session as the RSVP Tunnel scheme. Moreover it removes the critical problems of bandwidth overhead in a tunnel and association by duplicated messages. We compared the performance of our proposed scheme with RSVP Tunnel scheme in term of mean delay, mean data rate and bandwidth overhead in tunnel.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.05a
• /
• pp.591-593
• /
• 2016

Device-to-device (D2D) communications underlaid cellular infrastructure is an competitive local area services technology to promote spectrum usage for next generation cellular networks. These potential can only be tap through efficient interference coordination. Previous works only concentrated on interference from D2D pairs whiles interference from CUs to D2D pairs were neglected. This work focus on solving uplink interference problem emanating from multiple CUs sharing its resource with multiple D2D pairs. The base station (BS) acting as a supervisor selfishly institute a pricing scheme to manage the interference it experience from D2D pairs based on its Quality of service (QoS) requirement. D2D pairs following the supervisor make power allocation decisions considering the price from the BS in a non-cooperative game fashion. In order for the D2D pairs to also meet their QoS requirement, they suggest a price to the BS called discount price which reflects the interference they receive from the CUs. Finally, we analyze the proposed approach.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.6A
• /
• pp.371-378
• /
• 2003

In Code Division Multiple Access (CDMA) system, the cell capacity is defined as the number of available channels in a cell, which is limited by the interferences. When a new call is accepted at its home cell, this adds the interference to the home and its neighboring cells. This paper proposes a call admission control based on mobile transmission power prediction. The home cell has enough capacity to admit new call and if home cell would have admitted a new call, it calculates the mobile transmission power. Also, its neighboring cell can predict the amount of interference using the predicted mobile transmission power. Thus, the new mobile is accepted by its home cell if QoS(Quality Of Service) is guaranteed in its neighboring cells. The simulation result shows that the proposed scheme largely reduces the outage probability in the neighboring cells.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.5
• /
• pp.691-708
• /
• 2010

An important issue of supporting multi-users with diverse quality-of-service (QoS) requirements over wireless networks is how to optimize the systematic scheduling by intelligently utilizing the available network resource while, at the same time, to meet each communication service QoS requirement. In this work, we study the problem of a variety of communication services over multi-media heterogeneous cognitive OFDM system. We first divide the communication services into two parts. Multimedia applications such as broadband voice transmission and real-time video streaming are very delay-sensitive (DS) and need guaranteed throughput. On the other side, services like file transmission and email service are relatively delay tolerant (DT) so varying-rate transmission is acceptable. Then, we formulate the scheduling as a convex optimization problem, and propose low complexity distributed solutions by jointly considering channel assignment, bit allocation, and power allocation. Unlike prior works that do not care computational complexity. Furthermore, we propose the FAASA (Fairness Assured Adaptive Sub-carrier Allocation) algorithm for both DS and DT users, which is a dynamic sub-carrier allocation algorithm in order to maximize throughput while taking into account fairness. We provide extensive simulation results which demonstrate the effectiveness of our proposed schemes.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.14 no.5
• /
• pp.837-844
• /
• 2019

In this paper, we propose the AMBM(: Adaptive Multi-channel Backoff Machisum) -Mac protocol to provide high throughput for non-safety applications in VANET(: Vehicular Ad Hoc Networks) environment. The proposed protocol guarantees the quality of service of non-safety packets by dynamically adjusting CW(: Channel Window) of WSA(: WAVE Service Advertisement) to maximize throughput between non-safety packets of different priority. It also shows that allocating a large amount of time for channel coordination and time slot reservation for SC and dynamically adjusting CW and CCI as nodes increase to reduces transmission delay than IEEE 1609.9, C-MAC(: Coordinated multi-channel MAC, and Q-VCI(: QoS Variable CCH Interval) protocols.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.5B
• /
• pp.820-829
• /
• 2000

In this paper, DSPA(Dynamic Signalling Period Allocation) algorithm that has been proposed by the authors for MAC(Medium Access Control) protocols in W-ATM(Wireless Asynchronous Transfer Mode) is applied to mixed traffic conditions composed of various service classes. We investigate the bandwidth utilization efficiency and quality of service(QoS) fulfillment by the DSPA algorithm used in W-ATM MAC protocols. Simulation results indicate that the DSPA algorithm significantly increases the throughput of the system with the minimum control overhead. Moreover, QoS of each service class is well satisfied by proper and fair channel allocation to different service classes according to their requirements.

• Journal of KIISE:Information Networking
• /
• v.27 no.2
• /
• pp.123-130
• /
• 2000

It is important interest for us to solve skew problem in intermedia synchronization and to solve jitter problem in intramedia synchronization. It propose multimedia synchronization model to represent mixed media which contain temporal media and spatial media, and that helps us to develop multimedia application software efficiently. The proposed paper use four parameters to deal with QoS of intermedia synchronization and relative duration time algorithm and jitter-compensatory time algorithm are presented. When key medium is destroyed we make a delay as much as maximum delay jitter of the key medium in order to playout the other medium as much as that. The result is that the application of maximum delay jitter improves the service quality.

• The KIPS Transactions:PartC
• /
• v.10C no.4
• /
• pp.441-446
• /
• 2003

Earlier efforts on optical access concentrated on the design of PONs for the collection and distribution portion of the access network. The PON architecture is very simple but it requires a MAC protocol for control of upstream traffic. The MAC protocol must support QoS (Quality of Service) administration function by various traffic class, efficient dynamic bandwidth assignment function, CDV (Ceil Delay Variation) minimization function etc. This paper proposes a dynamic bandwidth assignment algorithm of the MAC protocol for a broadband access network using an Ethernet Passive Optical Network supporting various traffic class. We compare our proposed with MDRR algorithm using simulation, and confirmed that our proposed Request-Counter algorithm produces shorter average cell delay.

• Journal of KIISE
• /
• v.42 no.5
• /
• pp.566-572
• /
• 2015

We proposed a novel energy optimization technique for smartphone GPUs, more aggressively lowering the GPU frequency while obtaining higher energy efficiency with a negligible negative impact on the GPU performance. In order to achieve the Quality of Service (QoS) specified by the smartphone application, the proposed optimization technique employed the minimal acceptable GPU frequency based on average Frames per Second (FPS) for each GPU frequency level. Our experimental results on a smartphone development board showed that the proposed technique can reduce the GPU energy consumption by up to 23% over the default DVFS algorithm with only a 0.45 frame drop.