Effect of model uncertainty on some optimal routing problems

[1]  P. Dupuis,et al.  On sampling controlled stochastic approximation , 1991 .

[2]  Edwin K. P. Chong,et al.  Convergence of Recursive Optimization Algorithms using IPA Derivative Estimates , 1990, 1990 American Control Conference.

[3]  Donald F. Towsley,et al.  Distributed routing with on-line marginal delay estimation , 1990, IEEE Trans. Commun..

[4]  Alan Weiss,et al.  Sensitivity Analysis for Simulations via Likelihood Ratios , 1989, Oper. Res..

[5]  R. Suri,et al.  Perturbation analysis: the state of the art and research issues explained via the GI/G/1 queue , 1989, Proc. IEEE.

[6]  Peter W. Glynn,et al.  Likelilood ratio gradient estimation: an overview , 1987, WSC '87.

[7]  Anurag Kumar,et al.  Adaptive Load Balancing in a Multi-Processor System with a Central Job Scheduler , 1987, Computer Performance and Reliability.

[8]  G. S. Shedler,et al.  Regeneration and Networks of Queues , 1986 .

[9]  Fu Chang,et al.  An optimal adaptive routing algorithm , 1986 .

[10]  Kai Hwang,et al.  Correction to “optimal load balancing in a multiple processor system with many job classes” , 1985, IEEE Transactions on Software Engineering.

[11]  Kim C. Border,et al.  Fixed point theorems with applications to economics and game theory: Fixed point theorems for correspondences , 1985 .

[12]  Asser N. Tantawi,et al.  Optimal static load balancing in distributed computer systems , 1985, JACM.

[13]  Benjamin W. Wah.  File Placement on Distributed Computer Systems , 1984, Computer.

[14]  Dimitri P. Bertsekas,et al.  Second Derivative Algorithms for Minimum Delay Distributed Routing in Networks , 1984, IEEE Trans. Commun..

[15]  D. Bertsekas,et al.  Distributed asynchronous optimal routing in data networks , 1984, The 23rd IEEE Conference on Decision and Control.

[16]  Rajan Suri,et al.  Robustness of queuing network formulas , 1983, JACM.

[17]  D. Bertsekas,et al.  Projected Newton methods and optimization of multicommodity flows , 1982, 1982 21st IEEE Conference on Decision and Control.

[18]  Lawrence W. Dowdy,et al.  Comparative Models of the File Assignment Problem , 1982, CSUR.

[19]  Dimitri P. Bertsekas,et al.  Dynamic behavior of shortest path routing algorithms for communication networks , 1982 .

[20]  L. R. Tymes,et al.  Routing and Flow Control in TYMNET , 1981, IEEE Trans. Commun..

[21]  Eric C. Rosen,et al.  The New Routing Algorithm for the ARPANET , 1980, IEEE Trans. Commun..

[22]  S. Wecker,et al.  DNA: The Digital Network Architecture , 1980, IEEE Trans. Commun..

[23]  Dimitri Bertsekas.  Dynamic models of shortest path routing algorithms for communication networks with multiple destinations , 1979, 1979 18th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.

[24]  Robert G. Gallager,et al.  A Minimum Delay Routing Algorithm Using Distributed Computation , 1977, IEEE Trans. Commun..

[25]  Alain Danet,et al.  The French Public Packet Switching Service: The Transpac Network , 1976, International Conference on Innovative Computing and Cloud Computing.

[26]  R. Gutmann,et al.  Methods for Supplying Interactive Services on Broad-Band Communication Networks , 1975, IEEE Trans. Commun..

[27]  Mario Gerla,et al.  Optimal Routing in a Packet-Switched Computer Network , 1974, IEEE Transactions on Computers.

[28]  Jeffrey P. Buzen,et al.  Optimal Load Balancing in Memory Hierarchies , 1974, IFIP Congress.

[29]  Luigi Fratta,et al.  The flow deviation method: An approach to store-and-forward communication network design , 1973, Networks.