FLOW CONTROL AND ROUTING ALGORITHMS IN PACKET-SWITCHED NETWORKS (2008)
Roberto C. Bethi, Hisao Kameda, Toshio Nakatnishi T
Abstract- Performance of a sampling of nonadap-tive and adaptive routing algorithms and the combined effect when 4 levels of flow control mechanisms are operat-ing simultaneously in a packet-switched...
Effects of Symmetry on Globalizing Separated Monopolies to a Nash-Cournot Oligopoly ∗ (2008)
The effects of uniting separated markets, each monopolized by a producer, into a globalized oligopolistic market, which is regarded as a non-cooperative game, are investigated. The cases where such...
Said Fathy El-zoghdy, Hisao Kameda, Jie Li
Distributed computer systems consists of nodes (hosts, computers) and a communication means that connects nodes. Jobs arrive at each node and can be forwarded through the communication means to the...
Effects of Job Loading Policies for Multiprogramming Systems in Processing a Job Stream (2008)
The scheduling of jobs for multiprogramming systems includes the selection of jobs to be loaded into memory (job loading policy or memory schedule) and the scheduling for CPU processing (CPU...
A paradox in optimal flow control of M/M/n queues (2008)
Operations Research Www, Atsushi Inoie, Hisao Kameda, Corinne Touati
Optimal flow control problems of multiple-server (M/M/n) queueing systems are studied. Due to enhanced flexibility of the decision making, intuitively, we expect that grouping together separated...
Hisao Kameda, Inhwan Ryu, Jie Li
Distributed computer systems can share job processing in the eventofoverloads. Load balancing involves the distribution of jobs throughout a networked computer system, thus increasing throughput...
Fairness in Non-convex Systems (2005)
Corinne Touati, Hisao Kameda, Atsushi Inoie
In general, the set of users utilities is bounded because of the limitation of resources. There may exist many Pareto optimal points in the set of users utilities. For selecting a Pareto optimum...
Bounds on benefits and harms of adding connections to noncooperative networks (2004)
Abstract. In computer networks (and, say, transportation networks), we can consider the situation where each user has its own routing decision so as to minimize noncooperatively the expected passage...
Pareto Set, Fairness, and Nash Equilibrium: A Case Study on Load Balancing (2004)
Atsushi Inoie, Hisao Kameda, Corinne Touati
Various fairness objectives are studied in relation to Pareto optimal sets and Nash equilibria. We examine the already discussed general parameterized fairness objective that covers a variety of...
Nash Equilibria In Load Balancing In Distributed Computer Systems (2002)
Eitan Altman, Hisao Kameda, Yoshihisa Hosokawa
this paper a third area of applications of such games, which is load balancing in distributed computer systems. One of the most important questions that arise in all applications of routing games is...
Equilibria for multiclass routing in multi-agent networks (2001)
Abstract. We study optimal static routing problems in open multiclass networks with state-independent arrival and service rates. Our goal is to study the uniqueness of optimal routing under different...
Braess-like paradoxes in distributed computer systems (2000)
Hisao Kameda, Eitan Altman, Takayuki Kozawa, Yoshihisa Hosokawa
We consider optimal distributed decisions in distributed computer systems. We identify a Braess-like paradox in which adding capacity to the system may degrade the performance of all users. Unlike...
Braess-like paradoxes in distributed computer systems (2000)
Hisao Kameda, Eitan Altman, Takayuki Kozawa, Yoshihisa Hosokawa
2 We consider optimal distributed decisions in distributed computer systems. We identify a Braess-like paradox in which adding capacity to the system may degrade the performance of all users. Unlike...
Hisao Kameda, Eitan Altman, Takayuki Kozawa
The Braess paradox which was originally identified and observed in road traffic context, shows that it may happen that by adding capacity to the network, the performance of all users degrades. This...
Load balancing problems for multiclass jobs in distributed/parallel computer systems (1998)
Abstract—Load balancing problems for multiclass jobs in distributed/parallel computer systems with general network configurations are considered. We construct a general model of such a...
A finite-source queue with different customers (1982)
~STRACT A finite-source queuing model (sometimes called the finite-population, machine-interference, or machine-repairman model), which has often been used in analyzing time-sharing systems and...
Braess paradox, Noncooperative optimization, Wardrop equilibrium, Nash equilibrium, Computer networks, Distributed computer systems, Network routing, Static load balancing,