Redundancy allocation is one of the common techniques to increase the reliability of the bridge systems. Many studies on the general redundancy allocation problems assume that the redundancy strategy for each subsystem is predetermined and fixed. In general, active redundancy has received more attention in the past. However, in real world, a particular system design contains both active and col...

This research investigates the problem of robust static resource allocation for distributed computing systems operating under imposed Quality of Service (QoS) constraints. Often, such systems are expected to function in a physical environment replete with uncertainty, which causes the amount of processing required to fluctuate substantially over time. Determining a resource allocation that acco...

In this research, an integrated approach is presented to simultaneously solve quay crane scheduling and yard truck scheduling problems. A mathematical model was proposed considering the main real-world assumptions such as quay crane non-crossing, precedence constraints and variable berthing times for vessels with the aim of minimizing vessels completion time. Based on the numerical results, thi...

Designing a low cost, survivable, telecommunications network is an extremely complicated process. Most commercial products available to help with this process are based on simulation and/or proprietary heuristics. However, there is a growing consensus that mathematical programming belongs in the designer’s “toolkit.” Easyto-use modeling languages coupled with powerful optimization solvers have ...

Analytic queueing network models are being used to analyze various optimization problems such as server allocation, design and capacity issues, optimal routing, and workload allocation. The mathematical properties of the relevant performance measures, such as throughput, are important for optimization purposes and for insight into system performance. We show that for closed queueing networks of...

Most of elastic traffic calls require a rate between certain limits, while it is essential for a bandwidth allocation mechanism to allocate the available bandwidth in a fair manner among the elastic calls. Therefore, the min and max bandwidth requirements of calls have to be taken into account in the bandwidth allocation process. Such a process is the Generalized Max-Min Fairness policy (GMM). ...

Transportable agents are a relatively new technology for coordinating work within an organization. Transportable agents can migrate from machine to machine, gathering information, analyzing it and interacting with human operators if required. They allow unprecedented exibility in carrying out tasks by allowing essentially any distributed organizational scheme to be implemented. Much of the tech...