Computer capacity planning: theory and practice
Computer capacity planning: theory and practice
Data networks (2nd ed.)
Utopia: a load sharing facility for large, heterogeneous distributed computer systems
Software—Practice & Experience
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
Journal of the ACM (JACM)
Dynamic load sharing in distributed database systems
ACM '86 Proceedings of 1986 ACM Fall joint computer conference
Sharing the load across the Web
Network Computing
Routing and Dimensioning in Circuit-Switched Networks
Routing and Dimensioning in Circuit-Switched Networks
Performance Modelling of Communication Networks and Computer Architectures (International Computer S
Performance Modelling of Communication Networks and Computer Architectures (International Computer S
Analytic Models of Adaptive Load Sharing Schemes in Distributed Real-Time Systems
IEEE Transactions on Parallel and Distributed Systems
A Traffic Management Model for Virtual Private Network Links
PfHSN '99 Proceedings of the IFIP TC6 WG6.1 & WG6.4 / IEEE ComSoc TC on on Gigabit Networking Sixth International Workshop on Protocols for High Speed Networks VI
The Effect of Scheduling Discipline on Dynamic Load Sharing in Heterogeneous Distributed Systems
MASCOTS '97 Proceedings of the 5th International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
Adaptive Load Sharing and Scheduling Schemes for Distributed Continuous Media Delivery
ICMCS '99 Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2
Load sharing in distributed computer systems
Load sharing in distributed computer systems
In search of the optimal adaptive load sharing policy for distributed systems
In search of the optimal adaptive load sharing policy for distributed systems
Hi-index | 0.01 |
This paper presents the problem of optimally dimensioning a new geographically distributed computer system that handles all communications between aircraft and airline operation centers. Since computers are distributed on three continents, the service demand per site (as measured by messages to be treated) can vary greatly with the time of day.The model optimizes costs while taking advantage of the variation of demand over time and the sharing of load among the sites. The model is a mixed integer program with non-linear constraints. An algorithm is proposed to solve the problem to optimality. Test data provided by SITA were used to evaluate the quality of the solution.