• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.205-206
• /
• 2008

We propose load balancing algorithm based on cross layer designing for MIMO OFDM system. When there are many users using data service, base station(BS) should distribute traffic. Moreover, cross layer design gives benefit managing radio resource and network bandwidth management. Proposed cross layer load balancing technique manages both BS's bandwidth allocation and MS’s power control. One BS request bandwidth to other BSes and other BSes reduce each bandwidth. And BSes reduce power of sub carriers for reserving available bandwidth of backhaul. MSes that didn't get service can be served by obtaining bandwidth from other BSes. The simulation result shows more users can be served and cell throughput was increased

• Journal of IKEEE
• /
• v.23 no.4
• /
• pp.1203-1207
• /
• 2019

As the number of IP cores has been increasing in a System-on-Chip (SoC), multiple routers are included in on-chip-networks. Each router has its own arbitration policy and it is difficult to obtain a desired arbitration result by combining multiple routers. Allocating desired bandwidths to the ports across the routers is more difficult. In this paper, a guaranteed bandwidth allocation scheme using an IP-level QoS control is proposed to overcome the limitations of existing local arbitration policies. Each IP can control the priority of a packet depending on the data communication requirement within the allocated bandwidth. The experimental results show that the proposed mechanism guarantees for IPs to utilize the allocated bandwidth in multiple router on-chip-networks. The maximum error rate of bandwidth allocation of the proposed scheme is only 1.9%.

• Journal of electromagnetic engineering and science
• /
• v.1 no.2
• /
• pp.166-172
• /
• 2001

A novel RF tunable bandpass filter structure using dielectric resonators and varactor diodes is considered for the optimization to achieve constant bandwidth with minimum passband insertion loss. The coupling between resonators is realized by coupling windows and series lumped L, C elements are used to realize the input/output stage couplings. A 5 poles, 0.01 dB ripple Chebyshev type filter tuned from 800 MHz~900 MHz is designed and presented in this paper. The passband bandwidth for the design is 10 MHz (fractional bandwidth = 1.2 %). Experimental results show that the 3 dB passband bandwidth variation is 12.04 MHz~12.16 MHz (less than 1 %) and passband insertion loss is 15 dB~7 dB depending on the tuning voltages.

• Proceedings of the KIEE Conference
• /
• 2008.10c
• /
• pp.199-201
• /
• 2008

In this paper, We studied optimum service model of passenger car monitoring system at limited wireless bandwidth subway and railway. High bandwidth is better if we need more services. But, high bandwidth requires more cost at tunnel of subway. More bandwidth make receive sensitivity to bad. We deduced best bandwidth of subway wireless transmission system reflecting the cost of installation and efficiency of system. Consequently, we decide efficient service model of passenger car monitoring system.

• Korean Journal of Fisheries and Aquatic Sciences
• /
• v.52 no.6
• /
• pp.702-708
• /
• 2019

The range resolution of echo sounders can be improved by enhancing the transducer bandwidth. We designed a bandpass matching network for expanding the bandwidth of a transducer by scaling in both impedance and frequency after transforming a lowpass network into a bandpass configuration for a third-order Bessel filter. We measured the effect of the Bessel matching network for a 50 kHz sandwich type transducer on the transmitting voltage response (TVR), receiving sensitivity (SRT) and figure of merit (FOM), using a chirp echo sounder system. Both the simulation and experimental results indicated that the transducer with a bandpass matching network was capable of producing a symmetrical acoustic output over a wider bandwidth (8.25 kHz) than was the transducer without a matching network (3.75 kHz). By implementing the Bessel matching network, we achieved a 120% bandwidth enhancement.

• Journal of Communications and Networks
• /
• v.9 no.4
• /
• pp.402-407
• /
• 2007

The network throughput is an important performance criteria for the packet ring networks. Since maximizing the network throughput can lead to severe bias in bandwidth allocation among all flows, fairness should be imposed to prevent bandwidth starvation. The challenge here, therefore, is the joint optimization of the network throughput and fairness. In this paper, we present the optimal bandwidth assignment scheme to decompose this optimization problem into two tasks, one for finding fair bandwidth assignment and the other for finding the optimal routing. The network throughput is maximized under the fairness constraints when these tasks are performed iteratively.

• Journal of Communications and Networks
• /
• v.9 no.4
• /
• pp.408-418
• /
• 2007

In this paper, we address the question of dynamic network provisioning for time-varying traffic rates, with the objective of maximizing the system throughput. We assume that the network is capable of providing bandwidth guaranteed traffic tunnels for an ingress-egress pair and present an approach that (1) updates the tunnel routes and (2) adjusts the tunnel bandwidths, in an incremental, adaptive manner, based on the variations in the incoming traffic. First, we consider a simpler scenario where tunnel routes are fixed, and present an approach for adjusting the tunnel bandwidths dynamically. We show, through simulations, that our dynamic bandwidth assignment algorithm significantly outperforms the optimal static bandwidth provisioning policy, and yields a performance close to that of the optimal dynamic bandwidth provisioning policy. We also propose an adaptive route update algorithm, which can be used in conjunction with our dynamic bandwidth assignment policy, and leads to further improvement in the overall system performance.

• International Journal of Control, Automation, and Systems
• /
• v.6 no.4
• /
• pp.596-606
• /
• 2008

In this paper, we present a co-design methodology of dynamic optimal network-bandwidth allocation (ONBA) and adaptive control for networked control systems (NCSs) to optimize overall control performance and reduce total network-bandwidth usage. The proposed dynamic co-design strategy integrates adaptive feedback control with real-time scheduling. As part of this co-design methodology, a "closed-loop" ONBA algorithm for NCSs with communication constraints is presented. Network-bandwidth is dynamically assigned to each control loop according to the quality of performance (QoP) information of each control loop. As another part of the co-design methodology, a network quality of service (QoS)-adaptive control design approach is also presented. The idea is based on calculating new control values with reference to the network QoS parameters such as time delays and packet losses measured online. Simulation results show that this co-design approach significantly improves overall control performance and utilizes less bandwidth compared to static strategies.

• Proceedings of the Safety Management and Science Conference
• /
• 2000.11a
• /
• pp.131-134
• /
• 2000

Broadband networks are designed to support a wide variety of services with different traffic characteristics and demands for Quality of Services. Bandwidth allocation methods can be classified into two major categories: static and dynamic. In static allocation, bandwidth is allocated only at call setup time and the allocated bandwidth is maintained during a session. In dynamic allocation, the allocated bandwidth is negotiated during a session. The purpose of this paper is to develop policies for deciding and for adjusting the amount of bandwidth requested for a best effort connection over such as ATM networks. This method is to develop such policies that a good trade off between utilization and latency using cell delay variation to the forecast the incoming traffic in the next period. The performances of the different polices are compared by simulations.

• ETRI Journal
• /
• v.26 no.2
• /
• pp.185-188
• /
• 2004

In this paper, we design a two-step scheduling algorithm to support multiple bandwidth allocation policies for upstream channel access in an Ethernet passive optical network. The proposed scheduling algorithm allows us a simultaneous approach for multiple access control policies: static bandwidth allocation for guaranteed bandwidth service and dynamic bandwidth allocation for on-demand, dynamic traffic services. In order to reduce the scheduling complexity, we separate the process of the transmission start- time decision from the process of grant generation. This technique does not require the timing information of other bandwidth allocation modules, so respective modules are free from a heavy amount of timing information or complex processing.