• Communications for Statistical Applications and Methods
• /
• v.16 no.4
• /
• pp.595-603
• /
• 2009

Typically the standard optimal allocation method distributes the sample for each stratum considering survey cost. In case of varying survey cost for each survey unit, we need to consider more practical allocation method. In other words, according to characteristics of an individual unit, we consider the optimal dynamic allocation method which first selects the survey unit having maximum value of benefit cost ratio. In terms of this, the proposed allocation method is different from standard optimal allocation method which allocate samples for each stratum and selects the random sample according to each size of sample. This paper is considered the dynamic optimal allocation method for the stratified randomized response technique which surveys for sensitive characteristic of survey units such as drug abuse, abortion, alcoholic. We prove the practical usefulness of proposed method using the numerical example.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.7B
• /
• pp.1001-1008
• /
• 2010

In this paper, we propose the dynamic spectrum allocation (DSA) algorithm using spectrum sharing method considering the long-term priority between NOs and service classes for the maritime communication system environment where a ship locates at either near shore (or land) or off-shore. It was shown that the proposed algorithm using spectrum sharing with priorities could deliver better satisfaction ratio (SR) than the fixed allocation schemes, in the context of provision of required bandwidth (or spectrum) for each users. Therefore, we conclude that the proposed DSA with priorities could apply to the maritime communication environment and exploit the under-used (or unused, idle) spectrum of terrestrial communication networks.

• Journal of Internet Computing and Services
• /
• v.8 no.4
• /
• pp.41-49
• /
• 2007

Ethernet passive optical network(EPON) is the next-generation technology for supporting services of high-quality at low-cost. In the EPON, all optical network units(ONUs) have to share a limited uplink channel for upstream data. In order to satisfy bandwidth demands of users on high-capacity local access networks(LANs), the optical line terminal(OLT) efficiently divides and allocates time slots of uplink channel to all ONUs. We discuss previous schemes for dynamic bandwidth allocation(DBA), such as interleaved polling with adaptive cycle time(IPACT) and sliding cycle time(SLICT). In this paper, dynamic right sizing of maximum-windows(DRSM), as a novel bandwidth allocation service, is proposed for more effective and efficient time slot allocation of the uplink channel. DRSM which is based on past information of bandwidth allocated by OLT calculates maximum available bandwidth and dynamically alters the maximum window size for the next ONU. This scheme does not only exert every effort to meet bandwidth demands of ONUs with the possible scope, it also seeks fairness of bandwidth allocation among ONUs.

• Journal of the Korea Safety Management & Science
• /
• v.2 no.4
• /
• pp.165-176
• /
• 2000

Broadband networks are designed to support a wide variety of services with different traffic characteristics and demands for Quality of Services. Bandwidth allocation methods can be classified into two major categories： static and dynamic. In static allocation, bandwidth is allocated only at call setup time and the allocated bandwidth is maintained during a session. In dynamic allocation, the allocated bandwidth is negotiated during a session. The purpose of this paper is to develop policies for deciding and for adjusting the amount of bandwidth requested for a best effort connection over such as ATM networks.. This method is to develop such policies that a good trade off between utilization and latency using cell delay variation to the forecast the incoming traffic in the next period. The performances of the different polices are compared by simulations.

• Proceedings of the Safety Management and Science Conference
• /
• 2000.11a
• /
• pp.131-134
• /
• 2000

Broadband networks are designed to support a wide variety of services with different traffic characteristics and demands for Quality of Services. Bandwidth allocation methods can be classified into two major categories: static and dynamic. In static allocation, bandwidth is allocated only at call setup time and the allocated bandwidth is maintained during a session. In dynamic allocation, the allocated bandwidth is negotiated during a session. The purpose of this paper is to develop policies for deciding and for adjusting the amount of bandwidth requested for a best effort connection over such as ATM networks. This method is to develop such policies that a good trade off between utilization and latency using cell delay variation to the forecast the incoming traffic in the next period. The performances of the different polices are compared by simulations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.10A
• /
• pp.746-751
• /
• 2009

We propose a dynamic time allocation method in cooperative multiplexing with partial relaying system. This method uses a linear programming and considers protocol that is based on relaying of partial information bits followed by cooperative multiplexing. In this protocol, regardless of the location of relay, the allocation time for each transmission time slots are constant. Using a dynamic time allocation method with considering the location of relay, we can find optimal transmission time slots, and show that the system capacity is optimized.

• Journal of Communications and Networks
• /
• v.15 no.2
• /
• pp.222-227
• /
• 2013

This paper presents an analytical framework for dynamic spectrum allocation in cognitive radio networks. We propose a distributed queuing based Markovian model each for single channel and multiple channels access for a contending user. Knowledge about spectrum mobility is one of the most challenging problems in both these setups. To solve this, we consider probabilistic channel availability in case of licensed channel detection for single channel allocation, while variable data rates are considered using channel aggregation technique in the multiple channel access model. These models are designed for a centralized architecture to enable dynamic spectrum allocation and are compared on the basis of access latency and service duration.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.17 no.2
• /
• pp.167-174
• /
• 2014

In this paper, we address a task allocation problem for a robot team that performs a search and attack mission. The robots are limited in sensing and communication capabilities, and carry different types of resources that are used to attack a target. The environment is uncertain and dynamic where no prior information about targets is given and dynamic events unpredictably happen. The goal of robot team is to collect total utilities as much as possible by destroying targets in a mission horizon. To solve the problem, we propose a distributed task allocation framework incorporated with effective resource management based on resource welfare. The framework we propose enables the robot team to retain more robots available by balancing resources among robots, and respond smoothly to dynamic events, which results in system performance improvement.

• 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 Korean Institute of Industrial Engineers
• /
• v.38 no.4
• /
• pp.258-261
• /
• 2012

In this paper, I propose a new asset allocation framework to cope with the dynamic nature of the financial market. The investment performance can be much improved by protecting the capital from the market crashes, and such crashes can be pre-identified with high probabilities by regime detection analysis via a specialized unsupervised machine learning technique.