• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2003.05a
• /
• pp.8-13
• /
• 2003

Historically, IP-based internets have been able to provide a simple best-effort delivery service to all applications they carry. Best effort treats all packets equally, with no service level, packet loss, and delay. But the needs of users have changed. The want to use the new real-time, multimedia, and multicasting applications. Thus, there is a strong need to be able to support a variety of traffic with a variety of quality-of-service requirements. The DiffServ architecture, proposed by the Internet Engineering Task Force(IETF), has become the most viable solution for provising QoS over IP networks. The DiffServ architecture does not specify any handling method between AF out-profile packets and BE packets. This paper propose a mechanism for supporting inter class fairness in the DiffServ architecture. Ⅰ proposed a modified Weighted Round Robin method to protect the BE traffic from AF out-profile packets in the core routers. The proposed technique is evaluated through simulation. Simulation results indicate that the proposed method provides better protection not only for BE packets from AF out-profile packets, but also for the AF in-profile packets in congested networks.

• Journal of KIISE:Information Networking
• /
• v.29 no.1
• /
• pp.1-14
• /
• 2002

The most important issue in providing multimedia traffic on a mobile computing environments is to guarantee the mobile host(client) with consistent QoS(Quality of Service). However, the QoS negotiated between the client and network in one cell may not be honored due to client mobility, causing hand-offs between cells. In this paper, a call admission control mechanism is proposed to provide consistent QoS guarantees for multimedia traffics in a mobile computing environment. Each cell can reserve fractional bandwidths for hand-off calls to its adjacent cells. It is important to determine the right amount of reserved bandwidth for hand-off calls because the blocking probability of new calls may increase if the amount of reserved bandwidth is more than necessary. An adaptive bandwidth reservation based on an MPP(Mobility Pattern Profile) and a 2-tier cell structure has been proposed to determine the amount of bandwidth to be reserved in the cell and to control dynamically its amount based on its network condition. We also propose a call admission control based on this bandwidth reservation and "next-cell prediction" scheme using an MPP. In order to evaluate the performance of our call admission control mechanism, we measure the metrics such as the blocking probability of our call admission control mechanism, we measure the metrics such as the blocking probability of new calls, dropping probability of hand-off calls, and bandwidth utilization. The simulation results show that the performance of our mechanism is superior to that of the existing mechanisms such as NR-CAT1, FR-CAT1, and AR-CAT1.

• Convergence Security Journal
• /
• v.8 no.4
• /
• pp.105-113
• /
• 2008

Mobile computing environment is known to be quite difficult to provide user with a stable Quality of Service (QoS) due to vehicle mobility nature. In order to protect the inherent characteristics of wireless network such as low bandwidth and high transmission delay along with the vehicle's mobility, many works are conducted to apply caching and prefetching methods. This paper presents a novel prefetching technique which is based on owner's profile. It is the scheme with the vehicle velocity, the visit frequency and resident time of specific region for vehicle owner's past given period, and the user profile which has owner's personal inclination about a certain place. The proposed scheme shown relatively superior performance in terms of the utilization ratio of prefetched information and the failure ratio of information retrieval than the previous methods.

• Journal of information and communication convergence engineering
• /
• v.9 no.5
• /
• pp.539-544
• /
• 2011

In this paper, a parameter optimization method of RIO-DC (RED (Random Early Detection) with In and Out-De-Coupled Queues) scheme for Assured Service (AS) in Differentiated Services (DiffServ) is proposed. In order to optimize QoS (Quality of Service) performance of the RIO-DC policy for AS in terms of maximum tolerable latency, link utilization, fairness, etc., we should design router nodes with proper RIO-DC operating parameter values. Therefore, we propose a RIO-DC configuration method and the admission control criterion, considering the allocated bandwidth to each subclass and the corresponding buffer size, to increase throughput for In-profile traffic and link utilization. Simulation results show that RIO-DC with the proposed parameter values guarantees QoS performance comparable with the RIO scheme and it improves fairness between AS flows remarkably.

• Journal of Communications and Networks
• /
• v.4 no.3
• /
• pp.230-245
• /
• 2002

Usually the network-throughput maximization problem for constant-bit-rate (CBR) circuit-switched traffic is posed for a fixed offered load profile. Then choices of routes and of admission control policies are sought to achieve maximum throughput (usually under QoS constraints). However, similarly to the notion of channel “capacity,” it is also of interest to determine the “network capacity;” i.e., for a given network we would like to know the maximum throughput it can deliver (again subject to specified QoS constraints) if the appropriate traffic load is supplied. Thus, in addition to determining routes and admission controls, we would like to specify the vector of offered loads between each source/destination pair that “achieves capacity.” Since the combined problem of choosing all three parameters (i.e., offered load, admission control, and routing) is too complex to address, we consider here only the optimal determination of offered load for given routing and admission control policies. We provide an off-line algorithm, which is based on Lagrangian techniques that perform robustly in this rigorously formulated nonlinear optimization problem with nonlinear constraints. We demonstrate that significant improvement is obtained, as compared with simple uniform loading schemes, and that fairness mechanisms can be incorporated with little loss in overall throughput.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.4B
• /
• pp.255-269
• /
• 2006

The differentiated services(DiffServ) architecture provides packet level service differentiation through the simple and predefined Per-Hop Behaviors(PHBs). The Assured Forwarding(AF) PHB proposed as the assured services uses the RED-in/out(RIO) approach to ensusre the expected capacity specified by the service profile. However, the AF PHB fails to give good QoS and fairness to the TCP flows. This is because OUT(out- of-profile) packet droppings at the RIO buffer are unfair and sporadic during only network congestion while the TCP's congestion control algorithm works with a different round trip time(RTT). In this paper, we propose an Adaptive Regulating Drop(ARD) marker, as a novel dropping strategy at the ingressive edge router, to improve TCP fairness in assured services without a decrease in the link utilization. To drop packets pertinently, the ARD marker adaptively changes a Temporary Permitted Rate(TPR) for aggregate TCP flows. To reduce the excessive use of greedy TCP flows by notifying droppings of their IN packets constantly to them without a decrease in the link utilization, according to the TPR, the ARD marker performs random early fair remarking and dropping of their excessive IN packets at the aggregate flow level. Thus, the throughput of a TCP flow no more depends on only the sporadic and unfair OUT packet droppings at the RIO buffer in the core router. Then, the ARD marker regulates the packet transmission rate of each TCP flow to the contract rate by increasing TCP fairness, without a decrease in the link utilization.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.7
• /
• pp.2257-2285
• /
• 2022

Cyber-physical systems (CPS) have been growing exponentially due to improved cloud-datacenter infrastructure-as-a-service (CDIaaS). Incremental expandability (scalability), Quality of Service (QoS) performance, and reliability are currently the automation focus on healthy Tier 4 CDIaaS. However, stable QoS is yet to be fully addressed in Cyber-physical data centers (CP-DCS). Also, balanced agility and flexibility for the application workloads need urgent attention. There is a need for a resilient and fault-tolerance scheme in terms of CPS routing service including Pod cluster reliability analytics that meets QoS requirements. Motivated by these concerns, our contributions are fourfold. First, a Distributed Non-Recursive Cloud Model (DNRCM) is proposed to support cyber-physical workloads for remote lab activities. Second, an efficient QoS stability model with Routh-Hurwitz criteria is established. Third, an evaluation of the CDIaaS DCN topology is validated for handling large-scale, traffic workloads. Network Function Virtualization (NFV) with Floodlight SDN controllers was adopted for the implementation of DNRCM with embedded rule-base in Open vSwitch engines. Fourth, QoS evaluation is carried out experimentally. Considering the non-recursive queuing delays with SDN isolation (logical), a lower queuing delay (19.65%) is observed. Without logical isolation, the average queuing delay is 80.34%. Without logical resource isolation, the fault tolerance yields 33.55%, while with logical isolation, it yields 66.44%. In terms of throughput, DNRCM, recursive BCube, and DCell offered 38.30%, 36.37%, and 25.53% respectively. Similarly, the DNRCM had an improved incremental scalability profile of 40.00%, while BCube and Recursive DCell had 33.33%, and 26.67% respectively. In terms of service availability, the DNRCM offered 52.10% compared with recursive BCube and DCell which yielded 34.72% and 13.18% respectively. The average delays obtained for DNRCM, recursive BCube, and DCell are 32.81%, 33.44%, and 33.75% respectively. Finally, workload utilization for DNRCM, recursive BCube, and DCell yielded 50.28%, 27.93%, and 21.79% respectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.4C
• /
• pp.342-352
• /
• 2002

In this paper, we compare the performances of RIO and RIO-DC buffer management schemes for DiffServ AF PHB standardized in IETF. For the comparison, we relatively differentiate maximum delay for each Assured Service subclass in Differentiated Services by allocating bandwidth to each subclass differently. In addition, we set the values of RIO and RIO-DC parameters considering the buffer size determined by the network topology and the ratio of bandwidth allocated to each subclass. In this simulation environment, the performances of RIO and RIO-DC schemes are analyzed focusing on the throughput of the In-profile traffic, the link utilization and the fairness. Simulation results show that the performance of RIO-DC scheme is comparable to that of RIO scheme with regard to the throughput of the In-profile traffic and the link utilization. However, under the simulation condition RIO-DC scheme improves the fairness between flows much better than RIO scheme.

• Journal of KIISE:Information Networking
• /
• v.35 no.1
• /
• pp.11-20
• /
• 2008

An inevitable trend in the next generation wireless network environments is coexistence of different wireless access networks in a complementary, manner. In addition, mobile devices equipped with multiple air interfaces simultaneously executing diverse applications have been emerging, In such network environment, It is required that a solution for mobile users to seamlessly roam between different access networks as well as to satisfy QoS requirements of each application by efficiently utilizing coexisting various wireless access networks. In this paper, therefore, we propose a mobility management platform based on per-application end-to-end mobility management and cross-layer handover controls. Four core functional modules composing the proposed platform for end user devices are defined: Monitoring Agents, Profile Database, Decision Engine, and IP Agent. We show through simulations that the presented platform provides an improved QoS as it selectively utilizes the best available networks.

• Proceedings of the Korea Institute of Convergence Signal Processing
• /
• 2001.06a
• /
• pp.21-24
• /
• 2001

For very large multimedia traffic to be supported successfully in wireless network environment, it is necessary to provide Quality-of-Service(QoS) guarantees between mobile hosts(clients). In order to guarantee the Qos, we have to keep the call blocking probability below target value during handoff session. However, the QoS negotiated between the client and the network may not be guaranteed due to lack of available channels for traffic in the new cell, since mobile clients should be able to continue their on-going sessions. In this paper we propose a efficient load-balancing algorithm based on the adaptive bandwidth reservation scheme for enlarging available channels in a cell. We design a new method to predict the mobility of clients using MPT(mobility profile table). This method is then used to reserve a part of bandwidths for handoff calls to its adjacent cells and this reserved bandwidth can be used for handoff call prior to new connection requests. If the number of free channels is also under a low threshold value, our scheme use a load-balancing algorithm with a adaptive bandwidth reservation. In order to evaluate the performance of our algorithm, we measure the metrics such as the blocking probability of new calls and dropping probability of handoff calls, and compare with other existing schemes.