• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.9
• /
• pp.1492-1512
• /
• 2011

Due to multiple hops, mobility and time-varying channel, supporting delay sensitive real-time traffic in wireless local area network-based (WLAN) mesh networks is a challenging task. In particular for real-time traffic subject to medium access control (MAC) layer control overhead, such as preamble, carrier sense waiting time and the random backoff period, the performance of real-time flows will be degraded greatly. In order to support real-time traffic, an efficient adaptive packet scheduling (APS) scheme is proposed, which aims to improve the system performance by guaranteeing inter-class, intra-class service differentiation and adaptively adjusting the packet length. APS classifies incoming packets by the IEEE 802.11e access class and then queued into a suitable buffer queue. APS employs strict priority service discipline for resource allocation among different service classes to achieve inter-class fairness. By estimating the received signal to interference plus noise ratio (SINR) per bit and current link condition, APS is able to calculate the optimized packet length with bi-dimensional markov MAC model to improve system performance. To achieve the fairness of intra-class, APS also takes maximum tolerable packet delay, transmission requests, and average allocation transmission into consideration to allocate transmission opportunity to the corresponding traffic. Detailed simulation results and comparison with IEEE 802.11e enhanced distributed channel access (EDCA) scheme show that the proposed APS scheme is able to effectively provide inter-class and intra-class differentiate services and improve QoS for real-time traffic in terms of throughput, end-to-end delay, packet loss rate and fairness.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.1
• /
• pp.38-40
• /
• 2014

In this paper, proposed method achieves delay reduction and throughput improvement by utilizing token-ring method in infrastructure network. Access Point gives token passing effect by successively transmitting ACK frame including a node's Association ID. Not only can this method considerably reduce time for medium access, but also improve throughput. Furthermore, AP offers more frequent medium access opportunity to node having highest data queue among nodes associated by AP. these method can evenly offer medium access opportunity according to Queue's volumes.

• Journal of Internet Computing and Services
• /
• v.1 no.2
• /
• pp.1-10
• /
• 2000

ATM network technology is generally used for the solution of integrating multimedia service in high-speed Internet. In Internet protocol based on ATM services, If single cell is lost in ATM layer, the entire TCP packet will be lost. Therefore, TCP performance will be degraded. In order to reduce cell loss, when congestion occur, UBR+EPD mechanism is proposed to improve the throughput in TCP over UBR, and ER scheme is suggested in TCP over ABR. In this paper, we analyzed the performance improvement effect of UBR+EPD with FRR (Fast Retransmission and Recovery), the adjusting EPD threshold parameter (R), and variation of MTU (Maximum Transport Unit) size. As a result, through the analysis of performance, we know that the improved throughput and fairness are shown by the proposed scheme.

• Journal of Korea Multimedia Society
• /
• v.7 no.2
• /
• pp.204-210
• /
• 2004

This paper proposes a transmission probability control scheme and MAC protocol for packet data services in slotted CDMA system. In slotted CDMA system, multiple access interference is the major factor of unsuccessful packet transmissions. Therefore, in order to obtain the optimal system throughput, the number of simultaneously transmitted packets should be kept at a proper level. In the proposed protocol, the base station calculates the packet transmission probability of mobile stations according to the offered load and then broadcasts it. Mobile stations, which have a packet, attempt to transmit packet with the received probability. Numerical analysis and simulation results show that the proposed scheme can offer better system throughput than the conventional one, and guarantee a good fairness among all mobile stations regardless of the offered load.

• Journal of Korea Multimedia Society
• /
• v.7 no.10
• /
• pp.1443-1451
• /
• 2004

In this paper we propose a new packet scheduling mechanism to improve TCP throughput and fairness with estimated link state information in wireless networks, in which mobile hosts are receivers. Since a priori estimated link state information is used in this proposed mechanism, the entire packet transmission time can be reduced. In other words, packets scheduling procedure is performed before packets are transmitted using estimated link state. The proposed mechanism also has an temporary FIFO queue to store packets which are on the head of queue and can not be transmitted due to bad link state. Using this temporary FIFO queue, HOL(Head of Line) problem of FIFO queue can be resolved.

• Journal of KIISE:Information Networking
• /
• v.34 no.1
• /
• pp.27-32
• /
• 2007

Next-generation wireless networks are expected to support a wide range of services, including high-rate data applications, Various service types request differentiated QoSs(Qualities of Service) such as minimum data rate, accuracy, fairness and so on. Although resources of radio systems are limited, for many applications, it is important that certain QoS targets are required to be met. In this paper, we propose a QoS based scheduling algorithm for next generation systems, based on analyzing previous researches, and we develop the proposed QoS algorithm only for MIMO(multi-Input Multi-Output) systems. Moreover, we subsequently prove that the proposed algorithm optimize throughput relative to prespecified target values and converge to certain throughput.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10c
• /
• pp.160-162
• /
• 2001

Cyclic-Reservation Multiple-Access(CRMA) is an access scheme for high-speed local and metropolitan area networks based on folded-bus or dual-bus configurations. CRMA provides high throughput and fairness independent of the network speed or distance. This paper describes a simulation-based quantitative analysis of the performance gains obtained by introducing slot reuse in CRMA. Generally, a longer cycle length means a longer access delay and a lower throughput. There-fore, it is desirable to develop a scheme such that the cycle length is the shortest. In this paper, we will study the problem of reducing the total number of empty slots generated within every cycle. However, it has been shown that the problem is NP-complete under the constraint that all empty slots used by a station in a cycle are required to be consecutive. We present the algorithm that improves previous novel approach by using previous node information. We compare our slots reuse scheme with several slot reuse algorithms such as region scheme (FMR), address schemes, novel approach in terms of the following two important performance criteria: average cycle length and average slot utilization ratio. As compared with the one proposed in novel algorithm, the new scheme makes the cycle length much shorter. Besides, the resulting slot utilization and the access delay are better than those of the other two schemes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.3C
• /
• pp.219-227
• /
• 2006

In this paper, we propose a packet scheduling algorithm to maximize the required total price of the systems that is applied with a different traffic pricing criterion by the mobile service operator according to different kinds of the services. The proposed algorithm adopts a particular estimation method in scheduling using the value of pricing function, which is based on the required services and the value of SIR(signal to interference ratio) that indicate the channel condition of each user. We compare Max C/I, proportional fairness and round robin algorithm with the proposed algorithm on HSDPA in order to analyze the performance. The result shows that the proposed algorithm satisfies higher throughput and provides maximum the mobile service provider's revenue.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.7A
• /
• pp.485-492
• /
• 2003

This paper proposes a transmission probability control scheme for guaranteeing fair packet transmissions in CDMA slotted ALOHA system. In CDMA slotted ALOHA system, the packets transmitted in the same slot act as multiple access interference, so that unsuccessful packet transmissions are caused entirely by multiple access interference. Therefore, in order to maximize the system throughput, the number of simultaneously transmitted packets should be kept at a proper level. In the proposed scheme, the base station calculates the packet transmission probability of mobile stations in the next slot according to the offered load and then broadcasts this probability to all the mobile stations. Mobile stations, which have a packet to transmit, attempt to transmit packet with the received probability. Simulation results show that the proposed scheme can offer better system throughput and average delay than the conventional scheme, and guarantee a good fairness among all mobile stations regardless of the offered load.

• The Journal of Korean Association of Computer Education
• /
• v.7 no.1
• /
• pp.37-44
• /
• 2004

Differentiated services network (DiffServ) aims to provide the same service to a group of connections that have similar Quality of Service requirements. One of the essential function to realize DiffServ is the traffic conditioning mechanism. The paper proposes the enhanced traffic conditioning mechanism which can assure the reserved rates of TCP and UDP flows and support fair distribution of excess bandwidth. The simulation results show that the new mechanism is rather insensitive of the effect of UDP against TCP throughput, and performs better both in terms of throughput assurance and fair distribution of excess bandwidth in case of well-provisioned and over-provisioned network environment.