• Title/Summary/Keyword: Simulation Service

Search Result 2,847, Processing Time 0.038 seconds

Distributed Hash Table based Service Discovery in Mobile Ad Hoc Network (모바일 애드 혹 네트워크에서 분산 해쉬 테이블 기반의 서비스 탐색 기법)

  • Jung, Jae-Hoon;Lee, Seung-Hak;Kim, Nam-Gi;Yoon, Hyn-Soo
    • Journal of KIISE:Information Networking
    • /
    • v.35 no.1
    • /
    • pp.91-97
    • /
    • 2008
  • In order to get a desired service in such environments, we need a service discovery method for discovering a device providing that service. In this paper, we propose a service discovery protocol which is based on DHTs (Distributed Hash Tables) to solve these problems. Our protocol is scalable since it does not require a central lookup server and does not rely on multicast or flooding. Simulation results show that our protocol is scalable and outperforms existing service discovery protocols.

A Semantic Service Discovery Network for Large-Scale Ubiquitous Computing Environments

  • Kang, Sae-Hoon;Kim, Dae-Woong;Lee, Young-Hee;Hyun, Soon-J.;Lee, Dong-Man;Lee, Ben
    • ETRI Journal
    • /
    • v.29 no.5
    • /
    • pp.545-558
    • /
    • 2007
  • This paper presents an efficient semantic service discovery scheme called UbiSearch for a large-scale ubiquitous computing environment. A semantic service discovery network in the semantic vector space is proposed where services that are semantically close to each other are mapped to nearby positions so that the similar services are registered in a cluster of resolvers. Using this mapping technique, the search space for a query is efficiently confined within a minimized cluster region while maintaining high accuracy in comparison to the centralized scheme. The proposed semantic service discovery network provides a number of novel features to evenly distribute service indexes to the resolvers and reduce the number of resolvers to visit. Our simulation study shows that UbiSearch provides good semantic searchability as compared to the centralized indexing system. At the same time, it supports scalable semantic queries with low communication overhead, balanced load distribution among resolvers for service registration and query processing, and personalized semantic matching.

  • PDF

Identifying the Dynamic Structure of Mobile Banking Market: The System Dynamics Perspective (모바일 뱅킹 시장의 동태적 구조 분석: 시스템 다이내믹스 관점)

  • Kim, Hyo-Gun;Yun, Sun-Hee;Suh, Hyun-Ju
    • The Journal of Information Systems
    • /
    • v.15 no.4
    • /
    • pp.99-124
    • /
    • 2006
  • The development of IT has made it possible to use various terminal systems for financial transaction and demands for financial survices are getting more and more diversified at the same time. Among others, mobile banking service market based on IC chips has been expanded its service areas and the number of mobile banking users has been increased. The study analyzes and tests the dynamic effects of the inflow of potential customers on mobile banking market condition by using system dynamics methodology to identify the dynamic structure of mobile banking market. The simulation model is designed to track the variation in the number of subscribers of mobile banking servides according to two scenarios, and the results are as follows; First the effect of word of mouth by customers who have used the service already is significant. The satisfactory level of early adopters is reflected in WOM, and as a test result shows, increase in word-of-mouth causes the growth of potential customers' demands for mobile banking service. Second, perceived attractiveness of mobile banking service market is another important construct. Factors such as convenience, mobility, time saving, security, and various services explain the construct perceived attractiveness of the service, and it makes the potential customers adopt the service, causing the increase of demands.

  • PDF

Price-Based Quality-of-Service Control Framework for Two-Class Network Services

  • Kim, Whan-Seon
    • Journal of Communications and Networks
    • /
    • v.9 no.3
    • /
    • pp.319-329
    • /
    • 2007
  • This paper presents a price-based quality-of-service (QoS) control framework for two-class network services, in which circuit-switched and packet-switched services are defined as "premium service class" and "best-effort service class," respectively. Given the service model, a customer may decide to use the other class as a perfect or an imperfect substitute when he or she perceives the higher utility of the class. Given the framework, fixed-point problems are solved numerically to investigate how static pricing can be used to control the demand and the QoS of each class. The rationale behind this is as follows: For a network service provider to determine the optimal prices that maximize its total revenue, the interactions between the QoS-dependent demand and the demand-dependent QoS should be thoroughly analyzed. To test the robustness of the proposed model, simulations were performed with gradually increasing customer demands or network workloads. The simulation results show that even with substantial demands or workloads, self-adjustment mechanism of the model works and it is feasible to obtain fixed points in equilibrium. This paper also presents a numerical example of guaranteeing the QoS statistically in the short term-that is, through the implementation of pricing strategies.

Spreadsheet Model Approach for Buffer-Sharing Line Production Systems with General Processing Times (일반 공정시간을 갖는 버퍼 공유 라인 생산시스템의 스프레드시트 모형 분석)

  • Seo, Dong-Won
    • Journal of the Korea Society for Simulation
    • /
    • v.28 no.2
    • /
    • pp.119-129
    • /
    • 2019
  • Although line production systems with finite buffers have been studied over several decades, except for some special cases there are no explicit expressions for system performances such as waiting times(or response time) and blocking probability. Recently, a max-plus algebraic approach for buffer-sharing systems with constant processing times was introduced and it can lead to analytic expressions for (higher) moment and tail probability of stationary waiting. Theoretically this approach can be applied to general processing times, but it cannot give a proper way for computing performance measures. To this end, in this study we developed simulation models using @RISK software and the expressions derived from max-plus algebra, and computed and compared blocking probability, waiting time (or response time) with respect to two blocking policies: communication(BBS: Blocking Before Service) and production(BAS: Blocking After Service). Moreover, an optimization problem which determines the minimum shared-buffer capacity satisfying a predetermined QoS(quality of service) is also considered.

A Voice Controlled Service Robot Using Support Vector Machine

  • Kim, Seong-Rock;Park, Jae-Suk;Park, Ju-Hyun;Lee, Suk-Gyu
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • pp.1413-1415
    • /
    • 2004
  • This paper proposes a SVM(Support Vector Machine) training algorithm to control a service robot with voice command. The service robot with a stereo vision system and dual manipulators of four degrees of freedom implements a User-Dependent Voice Control System. The training of SVM algorithm that is one of the statistical learning theories leads to a QP(quadratic programming) problem. In this paper, we present an efficient SVM speech recognition scheme especially based on less learning data comparing with conventional approaches. SVM discriminator decides rejection or acceptance of user's extracted voice features by the MFCC(Mel Frequency Cepstrum Coefficient). Among several SVM kernels, the exponential RBF function gives the best classification and the accurate user recognition. The numerical simulation and the experiment verified the usefulness of the proposed algorithm.

  • PDF

Cluster Routing for Service Lifetime of Wireless Multimedia Sensor Networks (무선 멀티미디어 센서 네트워크의 서비스 수명을 위한 클러스터 라우팅)

  • Lee, Chongdeuk
    • Journal of Digital Convergence
    • /
    • v.11 no.5
    • /
    • pp.279-284
    • /
    • 2013
  • This paper proposes a new cluster-based routing protocol for assuring the service lifetime of wireless multimedia sensor networks. The proposed protocol performs the intra-cluster routing and inter-cluster routing to reduce the energy consumption and service lifetime in the wireless sensor multimedia computing environment, and the proposed mechanism enhances the routing reliability, and it minimizes the packet loss, overhead, and energy consumption. The simulation results show that the proposed mechanism outperforms DSR and AODV.

New Interactive TV Service Model based on the MPEG-4 System

  • Kim, Jongho;Jechang Jeong
    • Proceedings of the IEEK Conference
    • /
    • 2002.07a
    • /
    • pp.125-128
    • /
    • 2002
  • In this paper, a new interactive TV service model is proposed. The MPEG-4 system is specified for composing and managing various object streams including user interactions. The data broadcasting model supporting user interactions is designed using MPEG-4 system in our proposal. We evaluate possibility of proposed service model using simulation player. This player supports MPEG-2 TS which contains MPEG-2 video and AC-3 audio streams as a main service and MPEC-4 system data as interactive services as well as user specific EPG information, and XML data, etc as supplemetary services. The player also supports a multi-channel environment. The synchronization between audio and visual data is achieved by DTS and PTS in TS.

  • PDF

Computer Based Simulation for Digital Differential Protection Relay of Power Transformer (컴퓨터기반의 변압기 디지털 비율차동계전기 시뮬레이션 알고리즘 개발)

  • Park, Jin-Soo;Cheon, Young-Sig;Park, Il-Ho;Park, Gwan-Chang
    • Proceedings of the KIEE Conference
    • /
    • 2011.07a
    • /
    • pp.762-763
    • /
    • 2011
  • 19세기말에 차동보호계전방식이 이미 적용되었고 시스템 보호에 가장 먼저 사용되는 방식 중에 하나였다. 이 방식은 고장전력설비의 기기를 보호하기위해 전류의 입출력값을 비교함으로 고장을 검출하는 방법을 사용한다. 결과적으로 비율차동보호방식은 완벽하게 고장구간을 검출할 수 있으므로 전력설비의 중요기기의 주보호로 적합한 시스템이라고 볼 수 있다. 본 논문 변압기의 내/외부사고유형에 따른 전자기계식과 디지털 보호계전기의 동작특성을 컴퓨터기반의 해석 S/W를 이용하여 모델링과 동작특성에 대한 분석을 통해 보호계전기 동작특성의 신뢰성검증과 전력계통을 시뮬레이션하기 위해 구성하였다. 특히, 비율차동특성 보호 알고리즘을 계전기별로 모듈화하기 위한 기본 구조설계에 초점을 맞추었고 외부사고에 대해 각 보호계전기 동작특성을 비교함으로써 보호계전기 응답특성에 검증하는 기초 데이터를 생성하는 과정도 기술하였다.

  • PDF

Differentiated Quality of Service Model in the Internet (인터넷에서의 차별화된 서비스품질 제공 방안)

  • Kim, Dong-Chul;Jang, Hee-Seon
    • IE interfaces
    • /
    • v.23 no.2
    • /
    • pp.193-202
    • /
    • 2010
  • The quality of service(QoS) model should be presented with the optimal network design to effectively provide the multimedia data services between users and converged services with mobile or TV in the next-generation Internet. In specific, the method to provide differentiated services for each user is needed in the given Internet node to offer the previously negotiated QoS with the user. In this paper, the performance of the QoS enabling technologies in the differentiated services(DiffServ) network domain is analyzed. The QoS offering model and QoS metrics are presented to analyze the performance of the major scheduling algorithms. Under the real network topology and virtual service scenarios in the university, the NS-2 network simulation based on the discrete-event is performed. The results show that the ratio-based scheduling method is more effective rather than the bandwidth-assignment method.