• Title/Summary/Keyword: distributed applications

Search Result 1,258, Processing Time 0.032 seconds

A Fairness Control Scheme in Multicast ATM Switches (멀티캐스트 ATM 스위치에서의 공정성 제어 방법)

  • 손동욱;손유익
    • Journal of KIISE:Information Networking
    • /
    • v.30 no.1
    • /
    • pp.134-142
    • /
    • 2003
  • We present an ATM switch architectures based on the multistage interconnection network(MIN) for the efficient multicast traffic control. Many of these applications require multicast connections as well as point-to-point connections. Muiticast connection in which the same message is delivered from a source to arbitrary number of destinations is fundamental in the areas such as teleconferencing, VOD(video on demand), distributed data processing, etc. In designing the multicast ATM switches to support those services, we should consider the fairness(impartiality) and priority control, in addition to the overflow problem, cell processing with large number of copies, and the blocking problem. In particular, the fairness problem which is to distribute the incoming cells to input ports smoothly is occurred when a cell with the large copy number enters upper input port. In this case, the upper input port sends before the lower input port because of the calculating method of running sum, and therefore cell arrived into lower input port Is delayed to next cycle to be sent and transmission delay time becomes longer. In this paper, we propose the cell splitting and group splitting algorithm, and also the fairness scheme on the basis of the nonblocking characteristics for issuing appropriate copy number depending on the number of Input cell in demand. We evaluate the performance of the proposed schemes in terms of the throughput, cell loss rate and cell delay.

Open GIS Component Software Ensuring an Interoperability of Spatial Information (공간정보 상호운용성 지원을 위한 컴포넌트 기반의 개방형 GIS 소프트웨어)

  • Choe, Hye-Ok;Kim, Gwang-Su;Lee, Jong-Hun
    • The KIPS Transactions:PartD
    • /
    • v.8D no.6
    • /
    • pp.657-664
    • /
    • 2001
  • The Information Technology has progressed to the open architecture, component, and multimedia services under Internet, ensuring interoperability, reusability, and realtime. The GIS is a system processing geo-spatial information such as natural resources, buildings, roads, and many kinds of facilities in the earth. The spatial information featured by complexity and diversity requires interoperability and reusability of pre-built databases under open architecture. This paper is for the development of component based open GIS Software. The goal of the open GIS component software is a middleware of GIS combining technology of open architecture and component ensuring interoperability of spatial information and reusability of elementary pieces of GIS software. The open GIS component conforms to the distributed open architecture for spatial information proposed by OGC (Open GIS Consortium). The system consists of data provider components, kernel (MapBase) components, clearinghouse components and five kinds of GIS application of local governments. The data provider component places a unique OLE DB interface to connect and access diverse data sources independent of their formats and locations. The MapBase component supports core and common technology of GIS feasible for various applications. The clearinghouse component provides functionality about discovery and access of spatial information under Internet. The system is implemented using ATL/COM and Visual C++ under MicroSoft's Windows environment and consisted of more than 20 components. As we made case study for KSDI (Korea Spatial Data Infrastructure) sharing spatial information between local governments, the advantage of component based open GIS software was proved. Now, we are undertaking another case study for sharing seven kinds of underground facilities using the open GIS component software.

  • PDF

Design and Implementation of PS-Block Timing Model Using PS-Block Structue (PS-Block 구조를 사용한 PS-Block Timing Model의 설계 및 구현)

  • Kim Yun-Kwan;Shin Won;Chang Chun-Hyon;Kim Tae-Wan
    • The KIPS Transactions:PartD
    • /
    • v.13D no.3 s.106
    • /
    • pp.399-404
    • /
    • 2006
  • A real-time system is used for various systems from small embedded systems to distributed enterprise systems. Because it has a characteristic that provides a service on time, developers should make efforts to keep this property about time when developing real-time applications. As the result of research about real-time system indicates, TMO model supports various functions for time processing according to the real-time concept. And it guarantees response time which developers defined. So developers need a point of reference to define deadline and check the correctness of time. This paper proposes an improved PS-Block as an infrastructure of analysis tools for TMO to present a point of reference. There is a problem that the existing PS-Block has overhead caused by a policy making duplicated blocks. As such, this paper implements a PS-Block Timing Model to reduce the overhead due to block duplication, and defines a base class for searching in PS-Block. The PS-Block Timing Model, using an improved PS-Block structure, offers a point of reference of deadline and an infrastructure of execution time analysis according to the PS-Block configuration policy. Therefore, TMO developers can easily verify deadline of real-time methods, and improve reliability, and reduce development terms.

A Network-based Locator-Identifier Separation Scheme using DHT in SDN (SDN환경에서 DHT를 이용한 네트워크 기반 위치자-식별자 분리 기술)

  • Lee, Chan-Haeng;Min, Sung-Gi;Choi, Chang-Won
    • Journal of Internet of Things and Convergence
    • /
    • v.2 no.2
    • /
    • pp.37-49
    • /
    • 2016
  • An IP address is used as a host identifier and a locator to bind hosts and applications to their location in existing Internet. Several protocols are proposed to eliminate this binding. Most of these protocols use IPv6-based host identifiers to maintain compatibility with existing Internet, but these identifiers cannot be handled by standard IPv6 routers because such identifiers are unroutable. Therefore, host identifiers need to be usually converted to locators at hosts, and the standard IPv6 protocol should be modified to interoperate with these protocols. In this paper, we propose a network-based host identifier locator separating scheme in software-defined networking. The proposed scheme separates the underlying network into Host Identity and IP domains in order to directly forward unroutable identifiers. The Host Identity domain operates as an overlaid network over IP domain, and it makes the unroutable identifiers to be routable using distributed hash table based routing strategy. For the evaluation, we compared the proposed scheme with the previous scheme using signaling costs and packet delivery costs. The result shows that the proposed scheme is more suitable in the recent mobile-based environments.

An Improvement in K-NN Graph Construction using re-grouping with Locality Sensitive Hashing on MapReduce (MapReduce 환경에서 재그룹핑을 이용한 Locality Sensitive Hashing 기반의 K-Nearest Neighbor 그래프 생성 알고리즘의 개선)

  • Lee, Inhoe;Oh, Hyesung;Kim, Hyoung-Joo
    • KIISE Transactions on Computing Practices
    • /
    • v.21 no.11
    • /
    • pp.681-688
    • /
    • 2015
  • The k nearest neighbor (k-NN) graph construction is an important operation with many web-related applications, including collaborative filtering, similarity search, and many others in data mining and machine learning. Despite its many elegant properties, the brute force k-NN graph construction method has a computational complexity of $O(n^2)$, which is prohibitive for large scale data sets. Thus, (Key, Value)-based distributed framework, MapReduce, is gaining increasingly widespread use in Locality Sensitive Hashing which is efficient for high-dimension and sparse data. Based on the two-stage strategy, we engage the locality sensitive hashing technique to divide users into small subsets, and then calculate similarity between pairs in the small subsets using a brute force method on MapReduce. Specifically, generating a candidate group stage is important since brute-force calculation is performed in the following step. However, existing methods do not prevent large candidate groups. In this paper, we proposed an efficient algorithm for approximate k-NN graph construction by regrouping candidate groups. Experimental results show that our approach is more effective than existing methods in terms of graph accuracy and scan rate.

A Technique to Specify and Generate .NET Components in MDA/PSM for Pervasive Service (MDA/PSM상에서 퍼베이시브 서비스를 지원하는 닷넷 컴포넌트의 명세 및 생성 기법)

  • Kum, Deuk-Kyu;Kim, Soo-Dong
    • Journal of KIISE:Software and Applications
    • /
    • v.34 no.7
    • /
    • pp.635-645
    • /
    • 2007
  • Component technology has been widely accepted as an effective way for building software systems with reusable components, and Microsoft (MS) .NET is one of the recent representative component technologies. Model Driven Architecture (MDA) is a new development paradigm which generates software by transforming design models automatically and incrementally. Transformation of structural models in MDA has been successfully applied. However, transformation of dynamic models and pervasive services, such as transaction service, security service, synchronization service and object pooling are largely remains as an area for further research. The recent enterprise system has multi tier distributed architecture, and the functionality of early mentioned pervasive services is essential for this architecture. .NET platform can implement Component Object Model+ (COM+) component for supporting pervasive services by specify Attribute code. In this paper, we specify the functionalities of the COM+ component offering pervasive services, and then those functionalities are defined by UML profile. By using the profile, the Platform Specific Model (PSM) for .NET/C# is specified, and .NET components are automatically generated through our tool. The development productivity, extensibility, portability, and maintenance of software can be dramatically improved by using of the proposed methods.

Localization Scheme with Weighted Multiple Rings in Wireless Sensor Networks (무선 센서 네트워크에서 가중 다중 링을 이용한 측위 기법)

  • Ahn, Hong-Beom;Hong, Jin-Pyo
    • Journal of KIISE:Information Networking
    • /
    • v.37 no.5
    • /
    • pp.409-414
    • /
    • 2010
  • The applications based on geographical location are increasing rapidly in wireless sensor networks (WSN). Recently, various localization algorithms have been proposed but the majority of algorithms rely on the specific hardware to measure the distance from the signal sources. In this paper, we propose the Weighted Multiple Rings Localization(WMRL). We assume that each deployed anchor node may periodically emit the successive beacon signals of the different power level. Then, the beacon signals form the concentric rings depending on their emitted power level, theoretically. The proposed algorithm defines the different weighting factor based on the ratio of each radius of ring. Also, If a sensor node may listen, it can find the innermost ring of the propagated signal for each anchor node. Based on this information, the location of a sensor node is derived by a weighted sum of coordinates of the surrounding anchor nodes. Our proposed algorithm is fully distributed and does not require any additional hardwares and the unreliable distance indications such as RSSI and LQI. Nevertheless, the simulation results show that the WMRL with two rings twice outperforms centroid algorithm. In the case of WMRL with three rings, the accuracy is approximately equal to WCL(Weighted Centroid Localization).

Implementation and Validation of EtherCAT Support in Integrated Development Environment for Synchronized Motion Control Application (동기 모션 제어 응용을 위한 통합개발환경의 EtherCAT 지원 기능 구현 및 검증)

  • Lee, Jongbo;Kim, Chaerin;Kim, Ikhwan;Kim, Youngdong;Kim, Taehyoun
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.38 no.2
    • /
    • pp.211-218
    • /
    • 2014
  • Recently, software-based programmable logic controller (PLC) systems, which are implemented in standard PLC languages on general hardware, are gaining popularity because they overcome the limitations of classical hardware PLC systems. Another noticeable trend is that the use of integrated development environment (IDE) is becoming important. IDEs can help developers to easily manage the growing complexity of modern control systems. Furthermore, industrial Ethernet, e.g. EtherCAT, is becoming widely accepted as a replacement for conventional fieldbuses in the distributed control domain because it offers favorable features such as short transmission delay, high bandwidth, and low cost. In this paper, we implemented the extension of open source IDE, called Beremiz, for developing EtherCAT-based real-time, synchronized motion control applications. We validated the EtherCAT system management features and the real-time responsiveness of the control function by using commercial EtherCAT drives and evaluation boards.

Practical Quality Model for Measuring Service Performance in SOA (SOA 서비스 성능 측정을 위한 실용적 품질모델)

  • Oh, Sang-Hun;Choi, Si-Won;Kim, Soo-Dong
    • The KIPS Transactions:PartD
    • /
    • v.15D no.2
    • /
    • pp.235-246
    • /
    • 2008
  • Service-Oriented Architecture (SOA) is emerging as an effective approach for developing applications by dynamically discovering and composing reusable services. Generally, the benefits of SOA are known as low-development cost, high agility, high scalability, business level reuse, etc. However, a representative problem for widely applying SOA is the performance problem. This is caused by the nature of SOA such as service deployment and execution in distributed environment, heterogeneity of service platforms, use of a standard message format, etc. Therefore, performance problem has to be overcome to effectively apply SOA, and service performance has to be measured precisely to analyze where and why the problem has occurred. Prerequisite for this is a definition of a quality model to effectively measure service performance. However, current works on service performance lacks in defining a practical and precise quality model for measuring performance which adequately addresses the execution environment and features of SOA. Hence, in this paper, we define a quality model which includes a set of practical metrics for measuring service performance and an effective technique to measure the value of the proposed metrics. In addition, we apply the metrics for Hotel Reservation Service System (HRSS) to show the practicability and usefulness of the proposed metrics.

Agile Framework for SOA-based Application Development (SOA 기반 애플리케이션 개발을 위한 Agile 프레임워크)

  • Shin, Seung-Woo;Kim, Haeng-Kon
    • The KIPS Transactions:PartD
    • /
    • v.16D no.1
    • /
    • pp.55-64
    • /
    • 2009
  • Various business model and computing environments are currently merged into web services and many web related application products are also develop. Most of IT enterprises in Korea use the Service-oriented architecture (SOA) whenever they develop the web applications. SOA is an approach to loosely coupled, protocol independent, standards-based distributed computing where software resources available on the network are considered as Services. SOA is believed to become the future enterprise technology solution that promises the agility and flexibility the business users have been looking for by leveraging the integration process through composition of the services spanning multiple enterprises. But, There are no specific development methodology to apply into SOA standard model until now. The developer uses the currently existing methodology to develop the application with SOA. The users have some limitations to use it. In this paper, we suggest a Frameworks for applying agile methodology into SOA to address the productivity and quality of small web related project. We design and implement a frameworks architecture for applying the agile method into SOA and describe the process model to implement it. We finally evaluate the frameworks with productivity, flexibility and maintainability.