• Title/Summary/Keyword: cell-scheduling

Search Result 208, Processing Time 0.028 seconds

MAP 대응 FA 시스템에의 Expert 시스템의 활용에 대하여

  • Lee, Bong-Jin
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.5 no.2
    • /
    • pp.7-14
    • /
    • 1988
  • 작업물(Work)을 기계에 장입출, 가공에 필요한 공구류의 공급 등이 완전 자동화 된 기존의 사출성형기 Series를 제조하는 FA Systme은, MAP 대응의 FA System 으로 개량되었다. 이 논문은, MAP 대응 새 FA 시스템의 MAP에서 분산.통괄의 역할을 하도록 개발된 Cell controller의 정보관리기능 가운데 하나의 응용으로서 제조공정을 자동적으로 Scheduling 하는데 Expert 시스템(전문가시스템)을 적용한 idea를 소개하는 것이다. 이 idea의 적용 으로 인하여 제조공정의 scheduling 작염은 종래의 주단위로 부터 일일단위의 작업으로 처리가 가능해졌고, 또, 공구수명관리기능의 부가로 무인운전시의 기계의 가공율도 종래보다도 녹일 수가 있었다.

  • PDF

Energy Efficient Cell Management by Flow Scheduling in Ultra Dense Networks

  • Sun, Guolin;Addo, Prince Clement;Wang, Guohui;Liu, Guisong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.9
    • /
    • pp.4108-4122
    • /
    • 2016
  • To address challenges of an unprecedented growth in mobile data traffic, the ultra-dense network deployment is a cost efficient solution to off-load the traffic over other small cells. However, the real traffic is often much lower than the peak-hour traffic and certain small cells are superfluous, which will not only introduce extra energy consumption, but also impose extra interference onto the radio environment. In this paper, an elastic energy efficient cell management scheme is proposed based on flow scheduling among multi-layer ultra-dense cells by a SDN controller. A significant power saving was achieved by a cell-level energy manager. The scheme is elastic for energy saving, adaptive to the dynamic traffic distribution in the office or campus environment. In the end, the performance is evaluated and demonstrated. The results show substantial improvements over the conventional method in terms of the number of active BSs, the handover times, and the switches of BSs.

A Study on the Buffer Management and Scheduling of TCP/IP for GFR service in the ATM networks (ATM망에서 GFR서비스를 위한 TCP/IP의 버퍼 관리방법과 스케쥴링에 관한 연구)

  • 문규춘;최현호;박광채
    • Proceedings of the IEEK Conference
    • /
    • 2000.06a
    • /
    • pp.275-278
    • /
    • 2000
  • Recently ATM(Asynchronous Transfer Mode) technology is facing challenges from Integrated Service IP(Internet Protocol), IP router, Gigabit Ethernet. Although ATM is approved by ITU-T as the standard technology in B-ISDN, its survival is still in question. In the ATM networks, the Guaranteed Frame Rate(GFR) service has been designed to accommodate non-real-time applications, such as TCP(Transmission Control Protocol)/IP based traffic. The GFR service not only guarantees a minimum throughput at the frame level, but also supports a fairshare of available resources. We have studied different discarding and scheduling schemes, and compared their throughput and fairness when TCP/IP Traffic is carried. Through simulations, we know that only per-VC queueing with weighted Round Robin(WRR) can guarantee Minimum Cell Rate Among all the Schemes that have been experimented, we recommend DT-EPD(Dynamic Threshold-Early Packet Discard) integrated with MCRplus(Minimum Cell Rate) to support the GFR service.

  • PDF

On optimal cyclic scheduling for a flexible manufacturing cell

  • Kise, Hiroshi;Nakamura, Shinji;Karuno, Yoshiyuki
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1990.10b
    • /
    • pp.1250-1255
    • /
    • 1990
  • This paper discusses an optimal cyclic scheduling problem for a FMC (Flexible Manufacturing Cell) modeled by a two-machine flowshop with two machining centers with APC's (Automated Pallet Changers), an AGV (Automated Guided Vehicle) and loading and unloading stations. Cyclic production in which similar patterns of production is repeated can significantly reduce the production lead-time and WIP (Work-In-Process) in such flexible, automated system. Thus we want to find an optimal cyclic schedule that minimizes the cycle time in each cycle. However, the existence of APC's as buffer storage for WIP makes the problem intractable (i.e., NP-complete). We propose an practical approximation algorithm that minimizes, instead of each cycle time, its upper bound. Performances of this algorithm are validated by the way of computer simulations.

  • PDF

JOB Scheduling Analysis in FMC using TPN (TPN을 이용한 FMC의 JOB 스케쥴링 분석)

  • 안광수
    • Journal of the Korea Society of Computer and Information
    • /
    • v.4 no.3
    • /
    • pp.13-19
    • /
    • 1999
  • In this paper, we suggests a WIP (Work In Process) of FMC (Flexible Manufacturing Cell) analysis methods based on the TPN (Time Petri Nets) unfolding. Unfolding of PN is a partial order-based method for the verification of concurrent system without the state space explosion. The aim of this work is to formulate the general cyclic state scheduling problem to minimize the WIP to satisfy economical constraints. The method is based on unfolding of the original net into the equivalent acyclic description.

WRR Cell Scheduling Algorithm of BSW structure (BSW구조의 셀 스케쥴링 알고리즘)

  • 조해성;임청규;전병실
    • Journal of the Korea Society of Computer and Information
    • /
    • v.5 no.3
    • /
    • pp.119-125
    • /
    • 2000
  • A network of Asynchronous Transfer Mode (ATM) will be required to carry the traffics(CVR, VBR, UBR, ABR) generated by a wide range of services. The algorithm of WRR cell multiplexing is designed to serve no only CBR, VBR traffic but also ABR, UBR traffic in ATM. BSW algorithm was Proposed to carry on manage buffer efficiently at implementing of WRR scheduler. But, BSW a1gorithm cause serious degradation to the weight of each VC and the ratio of scheduler throughput because it allocates more weight than the weight allocated actually in VC and because it could not serve cell if the VC queue is empty. In this paper, we propose the WRR scheduling algorithm of BSW structure which improves the cell service ratio and cell delay. The proposed algorithm is capable of maintaining an allocated VC's weight correctly and decrease of average cell delay by serving other VC cell when empty in each VC queue and increase of cell service ratio as a whole.

  • PDF

Effect of Relay Capability on VoIP Performance in OFDMA based Relay Systems (OFDMA 기반 Relay 시스템에서 Relay의 Capability에 따른 VoIP 성능 분석)

  • Ahn, Sung-Bo;Choi, Ho-Young;Hong, Dae-Hyoung;Lim, Jae-Chan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.3B
    • /
    • pp.304-310
    • /
    • 2009
  • In this paper, we evaluate the performance of VoIP in OFDMA-based relay systems with various capabilities of relays. We classify relays according to capability as "mid-capability (MC)" and "high-capability (HC)" relay. In system with HC relays, not only base station (BS) but also relay station (RS) performs scheduling at its ova whereas only BS performs scheduling in system with MC relays using the information reported by MS (i.e. the received signal-to-interference-plus-noise ratio (SINR) of mobile station (HS), the amount of MS traffic, etc). In system with MC relays, the controling overhead of BS is larger than that of system with HC relays. However, since BS has all MS information, efficient resource allocation and scheduling is possible. We derived the "average packet delay," "good packet ratio," and "cell goodput" in a VoIP environment. The simulation results demonstrate that the system with MC relays has better VoIP performance over that with HC relays.

The study on Multicast Cell Scheduling for Parallel Multicast packet switch with Ring Network (링망을 이용한 병렬 멀티캐스트 패킷스위치에서의 멀티캐스트 셀 스케줄링에 관한 연구)

  • 김진천
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.4 no.5
    • /
    • pp.1037-1050
    • /
    • 2000
  • A goal of a BISDN network is to provided integrated transport for a wide range of applications such as teleconferencing, Video On Demand etc. There require multipoint communications in addition to conventional point-to-point connections. Therefore multicast capabilities are very essential in multimedia communications. In this paper, we propose a new multicast cell scheduling method on the Parallel Multicast Packet Switch with Ring network: PMRN which are based on separated HOL. In this method, we place two different HOLs, one for unicast cells and the other for multicast cells. Then using non-FIFO scheduling, we can schedule both unicast cells and multicast cells which are available at the time in the input buffer. The simulation result shows that this method reduces the delay in the input buffer and increases the efficiency of both point-to-point network and ring network and finally enhances the bandwidth of the overall packet switch. A goal of a BISDN network is to provided integrated transport for a wide range of applications such as teleconferencing, Video On Demand etc. There require multipoint communications in addition to conventional point-to-point connections. Therefore multicast capabilities are very essential in multimedia communications. In this paper, we propose a new multicast cell scheduling method on the Parallel Multicast Packet Switch with Ring network: PMRN which are based on separated HOL. In this method, we place two different HOLs, one for unicast cells and the other for multicast cells. Then using non-FIFO scheduling, we can schedule both unicast cells and multicast cells which are available at the time in the input buffer. The simulation result shows that this method reduces the delay in the input buffer and increases the efficiency of both point-to-point network and ring network and finally enhances the bandwidth of the overall packet switch.

  • PDF

HSDPA Sector Throughput Analysis With Modified Link Budget (Link budget을 이용한 HSDPA 시스템의 sector throughput 분식)

  • Yi Yo-Serb;Kim Sang-Bum;Hong Dae-Hyung;Jang Byung-Lyerl;Moon Soon-Joo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.5A
    • /
    • pp.469-474
    • /
    • 2006
  • In this paper, we develop a method that derive the average sector throughput of HSDPA system. This proposed method reflects the effects of AMC, scheduling and multi-code transmission, and is performed by simple calculation procedures such as link budget analysis. Link budget table is used to estimate a cell coverage in general. We modify the link budget table in order to calculate C/I of the user according to the location of the user in CDMA packet system employing AMC. Furthermore, we utilize the proposed method to analyze the effects of scheduling and multi-code transmission.

A buffer readout scheduling for ABR traffic control (ABR 트랙픽 제어를 위한 버퍼 readout 스케쥴링)

  • 구창회;이재호
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.34S no.11
    • /
    • pp.25-33
    • /
    • 1997
  • The end-to-end rate-based control mechanism is used for the flow control of the ABR service to allow much more flexibility in ATM switching system. To accommodate the ABR service effciently many algorithms such as EFCI, EPRCA, ERICA, and CAPC2 have been proposed for the switch algorithm. ABR cells and related RM cells are received at the ATM switch fabric transparently without any processing. And then cells received from the traffic source are queued in the ABR buffer of switching system. The ABR buffer usually has some thresholds for easy congestion control signal transmission. Whatever we use, therefore, these can be many ABR traffic control algorithms to implement the ABR transfer capability. The genertion of congestion indicate signal for ABR control algorithms is determined by ABR buffer satus. And ABR buffer status is determined by ABR cells transfer ratio in ATM switch fabrics. In this paper, we presented the functional structures for control of the ABR traffic capability, proposed the readout scheduling, cell slot allocation of output link and the buffer allocation model for effective ABR traffic guranteeing with considering CBR/VBR traffics in ATM switch. Since the proposed readout scheduling scheme can provide more avaliable space to ABR buffer than existing readout scheduling scheme, generation rate of a SEND signal, that is, BCN signal in destination node can be increased for ABR call connection. Therefore, the proposed scheme, in this paper, can be appropriate as algorithm for effective ABR traffic service on output link of ATM switching node.

  • PDF