• Journal of Institute of Control, Robotics and Systems
• /
• v.3 no.1
• /
• pp.77-88
• /
• 1997

Fieldbus is the lowest level communication network in factory automation and process control systems. Performance of factory automation and process control systems is directly affected by the data delay induced by network traffic. Data generated from several distributed field devices can be largely divided into three categories: sporadic real-time, periodic real-time and non real-time data. Since these data share one fieldbus network medium, the limited bandwidth of a fieldbus network must be appropriately allocated to the sporadic real-time, periodic real-time and non real-time traffic. This paper introduces a new fieldbus design scheme which allocates the limited bandwidth of fieldbus network to several different kinds of traffic. The design scheme introduced in this study not only satisfies the performance requirements of application systems interconnected into the fieldbus but also fully utilizes the network resources. The design scheme introduced in this study can be applicable to cyclic service protocols operated under single-service discipline. The bandwidth allocation scheme introduced in this study is verified using a discrete-event/continuous-time simulation experiment.

• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.237-239
• /
• 2004

Wireless LAN Voice over IP(VoIP) equipment needs Quality-of-Service(QoS) with priority for processing real-time traffic. This paper shows transmit function implementation of wireless LAN(WLANs) media access control(MAC) support VoIP, and it has an advantage of guarantee of QoS and is adaptable to VoIP or mobile wireless equipment. The IEEE 802.11e standard in progress has four queues according to four access categories(AC) for transmit and the MAC transmits the data based on EDCA. The value of AC is from AC0 to AC3 and AC3 has the highest priority. The transmit method implemented at this paper ensure QoS using one transmit FIFO in hardware since real-time traffic data and non real-time traffic data has the different priority. The device driver classifies real-time data and non real-time data and transmit data to hardware with information about data type. The hardware conducts shorter backoff and selects faster AIFS slot for real-time data than it for non real-time data. Therefor It make give the real-time traffic data faster channel access chance than non real-time data and enhances QoS.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.1A
• /
• pp.30-37
• /
• 2006

In this paper, we propose a QoS-aware efficient bandwidth re-provisioning scheme in a next generation wireless packet transport network. At the transport network layer, it classifies the traffic of the radio network layer into a real time class and a non-real time class. Using an auto-regressive time-series model and a given packet loss probability, our scheme predicts the needed bandwidth of the non-real time class at every re-provisioning interval. Our scheme increases the system capacity by releasing the unutilized bandwidth of the non-real time traffic class for the real-time traffic class while insuring a controllable upper bound on the packet loss probability of a non-real time traffic class. Through empirical evaluations using the real Internet traffic traces, our scheme is validated that it can increase the bandwidth efficiency while guaranteeing the quality of service requirements of the non-real time traffic class.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.12
• /
• pp.539-546
• /
• 2002

In this paper, we consider a wireless multimedia environment to service both real-time video traffic and non-real-time WWW-application traffic In our suggested new packet scheduling algorithm, we consider both the accumulation counter and SIR to reduce delay in real-time traffic. In addition, our packet scheduling algorithm gives priority first to real-time video traffic service and then to non-real-time internet Packet service when real-time traffic service is absent. From the simulation results, we find that the AC (Accumulation Counter) scheme has much smaller delay than the conversional M-LWDF scheme for real-time video data users, which has a special quality sensitive to its own delay. We also consider the transmission structure of using both the frame period in the time-axis and the OVSF codes in the code-axis at the same time, which is similar to the structure of HSDPA system.

• ETRI Journal
• /
• v.38 no.4
• /
• pp.622-633
• /
• 2016

A discontinuous reception (DRX) operation is included in the Long Term Evolution (LTE) system to achieve power saving and prolonged battery life of the user equipment. An improvement in DRX power saving usually leads to a potential increase in the packet delay. An optimum DRX configuration depends on the current traffic, which is not easy to estimate accurately, particularly for non-real-time applications. In this paper, we propose a novel way to vary the DRX cycle length, avoiding a continuous estimation of the data traffic when only non-real-time applications are running with no active real-time applications. Because a small delay in non-real-time traffic does not essentially impact the user's experience adversely, we deliberately allow a limited amount of delay in our proposal to attain a significant improvement in power saving. Our proposal also improves the delay in service resumption after a long period of inactivity. We use a stochastic analysis assuming an M/G/1 queue to validate this improvement.

• ETRI Journal
• /
• v.24 no.5
• /
• pp.360-372
• /
• 2002

In this paper, we propose the modified dynamic weighted round robin (MDWRR) cell scheduling algorithm, which guarantees the delay property of real-time traffic and also efficiently transmits non-real-time traffic. The proposed scheduling algorithm is a variation of the dynamic weighted round robin (DWRR) algorithm and guarantees the delay property of real-time traffic by adding a cell transmission procedure based on delay priority. It also uses a threshold to prevent the cell loss of non-real-time traffic that is due to the cell transmission procedure based on delay priority. Though the MDWRR scheduling algorithm may be more complex than the conventional DWRR scheme, considering delay priority minimizes cell delay and decreases the required size of the temporary buffer. The results of our performance study show that the proposed scheduling algorithm has better performance than the conventional DWRR scheme because of the delay guarantee of real-time traffic.

• Journal of Korea Multimedia Society
• /
• v.7 no.9
• /
• pp.1273-1281
• /
• 2004

There have been a number of researches on real-time packet scheduling based on EDF algorithm to support end-to-end delay bound guarantees for real-time traffic transmission. However, EDF-based packet scheduler could not guarantee the real-time requirements of real-time traffic if there exist non-real-time traffic. In this paper, we propose a new admission control algorithm and packet scheduling scheme considering non-real-time traffic in the real -time packet scheduler based on EDF policy. Proposed admission control algorithm has pseudo-polynomial time complexity, but we show through simulation that it can be used with little run-time overhead.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.97-100
• /
• 1997

Fieldbuses are used as the lowest level communication network for real-time communication in factory automation and process control systems. Data generated from field devices can be divided into three categories: sporadic real-time, periodic real-time and non real-time data. Since these data share one fieldbus network medium, it needs a method that allocate the limited bandwidth of fieldbus network to the sporadic real-time, periodic real-time and non real-time traffic. This paper introduces an implementation method of bandwidth allocation scheme introduced in [51 on PROFIBUS. Using the modified PROFIBUS FDL(Fieldbus Data Link layer), the bandwidth allocation scheme introduced in [51 is verified by the experiments.

• The KIPS Transactions:PartC
• /
• v.8C no.6
• /
• pp.805-814
• /
• 2001

In this paper, we propose a new scheduling algorithm that guarantees the delay property of real-time traffic, not considered in previous DWRR(Dynamic Weighted Round Robin) algorithm and also transmits non-real-time traffic efficiently. The proposed scheduling algorithm is a variation of DWRR algorithm to guarantee the delay property of real-time traffic by adding cell transmission method based on delay priority. It also uses the threshold to prevent the cell loss of non-real-time traffic due to cell transmission method based on delay priority. Proposed scheduling algorithm may increase some complexity over conventional DWRR scheme because of cell transmission method based on delay priority. However, the consideration of delay priority can minimize cell delay and require less size of temporary buffer. Also, the results of our performance study shows that the proposed scheduling algorithm has better performance than conventional DWRR scheme due to reliable ABR service and congestion avoidance capacity.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.7B
• /
• pp.641-649
• /
• 2004

We propose a dynamic traffic management model which uses adaptive priority reassignment algorithm to deliver service differentiation in home networks, and implement adaptive priority reassignment algorithm using FPGA. The proposed architecture is designed to handle home network traffic without the need for signaling protocol. We categorize home network traffic into three kinds of traffic class: control data traffic class, the Internet data and non-real-time data traffic class, and multimedia data traffic class (include non-real-time and real-time multimedia data traffic). To support differential service about these kinds of traffic class, we designed and implemented a traffic management framework that dynamically change each traffic class priority depending on bandwidth utilization of each traffic class.