• Title/Summary/Keyword: Packet scheduling

Search Result 365, Processing Time 0.031 seconds

Redundancy Management of Brake-by-wire System using a Message Scheduling (메시지 스케줄링을 이용한 Brake-by-wire 시스템의 Redundancy Management)

  • Yune, J. W.;Kim, K. W.;Kim, T. Y.;Kim, J. G.;Lee, S.
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2000.11a
    • /
    • pp.717-720
    • /
    • 2000
  • Event-driven communication protocols such as CAN(Controller Area Network) have inherent packet delays due to the contention process for the use of network medium. These delays are stochastic in nature because most packets arrive at random time instants. The stochastic property of the delay adversely influences the control system's performance in terms of stability, responsiveness and steady-state error. Another problem for safety-critical application such as brake-by-wire systems is the reliability of the communication modules that can fail abruptly. This paper deals with two methods to overcome the above problems : (i) scheduling method that can maintain packet delays under some acceptable level, and (ii) redundancy management of communication modules that prescribes dual-redundancy modules' behavior when one of them fails.

  • PDF

A Scheduling Method for QoS Switching of Multicast Packet (Multicast 패킷의 QoS 스위칭을 위한 스케쥴링 방법)

  • 이형섭;김환우
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.26 no.11C
    • /
    • pp.123-132
    • /
    • 2001
  • This paper proposes a sound multicast packet-switching method which can less affect QoS(Quality of Service) degradation. The method includes a switch fabric with extra switching paths dedicated f()r multicast packets. Presented also are both a buffering structure and a scheduling algorithm for the proposed method. Simulation analysis for the method shows that the switching delay of unicast packets is decreased even though arrival rate of multicast packets is increased.

  • PDF

An Efficient Scheduling Scheme for Bluetooth Piconets (블루투스 피코넷을 위한 효율적 스케줄링 기법)

  • 이우신;이혁준
    • Journal of KIISE:Information Networking
    • /
    • v.30 no.1
    • /
    • pp.38-47
    • /
    • 2003
  • Communication between Bluetooth devices is based on TDD by a master unit. In this discipline, the transmission of slave packets can be made only when the master transmits a packet to the slave. Thus, some slots may be wasted when there is no user data in the master's or slave's queue due to the transmission of a POLL or NULL packet. Therefore a scheduling scheme which can minimize the slot waste is required in Bluetooth intra-piconet communication. However, since the master is responsible for the intra-piconet scheduling, it must be provided with an information on each slave's queue length to apply traditional scheduling schemes. which is impossible in Bluetooth. This paper presents a new Bluetooth intra-piconet scheduling scheme that is efficient and does not require the information on each slave's queue length. The scheduling is done based on the information about the existence of data in the master and slave queues which is derived by the master identifying the type of packets transmitted. The master schedules to communicate with the slaves according to the priorities determined based on this information. We Presents simulation results which indicate a significant improvement in the performance when our proposed scheme is used.

On the Technology for High-speed Router Design (고속 라우터 기술)

  • 주성순
    • Proceedings of the IEEK Conference
    • /
    • 1999.11a
    • /
    • pp.105-108
    • /
    • 1999
  • In this paper, we define the high-speed router as a router, which can support aggregated ports over 25Gbps, and provide issues and trends in high-speed router design. We propose design considerations on IP packet forwarding, switching fabric, packet scheduling and buffer management, network resource reservation, and router operation and administration.

  • PDF

Distributed Proportional Fair Scheduling for Wireless LANs (무선 LAN을 위한 분산화된 비례공정 스케줄링)

  • Park, Hyung-Kun
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.56 no.12
    • /
    • pp.2262-2264
    • /
    • 2007
  • In this paper, we propose a distributed opportunistic scheduling scheme for wireless LAN network. Proportional fair scheduling is one of the opportunistic scheduling schemes and used for centralized networks, whereas we design distributed proportional fair scheduling (DPFS). In the proposed DPFS scheme, each receiver estimates channel condition and calculates independently its own priority with probabilistic manner, which can reduce excessive probing overhead required to gather the channel conditions of all receivers. We evaluate the proposed DPFS using extensive simulation and simulation results show that DPFS obtains up to 23% higher throughput than conventional scheduling schemes and has a flexibility to control the fairness and throughput by controlling the system parameter.

A study on improving the bandwidth utilization of fair packet schedulers (공평 패킷 스케줄러의 대역폭 이용 효율 개선에 관한 연구)

  • Kim Tae-Joon;Kim Hwang-Rae
    • The KIPS Transactions:PartC
    • /
    • v.13C no.3 s.106
    • /
    • pp.331-338
    • /
    • 2006
  • Most fair packet schedulers supporting quality-of-services of real-time multimedia applications are based on the finish time design scheme in which the expected transmission finish time of each packet is used as its timestamp. This scheme can adjust the latency of a flow with raising the flow's scheduling rate but it may suffer from severe bandwidth loss due to the coupled rate and delay allocation. This paper first introduces the concept of delay resource, and then proposes a scheduling method to improve the bandwidth utilization in which delay resource being lost due to the coupled allocation is transformed into bandwidth one. The performance evaluation shows that the proposed method gives higher bandwidth utilization by up to 50%.

Design Methodology of System-Level Simulators for Wideband CDMA Cellular Standards (광대역 CDMA 셀룰러 표준을 위한 시스템 수준 시뮬레이터의 설계 방법론)

  • Park, Sungkyung
    • Journal of the Korea Society for Simulation
    • /
    • v.22 no.1
    • /
    • pp.41-51
    • /
    • 2013
  • This tutorial paper presents the design methodology of system-level simulators targeted for code division multiple access (CDMA) cellular standards such as EV-DO (Evolution-Data Only) and broadcast multicast service (BCMCS). The basic structure and simulation flow of system-level simulators are delineated, following the procedure of cell layout, mobile drops, channel modeling, received power calculation, scheduling, packet error prediction, and traffic generation. Packet data transmissions on the forward link of CDMA systems and EV-DO BCMCS systems are considered for modeling simulators. System-level simulators for cellular standards are modeled and developed with high-level languages and utilized to evaluate and predict air interface performance metrics including capacity and coverage.

Hybrid Scheduling Algorithm based on DWDRR using Hysteresis for QoS of Combat Management System Resource Control

  • Lee, Gi-Yeop
    • Journal of the Korea Society of Computer and Information
    • /
    • v.25 no.1
    • /
    • pp.21-27
    • /
    • 2020
  • In this paper, a hybrid scheduling algorithm is proposed for CMS(Combat Management System) to improve QoS(Quality of Service) based on DWDRR(Dynamic Weighted Deficit Round Robin) and priority-based scheduling method. The main proposed scheme, DWDRR is method of packet transmission through giving weight by traffic of queue and priority. To demonstrate an usefulness of proposed algorithm through simulation, efficiency in special section of the proposed algorithm is proved. Therefore, We propose hybrid algorithm between existing algorithm and proposed algorithm. Also, to prevent frequent scheme conversion, a hysteresis method is applied. The proposed algorithm shows lower packet loss rate and delay in the same traffic than existing algorithm.

Study of Radio Resource Allocation Method for Wireless Broadband Internet System (휴대인터넷 무선자원 할당 연구)

  • Kook Kwang-Ho;Kim Kyung-Hee;Baek Jang-Hyun
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.31 no.3
    • /
    • pp.145-154
    • /
    • 2006
  • WiBro (Wireless Broadband Internet) system is going to be 9ot down to commercialization. The high portable internet system is able to be connected to the high-speed internet using 2.3 GHz frequency bandwidth, anytime and anywhere. An effective scheduling for UGS, rtPS, nrtPS and BE requiring different QoS, which are service types of the WiBro, is necessary to increase the efficiency of radio channels that are the limiting resource. This paper researches an uplink scheduling that plays a role in assignment for the radio channels from subscribers to base stations. The suggested scheduling provides priorities with each service type considering QoS of them but reserves some bandwidth for lower priory services. After deciding effective amount of bandwidth for reservation, we suggest analytical result on mean delayed time of packet transmission for each terminal, transmission rate for the data, and capacity for uplink. This research can be used as basic data for the standard in the high portable internet system and as data to predict the capacity of base stations.

Study of the radio resource allocation method of the Wireless Broadband Internet System (휴대인터넷 무선자원 할당 연구)

  • Guk, Gwang-Ho;Kim, Gyeong-Hui;Baek, Jang-Hyeon
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2005.10a
    • /
    • pp.347-353
    • /
    • 2005
  • WiBro (Wireless Broadband Internet) system is going to be commercialized before long. The high portable internet system is abie to be connected to the high-speed internet using 2.3 CHz frequency bandwidth, anytime and anywhere. An effective scheduling for UCS, rtPS. nrtPS and BE requiring different QoS, which are service types of the WiBro, is necessary to increase the efficiency of radio channels that arc the limiting resource. This paper researches an uplink scheduling that plays a role in assignment for the radio channels from subscribers to base stations. The suggested scheduling provides priorities With each service type considering QoS of them but reserves some bandwidth for lower priory services. After deciding effective amount of bandwidth for reservation, we suggest analytical result on mean delayed time of packet transmission for each terminal, transmission rate for the data, and capacity for uplink. This research can be used as basic data for the standard in the high portable internet system and as data to predict the capacity of base stations.

  • PDF