• Journal of Internet Computing and Services
• /
• v.1 no.2
• /
• pp.69-88
• /
• 2000

One of the most important factors on the performance of the distributed systems is the effective distribution of the software components, There have been a lot of researches on partitioning and allocating the task-based system, while the studies on the allocating the objects of the object-oriented system into the distributed object environments are very little relatively. In this paper. we defines the graph model for partitioning the existing C++ application and allocating the C++ objects into CORBA-base distributed system, In addition, we propose a distributed object allocation algorithm based on this graph model. The performance of distributed systems is determined by the concurrency between objects, the load balance among the processors and the communication cost on the networks. To search for the solutions optimizing the above three factors simultaneously, the object allocation algorithm of this paper is based on the Niched Pareto Genetic Algorithm (NPGA). We performed the experiment on the typical C++ application and CORBA system to prove the effectiveness of our graph model and our object allocation algorithm.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.9
• /
• pp.2827-2835
• /
• 2000

In recent years, much attention has been focused on improving I/O devices' processing speed which is essential in such large data processing areas as multimedia data processing. And studies on high-performance parallel file systems are considered to be one of such efforts. In this paper, an efficient disk allocation scheme is proposed for high-performance parallel file systems. In other words, the concept of a parallel disk file's parallelism is defined using data declustering characteristic of a given parallel file. With the concept, an efficient disk allocation scheme is proposed which calculates the appropriate degree of data declustering on disks for each parallel file in order to obtain the maximum throughput when more than one parallel file is used at the same time. Since, calculation for obtaining the maximum throughput is too complex as the number of parallel files increases, an approximate disk allocation algorithm is also proposed in this paper. The approximate algorithm is very simple and especially provides very good results when I/O workload is high. In addition, it has shown that the approximate algorithm provides the optimal disk allocation for the maximum throughput when the arrival rate of I/O requests is infinite.

• The Journal of the Acoustical Society of Korea
• /
• v.20 no.7
• /
• pp.101-108
• /
• 2001

In this paper we focus on dynamic reservation slot allocation scheme for supporting QoS of a voice traffic in WATM MAC. Especially, voice traffic is the most important real-time object, and so we propose a new MAC protocol for voice traffic over WATM networks in the multimedia environment. According to the characteristics of voice traffic which is repeatedly in silent state and active state, new protocol allocates reservation slots dynamically with respect to the number of silent voice source of which starting time is stored to the state table in base station (BS). The simulation results show that the proposed protocol has better performance than slotted ALOHA in average access delay, collision rate, better than NC-PRMA(Non Collision Packet Reservation Multiple Access) in band width efficiency, and can provide a certain level of QoS requirement by the given slot assignment even though the number of voice terminals is increased.

• Journal of IKEEE
• /
• v.6 no.2 s.11
• /
• pp.161-168
• /
• 2002

Network of these days, A transmission medium of information is replaced from electric signal to optical signal to accept various and increased network traffic. In this paper, we develop simulation program using AweSim and simulate EPON system as a high-speed optical subscriber network with various conditions. The effects of number of ONUs, effects of network load and effects of slot assignment schemes have been evaluated. The simulation results show that slot assignment schemes and number of ONUs is major factor of network performance. The variable-number slot scheme is more efficient than fixed-length slot scheme in the traffic processing.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.5
• /
• pp.95-103
• /
• 2008

The Network Mobility (NEMO) basic support protocol extends the operation of Mobile IPv6 to provide uninterrupted Internet connectivity to the communicating nodes of mobile networks. The protocol is not efficient to offer delays in data delivery and higher overheads in the case of nested mobile networks because it uses fairly sub-optimal routing and multiple encapsulation of data packets. In this paper, our scheme combining Hierarchical Mobile IPv6 (HMIPv6) functionality and Hierarchical Prefix Delegation (HPD) protocol for IPv6, which provide more effective route optimization and reduce packet header overhead and the burden of location registration for handoff. The scheme also uses hierarchical mobile network prefix (HMNP) assignment and tree-based routing mechanism to allocate the location address of mobile network nodes (MNNs) and support micro-mobility and intra-domain data communication. The performance is evaluated using NS-2.

• The KIPS Transactions:PartA
• /
• v.8A no.3
• /
• pp.245-252
• /
• 2001

Multicomputer systems achieve high performance by utilizing a number of computing nodes. Multidimensional meshes have become popular as multicomputer architectures due to their simplicity and efficiency. In this paper we propose an efficient processor allocation scheme for 3D torus based on first-fit approach. The scheme minimizes the allocation time by effectively manipulating the 3D information an 2D information using CST (Coverage Status Table). Comprehensive computer simulation reveals that the allocation time of the proposed scheme is always smaller than the earlier scheme based on best-fit approach, while allowing comparable processor utilization. The difference gets more significant as the input load increases. To investigate the performance of the proposed scheme with different scheduling environment, non-FCFs scheduling policy along with the typical FCFS policy is also studied.

• Journal of Internet Computing and Services
• /
• v.11 no.4
• /
• pp.1-10
• /
• 2010

As recent fusion industry and ubiquitous technology have grown fast, network contents, which require high load, are provided in various infrastructures and facilities such as u-city and smart phones. Therefore, it is anticipated that the playback quality of multimedia compared to network loads degrades dramatically due to the drastic increment of real-time reference of conventional high load contents (eg. multimedia data). In this paper, we improved the method of the traffic assignment based on MPP which elevated the playback quality of multimedia by assigning discriminately the possible traffic of MMS with TP coefficients. When the TP coefficient which combines content preference with media preference was applied to a real-time traffic assignment scheduler, the simulation results showed that the multimedia playback stream was assigned within the possible traffic of a server. The real-time scheduling algorithm was improved by using the TP coefficient that combines the time-dependent image contents and the weighted value of media preference. It was observed from the experiment that the loss of the possible traffic decreases to 3.91% and 3.88% for three and four clients respectively.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.10 no.2
• /
• pp.157-168
• /
• 1999

In this paper the new channel allocation method which is important in designing mobile radio system, is proposed. If the channel is allocated by time-frequency-code sliced and using DAMA scheduler, the blocking probability is lower than TA channel allocation method. With traffic load $\rho$=0.8 and 2% of blocking probability, TFS method can allocate 36 slices compared to 11 slices in TA method. At traffic load $\rho$=0.9 and 1% of blocking probability, the maximum available slices are 13 in TA method, but in TFS method 40 slices are allocated to user, so TFS method is better frequency availability by 3.75 times than TA method. TFS method could be suitable for system planning to multirate communication users.

• Proceedings of the KAIS Fall Conference
• /
• 2002.11a
• /
• pp.220-224
• /
• 2002

본 논문에서는 웹 서버의 부하가 급증하면서 대두된 네트워크 과부하를 해결하기 위한 방법으로 서버분산처리 방식과 RTO(retransmission time out : 재전송타임아웃)간을 조정하는 기법을 이용하였다. 부하 분산을 위한 방법으로는 기존의 NAT 기반의 가상서버 방식과 비슷하나, 기존의 가상서버에서 서버들을 선택하는 스케줄링 방법을 이용하지 않고 네트워크 주소(IP)룰 통한 서버 분산방법을 선택하였다. 이를 위해 Linux 기반의 PC에 라우터론 구축하였고 여기에 실제 IP를 할당하였으며, 라우터를 경유하여 연결된 두개의 서버에는 가상 IP를 할당 내부접속용과 외부접속용으로 나누어 서버 분산이 이루어지게끔 하였다. 이러한 서버 분산은 학교라는 즉. 웹서버의 접속이 내부접속 비율과 외부접속 비율 어느 한쪽으로도 크게 기울지 않는 네트워크 환경을 고려한 것이다. 네트워크의 성능 평가에 있어 가장 기본이 될 수 있는 응답시간은 전송거리와 트래픽량에 비례한다. 이에 외부접속용 서버와 내부접속용 서버 각각에 RTO 값을 다르게 적용시킴으로써 전체적인 Delay의 변화를 확인해 볼 수 있다. 이는 전송거리가 길 경우 생길 수 있는 패킷 손실을 고려한 것으로 패킷 손실로 인하여 재전송이 이루어질 경우 재전송 time이 RTO를 통하여 이루어지며 이러한 RTO의 적절한 값은 전체적인 응답시간에 영향을 미칠 수 있다는 것에 기인한 것으로 RTO값을 전송거리가 긴 외부접속용 서버에는 전송거리가 짧은 내부접속용 서버에 비해 길게 적응시킴으로써 전체적인 응답시간의 개선을 유도하였다

• Proceedings of the Korea Water Resources Association Conference
• /
• 2004.05b
• /
• pp.1023-1026
• /
• 2004

우리나라는 토지이용이 고도화 되어 있고 상수원에 각종 오염시설이 이미 입지해 있으며 개발압력이 가중되고 있는 현실을 고려해 볼 때 환경기초시설 확충 및 배출기준 강화 등 사후적 관리방법으로는 상수원의 수질개선에 한계가 있다. 그리고 상수원수질보전을 위한 기존의 토지이용 규제정책도 일정 규모 이하는 규제 대상에서 제외되어 소규모 시설에 대한 효율적 규제가 안 되고 있을 뿐만 아니라, 토지이용 규제에 의한 주민의 재산권 제한으로 민원도 계속되고 있다. 따라서 오염원의 총량적인 증가에 효율적으로 대처하고 주민이 스스로 오염원 총량발생을 억제함과 동시에 환경친화적으로 지역을 개발할 수 있는 새로운 수질관리 기법이 도입될 필요가 있다. 이에 본 연구에서는 섬진강을 대상하천으로 각 배수구역별 유황분석을 실시하고, 오염원조사, 부하량 산정, 수질모델링의 불확실성등 안전율을 고려하여, 오염원 총량관리 기본방침을 기준으로 오염총량관리대상 오염물질의 종류인 생물학적 산소요구량(BOD)에 대하여 2006년과 2011년의 장래수질예측을 실시하였고 그 결과 목표수질을 달성할 수 있는 배수구역별 부하량을 할당하였다.