• Proceedings of the KIEE Conference
• /
• 1997.11a
• /
• pp.109-112
• /
• 1997

A Discrete Event Dynamic System is a system whose states change in response to the occurrence of events from a predefined event set. A major difficulty in developing analytical results for the systems is the lack of appropriate modeling techniques. This paper proposes the use of Real-time Temporal Logic as a modeling tool for the modeling and control of fixed-time traffic control problem which by way of a DEDS. The Real-time Temporal Logic Frameworks is extended with a suitable structure of modeling hard real-time constraints. Modeling rules are developed for several specific situations. It is shown how the graphical model can be translated to a system of linear equations and constraints.

• The Journal of the Korea Contents Association
• /
• v.8 no.6
• /
• pp.34-42
• /
• 2008

MAC(Medium Access Control) is demanded to provide end-to-end QoS(Quality of Service) for a variety of traffic in the wireless networks. When all the traffic is integrated in the channel, the main difficulty of the MAC protocol is how to efficiently support multi-class traffic in the limited bandwidth wireless channel. In this paper, we proposed the dynamic bandwidth slot method for improving QoS of the real time traffics. In this paper, we used in-band scheme to send dynamic parameter and considering buffer size and delay variation, we enabled 2 state bits to send to base station in mobile station. The proposed algorithm is to guarantee QoS of real time traffic and maximize transfer efficiency in wireless networks.

• Journal of Communications and Networks
• /
• v.15 no.1
• /
• pp.15-24
• /
• 2013

Provisioning of quality of service (QoS) is a key issue in any multi-media system. However, in wireless systems, supporting QoS requirements of different traffic types is a more challenging problem due to the need to simultaneously minimize two performance metrics - the probability of dropping a handover call and the probability of blocking a new call. Since QoS requirements are not as stringent for non-real-time traffic, as opposed to real-time traffic, more calls can be accommodated by releasing some bandwidth from the already admitted non-real-time traffic calls. If the released bandwidth that is used to handle handover calls is larger than the released bandwidth that is used for new calls, then the resulting probability of dropping a handover call is smaller than the probability of blocking a new call. In this paper, we propose an efficient call admission control algorithm that relies on adaptive multi-level bandwidth-allocation scheme for non-realtime calls. The scheme allows reduction of the call dropping probability, along with an increase in the bandwidth utilization. The numerical results show that the proposed scheme is capable of attaining negligible handover call dropping probability without sacrificing bandwidth utilization.

• Journal of KIISE:Information Networking
• /
• v.32 no.2
• /
• pp.134-146
• /
• 2005

Research about QoS in the ad-hoc networks for stable service of various applications has been needed as the expectation about the realization of the ad-hoc networks grows bigger. Existing researches about QoS in the ad-hoc network had the problems which can not guarantee the quantitative services or create the overhead. In this paper, we propose a novel algorithm of QFAN(QoS Framework for Ad-hoc Networks) the framework to resolve such problems and considered application of the proposed algorithm into the ad-hoc networks. Our model can guarantee the minimum bandwidth of the real-time traffic as minimized the overhead. And, disproportionate distribution of bandwidth problem can resolve by the proposed algorithm through the fair share between real-time traffic and best-effort traffic about available bandwidth. We design both the TiRe(Tiny Reservation) and the ADR(Adaptive Drop Rate) control algorithm to apply the proposed QFAN. Using simulation, we confirm fair share of available bandwidth between real-time traffic and best-effort traffic as guarantee minimum required bandwidth of real-time traffic.

• Journal of Korean Society of Transportation
• /
• v.34 no.3
• /
• pp.278-290
• /
• 2016

Maximum traffic flow rate is an important performance measure of operational status in transport networks, and has been considered as a key parameter for transportation operation since a bottleneck in congestion decreases maximum traffic flow rate. Although previous studies for traffic flow analysis have been widely conducted, a detection method for changes in dynamic traffic flow has been still veiled. This paper explores the dynamic traffic flow detection that can be utilized for various traffic operational strategies. Turning point analysis (TPA), as a statistical method, is applied to detect the changes in traffic flow rate. In TPA, Bayesian approach is employed and vehicle arrival is assumed to follow Poisson distribution. To examine the performance of the TPA method, traffic flow data from Jayuro urban expressway were obtained and applied. We propose a novel methodology to detect turning points of dynamic traffic flow in real time using TPA. The results showed that the turning points identified in real-time detected the changes in traffic flow rate. We expect that the proposed methodology has wide application in traffic operation systems such as ramp-metering and variable lane control.

• ETRI Journal
• /
• v.39 no.4
• /
• pp.558-569
• /
• 2017

In this study, a non-preemptive M/G/1 queueing model of a spectrum handoff scheme for cognitive wireless networks is proposed. Because spectrum handoff gives secondary users an opportunity to carry on their transmissions, it is crucially important to determine the actions of primary users. In our queueing model, prioritized data traffic is utilized to meet the requirements of the secondary users. These users' packets are categorized into three different priority classes: urgent, real-time, and non-real time. Urgent data packets have the highest priority, while non-real time data packets have the lowest priority. Riverbed (OPNET) Modeler simulation software was used to simulate both reactive and proactive decision spectrum handoff schemes. The simulation results were consistent with the analytical results obtained under different load and traffic conditions. This study also revealed that the cumulative number of handoffs can be drastically decreased by exploiting priority classes and utilizing a decent spectrum handoff strategy, such as a reactive or proactive decision-based strategy.

• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06d
• /
• pp.476-479
• /
• 2008

Wireless Sensor Network typically incorporates various real time applications that must meet timing constraints under severe resource limitations. Due to the high data rate and burst traffic for that type of applications, occurrence of congestion is very common. Ensuring the end-to-end deadline under congested scenario is quite challenging. In this paper we propose a hop-by-hop rate control algorithm which avoids the congestion as well as ensures that the real time traffic will meet the end-to-end deadline by guaranteeing the meeting of local deadline at intermediate hop. Finally, simulation has demonstrated the effectiveness of our approach.

• Proceedings of the IEEK Conference
• /
• 2002.07b
• /
• pp.876-879
• /
• 2002

The paper presents the analysis and results of traffic measurements in the 155 Mbit/s real working ATM backbone network. The traffic is described as an ordered sequence of real-time cells. In this paper we analyze two timescales in which some form of a stochastic process is taking place: cell scale and burst scale. We present another way to describe the cell flow in ATM networks by definition the function, designed to be the probability of the burst of length ∫in n sequential slots.

• Proceedings of the KIEE Conference
• /
• 2005.05a
• /
• pp.215-217
• /
• 2005

There are two types of packet loss probabilities used in both the network layer and the physical layer within the wireless transmitter such as a queueing discard probability and transmission loss probability. We analyze these loss performances in order to guarantee Quality of Service (QoS) which is the basic of the future network. The queuing loss probability is caused by a maximum allowable delay time and the transmission loss probability is caused by a wireless channel error. These two types of packet loss probabilities are not easily analyzed due to recursive feedback which, originates as a result at a queueing delay and a number of retransmission attempts. We consider a wireless transmitter to a M/D/1 queueing model. We configurate the model to have a finite-size FIFO buffer in order to analyze the real-time traffic streams. Then we present the approaches used for evaluating the loss probabilities of this M/D/1/K queueing model. To analyze the two types of probabilities which have mutual feedbacks with each other, we drive the solutions recursively. The validity and accuracy of the analysis are confirmed by the computer simulation. From the following solutions, we suggest a minimum of 'a Maximum Allowable Delay Time' for real-time traffic in order to initially guarantee the QoS. Finally, we analyze the required service rate for each type utilizing real-time traffic and we apply our valuable analysis to a N-user's wireless network in order to get the fundamental information (types of supportable real-type traffics, types of supportable QoS, supportable maximum number of users) for network design.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.1
• /
• pp.1-13
• /
• 1998

The next generation of wireless network will be problably developed as a mobile communications which will support ATM-based multiMedium traffic. We need to develop an dffective MAC protocol in order to support multimedia traffic having variety of QoS characteristics on wireless neteworks. In this paper, we propose a MAC protocol a MAC protocol where mobile terminals having cells to transmit, request slots to base station through requested slot then the base station analyze parameters from mobile and allocate slots to mobile according to priority. The multimedia slot allocation(MSA) protocol divides multimedias applications into real-time/ variant and non real-time services. Entire slots of the frameare partitioned proportionallyby sizeof bandwidth according to types of services, so that related services can use allocated-slots in priority. The proposed algorithm guarantees real time operation since real-time service share slots allocated for non real-real services. The algorithm whih divides slots of the frame is called as an Algorithm A, otherwise as an Algorithm B. The simulation compares by average delay time and cell loss probability between Algorithm and Algorithm B by increasing number of mobile terminal using the proposed MAC protocol. the simulation result for real-time services shows that average delay time and cell loss probability of Algorithm A is better than those of Algorithm B.