• 제목/요약/키워드: Simulation service utilization

검색결과 218건 처리시간 0.031초

차별화된 서비스를 갖는 인터넷 망에서 호 블로킹 확률의 공평성을 위한 수락 제어 정책 Heuristic 알고리즘 연구 (Admission Control Policy Heuristic Algorithm for fairness of Call Blocking Probability in Differentiated Service Networks)

  • 민준기;이우섭;정중수
    • 인터넷정보학회논문지
    • /
    • 제6권3호
    • /
    • pp.121-128
    • /
    • 2005
  • 최근, 차별 서비스 망에서는 다양한 차세대 인터넷 서비스들을 지원하기 위해 효율적인 자원 관리를 위한 연구로서 동적 프로비저닝 (Dynamic Provisioning) 기법들을 이용한 수락 제어 메커니즘 연구가 활발히 진행되고 있다. 하지만, 수락 제어 메커니즘이 망에 적용되더라도 서로 다른 대역폭을 요구하는 서비스들에 대한 호 설정 요구가 들어오며 불공평한 호 블로킹 확률이 존재한다. 본 논문에서는 큰 대역폭을 요구하는 서비스와 작은 대역폭을 요구하는 서비스들 사이에 공평한 호 블로킹 확률을 제공하는 새로운 수락 제어 정책 Heuristic 알고리즘을 제안한다. 특히 제안된 알고리즘은 모의 실험 결과를 통하여 호 블로킹 확률의 공평성 및 높은 대역폭의 사용율을 제공할 수 있음을 보여 주었다.

  • PDF

Fair Peer Assignment Scheme for Peer-to-Peer File Sharing

  • Hu, Chih-Lin;Chen, Da-You;Chang, Yi-Hsun;Chen, Yu-Wen
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제4권5호
    • /
    • pp.709-735
    • /
    • 2010
  • The reciprocal virtue of peer-to-peer networking has stimulated an explosion of peer population and service capacity, ensuring rapid content distribution in peer-to-peer networks. Critical issues such as peer churn, free riding, and skewed workload significantly affect performance results such as service agility, fairness, and resource utilization. To resolve these problems systematically, this study proposes a peer assignment scheme that supports fair peer-to-peer file sharing applications. The proposed scheme exploits the peer duality of both server-oriented peer capacity and client-oriented peer contribution. Accordingly, the system server can prioritize download requests and appropriately assign server peers to uploading file objects. Several functional extensions, including peer substitution and elimination, bandwidth adjustment, and distributed modification, help cope with subtle situations of service starvation and download blocking, and hence make the system design robust and amenable. Simulation results show this design is examined under both centralized and distributed peer-to-peer environments. Performance results confirm that the proposed mechanisms are simple but effective in maintaining service agility and fairness, without loss of overall service capacity in peer-to-peer files sharing systems.

시뮬레이션을 이용한 금융 ATM기 유지보수의 효율적 운영에 관한 연구 (A Study on the Efficient Operation of Automated Teller Machine(ATM) Maintenance Using Simulation)

  • 유형근;이강원
    • 경영과학
    • /
    • 제28권1호
    • /
    • pp.107-116
    • /
    • 2011
  • The automated teller machine (ATM) is developed as a system to provide customers with an easy deposit and withdrawal of their money without time restriction and be served for 24 hours. Today, ATM is come up to the level of an unmanned branch. The automatic financing system is developed as an essential one for dealing with the rationalization of management and the globalization of financing in order to improve the efficiency of financial management work and increase the customer service quality. With reducing the operational cost of financial organizations through the efficient maintenance operation of ATM and increasing the service quality through the maximization of its processing efficiency, this study is to draw the scheme to ensure the competitiveness among the finance companies. The importance of ATM is highly recognized as the utilization of ATM is increased and the processing function is extended, but ATM is quite vulnerable to the malfunction occurred during the nighttime after banking hours. The ATM maintenance is done through consignment to the specialized maintenance company. The efficient operation of ATM maintenance work is important to the satisfaction of customer using ATM in the nighttime.

Evaluating C-RAN Fronthaul Functional Splits in Terms of Network Level Energy and Cost Savings

  • Checko, Aleksandra;Avramova, Andrijana P.;Berger, Michael S.;Christiansen, Henrik L.
    • Journal of Communications and Networks
    • /
    • 제18권2호
    • /
    • pp.162-172
    • /
    • 2016
  • The placement of the complete baseband processing in a centralized pool results in high data rate requirement and inflexibility of the fronthaul network, which challenges the energy and cost effectiveness of the cloud radio access network (C-RAN). Recently, redesign of the C-RAN through functional split in the baseband processing chain has been proposed to overcome these challenges. This paper evaluates, by mathematical and simulation methods, different splits with respect to network level energy and cost efficiency having in the mind the expected quality of service. The proposed mathematical model quantifies the multiplexing gains and the trade-offs between centralization and decentralization concerning the cost of the pool, fronthaul network capacity and resource utilization. The event-based simulation captures the influence of the traffic load dynamics and traffic type variation on designing an efficient fronthaul network. Based on the obtained results, we derive a principle for fronthaul dimensioning based on the traffic profile. This principle allows for efficient radio access network with respect to multiplexing gains while achieving the expected users' quality of service.

A Certificate Revocation List Distribution Scheme over the eMBMS for Vehicular Networks

  • Kim, Hyun-Gon
    • 한국컴퓨터정보학회논문지
    • /
    • 제21권10호
    • /
    • pp.77-83
    • /
    • 2016
  • To verify the trustworthiness of messages, public key certificates and certificate revocation list(CRL) has been standardized for vehicular networks. However, timely distribution of large CRLs to vehicles should be more elaborated with low bandwidth utilization from a practical point of view. To address this concern, we propose a CRL distribution scheme using long term evolution(LTE) point-to-multicast transmission, namely the enhanced multimedia broadcast multicast service(eMBMS). The schem is much more resource efficient than the existing unicast CRL distribution schemes for vehicular networks and it allows realizing the regional CRL distribution schemes efficiently in LTE network. By means of ns-3 simulation, we analyze the performance, latency, and execution time of the scheme in terms of varying coverage of the multimedia broadcast multicast service over single frequency network (MBFSN).

cdma2000에서 실시간 멀티미디어를 지원하는 다중 액세스 기법 (Multiple Access Scheme for Realtime Multimedia in cdma2000)

  • 이종찬;정혜명;문영성
    • 한국정보처리학회논문지
    • /
    • 제7권5호
    • /
    • pp.1536-1543
    • /
    • 2000
  • 본 연구에서는 cdma2000기술에 기반한 IMT-2000에서 CDMA MAC을 이용한 실시간 데이터 및 비실시간 데이타를 효율적으로 전송할 수 잇는 다중 엑세스 기법을 제안한다. 이 방식은 깆노의 회선형 방식과 달리 패킷형 서비스를 지원하다. 실시간 데이타의 가변 전송률에 근거한 대역의 통계적 다중화 기법을 통하여 가임자 용량을 극대화하였다. 시뮬레이션을 통하여 전송 지연고 채널 이용률 등의 성능을 회선형 방식과 비교한다.

  • PDF

Resource Allocation for QoS Provisioning in Overlaid Macrocell-Femtocell Networks

  • Lee, Jong-Chan;Lee, Moon-Ho
    • 한국컴퓨터정보학회논문지
    • /
    • 제20권10호
    • /
    • pp.53-59
    • /
    • 2015
  • In this paper we propose a resource management scheme which allocates hierarchical resources stepwise based on the users' QoS requirement of each service in the macro-femtocell overlaid LTE-Advanced network. Our proposed scheme adjusts the transmission rate to the minimum which guarantees the allowable minimum requirement of delay for each user service. In this way it minimizes the interference on the adjacent channels and it is able to increase the resource utilization efficiency. Simulation results show that our scheme provides better performances than the conventional one in respect of the outage probability and data transmission throughput.

DWDM기반의 차세대 광인터넷에서 QoS 기반의 제한적 플러딩 RWA 알고리즘에 관한 연구 (QoS-Aware Bounded Flooding RWA Algorithm in the Next Generation Optical Internet based on DWDM Networks)

  • 김용성;이재동;황진호;우종호
    • 대한전자공학회논문지TC
    • /
    • 제43권8호
    • /
    • pp.1-14
    • /
    • 2006
  • 실시간 멀티미디어 서비스들을 전송하는 DWDM(Dense-Wavelength Division Multiplexing) 기반의 차세대 인터넷에서는 DWDM 망의 다양한 QoS(Quality of Service) 파라미터들을 복합적으로 고려하는 QoS RWA(Routing and Wavelength Assignment) 방식으로의 접근이 요구되어진다. 본 논문은 flooding 방법을 기반으로 하고, 다중제약조건을 만족하는 새로운 QoS 라우팅 알고리즘인 Bounded Flooding Routing (BFR)을 제안한다. BFR 알고리즘의 주요 목적은 network overhead, blocking probability 그리고 wavelength utilization의 성능 분석 파라메터의 향상에 있다. 더욱이, 이러한 목적을 달성하기 위해 본 논문에서는 새로운 개념인 ripple count 개념을 제안하여, 링크 상태정보 및 계산량을 줄임으로써 라우팅의 성능을 높인다. 또한, 제안된 알고리즘의 광범위한 분석을 위해서, DWDM을 기반으로 하는 망에서 중요한 요소인 제한된 파장 변환기를 적용한다. 제안된 BFR 알고리즘의 성능분석 결과는 본 논문에서 제시하는 방법이 network overhead, blocking Probability 그리고 wavelength utilization 측면의 성능 평가를 통해 제안된 알고리즘들의 효율성을 검증하였다.

학습효과를 고려한 셀프서비스 모델 : 셀프서비스 주유소 분석 (Self-Service Model Considering Learning Effect : Self-Service Gas Station)

  • 정성욱;양홍석;김수욱
    • 한국경영과학회지
    • /
    • 제37권4호
    • /
    • pp.73-93
    • /
    • 2012
  • In recent years, service delivery systems employing a self-service approach have been rapidly spreading. Since a self-service system provides a lower product price, it attracts more customers. However, some system managers are still hesitant to accept a self-service system, because there is no systematic model to predict its performance. Therefore, this research attempts to provide a systematic and quantitative model to predict the performance of a self-service system, focused specifically on a self-service gas station. Under this model, the traditional queuing theory was adopted to describe the general self-service process, but it is also assumed that some changes occur in both the customer arrival rate and the service performance rate. In particular, the price elasticity was introduced to capture the change in the customer arrival rate, and the existence of learning effect and helpers were assumed to design the changed service performance rate. Under these assumptions, a simulation model for a self-service gas station is established, and three performance measurements, such as average number of customers, average waiting time, and Utilization are observed, depending on the changes in price difference and helper-operating time. In this research, the optimal operation strategy for price differentiation and helper-operating time is proposed in accordance with the level of the customer learning rate. Although this research confines the scope of the study to the self-service gas station model, the results of this research can be applied to any type of self-service system.

ATM 망에서 CT 서비스를 위한 버퍼 할당 방식의 성능 분석 (Performance Analysis of Buffer Allocation Schemes for Controlled Transfer Service in ATM Networks)

  • 김병철;조유제안윤영권율
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 1998년도 추계종합학술대회 논문집
    • /
    • pp.261-264
    • /
    • 1998
  • Controlled transfer (CT) capability, a new ATM transfer capability (ATC) for high-speed data applications which using credit-based flow control, has recently been proposed and studied in ITU-T. In this paper, we review the existing dyanmic buffer allocation schemes and propose an improved scheme. Also, we compare the performances of the existing buffer allocation methods such as static allocation, flow controlled virtual channels (FCVC), and zero queueing flow control (ZQFC) with the proposed method through simulation. Simulation results show that the proposed scheme exhibits a better performance than the existing schemes in terms of throughput, fairness, queue length and link utilization.

  • PDF