Although Software-Defined Networking (SDN) enables flexible network resource allocations for traffic engineering, current literature mostly focuses on unicast communications. Compared to traffic engineering for multiple unicast flows, multicast traffic engineering for multiple trees is very challenging not only because minimizing the bandwidth consumption of a single multicast tree by solving t...

We have developed an exact model and algorithm for the delay-constrained minimum cost loop problem (DC-MCLP) of finding broadcast loops from a source node. While the traditional minimum cost loop problem (MCLP) deals with only the traffic capacity constraint served by a port of source node, the DC-MCLP deals with the mean network delay and traffic capacity constraints simultaneously. The DC-MCL...

Flow allocation problem is one of the important steps in reliability evaluation or optimization of a stochastic flow network. In a single source single sink networks it is easy to determine the flow on each path by using one of best known methods. While, in the case of multisource multisink flow network the file allocation problem becomes more complicated and few studies have dealt with it. Thi...

W e consider advertising problems under an information technology (IT) capacity constraint encountered by electronic retailers in a duopolistic setting. There is a considerable amount of literature on advertising games between firms, yet introducing an IT capacity constraint fundamentally changes this problem. In the presence of information processing constraints, although advertising may still...

Consider a wireless communication system where the base station has multiple antennas and users have a single antenna. For both the multiple access and broadcast channels, the sum capacity scales at best linearly with the number of antennas at the base station and double logarithmically with the number of users as the user pool grows asymptotically. Achieving this optimal capacity scaling poten...

This paper studies a covering problem on graph which is a variant of facility location problem. In this research, constraints are considered to improve the previous model. These constraints have not considered previously. The first constraint limits the capacity of the facilities and the other one considers different coverage distances. The objective is to determine the optimal subset of candid...

In this work, we consider the problems of channel coding with feedback and source coding with feedforward. We give a new interpretation of directed information [1] which helps us understand why it arises in the capacity and rate-distortion function of these two problems. Comparing the two problems studied, we nd that in channel coding feedback boosts capacity due to a larger constraint set of o...

An important issue in the widespread deployment of infrastructure based wireless local area networks (WLANs) is the network design. In this paper, we propose a new WLAN design approach that focuses on assuring sufficient data rate capacity to meet expected user demand in the coverage area, while still satisfying signal coverage and interference level requirements. Noting the low cost of WLAN ac...

We introduce a novel global constraint for the total weighted completion time of activities on a single unary capacity resource. For propagating the constraint, an O(n) algorithm is proposed, which makes use of the preemptive mean busy time relaxation of the scheduling problem. The solution to this problem is used to test if an activity can start at each start time in its domain in solutions th...

In this paper we evaluate the sustainability of the current fiscal policy regime in Poland, which has been in place for almost 10 years since the start of the economic reform process. We use the intertemporal budget constraint (IBC) as a framework, and evaluate the sustainability of current policies. Consistency of fiscal policy with the IBC is evaluated using unit root and cointegration tests....