• Journal of Communications and Networks
• /
• 제14권1호
• /
• pp.15-20
• /
• 2012

As Internet protocol and wireless communications have developed, the number of different types of mobile services has increased gradually. Existing priority-computing schemes cannot satisfy the dynamic requirements of supporting multiple services in future wireless communication systems, because the currently used factors, mainly user priority, are relatively simple and lack relevancy. To solve this problem and provide the desired complexity, dynamic behavior, and fairness features of 3G and beyond 3G mobile communication systems, this paper proposes a novel cross-layer dynamic integrated priority-computing scheme that computes the priority based on a variety of factors, including quality of service requirements, subscriber call types, waiting time, movement mode, and traffic load from the corresponding layers. It is observed from simulation results that the proposed dynamic integrated priority scheme provides enhanced performance.

• Journal of Communications and Networks
• /
• 제16권2호
• /
• pp.193-201
• /
• 2014

In cognitive radio networks, the packet transmissions of the secondary users (SUs) can be interrupted randomly by the primary users (PUs). That is to say, the PU packets have preemptive priority over the SU packets. In order to enhance the quality of service (QoS) for the SUs, we propose a spectrum access strategy with an ${\alpha}$-Retry policy. A buffer is deployed for the SU packets. An interrupted SU packet will return to the buffer with probability ${\alpha}$ for later retrial, or leave the system with probability (1-${\alpha}$). For mathematical analysis, we build a preemptive priority queue and model the spectrum access strategy with an ${\alpha}$-Retry policy as a two-dimensional discrete-time Markov chain (DTMC).We give the transition probability matrix of the Markov chain and obtain the steady-state distribution. Accordingly, we derive the formulas for the blocked rate, the forced dropping rate, the throughput and the average delay of the SU packets. With numerical results, we show the influence of the retrial probability for the strategy proposed in this paper on different performance measures. Finally, based on the trade-off between different performance measures, we construct a cost function and optimize the retrial probabilities with respect to different system parameters by employing an iterative algorithm.

• 한국통신학회논문지
• /
• 제22권2호
• /
• pp.268-279
• /
• 1997

In this paper, we show the movable boundary (MB) method is the effective bandwidth allocation strategy for the ABR service among existing bandwidth allocation methods. The MB method can gurantee the QOS requirement according to the service priority and improve bandwidth utilization using the characteristics of the ABR service. The threshold values of the MB, which have an important effect upon connection blocking probability(CBP) performance of each service, are obtained by simulation. The MB method with the fixed thresholds, however, may not have good performance to variation of input traffic parameters. We suggest the dynamic MB method which changes the threshold values adaptively according to the required bandwidth of input traffic. We also show that the dynamic MB method can urantee the CBP performance according to the service priority regardless of variation of input traffic parameters.

• 전자공학회논문지A
• /
• 제33A권6호
• /
• pp.23-32
• /
• 1996

This paper proposes a new buffer management scheme to service delay-sensitive traffic and loss-sensitive traffic fairly in ATM networks. The proposed scheme uses tow buffers for delay-sensitive traffic and loss-sensitive traffic. To satisfy the average delay time of delay-sensitive traffic, cells in real-time buffer are served first. When congestion occurs in nonreal-time buffer, low loss priority cell in real-time buffer can be pushed out by high loss priority cell in nonreal-time buffer can be transferred to real-time buffer considering threshold value in real-time buffer. Using computer simulation, the existing methods and proposed scheme are compared and analyzed with respect to cell loss rate and average delay time. Simulation results show that the proposed scheme have superior performance to conventional schemes.

• Journal of applied mathematics & informatics
• /
• 제22권1_2호
• /
• pp.523-533
• /
• 2006

We analyze two finite buffers queueing system with priority scheduling dependent upon queue length. Customers are classified into two types ( type-l and type-2 ) according to their characteristics. Here, the customers can be considered as traffics such as voice and data in telecommunication networks. In order to support customers with characteristics of burstiness and time-correlation between interarrival, the arrival of the type-2 customer is assumed to be an Markov- modulated Poisson process(MMPP). The service order of customers in each buffer is determined by the queue length of two buffers. Methods of embedded Markov chain and supplementary variable give us information for queue length of two buffers. Finally, performance measures such as loss and mean delay are derived.

• 한국정보과학회논문지:정보통신
• /
• 제33권1호
• /
• pp.103-112
• /
• 2006

인터넷 트래픽 관리를 위한 IETF 차별화 서비스에서는 우선순위 방식의 가격정책이 널리 채택되고 있으며, 이러한 우선순위 방식의 서비스에서 최적가격을 정하기 위해 균형분석을 이용한 연구가 활발히 진행되고 있다. 그러나 '사용자들의 유틸리티 함수를 정확히 알고 있다'는 균형분석의 가정의 타당성에 대한 비판 또한 끊이지 않는다. 따라서 이 논문은 최적가격을 정하는 문제에 있어서, 현존하는 이론적인 연구의 기본 가정과 사용자 유틸리티 함수를 알 수 없는 현실적인 네트워크 환경과의 차이를 좁힐 수 있는 해결책을 제시하고자 한다. 기본 아이디어는 네트워크 서비스 제공자가 서비스 레벨의 가격을 조정하여 사용자들의 레벨 선택 결정을 바꾸도록 유도하고 그를 통해 더 정확한 유틸리티 정보를 알아내도록 하자는 것이다. 이 연구의 공헌은 크게 두 가지로 볼 수 있다. 첫째, 사용자 유틸리티 함수를 추정해나가는 일반적인 원리를 제시하였다 둘째, 유틸리티 함수에 대한 정보를 최대한으로 끌어낼 수 있도록 하는 가격을 정하는 방법을 개발하였다. 우리는 실험을 통해 제안된 추정법의 효과적인 성능을 보여준다.

• 전자공학회논문지S
• /
• 제35S권2호
• /
• pp.1-9
• /
• 1998

ATM was adopted as the switching and multiplexing technique for BISDN which aims at transmitting traffics with various characteristics in a unified network. To construct these ATM networks, the most important aspect is the design of the switching system with high performance and different service capabilities. In this paepr, we analyze the performance of an input and output queueing switch with preemptive priority which is considered to be most suitable for ATM networks. For the analysis of an input queue, we model each input queue as two separate virtual input queues for each priority class and we approximage them asindependent Geom/Geom/1 queues. And we model a virtual HOL queue which consists of HOL cells of all virtual input queues which have the same output address to obtain the mean service time at each virtual input queue. For the analysis of an output quque, we obtain approximately the arrival process into the output queue from the state of the virtual HOL queue. We use a Markov chain method to analyze these two models and obtain the maximum throughput of the switch and the mean queueing delay of cells. and analysis results are compared with simulation to verify that out model yields accurate results.

• Journal of Communications and Networks
• /
• 제10권3호
• /
• pp.287-296
• /
• 2008

The IEEE 802.11 wireless standard uses the carrier sense multiple access with collision avoidance (CSMA/CA) as its MAC protocol (during the distributed coordination function period). This protocol is an adaptation of the CSMA/CD of the wired networks. CSMA/CA mechanism cannot guarantee quality of service (QoS) required by the application because orits random access method. In this study, we propose a new MAC protocol that considers different types of traffic (e.g., voice and data) and for each traffic type different priority levels are assigned. To improve the QoS of IEEE 802.11 MAC protocols over a multi-channel CSMA/CA, we have developed a new admission policy for both voice and data traffics. This protocol can be performed in direct sequence spread spectrum (DSSS) or frequency hopping spread spectrum (FHSS). For voice traffic we reserve a channel, while for data traffic the access is random using a CSMA/CA mechanism, and in this case a selective reject and push-out mechanism is added to meet the quality of service required by data traffic. To study the performance of the proposed protocol and to show the benefits of our design, a mathematical model is built based on Markov chains. The system could be represented by a Markov chain which is difficult to solve as the state-space is too large. This is due to the resource management and user mobility. Thus, we propose to build an aggregated Markov chain with a smaller state-space that allows performance measures to be computed easily. We have used stochastic comparisons of Markov chains to prove that the proposed access protocol (with selective reject and push-out mechanisms) gives less loss rates of high priority connections (data and voices) than the traditional one (without admission policy and selective reject and push-out mechanisms). We give numerical results to confirm mathematical proofs.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권1호
• /
• pp.178-202
• /
• 2012

In this paper, we first survey cross-layer architectures for Wireless Sensor Networks (WSNs) and Wireless Multimedia Sensor Networks (WMSNs). Afterwards, we propose a novel cross-layer architecture for QoS provisioning in clustered and multi-hop based WMSNs. The proposed architecture provides support for multiple network-based applications on a single sensor node. For supporting multiple applications on a single node, an area in memory is reserved where each application can store its network protocols settings. Furthermore, the proposed cross-layer architecture supports heterogeneous flows by classifying WMSN traffic into six traffic classes. The architecture incorporates a service differentiation module for QoS provisioning in WMSNs. The service differentiation module defines the forwarding behavior corresponding to each traffic class. The forwarding behavior is primarily determined by the priority of the traffic class, moreover the service differentiation module allocates bandwidth to each traffic class with goals to maximize network utilization and avoid starvation of low priority flows. The proposal incorporates the congestion detection and control algorithm. Upon detection of congestion, the congested node makes an estimate of the data rate that should be used by the node itself and its one-hop away upstream nodes. While estimating the data rate, the congested node considers the characteristics of different traffic classes along with their total bandwidth usage. The architecture uses a shared database to enable cross-layer interactions. Application's network protocol settings and the interaction with the shared database is done through a cross-layer optimization middleware.

• 한국산학기술학회논문지
• /
• 제12권7호
• /
• pp.3176-3183
• /
• 2011

무선 센서 네트워크에서 트래픽과 혼잡제어는 처리율과 QoS (Quality of Service)를 결정하는 중요한 파라미터이다. 본 논문에서는 무선 센서 네트워크에서 디지털 콘텐츠 스트리밍 서비스를 위한 전송율 우선순위 기반의 트래픽 제어 기법을 제안한다. 제안된 기법에서 전송율 우선순위는 버스트 시간과 크기에 따른 실시간 트래픽과 비실시간 트래픽에 의해 결정된다. 전송율 기반 우선순위는 지연을 줄이고 신뢰성을 향상시킴으로서 스트림이 요청될 때 트래픽이 효율적으로 제어되게 된다. 트래픽 제어는 트래픽 탐지 과정, 트래픽 공지, 그리고 트래픽 제어 조절 과정을 거쳐 스트리밍 서비스가 차별화 되도록 하였다. 시뮬레이션 결과 제안된 기법이 CCF (Congestion Control and Fairness)기법, WCA (Weight-based Clustering Algorithm)기법에 비해서 전송지연, 패킷손실, 그리고 처리율에 대한 성능이 효율적임을 보였다.