• Title/Summary/Keyword: cost sharing mechanism

Search Result 25, Processing Time 0.028 seconds

Improving Overall WMN Performance in Peak Times Using Load-sharing Aware Gateways

  • Vo, Hung Quoc;Dai, Tran Thanh;Hong, Choong-Seon
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2007.05a
    • /
    • pp.855-857
    • /
    • 2007
  • In recent years, Wireless Mesh Network (WMN) is a compelling topic to many network researchers due to its low cost in deployment, ease and simplicity in installation and scalability and robustness in operation. In WMN, Gateway nodes (Access Point-AP) are in charge of steering the traffic from the external network (e.g. Internet...) to client devices or mesh clients. The limited bandwidth of wireless links between Gateways and intermediate mesh routers makes the Gateways becomes the bottleneck of the mesh network in both uplink stream and downlink stream. In this paper, we propose a mechanism to permit Gateways collaboratively work to manipulate the traffic to fit our network. They will move the traffic from congested links to the unused capacity on other links.

Functional Requirements about Modeling Methodology for CALS (CALS 구현을 위한 모델링 방법론의 기능조건)

  • 김철한;우훈식;김중인;임동순
    • The Journal of Society for e-Business Studies
    • /
    • v.2 no.2
    • /
    • pp.89-113
    • /
    • 1997
  • Modeling methodology has been widely used for analysis and design of a information system. Specially, under the CALS environments, modeling approach is more important because the enterprise functions are inter-related and information sharing speeds up the business. In this paper, we suggest functional requirements about modeling methodology for CALS by surveying the IDEF0 and ARIS. The former is FIPS 183 and the latter is basic methodology of SAP/R3 which is world-wide ERP system. The proposed functional requirements include all semantics of IDEF0 and adds some features. The first is adding modeling components which are semantic representations. In addition to ICOMs, we add the time and cost component which is required to execute the function. The second is tracing mechanism. When we need some information, we drive the functions related with the information by reverse tracing of the function which produces the information as a output and input. Through the tracing, we find out the bottleneck process or high cost process. This approach guarantees the integrity of data by designating the data ownership. Finally, we suggest the final decomposition level. We call the final decomposed function into unit function which has only one output data. We can combine and reconstruct some of functions such as 'lego block' combination.

  • PDF

A cross-domain access control mechanism based on model migration and semantic reasoning

  • Ming Tan;Aodi Liu;Xiaohan Wang;Siyuan Shang;Na Wang;Xuehui Du
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.18 no.6
    • /
    • pp.1599-1618
    • /
    • 2024
  • Access control has always been one of the effective methods to protect data security. However, in new computing environments such as big data, data resources have the characteristics of distributed cross-domain sharing, massive and dynamic. Traditional access control mechanisms are difficult to meet the security needs. This paper proposes CACM-MMSR to solve distributed cross-domain access control problem for massive resources. The method uses blockchain and smart contracts as a link between different security domains. A permission decision model migration method based on access control logs is designed. It can realize the migration of historical policy to solve the problems of access control heterogeneity among different security domains and the updating of the old and new policies in the same security domain. Meanwhile, a semantic reasoning-based permission decision method for unstructured text data is designed. It can achieve a flexible permission decision by similarity thresholding. Experimental results show that the proposed method can reduce the decision time cost of distributed access control to less than 28.7% of a single node. The permission decision model migration method has a high decision accuracy of 97.4%. The semantic reasoning-based permission decision method is optimal to other reference methods in vectorization and index time cost.

Sharing of DLNA Media Contents among Inter-homes based on DHCP or Private IP using Homeserver (동적 사설 IP 기반의 다중 홈간 DLNA 미디어 컨텐츠 공유)

  • Oh, Yeon-Joo;Lee, Hoon-Ki;Kim, Jung-Tae;Paik, Eui-Hyun
    • The KIPS Transactions:PartC
    • /
    • v.13C no.6 s.109
    • /
    • pp.709-716
    • /
    • 2006
  • According to the increase of various AV media devices and contents in the digital home, the DLNA becomes to play an important role as the interoperability standard between then Since this guideline only focuses on the interoperability among home networked devices, media players, and media contents existing inside of the homenetwork, there is no retrieval and transmission method for sharing multimedia contents located over several homes via Internet. Additionally, this guideline lets device-detection and notification messages to be transmitted using W multicast methods, and current Internet environment cannot guarantee consistent IP multicast services, it has the limitation that it cannot retrieve and control DLNA devices in other digital homes remotely via the Internet. Therefore, in this paper, we propose the IHM(Inter-Home Media) proxy system and its operating mechanism to provide a way of sharing media contents distributed over multiple DLNA-based homes, through analyzing these limitations and building up a sharing method for A/V media contents distributed over the DLNA homes based on the dynamic or private IP networks. Our method removes the limitation on the user locations through sharing distributed media contents, and also makes cost-downs for storing media contents, from the view point of individual residents.

Implementation of Ring Topology Interconnection Network with PCIe Non-Transparent Bridge Interface (PCIe Non-Transparent Bridge 인터페이스 기반 링 네트워크 인터커넥트 시스템 구현)

  • Kim, Sang-Gyum;Lee, Yang-Woo;Lim, Seung-Ho
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.8 no.3
    • /
    • pp.65-72
    • /
    • 2019
  • HPC(High Performance Computing) is the computing system that connects a number of computing nodes with high performance interconnect network. In the HPC, interconnect network technology is one of the key player to make high performance systems, and mainly, Infiniband or Ethernet are used for interconnect network technology. Nowadays, PCIe interface is main interface within computer system in that host CPU connects high performance peripheral devices through PCIe bridge interface. For connecting between two computing nodes, PCIe Non-Transparent Bridge(NTB) standard can be used, however it basically connects only two hosts with its original standards. To give cost-effective interconnect network interface with PCIe technology, we develop a prototype of interconnect network system with PCIe NTB. In the prototyped system, computing nodes are connected to each other via PCIe NTB interface constructing switchless interconnect network such as ring network. Also, we have implemented prototyped data sharing mechanism on the prototyped interconnect network system. The designed PCIe NTB-based interconnect network system is cost-effective as well as it provides competitive data transferring bandwidth within the interconnect network.

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
    • /
    • v.35 no.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

Development of Agent-based Platform for Coordinated Scheduling in Global Supply Chain (글로벌 공급사슬에서 경쟁협력 스케줄링을 위한 에이전트 기반 플랫폼 구축)

  • Lee, Jung-Seung;Choi, Seong-Woo
    • Journal of Intelligence and Information Systems
    • /
    • v.17 no.4
    • /
    • pp.213-226
    • /
    • 2011
  • In global supply chain, the scheduling problems of large products such as ships, airplanes, space shuttles, assembled constructions, and/or automobiles are complicated by nature. New scheduling systems are often developed in order to reduce inherent computational complexity. As a result, a problem can be decomposed into small sub-problems, problems that contain independently small scheduling systems integrating into the initial problem. As one of the authors experienced, DAS (Daewoo Shipbuilding Scheduling System) has adopted a two-layered hierarchical architecture. In the hierarchical architecture, individual scheduling systems composed of a high-level dock scheduler, DAS-ERECT and low-level assembly plant schedulers, DAS-PBS, DAS-3DS, DAS-NPS, and DAS-A7 try to search the best schedules under their own constraints. Moreover, the steep growth of communication technology and logistics enables it to introduce distributed multi-nation production plants by which different parts are produced by designated plants. Therefore vertical and lateral coordination among decomposed scheduling systems is necessary. No standard coordination mechanism of multiple scheduling systems exists, even though there are various scheduling systems existing in the area of scheduling research. Previous research regarding the coordination mechanism has mainly focused on external conversation without capacity model. Prior research has heavily focuses on agent-based coordination in the area of agent research. Yet, no scheduling domain has been developed. Previous research regarding the agent-based scheduling has paid its ample attention to internal coordination of scheduling process, a process that has not been efficient. In this study, we suggest a general framework for agent-based coordination of multiple scheduling systems in global supply chain. The purpose of this study was to design a standard coordination mechanism. To do so, we first define an individual scheduling agent responsible for their own plants and a meta-level coordination agent involved with each individual scheduling agent. We then suggest variables and values describing the individual scheduling agent and meta-level coordination agent. These variables and values are represented by Backus-Naur Form. Second, we suggest scheduling agent communication protocols for each scheduling agent topology classified into the system architectures, existence or nonexistence of coordinator, and directions of coordination. If there was a coordinating agent, an individual scheduling agent could communicate with another individual agent indirectly through the coordinator. On the other hand, if there was not any coordinating agent existing, an individual scheduling agent should communicate with another individual agent directly. To apply agent communication language specifically to the scheduling coordination domain, we had to additionally define an inner language, a language that suitably expresses scheduling coordination. A scheduling agent communication language is devised for the communication among agents independent of domain. We adopt three message layers which are ACL layer, scheduling coordination layer, and industry-specific layer. The ACL layer is a domain independent outer language layer. The scheduling coordination layer has terms necessary for scheduling coordination. The industry-specific layer expresses the industry specification. Third, in order to improve the efficiency of communication among scheduling agents and avoid possible infinite loops, we suggest a look-ahead load balancing model which supports to monitor participating agents and to analyze the status of the agents. To build the look-ahead load balancing model, the status of participating agents should be monitored. Most of all, the amount of sharing information should be considered. If complete information is collected, updating and maintenance cost of sharing information will be increasing although the frequency of communication will be decreasing. Therefore the level of detail and updating period of sharing information should be decided contingently. By means of this standard coordination mechanism, we can easily model coordination processes of multiple scheduling systems into supply chain. Finally, we apply this mechanism to shipbuilding domain and develop a prototype system which consists of a dock-scheduling agent, four assembly- plant-scheduling agents, and a meta-level coordination agent. A series of experiments using the real world data are used to empirically examine this mechanism. The results of this study show that the effect of agent-based platform on coordinated scheduling is evident in terms of the number of tardy jobs, tardiness, and makespan.

Private Certification Method of ePedigree for Cooperatives (협동조합을 위한 전자 페디그리 사설인증 방법)

  • Kim, Sangsik;Chae, Myungsu;Jung, Sungkwan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2016.10a
    • /
    • pp.463-466
    • /
    • 2016
  • Sharing of product and process information with partners is a basic activity and key requirement which ensures success of distribution. ePedigree that encapsulates all of the event data from manufacturer to retail shop provides a flexible mechanism of storing and sharing traceable information to the partners of supply chain and credibility of shared information through digital signature based on Public Key Infrastructure (PKI). To generate the signature that can be authenticated through PKI, the partners of supply chain should pay for PKI certificates from Certificate Authority (CA). In case of agrifood cooperatives which consist of petty merchants or farmers, it is hard to pay for the PKI certificate for all members and is a big obstacle for the ePedigree to be applied to the supply chain. This paper proposes a private certification method of ePedigree for cooperatives. Cooperatives can apply the ePedigree using the proposed method to all the members at small cost and the proposed method can assure the credibility of information at the same level of the previous ePedigree.

  • PDF

CALS System Development Methodology Using Document Trace Diagram and IDEF Model (Document Trace Diagram 과 IDEF 모델을 이용한 CALS 시스템 개발 방법론)

  • Kim, Soung-Hie;Cho, Sung-Sik;Lee, Jae-Kwang;Han, Chang-Hee;Yoon, Young-Suk
    • Asia pacific journal of information systems
    • /
    • v.8 no.3
    • /
    • pp.37-49
    • /
    • 1998
  • The basic goal of CALS is to improve transactions and relationships among organizations through information sharing and integration. CALS is an information strategy which needs strong cooperation between organizations or between users and developers in design step. However, current design methodologies using IDEF models, that are considered to be standard for CALS system development, has some limitations. For example, it is difficult for system developers to communicate with counterparts by IDEF model since IDEF models are difficult for counterparts to understand. In this paper, we suggest a development methodology for GALS systems by complementing IDEF model with Document Trace Diagram, which we developed as a communication tool, The concept of Document Trace Diagram stems from the fact that most information exchanged within or between organizations is in the form of documents and most standard operating procedures of organizations are about processing the documents. It helps system developers identify functions and their ICOMs (Input, Control, Output, Mechanism) with ease and little communication cost. With this methodology, we have constructed the GALS prototype system for construction industry.

  • PDF

공공연구기관의 기술이전모형연구와 그 정책적 함의 발표분야 : 기술경제, 기술정책분야(기술이전)

  • 류태규;박종복;이정동;김태유
    • Proceedings of the Technology Innovation Conference
    • /
    • 2002.06a
    • /
    • pp.203-223
    • /
    • 2002
  • In Korea, Public Research Institutes(PRIs) are today faced with the challenges of creating values by transferring technologies in store within themselves to private commercial sector. Recently, It has been increasingly pointed out that PRIs have the poor capability to valuate prospective technologies of their own, and don't run the reasonable technology transfer mechanism in terms of establishing royalty rate and initial payment, designing remuneration to inventor, screening qualified licensee, and controlling the moral hazard. This paper develops an enhanced mathematical model of technology transfer from a PRI to a private industrial firm with including the inventor as an important player. The model is made up of the main part which derives the optimal royalty rate by maximizing the social welfare and sharing risk fairly between players and some sub-parts. The one sub-part is a principal-agent model which makes it possible to control the moral hazard of inventors, and the other part provides the criteria for screening appropriate licensees. Moreover, the moral hazard between inventor and licensee is addressed by introducing the cost reduction function of efforts exerted by them. The model is able to relate the optimal royalty rate to the parameters that represent the environments under which the concerned parties operate. Especially, the ratio of initial payment over the value of transferred technology is calculated from the binding relation with the royalty rate. The paper shows that the model suggested here is more enhanced by comparing with the existing technology transfer mechanism. Finally, the paper allows us to find better strategies for effective technology transfer and further develop more sophisticated technology transfer model.

  • PDF