• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.7
• /
• pp.1256-1271
• /
• 1994

In this paper a GFC protocol based on HMR(High-speed Multimedia Ring) with a dynamic quota allocation is proposed and the performance of proposed protocol is evaluated by simulation. The HMR a medium access protocol proposed for Gbit ATM-LAN, can be applied to the GFC protocol without any modification because it uses only 4 bits for medium access of several topologies such as bus, ring and stared-bus, and priority control for satisfaction of different QoS(Quality of Service) requirements. The quota allocation method of HMR called static quota allocation has a problem of excessive access delay for the traffic with high burstness. In this paper a dynamic quota allocation method which allocates quota to the nodes according to the queue length is proposed and the performance of HMR with dynamic quota allocation is evaluated by seven simulation scenarios of CCITT. The HMR with proposed method shows better shows better access delay characteristics than the HMR with static quota allocation. Also the simulation results show that access delay performance of HMR is better than that of ATMR proposed by Japan and is similar to that of DQDB proposed by Australia.

• Journal of KIISE:Information Networking
• /
• v.32 no.2
• /
• pp.156-166
• /
• 2005

Ethernet passive optical network is an economical and efficient access network that has received significant research attention in recent years. A MAC(Media Access Control) protocol of PON, the next generation access network, is based on TDMA(Time Division Multiple Access) basically. In this thesis, we addressed the problem of dynamic bandwidth allocation in QoS based Ethernet PONs. We augmented the bandwidth allocation to support QoS in a differentiated services framework. Our differentiated bandwidth guarantee allocation(DBGA) allocates effectively and fairly bandwidths among end users. Moreover, we showed that DBGA that perform weighted bandwidth allocation for high priority packets result in better performance in terms of average and maximum packet delay, as well as network throughput compared with existing dynamic bandwidth allocations. We used simulation experiments to study the performance and validate the effectiveness of the proposed bandwidth allocations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.11
• /
• pp.5209-5228
• /
• 2016

Device-to-device (D2D) communication underlaying cellular networks can bring significate benefits for improving the performance of mobile services. However, it hinges on elaborate resource sharing scheme to coordinate interference between cellular users and D2D pairs. We formulate a joint mode selection, link allocation and power control optimization problem for D2D communication sharing uplink resources in a multi-user cellular network and consider the efficiency and the fairness simultaneously. Due to the non-convex difficulty, we propose a three-step scheme: firstly, we conduct mode selection for D2D pairs based on a minimum distance metric after an admission control and obtain some cellular candidates for them. And then, a cellular candidate will be paired to each D2D pair based on fairness. Finally, we use Lagrangian Algorithm to formulate a joint power control strategy for D2D pairs and their reused cellular users and a closed-form of solution is derived. Simulation results demonstrate that our proposed algorithms converge in a short time. Moreover, both the sum rate of D2D pairs and the energy efficiency of cellular users are improved.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.28 no.4
• /
• pp.1-19
• /
• 2003

This paper studies power and rate control for data users on the forward link of CDMA system with two cells. The QoS for data users is specified by delay and error rate constraints as well as a family of utility functions representing system throughput and fairness among data users. Optimal power and rate allocation problem is mathematically formulated as a nonlinear programming problem, which is to maximize total utility under delay and error rate constraints, and optimal power and rate allocation scheme (OPRAS) is proposed to obtain a good solution in a fast time. Computational experiments show that the proposed scheme OPRAS works very well and increases total utility compared to the separate power and rate allocation scheme (SPARS) which considers each cell individually.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.74.1-74
• /
• 2001

In this paper, we deal with an allocation model of vertical type container yard for minimizing the total ATC work time and the equivalence of ATC work´s load in each block on automated container terminal. Firstly, a layout of automated container terminal yard is shown. The characteristic of equipment which is operated in the terminal and basic assumption are given. Next, an allocation model which concerns with minimizing the total work time and the equivalence of work´s load is proposed for the effectiveness of ATC work in automated container terminal. Also, a weight values on critical function are suggested to adjust the critical values by evaluating the obtained allocation plan. To find the solution of allocation model in given terminal yard situation, a GA is applied, where the real information of container is used ...

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.4
• /
• pp.1255-1262
• /
• 2000

This paper proposes a hardware allocation and binding algorithm for ASIC Design. The proposed algorithm works on schedules input graph and simultaneously allocates and binds functional units, interconnections and registers by considering interdependency between operations and storage elements in each control step, in order to share registers and interconnections connected to functional units, as much as possible. Especially, he register allocation is executes the allocation optimal using graph coloring. This paper shows the effectiveness of the algorithm by comparing experiments to determine number of functional unit and register in advance or to separate executing allocation and binding of existing system.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1997.06a
• /
• pp.31-36
• /
• 1997

Bit allocation is a critical problem in video encoding such as MPEG. To improve the quality of the reconstructed sequence for a given bit rate, the assigned target bits for a group of pictures (GOP) must be allocated to each picture efficiently. In this paper, we derive a target bit allocation algorithm for more efficient rate control, by assuming that the average rate-distortion curve for an input source is logarithmic. This target bit allocation is based on Shannon's rate-distortion theory, which deals with the minimization of source distortion subject to a channel rate constraint. Simulation results show that the proposed target bit allocation algorithm provides better performance than the one in MPEG-2 Test Model 5 (TM5).

• Journal of Institute of Control, Robotics and Systems
• /
• v.20 no.12
• /
• pp.1246-1251
• /
• 2014

This article presents an optimum yaw moment distribution scheme for a vehicle with electronic stability control (ESC) and active rear steering (ARS). After computing the control yaw moment in the yaw moment controller, it should be distributed into tire forces, generated by ESC and ARS. In this paper, yaw moment distribution is formulated as an optimization problem. New objective function is proposed to tune the relative magnitudes of the tire forces. Weighed pseudo-inverse control allocation (WPCA) is adopted to solve the problem. To check the effectiveness of the proposed scheme, simulation is performed on a vehicle simulation package, CarSim. From the simulation, the proposed optimum yaw moment distribution scheme is shown to effective for vehicle stability control.

• Journal of Korean Society for Quality Management
• /
• v.28 no.3
• /
• pp.91-103
• /
• 2000

It is very important to rationally allocate manufacturing processes because customer's needs are being various, and product life cycle in the market Is being shortened. The process allocation is needed before making process control plan and is mostly being done by the field experience or intuition of machine operator, process engineer and/or maintenance technician. Therefore, a modified allocation method using the process variation is proposed. This paper presents the result of comparative studies between current method and the proposed one.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.140.3-140
• /
• 2001

This paper analyzes a blocking that is due to shared resource in multiprocessor system. A proposed analysis for shared resource suggests a scalable and amendable scheduling method about task allocation. An equation of shared resource blocking is proposed by a throughput at common bus and a ratio of throughput during time period, it is included a parameter of tasks scheduling. Using this equation, a new guideline for task allocation of multiprocessor is presented. Finally, in proposed system a model simulations for the proposed blocking model is given by a deterministic ratio of shared resource.