• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.12
• /
• pp.1-8
• /
• 2003

Scheduling technology is one of the most important elements required to support the Quality of service (QoS) in the Internet and a lot of scheduling algorithms have been developed. However, most of these algorithms ire not flexible to distribute the excess bandwidth. In order to provide flexibility for distributing the excess bandwidth, we proposed excess bandwidth fair queueing (EBFQ) algorithm with relatively low complexity. In this paper, we propose the new extension to this EBFQ algorithm for the hierarchical fair queueing system. This extension can be naturally applied to the existing hierarchical algorithm and simultaneously provide the same level of fairness. Through the simulation and analysis, we verify it.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.40 no.8
• /
• pp.619-630
• /
• 2003

We present a method of runtime configuration scheduling in reconfigurable SoC design. As a model of computation, we use a popular formal model of computation, hierarchical FSM (HFSM) with synchronous dataflow (SDF) model, in short, HFSM-SDF model. In reconfigurable SoC design with HFSM-SDF model, the problem of configuration scheduling becomes challenging due to the dynamic behavior of the system such as concurrent execution of state transitions (by AND relation), complex control flow (HFSM), and complex schedules of SDF actor firing. This makes it hard to hide configuration latency efficiently with compile-time static configuration scheduling. To resolve the problem, it is necessary to know the exact order of required configurations during runtime and to perform runtime configuration scheduling. To obtain the exact order of configurations, we exploit the inherent property of HFSM-SDF that the execution order of SDF actors can be determined before executing the state transition of top FSM. After obtaining the order information and storing it in the ready configuration queue (ready CQ), we execute the state transition. During the execution, whenever there is FPGA resource available, a new configuration is selected from the ready CQ and fetched by the runtime configuration scheduler. We applied the method to an MPEG4 decoder and IS95 design and obtained up to 21.8% improvement in system runtime with a negligible overhead of memory usage.

• Journal of Korea Multimedia Society
• /
• v.6 no.1
• /
• pp.105-113
• /
• 2003

In CDMA cellular system, inefficient Channel assignment for high-speed mobile host increase call blocking probability For it has been method proposed to guarantee QoS upon tn the speed of hierarchical cell that is allocated Queues and dedicated channels of high speed mobile host's speed. In this paper, We allocated the dedicated channel of high-speed handoff In FA (Foreign Agent), only if the receive signal strength of mobile host in current cell that there is low traffic in HA (Home Agent). also, we created new Circular queue LiFA (Limited Foreign Agent) for high-speed handoff call that signal strength is weak in certain FA, and had this High-speed handoff call to be ready for Life time to the new Circular queue LiFA. Thus improve the rate of the forced call termination.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.22 no.2
• /
• pp.134-141
• /
• 2008

This paper presents an innovative load management technique that can effectively lower the summer peak load by adjusting the aircondition loads through smoothe coordinations between utility companies and large customers. An intelligent hierarchical load management system composed of a Central Intelligent Load Management System(CIMS) and multiple Local Intelligent Management Systems(LIMS) is also proposed to implement the reposed technique. Upon receiving a load curtailment request from the utilities, CIMS issues tokens, which can be used by each LIMS as a right to turn on the airconditioner. CIMS creates and maintains a queue for fair allocation of the tokens among the LIMS demanding tokens. By adjusting the number tokens and queue management Policies, desired load factors can be achieved conveniently. The Markov Birth and Death Process and the Balance Equations are employed in estimating various queue performances. The proposed technique is tested using a summer load data of a large apartment complex and proved to be quite effective in load management while minimizing the customer inconveniences.

• ETRI Journal
• /
• v.26 no.4
• /
• pp.321-331
• /
• 2004

In this paper, we propose a new dynamic bandwidth allocation (DBA) algorithm for multimedia services over Ethernet PONs (passive optical networks). The proposed algorithm is composed of a low-level scheduler in the optical network unit (ONU) and a high-level scheduler in the optical line terminal (OLT). The hierarchical DBA algorithm can provide expansibility and efficient resource allocation in an Ethernet PON system in which the packet scheduler is separated from the queues. In the proposed DBA algorithm, the OLT allocates bandwidth to the ONUs in proportion to the weight associated with their class and queue length, while the ONU preferentially allocates its bandwidth to queues with a static priority order. The proposed algorithm provides an efficient resource utilization by reducing the unused remaining bandwidth caused by the variable length of the packets. We also define the service classes and present control message formats conforming to the multi-point control protocol (MPCP) over an Ethernet PON. In order to evaluate the performance, we designed an Ethernet PON system on the basis of IEEE 802.3ah "Ethernet in the first mile" (EFM) using OPNET and carried out simulations. The results are analyzed in terms of the channel utilization, queuing delay, and ratio of the unused remaining bandwidth.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1994.10a
• /
• pp.670-675
• /
• 1994

Yhis paper describes a fault diagnosis simulation of the Real-Time Multiple Fault Dignosis System (RTMFDS) for forcasting faults in a system and deciding current machine state from signal information. Comparing with other diagnosis system for single fault,the system developed deals with multiple fault diagnosis,comprising two main parts. One is a remotesignal generating and transimission terminal and the other is a host system for fault diagnosis. Signal generator generate the random fault signal and the image information, and send this information to host. Host consists of various modules and agents such as Signal Processing Module(SPM) for sinal preprocessing, Performence Monotoring Module(PMM) for subsystem performance monitoring, Trigger Module(TM) for multi-triggering subsystem fault diagnosis, Subsystem Fault Diagnosis Agent(SFDA) for receiving trigger signal, formulating subsystem fault D\ulcornerB and initiating diagnosis, Fault Diagnosis Module(FDM) for simulating component fault with Hierarchical Artificial Neural Network (HANN), numerical models and Hofield network,Result Agent(RA) for receiving simulation result and sending to Treatment solver and Graphic Agent(GA). Each agent represents a separate process in UNIX operating system, information exchange and cooperation between agents was doen by IPC(Inter Process Communication : message queue, semaphore, signal, pipe). Numerical models are used to deseribe structure, function and behavior of total system, subsystems and their components. Hierarchical data structure for diagnosing the fault system is implemented by HANN. Signal generation and transmittion was performed on PC. As a host, SUN workstation with X-Windows(Motif)is used for graphic representation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.11B
• /
• pp.960-968
• /
• 2006

HMIPv6 improved the handover management of basic MIPv6 by introducing the new protocol agent MAP. In this new protocol, MAP instead of the Mobile Node intercepts all packets and redirects the packets to CoA of the Mobile Node. However, this process may degrade the network performance due to the centralization phenomenon of registration occurring in the hierarchical MAP structure. ffe propose two schemes to improve real time traffic performance. First proposal is a MAP selection mettled in which MAP is selected based on traffic characteristics. And we also propose differentiated traffic processing scheme with multi-level queues when Home Agent or Correspondent Nodes process Binding Update messages. Performances of the proposed scheme are analyzed. Analysis result shows that our model has good performance in the respect of location update cost and total cost of Mobile Nodes.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.10b
• /
• pp.1533-1536
• /
• 2001

This paper considers the TMN system for management of public ATM switching network which has the four-level hierarchical structure consisting of one network management system, a few element management system and several agent-ATM switch pairs, respectively. The effects of one TMN command on the local call processing performance of the component ATM switch an analyzed using Jackson's queueing model. The TMN command considered is the permanent virtual call connection, and the performance measures of ATM switch are the utilization, mean queue length and mean waiting time for the processor interfacing the subscriber lines and trunks directly, and the call setup delay of the ATM switch.

• ETRI Journal
• /
• v.24 no.5
• /
• pp.381-390
• /
• 2002

We analyze the performance of a telecommunications management network (TMN) system using models of networks of queues, Jackson's theorem, and simulation. TMN systems for managing public asynchronous transfer mode (ATM) networks generally have a four-level hierarchical structure consisting of a network management system, a few element management systems (EMSs), and several pairs of agents and ATM switches. We construct a Jackson's queuing network and present formulae to calculate its performance measures: distributions of queue lengths and waiting times, mean message response time, and maximum throughput. We perform a numerical analysis and a simulation analysis and compare the results.

• Proceedings of the KIEE Conference
• /
• 2007.04a
• /
• pp.17-19
• /
• 2007

This paper describe an interactive video object segmentation tool which can be used to generate MPEG-4 video object planes for multimedia broadcasting and enables content based functionalities. In order to apply these functionalities, each frame of video sequence should be represented in terms of video objects. Semiautomatic segmentation can be thought of as a user-assisted segmentation technique. A user can initially mark objects of interest around the real object boundaries. Then the user-guided and selected objects are continuously separated from the unselected areas though time evolution in the image sequences. We proposed method shows very promising result and this encourages the development of object based video editing system.