• Convergence Security Journal
• /
• v.7 no.2
• /
• pp.17-25
• /
• 2007

In this paper, an algorithm that provisions proportional differentiation of packet delays is proposed with an objective for enhancing quality of service (QoS) in future packet networks. It features an adaptive scheme that adjusts the target delay every time slot to compensate the deviation from the target delay which is caused by the prediction error on the traffic to be arrived in the next time slot. It predicts the traffic to be arrived at the beginning of a time slot and measures the actual arrived traffic at the end of the time slot. The difference between them is utilized to the delay control operation for the next time slot to offset it. As it compensates the prediction error continuously, it shows superior adaptability to the bursty traffic as well as the exponential rate traffic. It is demonstrated through simulations that the algorithm meets the quantitative delay bounds and shows superiority to the traffic fluctuation in comparison with the conventional non-adaptive mechanism. The algorithm is implemented with VHDL on a Xilinx Spartan XC3S1500 FPGA and the performance is verified under the test board based on the XPC860P CPU.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.4
• /
• pp.1147-1161
• /
• 2023

The Internet of Things (IoT) requires a new processing model that will allow scalability in cloud computing while reducing time delay caused by data transmission within a network. Such a model can be achieved by using resources that are closer to the user, i.e., by relying on edge computing (EC). The amount of IoT data also grows with an increase in the number of IoT devices. However, building such a flexible model within a heterogeneous environment is difficult in terms of resources. Moreover, the increasing demand for IoT services necessitates shortening time delay and response time by achieving effective load balancing. IoT devices are expected to generate huge amounts of data within a short amount of time. They will be dynamically deployed, and IoT services will be provided to EC devices or cloud servers to minimize resource costs while meeting the latency and quality of service (QoS) constraints of IoT applications when IoT devices are at the endpoint. EC is an emerging solution to the data processing problem in IoT. In this study, we improve the load balancing process and distribute resources fairly to tasks, which, in turn, will improve QoS in cloud and reduce processing time, and consequently, response time.

• Journal of KIISE
• /
• v.43 no.3
• /
• pp.327-335
• /
• 2016

In this paper, we propose a buffer management scheme suitable for interactive multimedia services. We consider a typical delay optimization environment so that receiver buffer lengths vary according to the round trip time estimation. In this environment, we propose an optimization technique for minimizing the loss of information that may occur when a reduced buffer length forces I/P/B frames in the buffer to drop. We modeled our problem as a Knapsack Problem for which we used dynamic programing in order to find an approximate solution. The proposed technique is compared with the existing buffer management techniques. Through simulation studies, we found that our approach could increase PSNR, which is important to video quality.

• The KIPS Transactions:PartC
• /
• v.12C no.2 s.98
• /
• pp.217-222
• /
• 2005

The IEEE 802.11 based wireless local area networks are candidates to lead the broadband connectivity in the home and office scenarios. Recently IEEE proposed the 802.11e as a new standard to provide appropriate Quality of Services to a plethora of emerging real-time multimedia and high demanding applications such as high definition movie and audio distribution, video-conference and voice over IP. This paper studies the IEEE 802.11e/IEEE 802.11b interactions focusing on potential unfairness problems that might appear in networks with heterogeneous wireless LAN technologies as well as in the IEEE 802.11e deployment phase.

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

In this paper, a scheduling algorithm is proposed for military satellite networks to improve QoS(Quality of Service) based on WDRR(Weighted Deficit Round Robin) method. When the packet size that has been queued to be larger, the proposed scheme DWDRR(Dynamic WDRR) method give appropriate additional quantum using EWMA(Exponentially Weighted Moving Average). To demonstrate an usefulness of proposed algorithm using OPNET modeler that built the simulation environment, reliability and real-time availability of the proposed algorithm is analyzed. The simulation results show an availability of proposed scheme in terms of reduce queuing delay and packet drop rate compared and analyzed the existing algorithms WRR(Weighted Round Robin), DRR(Deficit Round Robin) and WDRR with DWDRR.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.8
• /
• pp.2774-2796
• /
• 2015

Quality-of-service (QoS) provisioning for a cognitive mesh network (CMN) with heterogeneous services has become a challenging area of research in recent days. Considering both real-time (RT) and non-real-time (NRT) traffic in a multihop CMN, [1] studied cross-layer resource management, including joint access control, route selection, and resource allocation. Due to the complexity of the formulated resource allocation problems, which are mixed-integer non-linear programming, a low-complexity yet efficient algorithm was proposed there to approximately solve the formulated optimization problems. In contrast, in this work, we present an application of genetic algorithm (GA) to re-address the hard resource allocation problems studied in [1]. Novel initialization, selection, crossover, and mutation operations are designed such that solutions with enough randomness can be generated and converge with as less number of attempts as possible, thus improving the efficiency of the algorithm effectively. Simulation results show the effectiveness of the newly proposed GA-based algorithm. Furthermore, by comparing the performance of the newly proposed algorithm with the one proposed in [1], more insights have been obtained in terms of the tradeoff among QoS provisioning for RT traffic, throughput maximization for NRT traffic, and time complexity of an algorithm for resource allocation in a multihop network such as CMN.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.1B
• /
• pp.64-72
• /
• 2004

Multiprotocol Label Switching (MPLS) has been developed as a key technology to enhance the reliability, manageability and overall quality of service of core If networks with connection-oriented tunnel LSP and traffic engineering such as constraint-based routing, explicit routing, and restoration. In this paper, we propose a control bandwidth borrowing scheme that maximizes the utilization of tunnel LSPs or physical links by an extension to the RSVP-TE label distribution protocol. MPLS-based core switching network and VPN services rely on the establishment of connection-oriented tunneled LSPs that are configured or predefined by network management systems. The mechanism of network management system varies from (i) a relatively static LSP establishment accounting, to (ii) a dynamic QoS routing mechanisms. With the use of hierarchical LSPs, the extra bandwidth that is unused by the trunk (outer) LSPs should be fully allocated to their constituent end-to-end user traffic (inner) LSPs in order to maximize their utilization. In order to find out the unused extra bandwidth in tunnel LSP or physical link and redistribute these resources to constituent LSPs, we expend the functionality of RSVP-TE and the found unused extra bandwidth is redistributed with a weight-based recursive redistribution scheme. By the extended RSVP-TE and proposed recursive redistributed scheme, we could achieve the instantaneous maximized utilization of tunnel LSP or physical link suffering from the potential under-utilization problem and guarantee the end-to-end QoS requirements. With the proposed scheme, network manager can manage more effectively the extra available bandwidth of hierarchical LSPs and maximize the instantaneous utilization of the tunneled LSP resources.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.11B
• /
• pp.1016-1022
• /
• 2003

The EPON has been actively studied as one of the access networks for the economic configuration of FTTH. The EPON must support the dynamic bandwidth allocation to the subscribers in order to support the QoS due to its base on Ethernet technology EFM SG, which is actively working for the standardization of EPON, also recently decided to select DBA. Therefore in this paper, we designed a ONU buffer scheduling algorithm(AIWFQ) and a scheme of DBA(Class-based FCFS) for the OLT suitable for embodying MPCP of the EPON. In this paper, we proposed methods that the EPON system can make use of by measuring end to end process delay time and the buffer size in order to implement the algorithm by using the OPNET.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.2B
• /
• pp.272-278
• /
• 2004

The EPON has been actively studied as one of the access networks for the economic configuration of FTTH. The EPON must support the dynamic bandwidth allocation to the subscribers in order to support the QoS due to its base on Ethernet technology. EFM SG, which is actively working for the standardization of EPON, also recently decided to select DBA. Therefore in this paper, we designed a ONU buffer scheduling algorithm (AIWFQ) and a scheme of DBA(Class-based FCFS) for the OLT suitable for embodying MPCP of the EPON. In this paper, we proposed methods that the EPON system can make use of by measuring end to end process delay time and the buffer size in order to implement the algorithm by using the OPNET.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2013.11a
• /
• pp.20-23
• /
• 2013

Recently for the transfer of large size video file between sites for high-definition craft editing used by broadcasting company the Public Network is used a lot. In the IP Public Network with QoS(Quality-of-Service) not guaranteed, degradation of performance has several causes. In this paper, we have analyzed the causes of low performance to transfer a large size HD video file in long distance, in order to maximize the effectiveness, the high efficiency network could be implemented enabling the highspeed of HD video file using the connection with networks between hosts through packet creation and multi-session of Parallel TCP. We survey the result of high speed transfer system and verify the efficient transfer method using Public IP Network for large HD video file transfer in broadcasting cooperation.