• 제목/요약/키워드: IT Resource Sharing

검색결과 297건 처리시간 0.035초

Evaluation and Challenges of Policy Responses to ABS (Nagoya Protocol) of Korea (우리나라 ABS(나고야의정서) 대응정책의 평가와 과제)

  • Hong, Heung-Deug;Lim, Hong-Tak;Cho, Eun Seol
    • Journal of Korea Technology Innovation Society
    • /
    • 제16권2호
    • /
    • pp.506-529
    • /
    • 2013
  • Nagoya protocol, alias ABS adopted in UN Convention on Biodiversity in 2010, has prompted governments in many countries to prepare strategic plans with regards to both the conservation of domestic bio-resources and the use of those with foreign origin. This study aims to evaluate the effectiveness of policy responses of Korean governments to ABS (Access and Benefit Sharing) and to make suggestions for a more integrative and efficient governance system for related ministries and institutions. Our analysis indicates that while most ministries have designated laws specifying various measures for the conservation of domestic bio-resources such as protected biological species or natural areas, just a couple of them have instituted measures governing the use of those resources and the benefit-sharing arising from it. We conclude that policy responses of Korean government are more focused on the conservation of bio-resources leaving the use of them ill-addressed. The study, thus, suggests that measures of 'bio-resource user country' be instituted in addition to those of 'bio-resource supplier country'. For instance, with regards to the use of bio-resources the roles and remits of related ministries had better be clarified and coordinated. The uncertainty over the explicit indication of 'place of origin' of bio-resources as a requirement of patent grant need to be cleared as well.

  • PDF

An Empirical Study on the Relationships among Safeguarding Mechanism, Relationship Learning, and Relationship Performance in Technology Cooperation Network by Applying Resource Based Theory (자원기반이론을 적용한 기술협력 네트워크에서 보호 메커니즘, 관계학습, 관계성과의 관계에 대한 실증연구)

  • Kang, Seok-Min
    • Management & Information Systems Review
    • /
    • 제35권2호
    • /
    • pp.45-66
    • /
    • 2016
  • Firms can make scale of economy and scope of economy by internalizing and using new advanced technology and knowledge from technology cooperation network, decrease risk and cost with partner firm of technology cooperation network, and increase market advantage of product & strengthen firms' position in the market. Due to the advantages of technology cooperation network, the related studies have focused on the positive effect of technology cooperation network. However, the related studies investigating the relationship between technology cooperation network and firm performance have only examined the role of technology cooperation network. Safeguarding mechanism, relationship learning, and relationship performance are categorized into the process of technology cooperation network, and this categorization is applied as resources, capability, and performance by resource based view. The empirical results are reported as belows. First, relationship specific investment and relationship capital positively affect on relationship learning as capability. Second, information sharing, common information understanding, and relationship specific memory development positively affect on long-term orientation, but information sharing has no impact on efficiency and effectiveness. Third, relationship specific investment positively affects on relationship capital and efficiency and effectiveness have positive effects on long-term orientation. Applying technology cooperation network in asymmetric technology dependency with resource based theory, this study suggested the importance of both safeguarding and relationship learning by investigating the relationship among safeguarding, relationship learning, and relationship performance. And it is worthy that this study investigated how firms' behavior change affects relationship performance in the relationship of technology cooperation partner.

  • PDF

A Data Sharing Algorithm of Micro Data Center in Distributed Cloud Networks (분산클라우드 환경에서 마이크로 데이터센터간 자료공유 알고리즘)

  • Kim, Hyuncheol
    • Convergence Security Journal
    • /
    • 제15권2호
    • /
    • pp.63-68
    • /
    • 2015
  • Current ICT(Information & Communication Technology) infrastructures (Internet and server/client communication) are struggling for a wide variety of devices, services, and business and technology evolution. Cloud computing originated simply to request and execute the desired operation from the network of clouds. It means that an IT resource that provides a service using the Internet technology. It is getting the most attention in today's IT trends. In the distributed cloud environments, management costs for the network and computing resources are solved fundamentally through the integrated management system. It can increase the cost savings to solve the traffic explosion problem of core network via a distributed Micro DC. However, traditional flooding methods may cause a lot of traffic due to transfer to all the neighbor DCs. Restricted Path Flooding algorithms have been proposed for this purpose. In large networks, there is still the disadvantage that may occur traffic. In this paper, we developed Lightweight Path Flooding algorithm to improve existing flooding algorithm using hop count restriction.

Providing survivability for virtual networks against substrate network failure

  • Wang, Ying;Chen, Qingyun;Li, Wenjing;Qiu, Xuesong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권9호
    • /
    • pp.4023-4043
    • /
    • 2016
  • Network virtualization has been regarded as a core attribute of the Future Internet. In a network virtualization environment (NVE), multiple heterogeneous virtual networks can coexist on a shared substrate network. Thus, a substrate network failure may affect multiple virtual networks. In this case, it is increasingly critical to provide survivability for the virtual networks against the substrate network failures. Previous research focused on mechanisms that ensure the resilience of the virtual network. However, the resource efficiency is still important to make the mapping scheme practical. In this paper, we study the survivable virtual network embedding mechanisms against substrate link and node failure from the perspective of improving the resource efficiency. For substrate link survivability, we propose a load-balancing and re-configuration strategy to improve the acceptance ratio and bandwidth utilization ratio. For substrate node survivability, we develop a minimum cost heuristic based on a divided network model and a backup resource cost model, which can both satisfy the location constraints of virtual node and increase the sharing degree of the backup resources. Simulations are conducted to evaluate the performance of the solutions. The proposed load balancing and re-configuration strategy for substrate link survivability outperforms other approaches in terms of acceptance ratio and bandwidth utilization ratio. And the proposed minimum cost heuristic for substrate node survivability gets a good performance in term of acceptance ratio.

Implementation and Evaluation of IoT Service System for Security Enhancement (보안성 향상을 위한 IoT 서비스 시스템 구현 및 평가)

  • Kim, Jin-bo;Kim, Mi-sun;Seo, Jae-hyun
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • 제27권2호
    • /
    • pp.181-192
    • /
    • 2017
  • Internet of Things includes the whole process of collected information generated from a variety of objects, as well as analyzing and sharing it, and providing useful information services to people. This study seeks ways to improve security and safety in the areas of service security technology, ID management technology and service access control, all of which take place in the IoT environment. We have implemented the services that can design and issue C&C (Certificate and Capability) service token authentication, which is based on a public key, to improve the service security. In addition, we suggest LCRS (Left Child-Right Sibling) resource model management for the efficient control of resources when generating the resource services from the data collected from node devices. We also implemented an IoT services platform to manage URL security of the resource services and perform access control for services.

Mandatory Access Control Protection Profile for Secure Operating System (보안 운영체제를 위한 강제적 접근 제어 보호 프로파일)

  • Ko Young Woong
    • Journal of the Korea Society of Computer and Information
    • /
    • 제10권1호
    • /
    • pp.141-148
    • /
    • 2005
  • Nowadays, it is possible to access sharing data from unauthorized People. Access control prevents unauthorized access to computing resource, information resources, and communication resources. It is very important to defend the critical system resources from the unauthorized. The importance of this study is to develop Protection Profile for Mandatory Access Control (MAC) that satisfies TCSEC assurance level B2. protection profile for MAC will help developers to use reference for the development of requirements and formulating security specification.

  • PDF

Hop-constrained multicast route packing with bandwidth reservation

  • Gang Jang Ha;Park Seong Su
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 대한산업공학회/한국경영과학회 2002년도 춘계공동학술대회
    • /
    • pp.402-408
    • /
    • 2002
  • Multicast technology allows the transmission of data from one source node to a selected group of destination nodes. Multicast routes typically use trees, called multicast routing trees, to minimize resource usage such as cost and bandwidth by sharing links. Moreover, the quality of service (QoS) is satisfied by distributing data along a path haying no more than a given number of arcs between the root node of a session and a terminal node of it in the routing tree. Thus, a multicast routing tree for a session can be represented as a hop constrained Steiner tree. In this paper, we consider the hop-constrained multicast route packing problem with bandwidth reservation. Given a set of multicast sessions, each of which has a hop limit constraint and a required bandwidth, the problem is to determine a set of multicast routing trees in an arc-capacitated network to minimize cost. We propose an integer programming formulation of the problem and an algorithm to solve it. An efficient column generation technique to solve the linear programming relaxation is proposed, and a modified cover inequality is used to strengthen the integer programming formulation.

  • PDF

A study on Framework for Sharable Metadata Interoperability (메타데이터 상호운용을 위한 프레임워크)

  • Choi, O-Hoon
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 한국정보처리학회 2004년도 춘계학술발표대회
    • /
    • pp.1449-1452
    • /
    • 2004
  • It is necessary to resolve the syntax, structure and semantic heterogeneity for sharing information resources. And the representative technologies are XML and Metadata. XML has been used to represent the syntax and structure, and metadata has been used to represent the semantic meaning of information resources. However, various metadata sets in one or more domains that have been developed by each independent organizations without any standards or guidelines, make it difficult to share their information resource. In this paper, we propose an interoperability framework (FSMI, Framework for Sharable Metadata Interoperability) on MDR (Metadata Registry) to increase the interoperability of XML encoded information resources between systems using different metadata sets.

  • PDF

Game Algorithm for Power Control in Cognitive Radio Networks (전파 인지 네트워크에서 전력 제어를 위한 게임 알고리즘)

  • Rho, Chang-Bae;Halder, N.;Song, Ju-Bin
    • Journal of Advanced Navigation Technology
    • /
    • 제13권2호
    • /
    • pp.201-207
    • /
    • 2009
  • Recently effective spectrum resource technologies have been studied using a game theorectical approach for cognitive radio networks. Radio resource management is required an effective scheme because the performance of a radio communication system much depends on it's effectiveness. In this paper, we suggest a game theoretical algorithm for adaptive power control which is required an effect scheme in cognitive radio networks. It will be a distributed network. In the network distributed cognitive radio secondary users require an adaptive power control. There are many results which are suggested some possibility of game theoretical approaches for communication resource sharing. However, we suggest a practical game algorithm to achieve Nash equilibrium of all secondary users using a Nash equilibrium theorem in this paper. Particularly, a game model was analyzed for adaptive power control of a cognitive radio network, which is involved in DSSS (Direct Sequence Spread Spectrum) techniques. In case of K=63 and N=12 in the DSSS network, the number of iteration was less than maximum 200 using the suggested algorithm.

  • PDF

Price-based Resource Allocation for Virtualized Cognitive Radio Networks

  • Li, Qun;Xu, Ding
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권10호
    • /
    • pp.4748-4765
    • /
    • 2016
  • We consider a virtualized cognitive radio (CR) network, where multiple virtual network operators (VNOs) who own different virtual cognitive base stations (VCBSs) share the same physical CBS (PCBS) which is owned by an infrastructure provider (InP), sharing the spectrum with the primary user (PU). The uplink scenario is considered where the secondary users (SUs) transmit to the VCBSs. The PU is protected by constraining the interference power from the SUs. Such constraint is applied by the InP through pricing the interference. A Stackelberg game is formulated to jointly maximize the revenue of the InP and the individual utilities of the VNOs, and then the Stackelberg equilibrium is investigated. Specifically, the optimal interference price and channel allocation for the VNOs to maximize the revenue of the InP and the optimal power allocation for the SUs to maximize the individual utilities of the VNOs are derived. In addition, a low‐complexity ±‐optimal solution is also proposed for obtaining the interference price and channel allocation for the VNOs. Simulations are provided to verify the proposed strategies. It is shown that the proposed strategies are effective in resource allocation and the ±‐optimal strategy achieves practically the same performance as the optimal strategy can achieve. It is also shown that the InP will not benefit from a large interference power limit, and selecting VNOs with higher unit rate utility gain to share the resources of the InP is beneficial to both the InP and the VNOs.