• Journal of The Korean Society of Agricultural Engineers
• /
• v.62 no.1
• /
• pp.29-38
• /
• 2020

Although educational facilities are important considerations from a social equity standpoint, the educational environment generally found in rural areas has been continuously deteriorated due to numerous social problems following birth rate declines and school abolition numbers. The purpose of this study is to evaluate the commuting accessibility changed by the abolition of elementary schools. The village-level accessibility is assessed following physical accessibility criteria based on legally defined commuting distances. Moreover, this study shows the implications of commuting accessibility by school district zones through comparing the minimum commuting distances with real commuting distance. The target area is the Gangwon state, the coverage area in which for schools is the widest in South Korea (44.1 ㎢/school). We evaluated the commuting distances to the nearest elementary school for 992 rural villages and 74 urban villages. Of the 1,066 villages in urban and rural areas evaluated, most of the villages (about 77%) are exposed to commutes to elementary schools were the marginal distance is over 1,000 meters. The annual rate of increase of commuting distance for 1,066 villages in Gangwon state has steadily increased by 2.8%p since 2000, average commuting distance from 2.8 km to 3.6 km. By the designation of the school districts, elementary school students have to go to a faraway school located within administrative district, even though there is a school nearby. It is expected that the results of this study will be made use of as basic data for the establishment of policies such as a reasonable basis for closing schools measurements considering the locally unique environment.

• The KIPS Transactions:PartC
• /
• v.9C no.6
• /
• pp.847-856
• /
• 2002

Cellular network applications are growing drastically and this requires a fast and efficient transport method between the base station and the mobile switching center. One possible solution is to use ATM links. The low data rate and small-sized packets in the typical cellular applications imply that significant amount of link bandwidth would be wasted, if this small sized packet is carried by one ATM cell. For efficient operation for such cellular and low bit rate applications, a new type of ATM Adaptation Layer, AAL Type 2, has been proposed. In this paper, the principles of AAL Type 2 are briefly described along with the introduction of other alternatives which have formed the basis for this new AAL. The result from the simulation to study the performance of the AAL Type 2 is discussed from the view point of packet delay and ATM cell use efficiency. Due to the variable size of packets in this application, the fairness issue in serving variable sized packets is also discussed along with the effect of fair queueing algorithm implemented at AAL Type 2.

• Journal of Satellite, Information and Communications
• /
• v.10 no.3
• /
• pp.53-56
• /
• 2015

In this paper, we want provide improved services with faster transmission, IEEE 802.11n was standardized. A-MPDU (Aggregation MAC Protocol Data UNIT) is a vital function of the IEEE 802.11n standard, which was proposed to improve transmission rate by reducing frame transmission overhead. In this paper, we show the problems of TCP retransmission with A-MPDU and propose a solution utilizing the property of TCP cumulative ACK. If the transmission of an MPDU subframe fails, A-MPDU mechanism allows selective re-transmission of failed MPDU subframe in the MAC layer. In TCP traffic transmission, however, a failed MPDU transmission causes TCP Duplicate ACK, which causes unnecessary TCP re-transmission. Furthermore, congestion control of TCP causes reduction in throughput. By supressing unnecessary duplicate ACKs the proposed mechanism reduces the overhead in transmitting redundant TCP ACKs, and transmitting only a HS-ACK with the highest sequence number. By using the RACK mechanism, through the simulation results, it was conrmed that the RACK mechanism increases up to 20% compared the conventional A-MPDU, at the same time, it tightly assures the fairness among TCP flows.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.11
• /
• pp.1177-1184
• /
• 2014

An wired ship area network has functionality of remote control and autonomous management of various sensors and instruments embedded or boarded in a ship. For such environment, the DiffServ (Differentiated Services) realizes that the high-speed real-time flow with the higher priority has the guaranteed minimum data rate and is delivered faster. As a result of this DiffServ effect, the intelligent Ship Area Networks can be implemented. In this paper, an packet drop technique is proposed to outperform the previous RIO (RED In and Out) drop mechanism for DiffServ in ship area networks. the proposed packet drop technique does not manage the individual flows and divides them into several flow groups according to a criterion. And it guarantees the fairness between individual flows in the same QoS class through the group-based control. In simulation results of the proposed packet drop technique, the link utilization decreases than RIO. But it guarantees more data rates to DiffServ flows passing multiple bottleneck links.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39A no.5
• /
• pp.280-292
• /
• 2014

Recently, heterogeneous networks consisting of small-cells on top of traditional macro-cellular network has attracted much attention, because traditional macro-cellular network is not suitable to support more demanding mobile data traffic due to its limitation of spatial reuse. However, due to the transmit power difference between macro- and small-cells, most users are associated with macro-cells rather than small-cells. To solve this problem, enhanced inter-cell interference coordination (eICIC) has been introduced. Particularly, in eICIC, the small-cell coverage is forcibly expanded to associate more users with small-cells. Then, to avoid cross-tier interference from macro-cells, these users are allowed to receive the data during almost blank subframe (ABS) in which macro-cells almost remain silent. However, this approach is not sufficient to balance the load between macro- and small-cells because it only expands the small-cell coverage. In this paper, we propose a load balance scheme improving proportional fairness for heterogeneous networks employing eICIC. In particular, the proposed scheme combines the greedy-based user association and the ABS rate determination in a recursive manner to perform the load balance.

• Journal of Korean Ophthalmic Optics Society
• /
• v.13 no.4
• /
• pp.25-30
• /
• 2008

Purpose: In this paper, we have analyzed the problems of the Oh's report which is used to the basic data for supply and demand of medical technicians and studied a proposal for improvement to control system and supply and demand of korean optometrists. Methods: We have analyzed errors of Oh's report including supply and demand for medical technicians and management policy, expecting number for future optician, inaccurate estimation by limited data (employment rate, retirement rate, mortality rate) and an incorrect method of measurement for future supply and demand. Results: Oh's report showed the 18% error for estimation of supply which exclude the irregular entrance students. The estimation of supply was calculated by graduation rate 62.6% (college and University of Technology are 78.9% and 85.98% respectively), employment rate 65.8% (the average employment between 2002 and 2007 is 73.96%) and retirement rate is 2.3% (the retirement of pharmacists is 1.3%) but it showed the significant differences to objective data. For estimate the suitable ratio of optometrists to the population, the ratio use of medical facilities by an age group was used, and suggested spectacle wearers 1,280 persons (populations 2,928 persons) per optometrist but the different from reference of Germany (4,706 persons), America (1,789 persons) and Korea (1,825 persons/an optometrist) are applied to estimation on supply. This report applied the low employment rate and argued that maintain the present situation, but claimed that utilize unemployment persons. The above result has induced double weighting effect on estimation of supply. Conclusions: To solve the related problems of supply and demand, we have to make a search for exact data and optimum application model, have to take an example of nation similar job category as Germany and the research result of the job satisfaction into consideration. After we get the integrated research result, we must carried out the policy with fairness and balance for the estimation of supply and demand. Therefore exact research is required prior to beginning policy establishment, government and related group have to make a clear long-term plan and permanent organization for medical technician to establish supply and demand of medical technician.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.1
• /
• pp.139-145
• /
• 2016

Dumbbell is the most basic topology that can be used in almost all kind of network experiment within it or just by little expansion. While Transmission Control Protocol TCP is the basic protocol that is used for the connectivity among networks and stations. TCP major and basic goal is to provide path and services to different applications for communication. For that reason TCP has to transfer a lot of data through a communication medium that cause serious congestion problem. To calculate the congestion problem, different kind of pre-cure solutions are developer which are Loss Based Variant and Delay Based Variant. While LBV keep track of the data that is going to be passed through TCP protocol, if the data packets start dropping that means congestion occurrence which notify as a symptom, TCP CUBIC use LBV for notifying the loss. Similarly the DBV work with the acknowledgment procedure that is used in when data ACK get late with respect to its set data rate time, TCP COMPOUND/VAGAS are examples of DBV. Many algorithms have been purposed to control the congestion in different TCP variants but the loss of data packets did not completely controlled. In this paper, the congestion control algorithms are implemented and corresponding results are analyzed in Dumbbell topology, it is typically used to analyze the TCP traffic flows. Fairness of throughput is evaluated for different TCP variants using network simulator (NS-2).

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.8
• /
• pp.1549-1560
• /
• 2009

In the TDMA PON system, the DBA is essential for ONUs to send data efficiently to the upstream. In this paper, we implement a DBA processor for the G-PON OLT with downstream and upstream rate, 2.5 and 1.25 Gbps, respectively, The processor collects bandwidth request messages from ONUs at every cycle time and allocates properly bandwidth to each Alloc-ID with considering priority and fairness for traffics. In the proposed DBA algorithm, one cycle time consists of multiple G-PON frames ($m{\times}125{\mu}s$) for high link efficiency. In particular, the link efficiency is higher because the algorithm adopts a method that an additional overhead is eliminated when an allocated bandwidth is laid between two G-PON frames for an ONU. This enables that the processor flexibly allocates the bandwidth from zero to the maximum link capacity for an ONU. The proposed DBA processor is implemented with the FPGA and shows bandwidth allocating processes for ONUs with logic analyzer.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.6 s.336
• /
• pp.41-52
• /
• 2005

In wireless networks there are various errors, caused by multi-path fading and interference between devices which lower the network Performance. Especially, performance of IEEE 802.IS.3 High-Rate WPAN (Wireless Personal Area Network) which is operated in ISM unlicensed frequency band is easily affected by channel errors. In this paper, we propose a scheduling algorithm which takes channel errors into consideration in scheduling asynchronous data traffic. The proposed scheduling algorithm can allocate CTA(Channel Time Allocation) proportionally in accordance with the requested channel time of each device. It also prevents waste of channel time by allocating CTA of the channel-error devices to other channel-error free devices. After recovering from the channel error, the devices are compensated as much as they conceded during channel error status. Simulation results show that the proposed scheduling algorithm is superior to the existing SRPT(Shortest Remain Processing Time) and RR(Round Robin) in throughput and fairness aspects.

• The KIPS Transactions:PartB
• /
• v.9B no.6
• /
• pp.835-844
• /
• 2002

The number of channels available to a video server is limited since the number of channels a video server can support is determined by its communication bandwidth. Several approaches such as batching, piggybacking and patching have been proposed to reduce I/O demand on the video server by sharing multicast data. Patching has been shown to be efficient in the matter of the cost for VOD systems. Unlike conventional multicast techniques, patching is a dynamic multicast scheme which enables a new request to join an ongoing multicast. In addition, true VOD can be achieved since a new request can be served immediately without having to wait for the next multicast. In this paper. we propose two types of channel reservation patching algorithm : a fixed channel reservation patching and a variable channel reservation patching. To immediately schedule the requests for popular videos, these algorithms reserve the channels of video server for the fixed number of popular videos or for the variable number of popular videos which is determined dynamically according to the load of video server. The performance of the proposed algorithms is evaluated through simulations, and compared with that of simple patching. Our performance measures are average defection rate, average latency, service fairness and the amount of buffered data according to video server loads. Simulation results show that the proposed channel reservation patching algorithms provide better performance compared to simple patching algorithm.