• Journal of the Korea Society of Computer and Information
• /
• v.8 no.4
• /
• pp.117-125
• /
• 2003

The proposed mechanism has an group management server, which manages the information about both the receivers and the senders. Any receiver can dynamically join/leave the multicast VC. The signaling overload due to group membership changes is not concentrated on the sender, but it is distributed to many receivers for the scalability improvement. The associated signaling messages propagates from the receivers to the ATM switch dedicated to the multicast VC, and hence no signaling overload exists in the shared links there is no latency for the receiver to wait. Our proposed scheme is superior in the view of scalability, the efficiency and the latency to other schemes.

• Journal of Communications and Networks
• /
• v.6 no.3
• /
• pp.280-286
• /
• 2004

The widespread use of the Internet and the maturing of digital video technology have led to an increase in various streaming media application. However, new classes of hosts such as mobile devices are gaining popularity, while the transmission became more heterogeneous. Due to the characteristics of mobile networks such as low speed, high error bit rate, etc., the applications over the wireless channel have different needs and limitations from desktop computers. An intermediary between two communicating endpoints to hide the heterogeneous network links is thought as one of the best approaches. In this paper, we adopted the concept of inter-packet gap and the sequence number between continuously received packets as the error discriminator, and designed an adaptive packet sizing mechanism to improve the network efficiency under varying channel conditions. Based on the proposed mechanism, the packetization scheme with error protection is proposed to scalable encoded video delivery. Finally, simulation results reveal that our proposed mechanism can react to the varying BER conditions with better network efficiency and gain the obvious improvement to video quality for stored MPEG-4 FGS video delivery.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10d
• /
• pp.274-278
• /
• 2006

무선 네트워크 기술의 발전으로 인해 매우 상이한 특성을 가지는 다양한 무선 시스템이 등장하였으며, 이들 무선 시스템은 상호 중첩된 영역을 가지기도 하면서 공존할 것으로 예상된다. 한편, 두 개 이상의 에어 인터페이스를 갖추고 다양한 서비스를 동시에 받을 수 있는 이동 단말들도 등장하고 있다. 이와 같은 환경에서 이동 사용자는 로밍하면서 끊김없는 통신을 지속할 뿐만 아니라 여러 개의 공존하는 무선 엑세스 시스템을 효과적으로 활용함으로써 응용의 서비스품질 요구에 대한 만족도를 높일 수 있다. 이에 본 논문에서는 차세대 네트워크 환경에서 이동 사용자가 여러 개의 서비스를 동시에 받는 경우 각 서비스에 대하여 서비스 품질을 보장하기 위한 새로운 종단 간 이동성 지원 방안을 제안한다. 이를 위해 본 논문에서는 종단 간 이동성 관리를 수행하는 IP agent 모듈을 새로이 정의하고, 핸드오버 시, 각 응용의 특성을 고려하여 응용 별로 가장 적합한 액세스 네트워크를 선택하여 핸드오버를 수행한다. 시뮬레이션을 통하여 응용 별 특성을 고려한 종단 간 이동성을 지원하는 제안하는 방안이 기존 방안들에 비해 서비스 품질의 보장이 더 잘 이루어짐을 알 수 있었다.

• Journal of Communications and Networks
• /
• v.4 no.2
• /
• pp.128-135
• /
• 2002

We propose a new space priority mechanism, and analyze its performance in a single Constant Bit Rate (CBR) server. The arrival process is derived from the superposition of two types of traffics, each in turn results from the superposition of homogeneous ON-OFF sources that can be approximated by means of a two-state Markov Modulated Poisson Process (MMPP). The buffer mechanism enables the Asynchronous Transfer Mode (ATM) layer to adapt the quality of the cell transfer to the Quality of Service (QoS) requirements and to improve the utilization of network resources. This is achieved by "Selective-Delaying and Pushing-ln"(SDPI) cells according to the class they belong to. The scheme is applicable to schedule delay-tolerant non-real time traffic and delay-sensitive real time traffic. Analytical expressions for various performance parameters and numerical results are obtained. Simulation results in term of cell loss probability conform with our numerical analysis.

• Research in Community and Public Health Nursing
• /
• v.17 no.3
• /
• pp.364-375
• /
• 2006

Purpose: The purpose of the study was to investigate burden and the qualify of life in caregivers who are taking care of home-based rare and incurable disease patients. Methods: The subjects of this study were 300 caregivers of rare and incurable disease patients registered at five health centers in Seoul. A survey was conducted by mail and visit in person during the period from the 25th of March to the 12th of May 2005. Collected data were analyzed through t-test, ANOVA, Pearson's correlation coefficient. Result: The mean burden of caregivers was 3.42, and the mean qualify of life of caregivers was 2.71. Burden and QoL showed significant differences according to caregivers' characteristics such as sender, age, relation to the patient, academic qualification, religion, occupation, monthly household income and perceived health condition. Caregivers' burden was in an inverse correlation with their quality of life. Conclusions: According to the results of this study, rare and incurable disease caregivers' burden and their quality of life were in a significant correlation with each other. In order to improve caregivers' quality of life by reducing their burden, we need to reestablish comprehensive policies for rare and incurable disease management including nursing intervention strategies for caregivers.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.7
• /
• pp.1614-1620
• /
• 2009

The overlay multicast that has been recently presented as an alternative for the IP multicast has been getting much persuasion by the system resource and the network bandwidth and the advancement of the network cost. we propose a overlay multi_casting network policy for efficient multimedia services with P2P join scheduling. In order to evaluate the performance of proposed scheme, We test the performance of multi_casting nodes with average join count, the maximum guaranteed waiting time and buffer starvation ratio with similar techniques. The result of simulation shows improved about 15${\sim}$20% of performance.

• The Korean Journal of Applied Statistics
• /
• v.28 no.1
• /
• pp.1-8
• /
• 2015

Security has become an issue due to the rapid increases in internet traffic data network. Especially P2P traffic data poses a great challenge to network systems administrators. Preemptive measures are necessary for network quality of service(QoS) and efficient resource management like blocking suspicious traffic data. Deep packet inspection(DPI) is the most exact way to detect an intrusion but it may pose a private security problem that requires time. We used several machine learning methods to compare the performance in classifying network traffic data accurately over time. The Random Forest method shows an excellent performance in both accuracy and time.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.1
• /
• pp.53-63
• /
• 1999

ATM 네트워크에서 다양한 트래픽을 특성과 QoS 요구사항을 갖는 멀티미디어 서비스의 종단간 품질을 만족시키면서 망 자원을 효율적으로 이용하기 위해서는 가상경로(virtual path : VP) 의 적절한 배치 및 대역 할당을 통한 논리적 망의 구성, 호 접속 시의 종적 경로 설정, 그리고 그와 연계된 효율적인 동적 대역 관리가 필수적으로 요구된다. 본 논문에서는 새로운 호가 시도될 때 논리적 망의 설계에서 설정된 가상경로의 대역으로 호의 품질 요구사항을 만족 시킬수 없거나 또는 미리 설정해 놓은 가상경로연결(VP Connection) 이 존재하지 않을 경우에 물리적 링크의 잔여용량을 기반으로 적절한 가상경로를 선택하여 용량을 재조정하기 위한 최적 관리 모델로서 MHR (Minimum Hop Route), MCR(Maximum Capacity Route), 그리고 MRCR (MaxMin Residual Capacity Route)방식을 제안하고 이에 대한 최적화 정식을 제안하였다. 제안된 각 최적화 모델에 대한 해를 노드의 수가 m인 네트워크에서 O(m2)의 복잡도로 구할 수 있는 알고리즘을 제시하고 시뮬레이션을 통해 제안된 최적화 모델이 망의 성능에 미치는 영향을 평균 호 차단률 평균 이용 링크의 수 , 그리고 노드 쌍간의 호 차단률의 분산등에 의해 망 운용의 효율성과 공평성등을 비교분석하였다.

• Journal of Internet Computing and Services
• /
• v.22 no.5
• /
• pp.27-33
• /
• 2021

With the broad adoption of the Internet of Things (IoT) in a variety of scenarios and application services, management and orchestration entities require upgrading the traditional architecture and develop intelligent models with ultra-reliable methods. In a heterogeneous network environment, mission-critical IoT applications are significant to consider. With erroneous priorities and high failure rates, catastrophic losses in terms of human lives, great business assets, and privacy leakage will occur in emergent scenarios. In this paper, an efficient resource slicing scheme for optimizing federated learning in software-defined IoT (SDIoT) is proposed. The decentralized support vector regression (SVR) based controllers predict the IoT slices via packet inspection data during peak hour central congestion to achieve a time-sensitive condition. In off-peak hour intervals, a centralized deep neural networks (DNN) model is used within computation-intensive aspects on fine-grained slicing and remodified decentralized controller outputs. With known slice and prioritization, federated learning communications iteratively process through the adjusted resources by virtual network functions forwarding graph (VNFFG) descriptor set up in software-defined networking (SDN) and network functions virtualization (NFV) enabled architecture. To demonstrate the theoretical approach, Mininet emulator was conducted to evaluate between reference and proposed schemes by capturing the key Quality of Service (QoS) performance metrics.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.9A
• /
• pp.702-709
• /
• 2003

In this paper, we propose an efficient and QoS-aware MAC scheduling algorithm for Bluetooth, which considers both throughput and delay performance of each Master-Slave pair in scheduling decisions, and thus, attempts to maximize overall performance. The proposed algorithm, MTDPP (Modified Throughput-Delay Priority Policy), makes up for the drawbacks of T-D PP (Throughput-Delay Priority Policy) proposed in [6] and improves the performance. Since Bluetooth employs a master-driven TDD based scheduling algorithm, which is basically operated with the Round Robin policy, many slots may be wasted by POLL or NULL packets when there is no data waiting for transmission in queues. To overcome this link wastage problem, several algorithms have been proposed. Among them, queue state-based priority policy and low power mode-based algorithm can perform with high throughput and reasonable fairness. However, their performances may depend on traffic characteristics, i.e., static or dynamic, and they require additional computational and signaling overheads. In order to tackle such problems, we propose a new scheduling algorithm. Performance of our proposed algorithm is evaluated with respect to throughput and delay. Simulation results show that overall performances can be improved by selecting suitable parameters of our algorithm.