• 제목/요약/키워드: transmission priority

검색결과 311건 처리시간 0.028초

Controller Area Network 의 실시간 서비스 품질 향상을 위한 동적 ID 할당 알고리즘 개발 (Development of Dynamic ID Allocation Algorithm for Real-time Quality-of-Service of Controller Area Network)

  • 이석;하경남;이경창
    • 한국정밀공학회지
    • /
    • 제26권10호
    • /
    • pp.40-46
    • /
    • 2009
  • Recently CAN (Controller Area Network) is widely used as an in-vehicle networking protocol for intelligent vehicle. The identifier field (ID) of CAN is used not only to differentiate the messages but also to give different priorities to access the bus. This paper presents a dynamic 10 allocation algorithm in order to enhance the real-time quality-of-service (QoS) performance. When the network traffic is increased, this algorithm can allocate a network resource to lower priority message without degradation of the real-time QoS performance of higher priority message. In order to demonstrate the algorithm's feasibility, message transmission delays have been measured with and without the algorithm on an experimental network test bed.

Exploring the Feasibility of Differentiating IEEE 802.15.4 Networks to Support Health-Care Systems

  • Shin, Youn-Soon;Lee, Kang-Woo;Ahn, Jong-Suk
    • Journal of Communications and Networks
    • /
    • 제13권2호
    • /
    • pp.132-141
    • /
    • 2011
  • IEEE 802.15.4 networks are a feasible platform candidate for connecting all health-care-related equipment dispersed across a hospital room to collect critical time-sensitive data about patient health state, such as the heart rate and blood pressure. To meet the quality of service requirements of health-care systems, this paper proposes a multi-priority queue system that differentiates between various types of frames. The effect of the proposed system on the average delay and throughput is explored herein. By employing different contention window parameters, as in IEEE 802.11e, this multi-queue system prioritizes frames on the basis of priority classes. Performance under both saturated and unsaturated traffic conditions was evaluated using a novel analytical model that comprehensively integrates two legacy models for 802.15.4 and 802.11e. To improve the accuracy, our model also accommodates the transmission retries and deferment algorithms that significantly affect the performance of IEEE 802.15.4. The multi-queue scheme is predicted to separate the average delay and throughput of two different classes by up to 48.4% and 46%, respectively, without wasting bandwidth. These outcomes imply that the multi-queue system should be employed in health-care systems for prompt allocation of synchronous channels and faster delivery of urgent information. The simulation results validate these model's predictions with a maximum deviation of 7.6%.

CAN기반 실시간 시스템을 위한 확장된 EDS 알고리즘 개발 (Development of an Extended EDS Algorithm for CAN-based Real-Time System)

  • 이병훈;김대원;김홍렬
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2001년도 하계학술대회 논문집 D
    • /
    • pp.2369-2373
    • /
    • 2001
  • Usually the static scheduling algorithms such as DMS (Deadline Monotonic Scheduling) or RMS(Rate Monotonic Scheduling) are used for CAN scheduling due to its ease with implementation. However, due to their inherently low utilization of network media, some dynamic scheduling approaches have been studied to enhance the utilization. In case of dynamic scheduling algorithms, two considerations are needed. The one is a priority inversion due to rough deadline encoding into stricted arbitration fields of CAN. The other is an arbitration delay due to the non-preemptive feature of CAN. In this paper, an extended algorithm is proposed from an existing EDS(Earliest Deadline Scheduling) approach of CAN scheduling algorithm haying a solution to the priority inversion. In the proposed algorithm, the available bandwidth of network media can be checked dynamically by all nodes. Through the algorithm, arbitration delay causing the miss of their deadline can be avoided in advance. Also non real-time messages can be processed with their bandwidth allocation. The proposed algorithm can achieve full network utilization and enhance aperiodic responsiveness, still guaranteeing the transmission of periodic messages.

  • PDF

도심의 전파 사각 지역 문제 해결을 위한 VANET 경고 메시지 전달 기능의 개선 (A performance Enhancement of VANET Warning Message Propagation on Electric Wave Blind Area Problem in the Urban Environment)

  • 이원열
    • 한국멀티미디어학회논문지
    • /
    • 제17권10호
    • /
    • pp.1220-1228
    • /
    • 2014
  • Emergency Warning Service will be the most important service of VANET. Transmission delay is the most important performance criteria of the warning service. Most legacy research takes a way to minimize the packet collision. However those approach has a critical weak point on urban environment where there is a blind area of electric wave. So another issue is required in order to provide enhanced warning message propagation technique to overcome the urban environment problem. In this paper, I proposed an enhanced warning message propagation scheme in the poor electric wave environment as the intersection area. Proposed scheme forwards the warning message to the blind area by enhanced forwarding node selection technique. For efficiency of warning message propagation, I suggest forwarding priority for decision of forwarding node. And the node has a direct mode or redirect mode depending on neighbor nodes. The simulation was carried out to evaluate the performance. The simulation results show that proposed scheme has the superior performance compared to legacy warning message technique.

Joint Relay Selection and Resource Allocation for Delay-Sensitive Traffic in Multi-Hop Relay Networks

  • Sha, Yan;Hu, Jufeng;Hao, Shuang;Wang, Dan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제16권9호
    • /
    • pp.3008-3028
    • /
    • 2022
  • In this paper, we investigate traffic scheduling for a delay-sensitive multi-hop relay network, and aim to minimize the priority-based end-to-end delay of different data packet via joint relay selection, subcarrier assignment, and power allocation. We first derive the priority-based end-to-end delay based on queueing theory, and then propose a two-step method to decompose the original optimization problem into two sub-problems. For the joint subcarrier assignment and power control problem, we utilize an efficient particle swarm optimization method to solve it. For the relay selection problem, we prove its convexity and use the standard Lagrange method to deal with it. The joint relay selection, subcarriers assignment and transmission power allocation problem for each hop can also be solved by an exhaustive search over a finite set defined by the relay sensor set and available subcarrier set. Simulation results show that both the proposed routing scheme and the resource allocation scheme can reduce the average end-to-end delay.

Distributed memory access architecture and control for fully disaggregated datacenter network

  • Kyeong-Eun Han;Ji Wook Youn;Jongtae Song;Dae-Ub Kim;Joon Ki Lee
    • ETRI Journal
    • /
    • 제44권6호
    • /
    • pp.1020-1033
    • /
    • 2022
  • In this paper, we propose novel disaggregated memory module (dMM) architecture and memory access control schemes to solve the collision and contention problems of memory disaggregation, reducing the average memory access time to less than 1 ㎲. In the schemes, the distributed scheduler in each dMM determines the order of memory read/write access based on delay-sensitive priority requests in the disaggregated memory access frame (dMAF). We used the memory-intensive first (MIF) algorithm and priority-based MIF (p-MIF) algorithm that prioritize delay-sensitive and/or memory-intensive (MI) traffic over CPU-intensive (CI) traffic. We evaluated the performance of the proposed schemes through simulation using OPNET and hardware implementation. Our results showed that when the offered load was below 0.7 and the payload of dMAF was 256 bytes, the average round trip time (RTT) was the lowest, ~0.676 ㎲. The dMM scheduling algorithms, MIF and p-MIF, achieved delay less than 1 ㎲ for all MI traffic with less than 10% of transmission overhead.

패킷 중요도 결정에 의한 VoIP 통화 품질 향상 기술 (Improving Speech Quality of VoIP by Packet Prioritization)

  • 윤제열;박호종
    • 한국음향학회지
    • /
    • 제29권5호
    • /
    • pp.347-353
    • /
    • 2010
  • VoIP 시스템의 통화 품질은 패킷의 전송 손실에 의하여 크게 저하되며, 각 패킷의 손실에 의한 음질 저하 정도는 해당 패킷의 특성에 따라 결정된다. 따라서 각 패킷 손실에 의한 음질 저하를 미리 분석하여 전송 과정에서 손실되는 패킷을 선택적으로 조정하면 VoIP 통화 품질을 향상시킬 수 있다. 본 논문에서는 DS 기반의 네트워크를 사용하는 VoIP에서 각 패킷에 전송 우선순위를 할당하여 통화 품질을 향상시키는 구조를 제안하고, 이를 위한 패킷 중요도 결정 방법을 제안한다. Gilbert 모델에 따른 패킷 손실 환경에서 제안한 방법의 성능을 측정하였으며, 객관적 음질 평가와 주관적 음질 평가를 통하여 VoIP 통화 품질이 향상되는 것을 확인하였다.

SDN-COR: An Efficient Network Coding Opportunistic Routing Method for Software-Defined Wireless Sensor Networks

  • Yifan Hu;Xiqiang Hou;Fuqiang Wang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제18권7호
    • /
    • pp.1795-1816
    • /
    • 2024
  • A Software-Defined Wireless Sensor Networks (SDWSNs) architecture is firstly proposed to address the issues of inflexible architecture strategies and low scalability of traditional WSNs in this article. The SDWSNs architecture involves the design of a software-defined sensor network model and a customized controller architecture, along with an analysis of the functionalities of each management module within the controller architecture. Secondly, to tackle limited energy problem of sensor nodes, a network coding opportunistic routing method (SDN-COR) is presented based on SDWSNs. This method incorporates considerations of coding opportunities, vertical distance, and remaining energy of nodes to design a metric for encoding opportunistic routing. By combining opportunistic forwarding mechanisms, candidate forwarding sets are selected and sorted based on priority to prioritize data transmission by higher-priority nodes. Simulation results indicate that, comparing with conventional methods, this approach achieves reduction in energy consumption by an average of 21.5%, improves network throughput by 24%, and extends network lifetime by 20%.

계층변조 시스템에서 신호의 우선순위를 이용한 블라인드 등화 (Priority Based Blind Equalization for Hierarchical Modulation Systems)

  • 최운락;서보석
    • 한국콘텐츠학회논문지
    • /
    • 제7권12호
    • /
    • pp.254-261
    • /
    • 2007
  • 이 논문에서는 계층변조를 적용하는 AT-DMB (advanced terrestrial digital multimedia broadcasting) 시스템에 적용할 수 있는 블라인드등화 기법을 제시하고 그 성능을 살펴본다. AT-DMB 시스템은 기존 T-DMB의 DQPSK (differential quadrature phase-shift keying) 신호와 역방향 호환성을 보장하고 더 높은 데이터 전송률을 지원하기 위해 16-QAM (quadrature amplitude modulation) 계층변조 방식을 적용한다. 이 결과 SNR (signal to noise ratio)에 따라 기존 T-DMB 심볼과 추가된 심볼은 서로 다른 판정오율 (decision error rate)을 가진다. 따라서 판정한 신호로부터 채널을 추정할 때 판정오율이 낮은 선순위 심볼과 판정오율이 높은 후순위 심볼의 신뢰도에 따라 다른 가중치를 줌으로써 판정치의 전체적인 신뢰도를 향상시킬 수 있다. 이 논문에서는 계층변조에 따른 비트 오율(bit error rate) 성능의 악화정도를 분석하고, 모의실험을 통해 판정신호의 신뢰도에 따라 가중치를 주는 제안방식이 가중치를 주지 않은 경우에 비해 비트 오율 성능이 향상됨을 확인하였다.

IEEE 1394 네트웍에서 실시간성 보장을 위한 디바이스 드라이버 소프트웨어 구조 설계 및 구현 (A Design and Implementation of Device Driver Architecture of IEEE 1394 Network Adaptor for Guaranteeing Real-Time Characteristics)

  • 박동환;임효상;강순주
    • 한국통신학회논문지
    • /
    • 제27권4C호
    • /
    • pp.295-307
    • /
    • 2002
  • 핫 플러깅과 네트웍 자동 재구성, 등시성 전송 기능을 지원하는 IEEE1394는 멀티미디어 디지털 홈 네트웍의 표준이 되었다. 특히 최근 IEEE 1394 프로토콜이 흠 씨어터 서비스와 같은 QoS 보장형 멀티미디어 네트웍, 실시간 통신 기능을 가지는 디지털 계측 제어 프로토콜과 연동되는 환경에서 백본 네트웍 프로토콜, 혹은 실시간 코바(CORBA) 와 같은 실시간성을 지원해야 하는 미들웨어의 물리계층 프로토콜 등에 사용되면서 네트웍 디바이스 드라이버 수준에서의 실시간성 보장이 요구되고 있다. 실시간성을 보장하기 위해 IEEE 1394 네트웍 디바이스 드라이버는 우선 순위 기반의 패킷 처리 기능과 1394의 등시성 통신의 주기에 기반한 등시성 버퍼관리 기능의 지원이 필요하다. 그러나 기존 상용 OS의 네트웍 디바이스 드라이버는 등시성 전송과 같은 IEEE 1394의 특성을 제대로 반영하지 못하며 실시간 통신을 지원하지 않는다. 본 논문에서는 IEEE 1394 디바이스 드라이버 수준에서 실시간 전송을 보장하기 위한 네트웍 디바이스 드라이버의 구조를 제안한다.