O ne of the challenges of engineering is to make the best possible use of the available resources, or in other words allocating the resources in such a way as to maximize the overall profit. In the context of networks on chip the resources are represented by the communication bandwidth and the final profit is the performance of an application supported by the network on chip. In this thesis we ...

This paper considers the bandwidth allocation problem for an Ethernet Passive Optical Network (EPON). An EPON is one of the best options for high-speed access networks. This paper formulates the optimal bandwidth allocation problem with an analytical model to maximize throughput and weighted fairness simultaneously. First, the optimal solution under certain conditions is characterized. Then, tw...

The authors propose and evaluate the performance of a dynamic bandwidth allocation algorithm, namely burstby-bUrst dynamic bandwidth allocation (BUDA), which enables the fair and efficient utilisation of the available upstream resources in 10-Gigabit-capable passive optical networks (XG-PONs). The proposed algorithm emulates a bit-by-bit burst multiplexing process based on the fair queuing sche...

Max-min is an established fairness criteria for allocating bandwidth for flows. In this work we look at the combined problem of routing and bandwidth allocation such that the flow allocation for each connection will be maximized and fairness will be maintained. We use the weighted extension of the max-min criteria to allocate bandwidth proportionaly to the flows’ demand. Our contribution is an ...

Effective Bandwidth is a powerful tool in modeling bandwidth and buffer requirements for multiplexed data sources. It is often approximated that an additional service capacity equal to the effective bandwidth of the source is required for every additional data source added to the multiplexed stream given a fixed buffer size and maximum blocking probability. This implies that a multiplexing gain...

During networking, the bandwidth is equally assigned to individual nodes. But each node can’t utilize the same amount of bandwidth. The requirement of bandwidth also differs from time to time. For proper utilization of bandwidth, the dynamic bandwidth allocation algorithm can be implemented. Efficient dynamic resource provisioning algorithms are necessary to the development and automation of Qu...