• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.4C
• /
• pp.308-315
• /
• 2002

Guaranteed frame rate (GFR) service has been defied to provide minimum cell rate (MCR) guarantees for virtual connections (VCs) carrying Internet traffic in ATM networks and allow them to fairly share residual bandwidth. The simplest switch implementation mechanism to support the GFR service in ATM networks consists of the frame-based generic cell rate algorithm (F-GCRA) frame classifier and the early packet discard (EPD)-like buffer acceptance algorithm in a single FIFO buffer. This mechanism is simple, but has foiled to guarantee the same bandwidth as an MCR to a VC that has reserved a relatively large MCR. This paper applies the packet spacing scheme to TCP traffic to alleviate its burstness, so as to guarantee a larger MCR to a VC. In addition, the random early detection (RED) scheme is added to the buffer acceptance algorithm in order to improve fairness in use of residual bandwidth. Simulation results show that the applied two schemes improve a quality of service (QoS) in the GFR service for the TCP traffic.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.24 no.7
• /
• pp.26-40
• /
• 2010

We propose a new routing protocol, MCQosR, that is based on bandwidth estimation, admission control, and a routing metric, MCCR - suitable for wireless ad-hoc networks with multiple radios and channels. To use the full capacity of a wireless link, we assume a node with multiple radios for full duplex operation, and a radio using multiple channels to exclude route-intra interference. This makes it possible to use the capacity of a wireless link. Then, to provide bandwidth and delay guarantee, we have a radio with a fixed channel for layer-3 data reception at each node, used to estimate the available bandwidth and expected delay of a wireless link. Based on the estimate of available bandwidth and delay, we apply the call admission control to a new call requiring bandwidth and delay guarantee. New calls with traffic that will overflow link or network capacity are rejected so the accepted calls can use the required bandwidth and delay. Finally, we propose a routing metric, MCCR, which considers the channel contentions and collisions of a wireless link operating in CSMA/CA. MCCR is useful for finding a route with less traffic and distributing traffic over the network to prevent network congestion as much as possible. The simulation of the MCQosR protocol and the MCCR metric shows traffic is distributed and guaranteed service is provided for accepted calls.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.7
• /
• pp.37-48
• /
• 2014

Wireless mesh networks have emerged as a key technology in environment that needs wireless multi-hop communication without infrastructure and IEEE 802.11s mesh network standard have currently been established. One of big differences between this standard and the legacy IEEE 802.11 is that MCCA MAC is included to support QoS. MCCA supports bandwidth reservations between neighbors, so it can satisfy the QoS of bandwidth guarantee. However, MCCA has dis-advantages as follow; 1) it can not guarantee end-to-end bandwidth, 2) in multi-interface multi-channel wireless environments, the IEEE 802.11s does not provide a bandwidth reservation protocol and a wireless channel assignment etc. In this paper, we have proposed MIMC R-HWMP, which expands R-HWMP that was proposed in our previous work[3], to support multi-interface multi-channel. By simulation, we showed end-to-end bandwidth guarantee and the increase in the available bandwidth in multi-interface multi-channel wireless mesh networks.

• Journal of KIISE:Information Networking
• /
• v.28 no.2
• /
• pp.242-250
• /
• 2001

This paper deals with the TCP bandwidth guarantee problem in a differentiated serviccs(Diffserv) network. The Diffserv assured s<:rvice differentiates packet drop probabilities to guarantee the promised bandwidth even under network congestion. However a token buffer marker fails to show adequate performance because TCI' generates packets according to the unique Tel' congestion control mechanism. We propose a marker that uses a data buffer as well as a token buffer. The marker with a data buffer works well with the assured service mechanism because it smooths Tel' traffic. We showed that the marker with a data buffer achieves the target throughput better than a marker with a token buffer only. We also showed that the optimal buffer size is proportional to reserved throughput and HTT.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.11
• /
• pp.4068-4086
• /
• 2014

Due to the prevalence of powerful mobile terminals and the rapid advancements in wireless communication technologies, the wireless video streaming service has become increasingly more popular. Recent studies show that video streaming services via Transmission Control Protocol (TCP) are becoming more practical. TCP has more advantages than User Diagram Protocol (UDP), including firewall traversal, bandwidth fairness, and reliability. However, each video service shares an equal portion of the limited bandwidth because of the fair sharing characteristics inherent in TCP and this bandwidth fair sharing cannot always guarantee the video quality for each user. To solve this challenging problem, an Adaptive Multiple TCP (AM-TCP) scheme is proposed in this paper to guarantee the video quality for mobile devices in wireless networks. AM-TCP adaptively controls the number of TCP connections according to the video Rate Distortion (RD) characteristics of each stream and network status. The proposed scheme can minimize the total distortion of all participating video streams and maximize the service quality by guaranteeing the quality of each video streaming session. The simulation results show that the proposed scheme can significantly improve the quality of video streaming in wireless networks.

• Journal of the Optical Society of Korea
• /
• v.20 no.6
• /
• pp.704-715
• /
• 2016

In this paper, we explore a low-complex bandwidth allocation (BA) scheme with multi-level service guarantees in VLC-OFDM systems. Effective capacity theory, which evaluates wireless channel capacity from a novel view, is utilized to model the system capacity under delay QoS constraints of the link layer. Since intensity modulation of light is used in the system, problems caused by frequency selectivity can be neglected. Then, the BA problem can be formulated as an integer programming problem and it is further relaxed and transformed into a concave one. Lagrangian formulation is used to reformulate the concave problem. Considering the inefficiency of traditional gradient-based schemes and the demand for distributed implementation in local area networks, we localize the global parameters and propose a quasi-distributed quadratic allocation algorithm to provide two-level service guarantees, the first level is QoS oriented, and the second level is QoE oriented. Simulations have shown the efficient performance of the proposed algorithm. The users with more stringent QoS requirements require more subcarriers to guarantee their statistical delay QoS requirements. We also analyze the effect of subcarrier granularity on the aggregate effective capacity via simulations.

• Proceedings of the IEEK Conference
• /
• 2003.07b
• /
• pp.959-962
• /
• 2003

At the processing capabilities and operating frequency of embedded system are growing, so is the needed data bandwidth to fully utilize the processing capability. The ability to transfer huge amount of data between the embedded core and external devices is required for efficient system operation. In this paper, the data communication architecture for the mixed-clock system is proposed. The dynamic priority adaptation algorithm for bus arbitration is proposed for bandwidth guarantee. The communication architecture that incorporates the proposed arbitration algorithm adapts the priority of communication components dynamically based on the information from FIFO. The experiments show that the measured bandwidth of each component traces the required bandwidth well compared to the other arbitration algorithms

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.4A
• /
• pp.380-387
• /
• 2011

While mobile IPTV services are supported through the mobile WiMAX networks, there must need some guaranteed bandwidth for the IPTV services especially if IPTV and non-IPTV services are simultaneously supported by the mobile WiMAX networks. The quality of an IPTV service definitely depends on the allocated bandwidth for that channel. However, due to the high quality IPTV services and to support of huge non-IPTV traffic over mobile WiMAX networks, it is not possible to guarantee the sufficient amount of the limited mobile WiMAX bandwidth for the mobile IPTV services every time. A Service Level Agreement (SLA) between the mobile IPTV service provider and mobile WiMAX network operator to reserve sufficient bandwidth for the IPTV calls can increase the satisfaction level of the mobile IPTV users. In this paper, we propose a SLA negotiation procedure for mobile IPTV users over mobile WiMAX networks. The Bandwidth Broker controls the allocated bandwidth for IPTV and non-IPTV users. The proposed dynamically reserved bandwidth for the IPTV services increases the IPTV user's satisfaction level. The simulation results state that, our proposed scheme is able to provide better user satisfaction level for the IPTV users.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.8A
• /
• pp.820-827
• /
• 2010

In these days, video applications for special purposes such as video conference systems among multiple users and video surveillance systems require multiple video connections and QoS guarantee. The video systems employ IEEE 802.11 Wireless LAN devices to support broadband wireless interfaces and easy internet accesses for cheaper prices. However, according to the current IEEE 802.11e HCCA standard, if more than three video sessions are established in WSTA services, some of them must share the TXOP because the available number of TSIDs for video transmission is two. In order to resolve the problem, we devised a method which can establish up to 15 video sessions by slightly modifying the frame structure while maintaining the compatibility with current standard. Our method is implemented on the NCTUns 4.0 network simulator, and evaluated not only numerically in terms of throughput, delay, and PSNR, but also experimentally in the sense of real video clips that are used as input to our simulation. The results showed that our method sufficiently guarantees the transmission bandwidth requested by each video session.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.5C
• /
• pp.465-473
• /
• 2002

In this paper the authors propose a theoretic framework to design the Virtual Private Network (VPN) via which the Quality of Services (QoSs) are guaranteed over IP networks. The required QoS is a very strict packet loss probability or a probability that packet delay does not exceed a certain target value in a statistical manner. QoSs are guaranteed by providing a statistical bandwidth similar to equivalent bandwidth, which is computed so that the provided bandwidth is sufficient to guarantee those requirements. Two typical network architectures are considered in constructing VPN, the customer pipe scheme and the Hose scheme, and we propose a method to compute the amount of the required bandwidth for the two schemes. Finally, we investigate the implication of the scheme via numerical experiments.