• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.04a
• /
• pp.470-473
• /
• 2000

차세대 셀룰라 이동 통신 시스템에서는 멀티미디어 서비스를 지원 할 수 있는 충분한 대역폭이 제공되어야 하며 QoS(Quality-of-Service)를 보장해야 한다. 본 논문에서는 셀 내에서의 호발생 위치를 추정하여 인접셀을 나누어 대역폭 할당을 하므로써 자원의 낭비를 줄이고 신규호와 핸드오프 호의 공유 대역폭을 두어 Blocking확률과 Dropping확률을 감소시키는 새로운 무선 대역폭 할당 알고리즘을 제안하였다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.8
• /
• pp.1981-1986
• /
• 2014

The problem studied in this paper is the channel routing problem to assign points with p colors on the upper row of the channel to points on the lower row in order to minimize its density. The case that the points on the upper row has an identical color or only two colors is studied in [1, 2]. This paper generalizes that to the points with p colors. First, we consider the problem to determine whether there is an assignment with density less than or equal to d, when an arbitrary d is given. We show that the problem is solved in O(p(n+m)log(n+m)) time. Using this result, we resolve the problem to fine an assignment with a minimum density.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10c
• /
• pp.427-429
• /
• 2003

최근 IPv6 망에 멀티호밍을 제공하기 위한 연구 방향 중의 하나는 지리적 정보를 이용하는 것이다. 대표적인 메커니즘인 Geo for Now[1]은 지리적 위치 정보를 기반으로 주소를 할당하고 멀티호밍 제공 시 DFZ내의 글로벌 라우팅 테이블 엔트리가 급격히 증가되는 문제점을 해결하기 위한 방안을 제공한다. 그러나 [1]은 멀티호밍을 위하여 반드시 새로운 주소가 할당되어야 하며 멀티호밍 서비스를 요구하는 사이트가 증가되는 경우 확장성 문제를 야기한다. 본 논문에서는 지리적 위치 정보를 기반으로 IPv4 형식의 멀티호밍 기법을 그대로 적용하는 동시에 확장성 문제를 해결하기 위한 메커니즘을 제안한다. 제안된 메커니즘의 경우 지리적 위치 정보 및 확장된 BGP 속성의 사용으로 멀티호밍으로 인해 야기되는 상세한 경로 정보의 확산을 제한한다. 이로써 확장성의 문제를 발생시키지 않으면서도 IPv4 형식의 멀티호밍 기법을 사용함으로써 IPv4 멀티호밍에서 제공하던 기능들을 유사한 수준으로 제공할 수 있다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04a
• /
• pp.550-552
• /
• 2004

현재 MANET에 관한 대부분의 연구는 라우팅문제에 초점을 맞추고 있다. 하지만 우리는 MANET에서 응용될 수 있는 시스템에 대하여 관심을 갖게 되었다. 특히 셀룰라망(Cellular network)의 단점, 즉 처리량(Throughput)이 낮고 독립적인 망 구축과 데이터 서버로의 접근이 용이하지 않다는 것을 보완하기 위한 802.11기반 위치기반서비스(LBS： Location Based Service)라는 응용 시스템을 제안하게 되었고 MANET에서의 동적 IP 주소 할당과 웹 기반 응용프로그램(Web based application)을 구현하였다. 본 논문에서는 이동적응 망에서의 802.11기반 위치기반서비스에서 필요한 서비스발견(Service discovery)과 등록(Service registration), 동적 IP 주소 할당, 라우팅(Routing)과 웹 기반 응용프로그램(Web based application)을 연동한 시스템 프로토타입을 제안하고 구현한다.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.27 no.5
• /
• pp.454-462
• /
• 2016

portable white space device(WSD) obeying the Korean regulations of TV white space(TVWS) can cause harmful interference to a digital TV receiver residing at the same pixel around the edge of the digital TV service coverage for the case with a changed propagation environment. In order to solve this problem, we propose a method to allocate the resource of a hybrid WSD based on TVWS geo-location DB with spectrum sensing. Using the received power of digital TV signal through the spectrum sensing, a hybrid WSD can calculate the maximum permitted EIRP based on location probability. Based on the accurate allocation method proposed in this paper, it is possible to satisfy the Korean TVWS regulations and to eliminate the harmful interference to TV receivers nearby the hybrid WSD.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.5
• /
• pp.1179-1186
• /
• 1996

A previous location area scheme was proposed for cellular network, in which the size of location area of a user is dynamically determined by is current mobility and call arrival rate as the burden of system reaches the minimum. This scheme, however, doesn't consider other individual's movement pattern respectively because of allocating location area with a system's fixed pattern. When mobile subscribers move fast, this scheme allocates especially so large location area to reduce the number of location registration that it makes much paging cost. In this paper, we suggest new dynamic location area management which allocates location area according to each subscriber's mobility regarding its current location as center point. This new scheme allocates fast subscriber larger location area, which resulted in reducing the number of location registration. And small area paging reduces paging cost.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1995.06a
• /
• pp.49-51
• /
• 1995

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.3
• /
• pp.177-183
• /
• 2022

There is no known polynomial time algorithm for QAP that is a NP-complete problem. This paper suggests O(n²) polynomial time algorithm for random type quadratic assignment problem (QAP). The proposed algorithm suggests incremental augmenting matching strategy that is to set the matching set M={(l_i,f_j)} from l_i with minimum sum of distance in location matrix L and f_j with maximum sum of quantity in facility matrix F, and incremental augmenting of matching set M from M to l_i with minimum sum of distance and to f_j with maximum sum of quantity. Finally, this algorithm performs swap strategy that is to reflect the complex correlations of distances in locations and quantities in facilities. For the experimental data, this algorithm, in spite of O(n²) polynomial time algorithm, can be improve the solution than genetic algorithm a kind of metaheuristic method.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.7
• /
• pp.1681-1693
• /
• 1997

In a distributed system, the simple file allocation problem determines the placement of copies of a file, so as to minimize the operating costs. The simple file allocation problem assumes the cost parameters to be fixed. In practice, these parameters change over time. In this research, dynamic file allocation problem for both single and multiple files are considered, which account for these changing parameters. A model for dynamic file allocation problem is formulated as a mixed integer program for which Lagrangian relaxation based branch-and-bound algorithm is developed. This algorithms is implemented and its efficiency is tested on medium to large test problems.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.7
• /
• pp.349-358
• /
• 2005

False sharing is a result of co-location of unrelated data in the same unit of memory coherency, and is one source of unnecessary overhead being of no help to keep the memory coherency in multiprocessor systems. Moreover. the damage caused by false sharing becomes large in proportion to the granularity of memory coherency. To reduce false sharing in a page-based DSM system, it is necessary to allocate unrelated data objects that have different access patterns into the separate shared pages. In this paper we propose call-site tracing-based shared memory allocator. shortly CSTallocator. CSTallocator expects that the data objects requested from the different call-sites may have different access patterns in the future. So CSTailocator places each data object requested from the different call-sites into the separate shared pages, and consequently data objects that have the same call-site are likely to get together into the same shared pages. We use execution-driven simulation of real parallel applications to evaluate the effectiveness of our CSTallocator. Our observations show that by using CSTallocator a considerable amount of false sharing misses can be additionally reduced in comparison with the existing techniques.