• Title/Summary/Keyword: Share 할당

Search Result 149, Processing Time 0.028 seconds

A Performance Analysis and Evaluation of Congestion Avoidance Algorithm for ABR service over ATM Networks (ATM망에서 ABR 서비스를 위한 혼잡회피 알고리즘의 성능 분석 및 평가)

  • 하창승;조익성
    • Journal of the Korea Society of Computer and Information
    • /
    • v.7 no.3
    • /
    • pp.80-91
    • /
    • 2002
  • A general goal of the AT%(Asynchronous Transfer Mode) network is to support connect across various network. On ATM networks, ABR services are provided using the remained ban after allocation CBR and VBR traffic. Realtime services such as transmitting audio or video data may be provided using CBR ado VBR which have a constrained transmission delay, but in these cases, the communications bandwidth may be wasted. In this paper a simulation has been performed to compare and evaluate the performance between the ERICA(Explicit Rate Indicate Avoidance) and EPRCA(Enhanced Proportional Rate Control Algorithm) switches which use Explicit Rate switch algorithm for ABR switch. The variation of the ACR at the source end system, the queue length, the utilization rate of the link bandwidth and the share fairness at the transient and steady states are used as the evaluation criteria for the simulation. As a result of simulation, ERICA algorithm switch was ten times long compared to ERPCA switch to achieve assigned fair share. so EPRCA switch is superior to ERICA about load response. For Fair share and stability, ERICA switch is excellent to EPRCA switch.

  • PDF

Implementation and Experimental Evaluation of Bandwidth Allocation Scheme on PROFIBUS (PROFIBUS에서 대역폭 할당 기법 구현 및 실험적 평가)

  • Hong, Seung-Ho;Kim, Yu-Chul;Kim, Ji-Yong
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.6 no.11
    • /
    • pp.943-954
    • /
    • 2000
  • Fieldbus is the lowest level industrial network in the communication hierarchy of factory automation and distributed process control systems. Data generated from field devices are largely divided into three categories : time-critical, periodic and time-available data. Because these data share one fieldbus medium, it needs a method that allocates these data to the bandwidth-limited fieldbus medium. This paper introduces an implementation method of bandwidth allocation scheme on PROFIBUS. In order to implement bandwidth allocation scheme on PROFIBUS, the following functions need to be supplemented on the FDL(Fieldbus Datalink Layer) protocol: (i) separation of medium bandwidth into periodic and non-periodic intervals, (ii) synchronization of node timers over a local link. In order to examine the validity of bandwidth allocation scheme on PROFIBUS, this paper develops an experimental model of a network system. The results obtained from the experimental model show that the bandwidth allocation scheme satisfies the performance requirement of time-critical, periodic and time-available data.

  • PDF

Downlink code management for dynamic resource allocation in TD-SCDMA systems (TD-SCDMA에서 동적 무선자원 할당을 위한 하향링크 코드 관리)

  • Yeo, Woon-Young;Lee, Sang-Yun
    • Proceedings of the IEEK Conference
    • /
    • 2008.06a
    • /
    • pp.261-262
    • /
    • 2008
  • TD-SCDMA is considered as an innovative Chinese 3G technology adopted by the ITU for the IMT-2000 family. TD-SCDMA combines TDMA and CDMA components to provide more efficient use of radio resources. However, the downlink scheduler of TD-SCDMA should transmit data packets with the initial configuration and cannot change the configuration dynamically. Therefore, in this paper, we propose an enhanced channel allocation, by which mobile terminals can share the downlink channelization codes dynamically.

  • PDF

A Hardware Allocation and Binding Algorithm for ASIC Design (ASIC설계를 위한 하드웨어 할당 및 바인딩 알고리듬)

  • Choe, Ji-Yeong;In, Chi-Ho;Kim, Hui-Seok
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.4
    • /
    • pp.1255-1262
    • /
    • 2000
  • This paper proposes a hardware allocation and binding algorithm for ASIC Design. The proposed algorithm works on schedules input graph and simultaneously allocates and binds functional units, interconnections and registers by considering interdependency between operations and storage elements in each control step, in order to share registers and interconnections connected to functional units, as much as possible. Especially, he register allocation is executes the allocation optimal using graph coloring. This paper shows the effectiveness of the algorithm by comparing experiments to determine number of functional unit and register in advance or to separate executing allocation and binding of existing system.

  • PDF

A study on the routing and wavelength assignment in WDM ring (WDM 링에서의 루팅 및 파장할당에 관한 연구)

  • 김후곤;백천현;정용주
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.27 no.4
    • /
    • pp.1-10
    • /
    • 2002
  • The ring routing and wavelength assignment problem arose in the planning of optical communication networks which use WDM rings. Traffic demands are given for each pair of nodes in an ring : each demand must be routed one of the two possible connections round the ring and the wavelength assignments must be made so that there are no conflicts : that is. no two connections whose routes share a link can be assigned the same wavelength along that link. The objective is to minimize the number of used wavelengths. We propose the local optimal routing for the problem and show that there always exists an optimal solution satisfying it. Furthermore we suggest a new lower bound for the problem and show that it is very efficient for the worst case example.

A Design Traffic Conditioner for Fairness Resource share in Differentiated Service (Differentiated Service에서 공정한 자원 공유를 위한 Traffic Conditioner 설계)

  • 이진호;김용수;장경성;김병기
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2000.04a
    • /
    • pp.310-312
    • /
    • 2000
  • 명시적인 자원 할당과 스케줄링에 의해 QoS를 제공 할 수 있는 방안으로 RSVP가 제안되었으나 내부 구조 변경이나 확장성의 문제를 내포하고 있다. 그래서 IETF에서는 차등 서비스(Differentiated Service)를 이용하여 서비스 영역을 확장하려는 연구가 활발히 진행중이다. DiffServ는 확장성을 고려하여 RSVP와 같은 개별 flow에 대한 QoS 제공이 아닌 flow들의 집합(aggregated)으로 차등적인 서비스를 제공하는 방법이다. 본 논문에서는 aggregated flow로 서비스를 제공할 때 불특정 flow에 대한 QoS 손실을 막기 위해 Token Bucket Meter 처리 전에 사전 모니터링에 의해 자원공유의 공정성과 처리 속도를 향상시킬 수 있는 TC(Traffic Conditioner)를 설계, 구현하여 다수 subnetwork에서의 flow가 자원을 공정하게 공유함을 결과로 보였다.

  • PDF

Simulation Analysis of Part Release Algorithm under Dynamic Tool Allocation in SSMS (SSMS에서 동적 공구할당을 고려한 부품투입 알고리즘의 시뮬레이션 분석)

  • 이충수
    • Journal of the Korea Society for Simulation
    • /
    • v.8 no.1
    • /
    • pp.63-76
    • /
    • 1999
  • Recently in manufacturing environment, manufacturing order is characterized by unstable market demand, shorter product life cycle, a variety of product and shorter production lead time. In order to adapt this manufacturing order, flexible manufacturing systems(FMS) in manufacturing technology advances into the direction that machines become further versatile functionally and that tools are controlled by fast tool delivery device. Unlike conventional FMS to mainly focus on part flow, it is important to control tool flow in single-stage multimachine systems(SSMS), consisting of versatile machines and fast tool delivery device. This research is motivated by the thought that exact estimation of tool competition at part release in SSMS enhances the system performance. In this paper, in SSMS under dynamic tool allocation strategy to share tools among machines, we propose real-time part release and tool allocation algorithms which can apply real factory and which can improve system performance.

  • PDF

SSMS에서 동적 공구할당을 고려한 부품투입 알고리즘의 시뮬레이션 분석

  • 이충수
    • Proceedings of the Korea Society for Simulation Conference
    • /
    • 1999.04a
    • /
    • pp.60-64
    • /
    • 1999
  • Recently in manufacturing environment, manufacturing order is characterized by unstable market demand, shorter product life cycle, a variety of product and shorter production lead time. In order to adapt this manufacturing order, flexible manufacturing system(FMS) in manufacturing technology advances into the direction that machines become further versatile functionally and that tools are controlled by fast tool delivery device. Unlike conventional FMS to mainly focus on part flow, it is important to control tool flow in single-stage multimachine systems(SSMS), consisting of versatile machines and fast tool delivery device. In this paper, in SSMS under dynamic tool allocation strategy to share tools among machines, we propose real-time part release and tool allocation algorithms which can apply real factory and which can improve system performance.

  • PDF

Dynamic Bandwidth Allocation using Adaptive Minimum Guaranteed Bandwidth for Ethernet Passive Optical Networks (이더넷 수동 광통신 망을 위한 가변형 최소 보증 대역폭을 이용한 동적 대역폭 할당 기법의 제안)

  • Lim, Wan-Wu;Yun, Chang-Ho;Lee, Hyun-Ju;Yang, Yeon-Mo;Kim, Ki-Seon
    • Proceedings of the IEEK Conference
    • /
    • 2007.07a
    • /
    • pp.23-24
    • /
    • 2007
  • Ethernet passive optical network (EPON) is a technology to solve the access network bottleneck and to realize fiber to the home (FTTH). In EPON, the dynamic bandwidth allocation (DBA) is important because all users share common line in upstream. In this paper, we propose new DBA named as modified EPON dynamic scheduling algorithm (MEDSA) and simulate new DBA using Matlab.

  • PDF

Spectrum Share Allocation Revenue Optimization Algorithm of Femtocell in the Heterogeneous Network (이종네트워크에서 펨토셀의 스펙트럼 공유할당 비용 최적화 알고리즘)

  • Park, Sang Hyuk;Myeong, Seayoung;Rajeev, Rajeev;Cuma, Cuma;Won, Jongho;Bate, Bate;Kim, Gyeongho;Lee, Yeonwoo
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2013.11a
    • /
    • pp.268-270
    • /
    • 2013
  • 본 논문에서는 최근 주파수 자원에 대한 수요가 급증하면서 효율적으로 주파수를 이용하기 위해 주파수 공유를 하면서 생길 수 있는 비용문제의 최고의 이득을 발생시킬 수 있도록 하기 위하여 이종네크워크(Heterogeneous Network)에서 매크로셀과 펨토셀 환경에서 스펙트럼 공유에 있어서 매크로셀이 사용하지 않는 스펙트럼을 펨토셀에 공유해줌으로써 이득을 취할 수 있는데 이러한 이득에 있어서 최고의 이득을 발생시킬 수 있도록 하기 위하여 펨토셀의 스펙트럼 공유당 비용 최적화 알고리즘을 제안 하였다.