• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.10
• /
• pp.4787-4807
• /
• 2016

Although the dense interconnection datacenter networks (DCNs) (e.g. FatTree) provide multiple paths and high bisection bandwidth for each server pair, the single-path TCP (SPT) and ECMP which are widely used currently neither achieve high bandwidth utilization nor have good load balancing. Due to only one available transmission path, SPT cannot make full use of all available bandwidth, while ECMP's random hashing results in many collisions. In this paper, we present OFPT, an OpenFlow based Parallel Transport framework, which integrates precise routing and scheduling for better load balancing and higher network throughput. By adopting OpenFlow based centralized control mechanism, OFPT computes the optimal path and bandwidth provision for each flow according to the global network view. To guarantee high throughput, OFPT dynamically schedules flows with Seamless Flow Migration Mechanism (SFMM), which can avoid packet loss in flow rerouting. Finally, we test OFPT on Mininet and implement it in a real testbed. The experimental results show that the average network throughput in OFPT is up to 97.5% of bisection bandwidth, which is higher than ECMP by 36%. Besides, OFPT decreases the average flow completion time (AFCT) and achieves better scalability.

• The KIPS Transactions:PartC
• /
• v.9C no.3
• /
• pp.385-398
• /
• 2002

To accommodate the increasing number of mobile terminals in the limited radio spectrum, wireless systems have been designed as micro/picocellular architectures for a higher capacity. This reduced coverage area of a cell has caused a higher rate of hand-off events, and the hand-off technology for efficient process becomes a necessity to provide a stable service. Population-based Bandwidth Reservation(PBR) Scheme is proposed to provide prioritized handling for hand-off calls by dynamically adjusting the amount of reserved bandwidth of a cell according to the amount of cellular traffic in its neighboring cells. We analyze the performance of the PBR scheme according to the changes of a fractional parameter, f, which is the ratio of request reservation to the total amount of bandwidth units required for hand-off calls that will occur for the next period. The vague of this parameter, f should be determined based on QoS(Quality of Service) requirement. To meet the requirement the value of Parameter(f) must be able to be adjusted dynamically according to the changing traffic conditions. The best value of f can be determined by a function of the average speed of mobile stations, average call duration, cell size, and so on. This paper considers the average call duration and the cell size according to the speed of mobile stations. Although some difference exists as per speed, in the range of 0.4 $\leq$ f $\leq$ 0.6, Blocking Probability, Dropping Probability and Utilization show the best values.

• Journal of electromagnetic engineering and science
• /
• v.8 no.2
• /
• pp.41-46
• /
• 2008

A bandwidth and power efficient high speed ubiquitous sensor network(USN) for realizing a ubiquitous society is a great challenge for researcher community. In this paper we incorporate a cooperative transmission protocol within a special type of multi-code modulation to meet these requirements. Multi-code(Mc) modulation has been developed for high-speed data transmission over wireless channels. We proposed a new class of orthogonal codes for multi-code modulation which is an orthogonal subset of orthogonal codes(OSOC). Our proposed OSOC structure allows us to use only one relay to cooperate M nodes that effectively reduces the bandwidth and power requirement. This protocol is similar to spread-spectrum(SS) technique that can reduce both broad and narrow band jamming.

• Journal of Korea Multimedia Society
• /
• v.9 no.3
• /
• pp.315-322
• /
• 2006

In the application rising IP multicast, the waste of available bandwidth occurs of reducing of transmission rate in non-congestion local caused by reducing of transmission rate in congestion local. In this paper, to solve such a problem, we propose a dynamic multicast method using IP multicast and overlay multicast. In proposed method, we elected a local representative for overlay multicasting. When the transmission rate of a group is less than transmission rate threshold, the representative can transmits duplicative packets. In simulation results, it was known that proposed method uses bandwidth more efficiently.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.6
• /
• pp.1209-1221
• /
• 2010

Three dimensional (3D) video is expected to be an important application for broadcast and IP streaming services. One of the main limitations for the transmission of 3D video over IP networks is network bandwidth mismatch due to the large size of 3D data, which causes fatal decoding errors and mosaic-like damage. This paper presents a novel selective frame discard method to address the problem. The main idea of the proposed method is the symmetrical discard of the two dimensional (2D) video frame and the depth map frame. Also, the frames to be discarded are selected after additional consideration of the playback deadline, the network bandwidth, and the inter-frame dependency relationship within a group of pictures (GOP). It enables the efficient utilization of the network bandwidth and high quality 3D IPTV service. The simulation results demonstrate that the proposed method enhances the media quality of 3D video streaming even in the case of bad network conditions.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.27-30
• /
• 2000

In this paper, we propose a new dynamic bandwidth allocation and call admission control method for the VBR video sources with QoS constraints to provide user's quality of service requirements and at the same time to achieve an efficient resource management in networks. The proposed mechanism dynamically adjusts the necessary bandwidth by the networks based on the provided quality of service satisfaction degree of each connection in respect to the user's requirements in terms of loss ratio and average delay Simulation results show that our proposed dynamic method is able to provide the desired level of quality of service and high utilization.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.11a
• /
• pp.1482-1484
• /
• 2010

A new TCP protocol can succeed for large bandwidth delay product when it meets network bandwidth utilization efficiency and fair sharing. We introduce a novel congestion control algorithm which employs queueing delay information in order to calculate the amount of congestion window increment in increase phase, and reduces congestion window to optimal estimated bound as packet loss occurs. Combination of such methods guarantees that the proposal utilizes fully network bandwidth, recovers quickly from packet loss in wireless link, and preserves fairness for competing flows mixed short RTT and long RTT. Our simulations show that features of the proposed TCP meet the desired requirements.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.2 no.2
• /
• pp.63-81
• /
• 2008

WiMAX has been introduced as a competitive alternative for metropolitan broadband wireless access technologies. It is connection oriented and it can provide very high data rates, large service coverage, and flexible quality of services (QoS). Due to the large number of connections and flexible QoS supported by WiMAX, the uplink access in WiMAX networks is very challenging since the medium access control (MAC) protocol must efficiently manage the bandwidth and related channel allocations. In this paper, we propose and investigate a cost-effective WiMAX bandwidth management scheme, named the WiMAX partial sharing scheme (WPSS), in order to provide good QoS while achieving better bandwidth utilization and network throughput. The proposed bandwidth management scheme is compared with a simple but inefficient scheme, named the WiMAX complete sharing scheme (WCPS). A maximum entropy (ME) based analytical model (MEAM) is proposed for the performance evaluation of the two bandwidth management schemes. The reason for using MEAM for the performance evaluation is that MEAM can efficiently model a large-scale system in which the number of stations or connections is generally very high, while the traditional simulation and analytical (e.g., Markov models) approaches cannot perform well due to the high computation complexity. We model the bandwidth management scheme as a queuing network model (QNM) that consists of interacting multiclass queues for different service classes. Closed form expressions for the state and blocking probability distributions are derived for those schemes. Simulation results verify the MEAM numerical results and show that WPSS can significantly improve the network’s performance compared to WCPS.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.6
• /
• pp.1490-1500
• /
• 1996

One of the important issues for multimedia communications over ATM netowrks is efficient use of net-work resources since transmitting video at low cost requires high utilization of channel bandwidth. In this paper, we propose an effective bandwidth estimation scheme for MPEG sources in ATM networks. It has been known difficult to allocate effective transmission bandwidth to MPEG sources due to its bursty charactersitics. The MPEG traffic stream can bemodeled using five traffic parameters:service rate, burst load ratio, interburst load ratio, burst period, and interburst period. Using these parameters, a transmission bandwidth for each source can be estimated, and the estimated bandwidth is applied synchronously to reduce the queue size in a buffer. For a simple network modelof a high speed link that multiplexes a number of virtual-circuit connections, simulations on adaptive bandwidth allocation were performed, and the results show that the queueing delay is significantly reduced, when compared to a fixed bandwidth allocation.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.3
• /
• pp.22-33
• /
• 2014

As a standard of WMNs, IEEE 802.11s supports two kinds of MAC algorithm: a mandatory EDCA used by IEEE 802.11e and an optional MCCA. While EDCA classifies traffic according to four Access Categories (AC) and offer differentiated service using a classified priority, MCCA can guarantee the specific bandwidth of users with a TDMA-style bandwidth reservation scheme between mesh routers. In case that a flow is VBR traffic of a multimedia application, MCCA has disadvantage that the reserved bandwidth does not be used entirely, though it guarantees required bandwidth of users and fairness using bandwidth reservation with neighbors' node. In this paper, we showed a problem that is wastes the reserved bandwidth when MCCA is enabled and proposed a new scheduling algorithm to prevent waste of bandwidth and to improve network utilization effectively, named Resource Sharing Round Robin (RSRR) scheduling. Finally we showed simulation results that performance of a proposed RSRR is better than the legacy MCCA through NS-2 simulation.