Presentation 2000/4/20
Analysis of Flow Control by Means of Dynamic Programming
Toshihisa OZAWA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In this paper, we dealt with the framework to present a flow control algorithm is a computer communication network as the solution of an optimization problem. This optimization problem minimizes the expectation of congestion cost minus user utilities for communications. The network model for analysis is a Markovian queueing model with single bottleneck node, where users send packets according to independent Poisson processes and their intensities are controlled to minimize the expectation. This control corresponds to packet flow control, and it is given as the stochastic dynamic programming type solution of the optimization problem.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Communication network / congestion control / flow control / traffic theory / queueing theory / dynamic programming
Paper # SSE2000-1
Date of Issue

Conference Information
Committee SSE
Conference Date 2000/4/20(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Switching Systems Engineering (SSE)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Analysis of Flow Control by Means of Dynamic Programming
Sub Title (in English)
Keyword(1) Communication network
Keyword(2) congestion control
Keyword(3) flow control
Keyword(4) traffic theory
Keyword(5) queueing theory
Keyword(6) dynamic programming
1st Author's Name Toshihisa OZAWA
1st Author's Affiliation Department of Business Administration, Komazawa University()
Date 2000/4/20
Paper # SSE2000-1
Volume (vol) vol.100
Number (no) 14
Page pp.pp.-
#Pages 6
Date of Issue