• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.11 no.1
• /
• pp.66-71
• /
• 2012

In this paper, using the bargaining game theory, we propose a bandwidth management scheme that allocates bandwidth in an efficient and proportionally fair manner between the service classes with different service requirements. Since the traffic input rates of the classes are asymmetric in most of the time, the proposed scheme allocates bandwidth in proportion to the traffic input rates to increase the bandwidth utilization while protecting the quality of service of a class against the excessive traffic input of the other classes. In addition, the proposed method considers the weights of classes so that the bandwidth is allocated differentially among the classes.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.32A no.9
• /
• pp.1219-1228
• /
• 1995

In this paper, we propose a dynamic bandwidth allocation scheme for the transmission of VBR video source through ATM based BISDN. In order to efficiently evaluate the required bandwidth, the characteristics of the VBR video sources generated by the MPEG coder are analyzed with variations in the number of GOP and quantizer scale. The required bandwidth for VBR video source is estimated by a prediction algorithm using scene and frame correlations as well as the statistical properties of the VBR video source. Scene correlation represents a strong correlation among the adjacent slices in a frame, and frame correlation represents a strong correlation among the frames. The statistical properties based on the traffic parameters of video sources such as peak rate, average rate, and standard deviation of source are determined through simulation. The performance of the proposed bandwidth allocation scheme is evaluated in terms of the over-allocated bandwidth, bandwidth utilization, and cell loss rate with variations in the quantizer scale and the number of GOP. It is shown that the results of simulation based on the proposed scheme are superior to those of the conventional methods.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.4 no.3
• /
• pp.537-548
• /
• 2000

ATM is the effective information transmission method which multiply statistical and can accept effective the traffic of the various transmission rate. However, it can happen excessive cell loss probability and cell delay when it have temporarily overload. Therefore, it is required the effective traffic control and network resource management for which guarantee QoS(Quality of Service) in terms of users and bandwidth utilization maximization in terms of networks. In this paper, we proposed POBP(PushOut BP) scheme which mixed pushout scheme with BP(Back Pressure), reactive control scheme recommended at the ATM Forum, to guarantee QoS in two stages ATM switch networks. In proposed method, we have to understand exactly using bandwidth information in real-time and become traffic shaping. Thorough these processes, we can not only use effectively unused bandwidth, but also guarantee the fair bandwidth utilization and then can improve cell-loss possibility happened by congestion states in two stage ATM networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.2A
• /
• pp.110-118
• /
• 2006

In part-I of the paper, two sub-channel structures, either contiguous or distributed, were considered. Modeling the SNR distribution over a sub-channel as Ricean in general, the statistical chracteristics were investigated. In this part of the paper, we develop a generalized two step channel/resource allocation algorithm, which incorporates the two statistical measurements, and analyze the spectral efficiency of OFDMA in terms of average frequency utilization for the two sub-channel structures. In OFDMA with distributed structure, the key design parameter would be the sub-channel bandwidth. To give an insight into the impact on this parameter, we show in the numerical results the frequency utilization as a function of sub-channel bandwidth normalized to coherence bandwidth. As confirmed by numerical results, for contiguous sub-channel structure, we obtain the nominal multiuser diversity gain when the sub-channel bandwidth is smaller than the coherence bandwidth and lose the gain as it is getting larger.

• Journal of Communications and Networks
• /
• v.12 no.5
• /
• pp.499-509
• /
• 2010

A plethora of transmission control protocol (TCP) congestion control algorithms have been devoted to achieving the ultimate goal of high link utilization and fair bandwidth sharing in high bandwidth-delay product (HBDP) networks. We present a new insight into the TCP congestion control problem; in particular an end-to-end delay-based approach for an HBDP network. Our main focus is to design an end-to-end mechanism that can achieve the goal without the assistance of any network feedback. Without a router's aid in notifying the network load factor of a bottleneck link, we utilize goodput and throughput values in order to estimate the load factor. The obtained load factor affects the congestion window adjustment. The new protocol, which is called TCP-goodput and throughput (GT), adopts the carefully designed inversely-proportional increase multiplicative decrease window control policy. Our protocol is stable and efficient regardless of the link capacity, the number of flows, and the round-trip delay. Simulation results show that TCP-GT achieves high utilization, good fairness, small standing queue size, and no packet loss in an HBDP environment.

• Journal of Digital Convergence
• /
• v.10 no.4
• /
• pp.251-256
• /
• 2012

In this paper, we addressed the problem of upstream bandwidth in EPONs. We presented a wavelength division EPON supporting QoS in the differentiated services framework. It was shown that the bandwidth allocation by priority scheduling, under our assumptions for traffic behavior, will result in an unexpected behavior for high priority class and we suggested the use of weighted priority scheduling to alleviate this problem. Our wavelength division EPON supporting QoS allocates effectively and fairly bandwidths and wavelengths between ONUs in the differentiated services framework. Moreover, we showed better performance in terms of average and maximum end-to-end delay, as well as network throughput, utilization compared with some other algorithms. We used simulation experiments to study the performance and validate the effectiveness of the proposed network and algorithm.

• Journal of Internet Computing and Services
• /
• v.4 no.5
• /
• pp.61-68
• /
• 2003

In this paper, we propose a wireless MAC protocol named APRMA, which is capable of supporting the ABR type data service and Maximizing channel utilization. Data terminals with random data packets are not provided slot reservation with PRMA protocol. That is, slot reservation is applicable to the time constraint voice packet exclusively. But the reservation scheme have to be performed for loss sensitive data packet, and contended their quality of service, Therefore, in wireless MAC, reservation technique has to be used for both voice and data services. So the terminal which wants to request for ABR type service, is allocated a minimum bandwidth from system for the first time, If the system have some extra available bandwidth, ABR terminals would acquire additional bandwidth slot by slot, As a result, APRMA protocol can support the data service with loss sensitivity and maintain their channel utilization high.

• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.6 no.3
• /
• pp.1-7
• /
• 2007

In this paper, we propose a new prioritized Optical Burst Switching (OBS) protocol based on a hop count, which can provide efficient utilization in optical networks. Under several legacy schemes, a switch drops the burst with the shortest time regardless of its traversed hop count. As a result, a dropped burst that have been traversed many hops might cause increased bandwidth waste compared to one that has traversed a few hops. To improve this problem, we propose the Just Enough Time (JET) with a hop counting scheme which can reduce the wasted bandwidth by prioritizing the burst traversed many hops over others. From the simulation result, it is preyed, we show that the proposed scheme has advantages against legacy schemes in terms of the burst blocking probability and the link utilization.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.51 no.7
• /
• pp.294-301
• /
• 2002

A new dynamic scheduling algorithm is proposed for CAN-based real-time system in this paper. The proposed algorithm is extended from an existing EDS(Earliest Deadline Scheduling) approach having a solution to the priority inversion. Using the proposed algorithm, the available bandwidth of network media can be checked dynamically, and consequently arbitration delay causing the miss of deadline can be avoided. Also, non-real time messages can be processed with their bandwidth allocation. Full network utilization and real-time transmission feasibility can be achieved through the algorithm. To evaluate the performance of algorithm, two simulation tests are performed. The first one is transmission data measurement per minute for periodic messages and the second one is feasibility in the system with both periodic messages and non-real time message.

• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.8 no.4
• /
• pp.195-200
• /
• 2009

In this paper, we propose a new priority Optical Burst Switching (OBS) protocol based on a hop count, which can provide an efficient utilization in optical wireless networks. Under several legacy schemes, a switch drops the burst with a shorter time among ones regardless of its traversed hop count. As a result, the dropped burst that have been traversed more hops might cause to waste bandwidth than the one traversed a few hops. Noting that this problem, we propose a Just Enough Time (JET) with a hop count scheme which can reduce the wasted bandwidth by prioritizing the burst traversed more hops over others. The simulation results shows that the proposed scheme has more advantages over the legacy schemes in terms of the burst blocking probability and the link utilization.