• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.1B
• /
• pp.64-72
• /
• 2004

Multiprotocol Label Switching (MPLS) has been developed as a key technology to enhance the reliability, manageability and overall quality of service of core If networks with connection-oriented tunnel LSP and traffic engineering such as constraint-based routing, explicit routing, and restoration. In this paper, we propose a control bandwidth borrowing scheme that maximizes the utilization of tunnel LSPs or physical links by an extension to the RSVP-TE label distribution protocol. MPLS-based core switching network and VPN services rely on the establishment of connection-oriented tunneled LSPs that are configured or predefined by network management systems. The mechanism of network management system varies from (i) a relatively static LSP establishment accounting, to (ii) a dynamic QoS routing mechanisms. With the use of hierarchical LSPs, the extra bandwidth that is unused by the trunk (outer) LSPs should be fully allocated to their constituent end-to-end user traffic (inner) LSPs in order to maximize their utilization. In order to find out the unused extra bandwidth in tunnel LSP or physical link and redistribute these resources to constituent LSPs, we expend the functionality of RSVP-TE and the found unused extra bandwidth is redistributed with a weight-based recursive redistribution scheme. By the extended RSVP-TE and proposed recursive redistributed scheme, we could achieve the instantaneous maximized utilization of tunnel LSP or physical link suffering from the potential under-utilization problem and guarantee the end-to-end QoS requirements. With the proposed scheme, network manager can manage more effectively the extra available bandwidth of hierarchical LSPs and maximize the instantaneous utilization of the tunneled LSP resources.

• Journal of the Korean Society for information Management
• /
• v.30 no.1
• /
• pp.93-109
• /
• 2013

This study extracted quality control factors for invigorating Institutional Repository operations, and re-extracted key quality control factors with significant influence among them. Furthermore, this study developed an operating model reflecting an improvement scheme of these key quality control factors, and estimated how much effective the operating model was to the user. As a result of inspecting satisfaction for IR operating model and the general system, it has been found that librarians' satisfaction for them is higher than that of the general user. Korea's universities prefer a proxy submission mode by librarians to a self-archiving submission mode by writers. Therefore, based on the operation model developed by this study, it is suggested that Institutional Repository operation can be actively invigorated with librarians of these universities as central players.

• Computers and Concrete
• /
• v.7 no.5
• /
• pp.469-482
• /
• 2010

This paper investigates the concrete permeability through a numerical and statistical approach. Concrete is considered as a random heterogeneous composite of three phases: aggregates, interfacial transition zones (ITZ) and matrix. The paper begins with some classical bound and estimate theories applied to concrete permeability and the influence of ITZ on these bound and estimate values is discussed. Numerical samples for permeability analysis are established through random aggregate structure (RAS) scheme, each numerical sample containing randomly distributed aggregates coated with ITZ and dispersed in a homogeneous matrix. The volumetric fraction of aggregates is fixed and the size distribution of aggregates observes Fuller's curve. Then finite element method is used to solve the steady permeation problem on 2D numerical samples and the overall permeability is deduced from flux-pressure relation. The impact of ITZ on overall permeability is analyzed in terms of ITZ width and contrast ratio between ITZ and matrix permeabilities. Hereafter, 3680 samples are generated for 23 sample sizes and 4 contrast ratios, and statistical analysis is performed on the permeability dispersion in terms of sample size and ITZ characteristics. By sample theory, the size of representative volume element (RVE) for permeability is then quantified considering sample realization number and expected error. Concluding remarks are provided for the impact of ITZ on concrete permeability and its statistical characteristics.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.6
• /
• pp.1996-2013
• /
• 2015

This paper considers a scenario that more D2D users exist in the cell, they compete for cellular resources to increase their own data rates, which may cause transmission interference to cellular users (CU) and the unfairness of resource allocation. We design a resource allocation scheme for selfish D2D users assisted by cooperative relay technique which is used to further enhance the users' transmission rates, meanwhile guarantee the QoS requirement of the CUs. Two transmission modes are considered for D2D users: direct transmission mode and cooperative relay transmission mode, both of which reuses the cellular uplink frequency resources. To ensure the fairness of resource distribution, Nash bargaining theory is used to determine the transmission mode and solve the bandwidth allocation problem for D2D users choosing cooperative relay transmission mode, and coalition formation game theory is used to solve the uplink frequency sharing problem between D2D users and CUs through a new defined "Selfish order". Through theoretical analysis, we obtain the closed Nash bargaining solution under CUs' rate constraints, and prove the stability of the formatted coalition. Simulation results show that the proposed resource allocation approach achieves better performance on resource allocation fairness, with only little sacrifice on the system sum rates.

• The Journal of Korean Association of Computer Education
• /
• v.7 no.1
• /
• pp.55-66
• /
• 2004

The Internet today provides group communication model, multicast service. It is important to keep security for multicast communication. Member leaving is associated with scalability problem for group key management. If one member of the group is removed, new group key has to be changed and communicated to all remaining members of group. Modification and distribution of new group keys for rekeying is an expensive operation. Minimizing the number of messages and operation cost for generation of the composite keys are important evaluating criteria of multicast key management scheme. Periodic rekey helps reducing these important parameters rather than removing members sequentially in fashion one after another. In this paper, Hamming distance is calculated between every members to be removed. The members with Hamming distance less than threshold are selected for rekeying procedure. With running the round assignment algorithm, our model has advantages of reducing the number of message and operation cost for generation of the composite keys for rekeying.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.1
• /
• pp.21-40
• /
• 2018

In this paper, we propose the distributed robust beamforming design scheme in cognitive two-way amplify-and-forward (AF) relay networks with imperfect channel state information (CSI). Assuming the CSI errors follow a complex Gaussian distribution, the objective of this paper is to design the robust beamformer which minimizes the total transmit power of the collaborative relays. This design will guarantee the outage probability of signal-to-interference-plus-noise ratio (SINR) beyond a target level at each secondary user (SU), and satisfies the outage probability of interference generated on the primary user (PU) above the predetermined maximum tolerable interference power. Due to the multiple CSI uncertainties in the two-way transmission, the probabilistic constrained optimization problem is intractable and difficult to obtain a closed-form solution. To deal with this, we reformulate the problem to the standard form through a series of matrix transformations. We then accomplish the problem by using the probabilistic approach based on two sorts of Bernstein-type inequalities and the worst-case approach based on S-Procedure. The simulation results indicate that the robust beamforming designs based on the probabilistic method and the worst-case method are both robust to the CSI errors. Meanwhile, the probabilistic method can provide higher feasibility rate and consumes less power.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.882-885
• /
• 2008

무선 센서 네트워크는 저가의 한정된 자원들을 갖는 수많은 센서 노드들로 구성된다. 보편적으로 대부분의 센서들은 안전하지 않거나 제어할 수 없는 환경에 배치되며, 만일 넓은 목표 지역에 센서노드들을 무작위로 배치할 때에는 센서 노드들의 정확한 위치를 파악하기 매우 어렵다. 따라서 본 논문에서는 이러한 문제를 해결하기 위한 방안으로서 효율적인 키 분배 기법을 제안하고자 한다. 이에 제안된 기법을 통해 센서 노드들이 선-분배된 키들을 사용하여 안전한 링크를 확립한 후 근접한 이웃 노드들과 서로 정보를 교환할 수 있도록 하였다. 또한 제안된 기법에서는 센서노드의 위치 정보를 이용함으로써 노드간에 공통-키를 발견할 수 있는 확률을 높일 수 있게 하였다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2006.05a
• /
• pp.995-998
• /
• 2006

IGMP(Internet Group Management Protocol)는 멀티캐스트 그룹의 멤버쉽 관리를 위한 프로토콜로서, 임의의 호스트가 멀티캐스트 라우터에게 특정한 멀티캐스트 통신의 수신을 요청할 경우에 사용된다. 본 논문에서는 이와 같은 IGMP 메시지를 이용한 정당하지 않은 호스트의 DoS 공격 등으로부터 멀티캐스트 분배트리의 보호를 위한 수신자 접근제어 기법을 제안한다. 또한 제안기법은 수신자 접근제어 기능뿐만 아니라, 실제 다양한 상업적인 멀티캐스트 서비스에도 적용될 수 있는 비즈니스 모델을 기반으로 하며 과금과 관련하여 활용이 가능하다.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 2006.06a
• /
• pp.447-450
• /
• 2006

센서 네트워크는 앞으로 다방면에서 활용되어질 것으로 기대되고 있다. 그러나 센서 노드들은 악의적인 공격자에 의해 통신내용이 수집되고 공격을 받거나 조작될 수 있는 적대적이고 안전하지 못한 환경에 위치할 수 있다. 더욱이 센서 네트워크는 메모리, 전력, 계산능력에 있어서 상당히 제약적인 노드들로 구성되기 때문에 기존의 키 관리 기법을 적용하기 어려우며, 따라서 별도의 키 관리 기법이 요구되어진다. 본 논문에서는 센서 네트워크에서의 키 관리에 관련한 연구들을 소개하고 좀 더 안전한 키 분배 기법을 제안하고자 한다.

• ETRI Journal
• /
• v.32 no.5
• /
• pp.766-773
• /
• 2010

Support vector machine (SVM) active learning plays a key role in the interactive content-based image retrieval (CBIR) community. However, the regular SVM active learning is challenged by what we call "the small example problem" and "the asymmetric distribution problem." This paper attempts to integrate the merits of semi-supervised learning, ensemble learning, and active learning into the interactive CBIR. Concretely, unlabeled images are exploited to facilitate boosting by helping augment the diversity among base SVM classifiers, and then the learned ensemble model is used to identify the most informative images for active learning. In particular, a bias-weighting mechanism is developed to guide the ensemble model to pay more attention on positive images than negative images. Experiments on 5000 Corel images show that the proposed method yields better retrieval performance by an amount of 0.16 in mean average precision compared to regular SVM active learning, which is more effective than some existing improved variants of SVM active learning.