• Title/Summary/Keyword: asynchronous scheduling

Search Result 39, Processing Time 0.021 seconds

Delay Bound Analysis of Networks based on Flow Aggregation (통합 플로우 기반 네트워크의 지연시간 최대치 분석)

  • Joung, Jinoo
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.20 no.1
    • /
    • pp.107-112
    • /
    • 2020
  • We analyze the flow aggregate (FA) based network delay guarantee framework, with generalized minimal interleaved regulator (IR) initially suggested by IEEE 802.1 time sensitive network (TSN) task group (TG). The framework has multiple networks with minimal IRs attached at their output ports for suppressing the burst cascades, with FAs within a network for alleviating the scheduling complexity. We analyze the framework with various topology and parameter sets with the conclusion that the FA-based framework with low complexity can yield better performance than the integrated services (IntServ) system with high complexity, especially with large network size and large FA size.

A Study on the Delays of Security Packet for ATM Network (ATM 망의 보안 패킷 지연에 관한 연구)

  • Lim Chung-Kyu
    • Journal of the Korea Society of Computer and Information
    • /
    • v.9 no.4 s.32
    • /
    • pp.173-178
    • /
    • 2004
  • 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 ATM services the Quality-of-Service (QoS) management of traffice sources and bandwidth. Besides efficiency and throughput, the security services are achieved in the traffic sent in ATM network. In this paper, the scheduler evaluate and the packets sent in ATM security group. The scheduler transmits the safty packet, drop the unsafty packet and evaluate mark packet as the requirement of the delay. In this paper, we propose the scheduling algorithm of mark packet which evaluates the packet. The suggested model performance of the firewall switch is estimate simulation in terms of the delay by computer.

  • PDF

CReMeS: A CORBA COmpliant Reflective Memory based Real-time Communication Service

  • Chung, Sun-Tae
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.10B
    • /
    • pp.1675-1689
    • /
    • 2000
  • We present CReMeS a CORBA-compliant design and implementation of a new real-time communication service. It provides for efficient predictable and scalable communication between information producers and consumers. The CReMeS architecture is based on MidART's Real-Time Channel-based Reflective Memory (RT-CRM) abstraction. This architecture supports the separation of QoS specification between producer and consumer of data and employs a user-level scheduling scheme for communicating real-time tasks. These help us achieve end-to-end predictability and allows our service to scale. The CReMeS architecture provides a CORBA interface to applications and demands no changes to the ORB layer and the language mapping layer. Thus it can run on non real-time Off-The-Shelf ORBs enables applications on these ORBs to have scalable and end-to-end predictable asynchronous communication facility. In addition an application designer can select whether to use an out-of-band channel or the ORB GIOP/IIOP for data communication. This permits a trade-off between performance predictability and reliability. Experimental results demonstrate that our architecture can achieve better performance and predictability than a real-time implementation of the CORBA Even Service when the out-of-band channel is employed for data communication it delivers better predictability with comparable performance when the ORB GIOP/IIOP is used.

  • PDF

Energy-Efficient Quorum-Based MAC Protocol for Wireless Sensor Networks

  • Annabel, L. Sherly Puspha;Murugan, K.
    • ETRI Journal
    • /
    • v.37 no.3
    • /
    • pp.480-490
    • /
    • 2015
  • The reliability of sensor networks is generally dependent on the battery power of the sensor nodes that it employs; hence it is crucial for the sensor nodes to efficiently use their battery resources. This research paper presents a method to increase the reliability of sensor nodes by constructing a connected dominating tree (CDT), which is a subnetwork of wireless sensor networks. It detects the minimum number of dominatees, dominators, forwarder sensor nodes, and aggregates, as well as transmitting data to the sink. A new medium access control (MAC) protocol, called Homogenous Quorum-Based Medium Access Control (HQMAC), is also introduced, which is an adaptive, homogenous, asynchronous quorum-based MAC protocol. In this protocol, certain sensor nodes belonging to a network will be allowed to tune their wake-up and sleep intervals, based on their own traffic load. A new quorum system, named BiQuorum, is used by HQMAC to provide a low duty cycle, low network sensibility, and a high number of rendezvous points when compared with other quorum systems such as grid and dygrid. Both the theoretical results and the simulation results proved that the proposed HQMAC (when applied to a CDT) facilitates low transmission latency, high delivery ratio, and low energy consumption, thus extending the lifetime of the network it serves.

Traffic Scheduling using Multi - Thresholds in ATM Networks (ATM망에서 다중 임계를 이용한 트래픽 스케줄링 연구)

  • Kim, Jong-Eun;Ahn, Hyo-Beom;Cho, Kyung-San
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.7
    • /
    • pp.1781-1787
    • /
    • 1997
  • Future high speed networks are expected to use the Asynchronous Transfer Mode(ATM), which provides desired quality of service for the various traffic types(e.g., voice, video and data). Proper traffic control scheme helps ensure efficient and fair operation of networks. In this paper, we analyze various related traffic-control strategies and propose a new traffic control scheme and ATM control architecture with an integrated buffer management method and multi-thresholds in order to solve the problem of each class's cell loss ratio and cell delay in ATM networks. In addition, we evaluate the performance improvement of the proposed traffic control scheme through simulation. As shown in the result, the proposed traffic control scheme improves cell loss ratio in proportion to the buffer size.

  • PDF

Reliable Asynchronous Image Transfer Protocol In Wireless Multimedia Sensor Network (무선 멀티미디어 센서 네트워크에서의 신뢰성 있는 비동기적 이미지 전송 프로토콜)

  • Lee, Joa-Hyoung;Seon, Ju-Ho;Jung, In-Bum
    • The KIPS Transactions:PartC
    • /
    • v.15C no.4
    • /
    • pp.281-288
    • /
    • 2008
  • Recently, the advance of multimedia hardware has fostered the development of wireless multimedia sensor network which is able to ubiquitously obtain multimedia content such as image or audio from the environment. The multimedia data which has several characteristics such as large size and correlation between the data requires reliability in transmission. However, the existing solution which take the focus on the efficiency of network mainly, is not appropriate to transmit the multimedia data. In the paper, we proposes a reliable asynchronous image transfer protocol, RAIT. RAIT applies double sliding window method in node-to-node image tansfer to prevent the packet loss caused by network congestion. The double sliding window consists of one sliding window for the receiving queue, which is used for prevention of packet loss caused by communication failure between nodes and the other sliding window for the sending queue which prevents the packet loss caused by network congestion. the routing node prevents the packet loss and guarantees the fairness between the nodes by scheduling the packets based on the image non-preemptively. The RAIT implements the double sliding window method by cross layer design between RAIT layer, routing layer, and queue layer. The experiment shows that RAIT guarantees the reliability of image transmission compared with the existing protocol.

Clock Synchronization for Periodic Wakeup in Wireless Sensor Networks (무선 센서 망에서 주기적인 송수신 모듈 활성화를 위한 클락 동기)

  • Kim, Seung-Mok;Park, Tae-Keun
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.3
    • /
    • pp.348-357
    • /
    • 2007
  • One of the major issues in recent researches on wireless sensor networks is to reduce energy consumption of sensor nodes operating with limited battery power, in order to lengthen their lifespan. Among the researches, we are interested in the schemes in which a sensor node periodically turns on and off its radio and requires information on the time when its neighbors will wake up (or turn on). Clock synchronization is essential for wakeup scheduling in such schemes. This paper proposes three methods based on the asynchronous averaging algorithm for clock synchronization in sensor nodes which periodically wake up: (1) a fast clock synchronization method during an initial network construction period, (2) a periodic clock synchronization method for saving energy consumption, and (3) a decision method for switching the operation mode of sensor nodes between the two clock synchronization methods. Through simulation, we analyze maximum clock difference and the number of messages required for clock synchronization.

  • PDF

Reduction of Switch Cost by Optimization of Tunable Wavelength Converters and Internal Wavelengths in the Optical Packet Switch with Shared FDL Buffer (공유형 광 지연 선로 버퍼를 갖는 광 패킷 스위치에서 튜닝 가능한 파장 변환기와 내부 파장 개수의 최적화에 의한 스위치 비용 감소)

  • Hwang, Il-Sun;Lim, Huhn-Kuk;Yu, Ki-Sung;Chung, Jin-Wook
    • Journal of Internet Computing and Services
    • /
    • v.7 no.6
    • /
    • pp.113-121
    • /
    • 2006
  • To reduce switch cost, the optimum numbers of tunable wavelength converters (TWCs) and internal wavelengths required for contention resolution of asynchronous and variable length packets like internet traffics, is presented in the optical packet switch (OPS) with the shared fiber delay line (FDL) buffer. To optimize TWCs and internal wavelength related to on OPS design cost, we proposed a scheduling algorithm for the limited TWCs and internal wavelengths. For three TWC alternatives (not shared, partially shared, and fully shared cases), the optimum numbers of TWCs and internal wavelengths to guarantee minimum pocket loss are evaluated to prevent resource waste. Under o given load, TWCs and internal wavelengths could be significantly reduced, guaranteeing the same pocket loss probability as the performance of on OPS with full TWCs and internal wavelengths.

  • PDF

Performance Model and Analysis for Improving Efficient Packet Service of GGSN in CPRS Network (GPRS 망에서 GGSN 노드의 패킷 처리 향상을 위한 성능 모델 및 분석)

  • Kwak, Yong-Won;Min, Jae-Hong;Jeong, Young-Sic;Park, Wung
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2002.11a
    • /
    • pp.826-834
    • /
    • 2002
  • Asynchronous third generation mobile communication system is able to service Packet Switching through adding GPRS Network to the second generation system GSM. Therefore, it is necessary to study packet traffic service of GGSN node which is due to perform gateway role that GPRS Network is enable to inter-connect with Internet in order to optimize the capability and performance of GGSN. In this paper, the Internet packet traffic model that it is arrived to GGSN node from the Internet is studied and In order to process the Inter traffic efficiently, performance analysis model in GGSN is proposed to optimize packet processing capability of each processor. In order to guarantee QoS requirement of the real time traffic Speech and Video, several scheduling algorithm is applied to performance model and each mechanism is compared with several performance parameters.

  • PDF