• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.55 no.1
• /
• pp.24-30
• /
• 2006

The Controller Area Network (CAN) is being widely used for real-time control application and small-scale distributed computer controller systems. When the stuff bits are generated by bit-stuffing mechanism in the CAN network, it causes jitter including variations in response time and delay In order to eliminate this jitter, stuff bits must be controlled to minimize the response time and to reduce the variation of data transmission time. This paper proposes the method to reduce the stuff bits by restriction of available identifier and bit mask using exclusive OR operation. This da manipulation method are pretty useful to the real-time control strategy with respect to performance. However, the CAN may exhibit unfair behavior under heavy traffic conditions. When there are both high and low priority messages ready for transmission, the proposed precedence priority filtering method allows one low priority message to be exchanged between any two adjacent higher priority messages. In this way, the length of each transmission delays is upper bounded. These procedures are implemented as local controllers for the ISHURO(Inha Semvung Humanoid Robot).

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.38 no.4
• /
• pp.59-71
• /
• 2001

The Current CORBA shows some limitations for its successful deployment in real time system applications. Recently, OMG adopted Real-Time CORBA specification, which is defined as an extension to CORBA. The goal of the Real-Time CORBA is to provide a standard for CORBA ORB implementations that support 'end to end predictability'. In order to support 'end-to-end predictability', Real Time CORBA specifies many components such as priority model, communication protocol configuration, thread management, and etc. Among them, 'priority model' is the most important mechanism for avoiding or bounding priority inversion in CORBA invocations. In this paper, we present our efforts on a design ,and implementation of the Priority Model in Real-Time CORBA specification. The implementation is done as an extension of omniORB2(v.3.0.0), a popular open source non real time ORB. Experiment results demonstrate that our priority model implementation shows better performance and predictability than the non real-time ORB.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.9
• /
• pp.4103-4121
• /
• 2018

Quality of Service (QoS) awareness is recognized as a key point for the success of Internet of Things (IOT).Realizing the full potential of the Internet of Things requires, a real-time task scheduling algorithm must be designed to meet the QoS need. In order to schedule tasks with diverse QoS requirements in cloud environment efficiently, we propose a task scheduling strategy based on dynamic priority and load balancing (DPLB) in this paper. The dynamic priority consisted of task value density and the urgency of the task execution, the priority is increased over time to insure that each task can be implemented in time. The scheduling decision variable is composed of time attractiveness considered earliest completion time (ECT) and load brightness considered load status information which by obtain from each virtual machine by topic-based publish/subscribe mechanism. Then sorting tasks by priority and first schedule the task with highest priority to the virtual machine in feasible VMs group which satisfy the QoS requirements of task with maximal. Finally, after this patch tasks are scheduled over, the task migration manager will start work to reduce the load balancing degree.The experimental results show that, compared with the Min-Min, Max-Min, WRR, GAs, and HBB-LB algorithm, the DPLB is more effective, it reduces the Makespan, balances the load of VMs, augments the success completed ratio of tasks before deadline and raises the profit of cloud service per second.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2004.07a
• /
• pp.57-57
• /
• 2004

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.4
• /
• pp.17-24
• /
• 2016

In this paper, we propose a AH LSU(Advanced Hybrid QoS Routing Link State Update) Algorithm that improves the performance of Hybrid LSU(Hybrid QoS Link State State Update) Algorithm with statistical information of flow holding time in network. AH LSU algorithm has had both advantages of LSU message control in periodic QoS routing LSU algorithm and QoS routing performance in adaptive LSU algorithm. It has the mechanism that calculate LSU message transmission priority using the flow of statistical request bandwidth and available bandwidth and include MLMR(Meaningless LSU Message Removal) mechanism. MLMR mechanism can remove the meaningless LSU message generating repeatedly in short time. We have evaluated the performance of the MLMR mechanism, the proposed algorithm and the existing algorithms on MCI simulation network. We use the performance metric as the QoS routing blocking rate and the mean update rate per link, it thus appears that we have verified the performance of this algorithm.

• Journal of KIISE:Information Networking
• /
• v.30 no.4
• /
• pp.461-473
• /
• 2003

Multimedia applications are much more sensitive to QoS(Quality of Service) than text based ones due to their data continuity. In order to provide a fast moving MH(Mobil Host) using multimedia application with a consistent QoS,an efficient call admission mechanism is in need. This paper proposes the 2SCA(2-Step Call Admission) scheme based on cal admission scheme using pripority to guarantee the consistent QoS for mobile multimedia applications. A calls of MH are classified new calls, hand-off calls, and QoS upgrading calls. The 2SCA is composed of the basic call admission and advanced call admission; the former determines the call admission based on bandwidth available in each cell and the latter determines the call admission by applying DTT(Delay Tolerance Time), PQeueu(Priority Queue), and UpQueue(Upgrade Queue) algorithm according to the type of each call blocked at the basic call admission stage. In order to evaluate the performance of our mechanism, we measure the metrics such as the dropping probability of new calls, dropping probability of hand-off calls, and bandwidth utilization. The result shows that the performance of our mechanism is superior to that of existing mechanisms such as CSP(Complete Sharing Policy), GCP(Guard Channel Policy) and AGCP(Adaptive Guard Channel Policy).

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.4
• /
• pp.17-27
• /
• 2007

The enhanced distributed channel access (EDCA) of IEEE 802.11e has been standardized for supporting Quality of Service (QoS) in wireless LANs. In the EDCA, support of QoS can be achieved statistically by reducing the probability of medium access for lower priority traffics. In other words, it provides statistical channel access rather than deterministically prioritized access to high priority traffic. Therefore, lower priority traffics affect the performance of higher priority traffics. Consequently, at the high loads, the EDCA does not guarantee the QoS of multimedia applications such as voice and video even though it provides higher priority. In this paper, we propose a simple and effective scheme, called deterministic priority channel access (DPCA), for improving the QoS performance of the EDCA mechanism. In order to provide guaranteed priority channel access to multimedia applications, the proposed scheme uses a busy tone for limiting the transmissions of lower priority traffics when higher priority traffic has data packets to send. Performance of the proposed scheme is investigated by numerical analysis and simulation. Our results show that the proposed scheme outperforms the EDCA in terms of throughput, delay, jitter, and drop under a wide range of contention levels.

• Proceedings of the IEEK Conference
• /
• 2000.11a
• /
• pp.307-310
• /
• 2000

ATM is the switching and multiplexing technology chosen by the ITU-T for the operation of B-lSDN. Basically, ATM technology is designed to combine the reliability of circuit switching with the efficiency and flexibility of packet switching technology. For servicing QoS in IPOA(IP over ATM) when the larger effort is given, it will be the good method that the original QoS benefits having ATM switching have in ATM layer underlying layer. The IETF has recently proposed Differentiated Services framework for provision of QoS. In this paper we analyse performance of two Diffserv mechanism. Threshold Dropping and Priority Scheduling. Threshold Dropping and Priority Scheduling can be regarded as basic mechanisms from which the other mechanisms have been derived. Hence comparative performance of these two mechanisms in providing required QoS is an important issue. In this Paper we carry out a performance comparison of the TD and PS mechanisms with the aim of providing the same level of packet loss to the preferred flow. Our comparison of the TD and PS allows us to determine resultant packet loss for the non-preferred flows as a function of various parameters of the two mechanisms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.7B
• /
• pp.653-663
• /
• 2002

UMTS/GPRS has its own QoS architecture, but additionally needs to support IP-QoS to provide Internet services. This paper describes an IP-QoS provisioning mechanism in the MPLS-based UMTS/GPRS network. We propose a QoS framework that includes the functional architecture of the MPLS-based GPRS networks and the efficient scheduling mechanism based on Diffserv model. The proposed scheduling mechanims is especially focused on the QoS support for real-time services. It also includes a new buffer management scheme that combines the priority queuing and weighted round robin method. The ns-2 simulator has been used to verify the validity of the proposed scheduling method.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.1
• /
• pp.103-109
• /
• 2019

The automotive electronic system should provide a method that can be safely performed by loading a number of application programs having time constraints in several electronic control devices. In this paper, we propose a timing protection mechanism for AUTOSAR, which is a real - time operating system specification for automotive field, in order to observe the deadline of each task when scheduling real - time tasks. We propose a dynamic non-preemption algorithm to guarantee a flexible deadline for fixed priority or dynamic priority tasks, and a location where execution time can be monitored for errors, and suggest ways to implement the AUTOSAR time protection mechanism.