• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.6B
• /
• pp.595-604
• /
• 2009

The HCCA reserves the channel resources based on the mean data rate in IEEE 802.11e. It may cause either the waste of channel resource or the increase of transmission delay at MAC layer if the frame size is rapidly varied when a compressed mode video codec such as MPEG video is used. To solve these problems, it is developed that the packet scheduler allocates the wireless resource adaptation by according to the packet size. However, it is difficult to perform the admission control because of the difficulty with calculating the available resources. In this paper, we propose a CAC mechanism to solve the problem that may not satisfy the QoS by increasing traffic load in case of using EDCA. Especially, the proposed CAC mechanism calculates the EB of TSs using the traffic information transmitted by the application layer and the number of average transmission according to the wireless channel environment, and then determines the admission of the TS based on the EB. According to the simulation results of the proposed CAC mechanism, it admitted the TSs under the loads which are satisfied within the delay bound. Therefore, the proposed mechanism guarantees QoS of streaming services effectively.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.12
• /
• pp.106-115
• /
• 2003

Diverse multimedia services will be deployed at hand on 3G-and-beyond multi-service CDMA systems in order to satisfy different quality of service (QoS) according to traffic types. In order to use appropriate resources efficiently the call admission control (CAC) as a major resource control mechanism needs to be used to take care of efficient utilization of limited resources. In this paper, we propose a QoS-aware CAC (QCAC) that is enabled to provide service fairness and service differentiation in accordance with priority order and that applies the different thresholds in received power considering different QoS requirements such as different bit error rates (BER) when adopting total received power as the ceil load estimation. The proposed QCAC calculates the different thresholds of the different traffic types based on different required BER applies it for admission policy, and can get service fairness and differentiation in terms of call dropping probability as a main performance metric. The QCAC is aware of the QoS requirement per traffic type and allows admission discrimination according to traffic types in order to minimize the probability of QoS violation. Also the CAC needs to consider the resource allocation schemes such as complete sharing (CS), complete partitioning (CP), and priority sharing(PS) in order to provide fairness and service differentiation among traffic types. Among them, PS is closely related with the proposed QCAC having differently calculated threshold per each traffic type according to traffic priority orders.

• Journal of KIISE:Information Networking
• /
• v.29 no.2
• /
• pp.197-203
• /
• 2002

This paper proposes a new agent based mechanism called a Multicast Handoff Agent (MHA) to reduce handoff latency for IP multicast. The MHA acts as a proxy for an Internet Group Management Protocol (IGMP) of Mobile Nodes (MNs) at each Base Station (BS) and keeps information for members of multicast groups in a cell. When an MN moves to a next cell, the MHA immediately sends unsolicited reports without waiting for the IGMP query. The mechanism was evaluated through simulation and analysis and compared with the IGMPv2 for micro-mobility and the IGMP traffic. Simulation results show that handoff latency for micro-mobility can be largely reduced and the IGMP control traffic on the wireless links during the duration of membership can be eliminated. Thus, this mechanism is superior to the existing mechanism in both micro-mobility and battery duration, as the need not to reply to a query conserves battery power.

• Journal of Communications and Networks
• /
• v.18 no.5
• /
• pp.857-869
• /
• 2016

This paper proposes an X-MAC/BEB protocol that runs a binary exponential backoff (BEB) algorithm on top of an X-MAC protocol to save more energy by reducing collision, especially in densely populated wireless sensor networks (WSNs). X-MAC, a lightweight asynchronous duty cycle medium access control (MAC) protocol, was introduced for spending less energy than its predecessor, B-MAC. One of X-MAC 's conspicuous technique is a mechanism to allow senders to promptly send their data when their receivers wake up. X-MAC, however, has no mechanism to deal with sudden traffic fluctuations that often occur whenever closely located nodes simultaneously diffuse their sense data. To precisely evaluate the impact of the BEB algorithm on X-MAC, this paper builds an analytical model of X-MAC/BEB that integrates the BEB model with the X-MAC model. The analytical and simulation results confirmed that X-MAC/BEB outperformed X-MAC in terms of throughput, delay, and energy consumption, especially in congested WSNs.

• International Journal of Internet, Broadcasting and Communication
• /
• v.15 no.1
• /
• pp.1-7
• /
• 2023

TCP is considered a major candidate transport protocol even for constrained IoT networks due to its ability to integrate into the existing network infrastructures. Since TCP implementations such as uIP TCP often allow only a single TCP segment per connection to be unacknowledged at any given time due to resource constraints, the congestion control relies only on RTO management. In our previous work, to address the problem that uIP TCP performs poorly particularly when a radio duty cycling mechanism is enabled and the hidden terminal problem is severe, we proposed a RTO scheme for uIP TCP and validated the performance through Cooja simulation. In this study, we investigate the effect of other factors that were not considered in our previous work. More specifically, the effect of traffic intensity, the degree of the hidden terminal problem, and RDC is investigated by varying the offered load and the transmission range, and the RDC channel check rate. Simulation results imply that we need to further investigate how to improve TCP performance when the radio duty cycling mechanism is used.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.11B
• /
• pp.1234-1244
• /
• 2009

Nowadays, the traffic type and behavior are extremely diverse due to the appearance of various services and applications on Internet, which makes the need of application-level traffic classification important for the efficient management and control of network resources. Although lots of methods for traffic classification have been introduced in literature, they have some limitations to achieve an acceptable level of performance in terms of accuracy and completeness. In this paper we propose an application traffic classification method using statistic signatures, defined as a directional sequence of packet size in a flow, which is unique for each application. The statistic signatures of each application are collected by our automatic grouping and extracting mechanism which is mainly described in this paper. By matching to the statistic signatures we can easily and quickly identify the application name of traffic flows with high accuracy, which is also shown by comprehensive excrement with our campus traffic data.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.2
• /
• pp.305-314
• /
• 1996

In the paper, we divide the ATM cells generated by multimedia systems that want to transmit multimedia informations over B-ISDN into two categories:i)a media cell with a media information and ii) a synchronization cell with a synchronization information. We induce a media cell loss equation and a synchroni- zation cell loss equation based on probability distribution functions with on-off source as an input traffic model. In order to meet the requirements of real-time and integrity of multimedia informations, multimedia synchronization cells should provide the delay-sensitive and the loss-sensitive requirements. A traffic control mechanism needs to satisfy above requirements. According to the performance evaluation by a traffic control model simulation, we describe both spatial priority for minimizing the synchronization cell loss and temporal priority for reducing the synchronization cell delay must be applied simultaneously.

• The Journal of the Acoustical Society of Korea
• /
• v.18 no.6
• /
• pp.65-70
• /
• 1999

In ATM network there exist several traffics according to QoS, such as CBR, rt-VBR, nrt-VBR, UBR, and ABR. Many studies have done at the traffic management of ABR which uses the unused network bandwidth. Many flow control mechanisms have proposed to use efficiently the unused bandwidth. In TMWG(Traffic Management Working Group) of ATM Forum, there exist rate-based, credit-based, and mixture of them to manage flow control of ABR traffic. Among these, rate-based mechanisms adopted as standard because it is flexible and also makes it possible to implement ATM switch with low price and high capacity. In this paper, we study the switch that uses EFCI, ER and VS/VD(Virtual Source/Virtual Destination) with rate-based mechanism. Instead of using queue threshold, we propose a new algorithm which uses bandwidth threshold of input stage of switch, and manages efficiently ABR traffic with EPRCA algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.8B
• /
• pp.764-768
• /
• 2006

Over the years, the widespread proliferation of multimedia services has necessitated the development for an efficient network management. In this paper, we investigate the role of adaptive online pricing mechanism in order to manage effectively the network congestion problem. Our on-line approach is dynamic and flexible that responds to current network conditions. With a simulation study, we demonstrate that our proposed scheme enhances network performance and system efficiency simultaneously under widely diverse traffic load intensities.

• Journal of Korea Multimedia Society
• /
• v.7 no.2
• /
• pp.187-193
• /
• 2004

Wireless networks play a very important role in communications today. For example, wireless networks today provide from the basic services like e-mail and FTP to the multimedia applications like Web service. It is obvious that QoS requirements to these diverse applications over wireless networks will continue as in wired networks. Much research has been done to develop QoS supporting algorithms on Internet. But due to the limited bandwidth and varying channel states of the wireless networks, it is difficult to support differentiated service over wireless networks. In this paper we propose the modified wireless token ring protocol supporting QoS to the real-time traffic service node over Internet environments in which non-real-time and real-time traffic service nodes coexist. In the proposed algorithm, the real-time traffic service node gets the priority to take token over the non-real-time traffic service node. So the proposed algorithm support quick transmission of the real-time traffic service node. And this advantage can be obtained with minor modification of the legacy wireless token ing protocol to support QoS. We also consider the lost token recovery mechanism.