• 한국콘텐츠학회논문지
• /
• 제8권6호
• /
• pp.34-42
• /
• 2008

무선망에서 다양한 트래픽의 종단간 서비스의 질을 보장하기 위해서는 매체접근제어가 요구된다. 무선망에서 다양한 트래픽이 채널에서 통합될 때 매체접근제어 프로토콜의 주요 단점은 한정된 대역폭을 어떻게 효율적으로 멀티 클래스 트래픽을 위해 지원할 수 있는가이다. 본 논문에서는 실시간 트래픽의 서비스의 질을 향상시키기 위해 동적 대역 슬롯 기법을 제안하였다. 제안된 기법에서는 동적파라미터를 전송하기 위해서 인 밴드 방식을 사용하였으며, 버퍼의 크기와 지연변이를 고려하여 이동국에서는 2상태 비트를 기지국으로 전송될 수 있도록 하였다. 제안된 기법은 실시간 트래픽의 서비스의 질을 보장하고 전송효율을 높일 수 있도록 하였다.

• Journal of Communications and Networks
• /
• 제15권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.

• 한국정보과학회논문지:정보통신
• /
• 제32권2호
• /
• pp.134-146
• /
• 2005

Ad-Hoc Network의 실용화에 대한 기대가 커짐에 따라 다양한 응용의 안정적인 서비스를 위해 005의 지원을 위한 연구가 필요하게 되었다. Ad-Hoc Network에서 005를 지원하기 위한 기존의 연구들은 정량적인 서비스를 보장하기 어렵거나, 네트워크 오버헤드를 발생시키는 문제점을 가지고 있었다. 본 논문에서는 이러한 문제를 해결하기 위해 새로운 QFAN(QoS Framework for Ad-hoc Networks)을 제안한다. 본 논문에서 제안하는 QFAN은 네트워크 오버헤드를 최소화하면서 실시간 트래픽의 최소 대역폭을 보장할 수 있다 그리고 실시간 트래픽과 최선형 트래픽간의 잉여 대역폭에 대한 공정분배를 통해 대역폭 불균형 문제를 해결할 수 있다. 제안된 프레임웍을 실제 적용하기 위해서 TiRe(Tiny Reservation)과 ADR(Adaptive Drop Rate) 컨트롤 알고리즘을 설계하였다. 시뮬레이션을 통해 실시간 트래픽의 최소 요구 대역폭을 만족시키면서, 실시간 트래픽과 최선형 트래픽이 잉여 대역폭을 공정 분배하는 것을 확인 할 수 있었다.

• 대한교통학회지
• /
• 제34권3호
• /
• pp.278-290
• /
• 2016

연속교통류 운영 및 설계에서는 최대통과교통류율에 따른 교통류 상태변화 분석이 중요하다. 최대통과교통류율은 연속교통류 운영상태를 평가함에 있어 기준이 되고 있으며, 병목현상과 같은 지 정체 발생시 최대통과교통류율이 급격히 감소하게 된다. 현재까지 이러한 연속교통류 운영과 관련된 다양한 연구들이 수행되었지만, 변화되는 교통량을 명확하게 식별하지 못하고 있다. 이에 본 연구에서는 교통운영 및 설계 등의 다양한 연구를 수행하는 데 있어 가장 중요한 실시간 교통량 변화 검지 방법론에 대한 연구를 실시한다. 이를 위하여 도시고속도로 자유로 구간의 24시간 레이더검지기의 시계열 자료를 이용하며, 교통류 상태 구분에는 통계적 기법의 일환인 터닝포인트 분석(Tunring Point Analysis, 이하 TPA)를 적용한다. TPA는 베이지안 접근법(bayesian approach)을 이용하며, 차량도착은 포아송 분포로 가정한다. 분석대상 구간에 대한 터닝포인트(Turning Point, 이하 TP)를 도출하였으며, 교통량이 변화되는 시점을 확인할 수 있었다. 또한 실시간 교통상태변화 검지를 위한 방법으로 TP지속시간을 설정하여 분석을 실시하였으며, 실시간으로 교통량의 변화를 검지하였다. 이는 기존의 직관적이고 경험적인 접근법의 한계를 극복할 수 있는 장점을 가지며, 실시간으로 교통량 변화를 식별할 수 있어 램프미터링(ramp-metering), 가변차로 등의 교통운영관리에 적용이 가능하다.

• ETRI Journal
• /
• 제39권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.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2008년도 한국컴퓨터종합학술대회논문집 Vol.35 No.1 (D)
• /
• 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.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 ITC-CSCC -2
• /
• 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.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2005년도 심포지엄 논문집 정보 및 제어부문
• /
• 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.

• 전자공학회논문지S
• /
• 제35S권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.

• 대한교통학회지
• /
• 제14권3호
• /
• pp.7-26
• /
• 1996

The estimation of real-time Origin-Destination(O-D) parameters, which gives travel demand between combinations of origin and destination points on a urban freeway network, from on-line surveillance traffic data is essential in developing an efficient ATMS strategy. On this need a real-time O-D parameter estimation model is formulated as a parameter adaptive filtering model based on the extended Kalman Filter. A Monte Carlo test have shown that the estimation of time-varying O-D parameter is possible using only traffic counts. Tests with field data produced the interesting finding that off-ramp volume predictions generated using a constant freeway O-D matrix was replaced by real-time estimates generated using the parameter adaptive filter.