• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.4
• /
• pp.552-558
• /
• 2002

Differentiated services (DiffServ) architecture defines a new framework for the support of quality of service (QoS) in IP-based networks. RIO has received the most attention among all the active queue management mechanisms proposed for assured service in DiffServ environment. The paper proposed the enhanced RIO which could alleviate the impact of flow's packet sire on the realized throughput. The simulation results indicate that this mechanism, when combined with TSW as traffic conditioner, provide better throughput assurance and fair distribution of excess bandwidth independent of packet size of flows in case of well-provisioned network environment.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.1
• /
• pp.153-160
• /
• 2009

A hierarchical network between Mobile-WiMAX and WLAN systems is to make it possible to utilize wireless internet services including time sensitive applications such as VoIP, VOD, visual telephony etc. During the process of vertical handoff decision from Mobile-WiMAX to WLAN hotspot, vertical handoff delay causes user dissatisfaction because it doesn't provide the seamless wireless internet service. We make use of type of service (ToS) parameters in IEEE 802.16e specification as the criterion parameter of vertical handoff decision process in hierarchical Mobile-WiMAX/WLAN networks. In this paper, we propose the process of vertical handoff decision for seamless wireless internet service which is sensitive to time delay. If type of service is time sensitive application, the decision of vertical handoff is withdrawn until the service is terminated. In focus on user satisfaction, if the proposed traffic management strategy in hierarchical Mobile-WiMAX/WLAN networks is used, user will utilize seamless wireless internet services including time sensitive applications.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.12B
• /
• pp.1749-1757
• /
• 2010

This paper considers the cost minimization problem to satisfy QoS (Quality of Service) requirements for a given network, in particular when communication resources to each link can be additionally assigned. For the purpose of quantifying QoS requirements such as data transfer delay and packet loss, we introduce the cost function considering both the link utilization factor and the additionally assigned resource. To minimize this cost function, we firstly formulate a Basic Capacity Planning (BCP) problem, a special case of Network Utility Maximization (NUM). We show that the solution of this BCP problem cannot be optimal via a counter example. In this paper, we suggest the cross-layer design of both additionally assigned resource and routing path, whose initial values are set to the result of BCP problem. This cross-layer design is based on a heuristic approach which presents an effective way to plan how much communication resources should be added to support the QoS requirements in future. By simulation study, we investigate the convergence of the cost function in a more general network topology as well as in a given simple topology.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.18 no.4
• /
• pp.694-699
• /
• 2017

In accordance with the development of information and communications technology, a network user has to be able to use quality of service (QoS)-based multimedia services easily. Thus, information and communications operators began to focus on a technique for providing multimedia services. The IP Multimedia Subsystem (IMS) is a platform based on Internet Protocol (IP) as a technology for providing multimedia services and application services. The emerging 5G networks are described as having massive capacity and connectivity, adaptability, seamless heterogeneity, and great flexibility. The explosive growth in network services and devices for 5G will cause excessive traffic loads. In this paper, software-defined networking (SDN) is applied as a kind of virtualization technology for the network in order to minimize the traffic load, and Simple Network Management Protocol (SNMP) is used to provide more efficient network management. To accomplish these purposes, we suggest the design of a dynamic routing algorithm to be utilized in the IMS network using SDN and an SNMP private management information base (MIB). The proposal in this paper gives information and communications operators the ability to supply more efficient network resources.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.1
• /
• pp.34-45
• /
• 2013

Recently, world-wide research activities on new network architectures and protocols are being actively progressed. Furthermore, research activities on testbed and related technologies for supporting those activities are being actively performed. In domestic study, research on the OpenFlow protocol based future Internet testbed implementation and research on its virtualization for supporting independent research experiments are being performed at the same time. The network virtualization is a technology which maximizes the testbed utilization without interfering each other for the individual research when many researchers share the testbed. In this paper, we implemented a Enhanced FlowVisor by extending basic FlowVisor by adding QoS functions which are admission control and minimum bandwidth guarantee. On the testbed, we performed a real-time video streaming experiment for verifying the performance of the Enhnaced FlowVisor on the OpenFlow protocol based future internet testbed. The result shows that the Enhanced FlowVisor can provide reliable and stable QoS to the individual researches without disturbing each other traffic on virtualized networks of the future Internet testbed.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.18 no.6
• /
• pp.1081-1086
• /
• 2023

The rapid growth and increasing complexity of modern networks have highlighted the limitations of traditional network architectures. The emergence of SDN (Software-Defined Network) in response to these challenges has changed the existing network environment. The SDN separates the control unit and the data unit, and adjusts the network operation using a centralized controller. However, this structure has also recently caused a huge amount of traffic due to the rapid spread of numerous Internet of Things (IoT) devices, which has not only slowed the transmission speed of the network but also made it difficult to ensure quality of service (QoS). Therefore, this paper proposes a method of load distribution by switching the IP and any server (processor) from the existing data processing scheduling technique, RR (Round-Robin), to mapping when a large amount of data flows in from a specific IP, that is, server overload and data loss.

• The Journal of Korean Institute of Next Generation Computing
• /
• v.13 no.6
• /
• pp.7-20
• /
• 2017

The advancement of cloud and big data and the considerable growth of traffic have increased the complexity and problems in the management inefficiency of existing networks. The software-defined networking (SDN) environment has been developed to solve this problem. SDN enables us to control network equipment through programming by separating the transmission and control functions of the equipment. Accordingly, several studies have been conducted to improve the performance of SDN controllers, such as the method of connecting existing legacy equipment with SDN, the packet management method for efficient data communication, and the method of distributing controller load in a centralized architecture. However, there is insufficient research on the control of SDN in terms of the quality of network-using applications. To support the establishment and change of the routing paths that meet the required network service quality, we require a mechanism to identify network requirements based on a contract for application network service quality and to collect information about the current network status and identify the violations of network service quality. This study proposes a method of identifying the quality violations of network paths through ontology to ensure the network service quality of applications and provide efficient services in an SDN environment.

• Journal of Internet Computing and Services
• /
• v.3 no.3
• /
• pp.67-74
• /
• 2002

Asynchronous transfer mode (ATM) can be efficiently used to transport packet data services. The switching system will support voice and packet data services simultaneously from end to end applications. To guarantee quality of service (QoS) of the offered services, source rate to send packet data is needed to control the network overload condition. Most existing control algorithms are shown to provide the threshold-based feedback control technique. However, real-time voice calls can be dynamically connected and released during data services in the network. If the feedback control information delays, quality of the serviced voice can be degraded due to a time delay between source and destination in the high speed link, An adaptive algorithm based on the optimal least mean square error technique is presented for the predictive feedback control technique. The algorithm attempts to predict a future buffer size from weight (slope) adaptation of unknown functions, which are used for feedback control. Simulation results are presented, which show the effectiveness of the algorithm.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.1
• /
• pp.85-94
• /
• 2002

EMRCA(Explicit Max_min Rate Control Algorithm) switch, which has been proposed in the ATM(Asychronous Transfer Mode) standard, controls the ABR(Available Bit Rate) service traffic in the ATM networks. The ABR service class of ATM networks uses a feedback control mechanism to adapt to varying link capacities. The VS/VD(Virtual Source/Virtual Destination) technique offers the possibility to segment the otherwise end-to-end ABR control loop into separate loops. The improved feedback delay and the control of ABR traffic inside closed segments provide a better performance and QoS(Quality of Service) for ABR connections with respect to throughput, delay, and jitter. This paper is study of an ABR VS/VD flow control method. Linear control theory offers the means to derive correct choices of parameters and to assess performance issues, like stability of the system, during the design phase. The performance goals are a high link utilization, fair bandwidth distribution and robust operation in various environments, which are verified by discrete event simulations. The major contribution of this work is the use of linear control theory to model and design an ABR flow control method tailored for the special layout of a VS/VD switch, the simulation shows that this techniques better than conventional method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.1B
• /
• pp.53-60
• /
• 2007

We investigate the end-to-end delay bounds in large scale networks with Differentiated services (DiffServ) architecture. It is generally understood that networks with DiffServ architectures, where packets are treated according to the class they belong, can guarantee the end-to-end delay for packets of the highest priority class, only in lightly utilized cases. We focus on tree networks, which are defined to be acyclic connected graphs. We obtain a closed formula for delay bounds for such networks. We show that, in tree networks, the delay bounds exist regardless of the level of network utilization. These bounds are quadratically proportional to the maximum hop counts in heavily utilized networks; and are linearly proportional to the maximum hop counts in lightly utilized networks. Considering that tree networks, especially the Ethernet networks are being accepted more and more for access networks as well as provider networks, we argue that based on these delay bounds DiffServ architecture is able to support real time applications even for a large network. Throughout the paper we use Latency-Rate (LR) server model, with which it has proven that FIFO and Strict Priority are LR servers to each flows in certain conditions.