윤현수 교수

An analytic model and analytic results for the performance of multibuffered packet-switching interconnection networks in multiprocessor systems are presented. The performance of single-buffered delta networks is first modeled using the state transition diagram of a buffer. The model is then extended to account for multiple buffers. The analytic results for multibuffered delta networks are compared to simulation results. The performance of multibuffered data manipulator networks is analyzed to de

Content-centric networking (CCN) is designed for efficient dissemination of information. Several architectures are proposed for CCN recently, but mobility issues are not considered sufficiently. We classify traffic types of CCN into real-time and non real-time. We examine mobility problems for each type, and suggest the possible hand-off schemes over CCN. Then, we analyze the delay performance in terms of simulation study. We believe that the proposed schemes can be merged as a part of the CCN e

Many routing algorithms, proposed for ad-hoc wireless networks, are based on source routing scheme. When a route is broken in source routing, route recovery and maintenance procedures are executed. However these procedures consume many resources. To minimize route breaking, it important to find a route that endures longer time. Shortest path route has short lifetime especially in highly dense ad-hoc wireless networks, and it due to the edge effect discovered in this paper Some routing protocols

In this paper, we address the problem of packet transmission from multiple sources to multiple mobile sinks in the large-scale sensor network. Each mobile sink needs to periodically update its location information into the sensor network. Due to multiple mobile sinks, frequent location updates are needed and this causes enormous consumption of the limited battery power in the sensor node. Several routing protocols, such as TTDD and SEAD, suggest hierarchical approach for supporting mobile sinks.

Wireless sensor networks offer many beneficial applications in various fields. However, because sensor devices are limited in their resources and susceptible to a variety of novel attacks, even a few malicious adversaries can easily spread deceitful data and make the networks be in confusion without great efforts. Therefore, it is essential to distinguish forged data of illegal nodes from innocent data of legal nodes in sensor networks. In this paper, to make resilient wireless sensor networks,

Recommendation systems become popular in our daily life. It is well known that the more the release of users' personal data, the better the quality of recommendation. However, such services raise serious privacy concerns for users. In this paper, focusing on matrix factorization-based recommendation systems, we propose the first privacy-preserving matrix factorization using fully homomorphic encryption. On inputs of encrypted users' ratings, our protocol performs matrix factorization over the en

To reduce the number of unnecessary handover in hierarchical macro/femto-cell networks, it is necessary to avoid macro → femto cell handovers of temporary femtocell visitors who stay in the femtocell for a relatively short time. In this paper, we propose a smart handover decision algorithm exploiting future mobility pattern prediction scheme to prevent macro → femto cell handovers of such temporary femtocell visitors. Our simulation result shows that the proposed algorithm effectively reduces th

A novel high-performance packet-switching architecture, called the knockout switch, has been recently proposed. It is a nonblocking, cost-effective switch suitable for broadband packet switching. The authors give equations which can be used to derive the packet loss probability and investigate the knockout switch under various uniform traffic patterns. They also compare the knockout switch with the multistage switch under various nonuniform traffic patterns.< <ETX xmlns:mml="http://www.w3.org/19

The knockout switch is a nonblocking, high-performance switch suitable for broadband packet switching. It allows packet losses, but the probability of a packet loss can be kept extremely small in a cost-effective way. The performance of the knockout switch was analyzed under uniform traffic. In this paper, we present a new, more general analytic model of the knockout switch, which enables us to evaluate the knockout switch under nonuniform traffic. The new model also incorporates the effects of

An analytic model and analytic results for the performance of multibuffered packet-switching interconnection networks in multiprocessor systems are presented. The performance of single-buffered delta networks is first modeled using the state transition diagram of a buffer. The model is then extended to account for multiple buffers. The analytic results for multibuffered delta networks are compared to simulation results. The performance of multibuffered data manipulator networks is analyzed to de