• Smart Media Journal
• /
• v.11 no.5
• /
• pp.82-90
• /
• 2022

Along with the growing popularity of 5G technology, providing flexible and personalized network services suitable for requirements of customers has also become a lucrative venture and business key for network service providers. Therefore, dynamic network provisioning is needed to help network service providers. Moreover, increasing user demand for network services meets specific requirements of users, including location, usage duration, and QoS. In this paper, a routing algorithm, which makes routing decisions using Reinforcement Learning (RL) based on the information about link stability, is proposed and called Link Stability aware Reinforcement Learning (LSRL) routing. To evaluate this algorithm, several mininet-based experiments with various network settings were conducted. As a result, it was observed that the proposed method accepts more requests through the evaluation than the past link annotated shorted path algorithm and it was demonstrated that the proposed approach is an appealing solution for dynamic network provisioning routing.

• Review of KIISC
• /
• v.15 no.3
• /
• pp.13-28
• /
• 2005

광대역 통합망(BcN: Broadband convergence Network)에서 대역폭의 증가와 서비스의 통합으로 보안의 중요성이 빠르게 증가하고 있다. 그러므로 보안은 BcN에서 다루어져야 할 중요한 문제의 하나로 인식되어야 한다. BcN과 같은 QoS-aware 통신시스템에서 사용자는 원하는 서비스 품질 수준의 보장을 위하여 여러 가지의 서비스 클래스 중에서 선택할 수 있다. 그러나 보안은 아직 이런 QoS 구조에서 하나의 파라미터로 인정되지 않고 있으며, 보안-관련 서비스 클래스도 정의된 바 없다. 본고에서는 BcN 구조에서 발생할 수 있는 보안 취약성을 분석하고 BcN 인프라 정보보호를 위하여 관련 기술, 표준화, 국내 동향 등에 대하여 기술하고자 한다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.8 s.350
• /
• pp.1-14
• /
• 2006

Multi-constraint QoS routing has been seen as crucial network property in the next generation optical Internet based on DWDM Networks. This paper proposes a new QoS routing algorithm based on flooding method, called bounded flooding routing (BFR) algorithm which can meet multi-constraint QoS requirements. Primarily, the BFR algorithm tries to reduce network overhead by accomplishing bounded-flooding to meet QoS requirements, and improve blocking probability and wavelength utilization. Also, as one effort to improve routing performance, we introduce a new concept, ripple count, which does not need any link-state information and computational process. For extensive analysis and simulation study, as a critical concern, in DWDM-based networks we deploy limited wavelength conversion capability within DWDM nodes. And the simulation results demonstrate that the BFR algorithm is superior to other predominant routing algorithms (both original flooding method and source-directed methods) in terms of blocking probability, wavelength channels required and overhead.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.2
• /
• pp.579-603
• /
• 2018

In this paper we propose a QoS-enhanced intelligent stochastic optimal fair real-time packet scheduler, QUEST, for 4G LTE traffic in routers. The objective of this research is to maximize the system QoS subject to the constraint that the processor utilization is kept nearly at 100 percent. The QUEST has following unique advantages. First, it solves the challenging problem of starvation for low priority process - buffered streaming video and TCP based; second, it solves the major bottleneck of the scheduler Earliest Deadline First's failure at heavy loads. Finally, QUEST offers the benefit of arbitrarily pre-programming the process utilization ratio.Three classes of multimedia 4G LTE QCI traffic, conversational voice, live streaming video, buffered streaming video and TCP based applications have been considered. We analyse two most important QoS metrics, packet loss rate (PLR) and mean waiting time. All claims are supported by discrete event and Monte Carlo simulations. The simulation results show that the QUEST scheduler outperforms current state-of-the-art benchmark schedulers. The proposed scheduler offers 37 percent improvement in PLR and 23 percent improvement in mean waiting time over the best competing current scheduler Accuracy-aware EDF.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.12
• /
• pp.5917-5935
• /
• 2018

Adaptive Multi-Rate Codec is one of the codecs which is used for making voice calls. It helps to connect people who are scattered in various geographical areas. It adjusts its bit-rate according to the user's channel conditions. It plays a vital role in providing an improved speech quality of voice connection in Long Term Evolution (LTE). There are some constraints which need to be addressed in providing this service profitably. Quality of Service (QoS) is the dominant mechanism which determines the quality of the speech in communication. On several occasions, number of users are trying to access the same channel simultaneously by standing in a particular region for a longer period of time. It refers to Multi-user channel sharing problem which leads to resource loss very often. The main aim of this paper is to develop a novel RSA - QoS scheduling algorithm for reducing the Resource Loss Ratio. Eventually, it increases the throughput.The simulation result shows that the RSA - QoS increases the number of users for accessing the resources better than the existing algorithms in terms of resource loss and throughput. Ultimately, it enhances the QoS in Mobile Networks.

• Journal of Digital Contents Society
• /
• v.19 no.2
• /
• pp.407-413
• /
• 2018

In this paper, we present a scalable data delivery infrastructure for such IoT computing environment where we need a common platform where data providers share their diverse sensing data and applications can easily access and receive such data from providers. For efficient data delivery, this paper proposes a new delivery path management technique that take advantage of diverse consumer QoS when building bandwidth-efficient delivery paths. We perform primitive experiments on the path construction and reconstruction which may be major overhead of the scalable infrastructure. The results show that the proposed infrastructure achieves a high level of scalability, and demonstrates that the management overhead is not significant.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.10B
• /
• pp.876-890
• /
• 2003

This paper proposes a protocol for the reliableand QoS-aware multicast transport, which is called the Enhanced Communications Transport Protocol (ECTP). The ECTP has so far been developed and standardized in ITU-T SG17 and ISO/IEC JTC 1/SC 6. Differently from the conventional reliable multicast, as shownin the IETF RMT WG, the ECTP additionally provides several distinct features such as tight control of multicast session, tree-based error control, and QoS management. For the tight control of multicast connections, the sender is at the heart of one-to-many group communications, and it is responsible for overall connection management such as connection creation/termination, pause/resumption, and the join and leave operations. for tree-based reliability control, ECTP configures a hierarchical tree during connection creation. Error control is performed within each local group defined by a control tree, which was partly designed like the IETF TRACK approach. Each parent retransmits lost data in response to retransmission requests from its children. For QoS management, ECTP supports QoS negotiation for resource reservation, and it also provides QoS monitoring and maintenance operations. ECTP has been implemented and tested on Linux machine, along with Application Programming Interfaces based on Berkeley sockets. For basic testing of the ECTP functionality, we give some preliminary experimental results for performance comparison of ECTP and TCP unicast transports. In conclusion, we describe the status of ECTP experimentations over APAN/KOREN testbed networks

• Journal of Multimedia Information System
• /
• v.1 no.2
• /
• pp.101-110
• /
• 2014

The purpose of this research is to extend Ad-hoc network system lifetime with the proposed routing protocol which has considered hop lifetimes of the nodes while guaranteeing QoS in the establishment process of Ad-hoc network communication paths. Based on another power aware routing system that proposed in the advanced research [1], we are proposing an alternative power aware routing system in which nodes' hop lifetimes are compared in order to extend the lifetime of an Ad-hoc network system and delay factors have been considered for the assurance of QoS. The research of the routing protocol in this paper, which aims to maximize the system survival time considering power consumption status during the path searching in MANET and pursues the mechanism that controls hop delays for the same reason, can be applied to the study of WSN. The study concerning such phenomena is essential so that the proposed protocol has been simulated and verified with NS-2 in Linux system focusing on the lifetimes of the hops of the nodes. Commercialization of smart devices and arrival of the ubiquitous age has brought about the world where all the people and things are connected with networks. Since the proposed power aware method and the hop delay control mechanism used to find the adequate communication paths in MANET which mainly uses batteries or in WSN, they can largely contribute to the lifetime extension of the network system by reducing power consumptions when utilized for the communications attempts among soldiers during military operation, disaster areas, temporary events or exhibitions, mobile phone shadow areas, home networks, in-between vehicle communications and sense networks, etc. This paper presents the definitions and some advantages regarding the proposed outing protocol that sustain and extend the lifetime of the networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.7B
• /
• pp.602-607
• /
• 2006

A subscriber-oriented service became necessary for the QoS management due to the development of network. BcN(Broadband convergence Network) which incorporates communication, broadcasting and internet not only improves the quality of the communication and broadcasting service but also. aims at broadband service. Therefore, QoS management for each subscriber becomes more important. Not yet, however, the discussion for the subscriber oriented QoS management is not activated. Although, there are several techniques for subscriber distinction using flow information, IP information or MAC information, but they are only processed in layer 3 network. Actually, it is impossible to manage QoS of all subscriber's in layer 3 network. In this paper, we propose a method for QoS management scheme that does not need additional processes or large hardware in layer 2 network and analyze efficiency and overheads. We propose the first subscriber-oriented service method in layer 2 network that is applicable to either existing network or BcN.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.12
• /
• pp.5231-5248
• /
• 2016

As a service-oriented paradigm, web service composition has obtained great attention from both academia and industry, especially in the area of cloud service. Nowadays more and more web services providing the same function but different in QoS are available in cloud, so an important mission of service composition strategy is to select the optimal composition solution according to QoS. Furthermore, the selected composition solution should satisfy the service level agreement (SLA) which defines users' request for the performance of composite service, such as price and response time. A composite service is feasible only if its QoS satisfies user's request. In order to obtain composite service with the optimal QoS and avoid SLA violations simultaneously, in this paper we first propose a QoS evaluation method which takes the SLA satisfaction into account. Then we design a service selection algorithm based on our QoS evaluation method. At last, we put forward a parallel running strategy for the proposed selection algorithm. The simulation results show that our approach outperforms existing approaches in terms of solutions' optimality and feasibility. Through our running strategy, the computation time can be reduced to a large extent.