File:Dynamic multicommodity flow schedules (IA dynamicmulticomm00feit).pdf

From Wikimedia Commons, the free media repository
Jump to navigation Jump to search
Go to page
next page →
next page →
next page →

Original file(1,187 × 1,568 pixels, file size: 11.71 MB, MIME type: application/pdf, 528 pages)

Captions

Captions

Add a one-line explanation of what this file represents

Summary[edit]

Dynamic multicommodity flow schedules   (Wikidata search (Cirrus search) Wikidata query (SPARQL)  Create new Wikidata item based on this file)
Author
Feit, Adam
image of artwork listed in title parameter on this page
Title
Dynamic multicommodity flow schedules
Publisher
Monterey, California: U.S. Naval Postgraduate School
Description
"December 1981"
Dissertation advisor(s): Wozencraft, J. M
DTIC Descriptors: Communications networks, Data management, Scheduling, Multiple operation, Dynamic response, Timeliness, Minimax technique, Delivery, Delay, Sequences(Mathematics), Linear programming, Transportation, Stochastic processes, Poisson density functions, Theses
Author(s) subject terms: Dynamic routing, Data communication network, Minimum time problem, Min-Max Criterion, Transportation problem, Linear programming
Issued as Naval Postgraduate School Technical Report (NPS-62-81-039)
Thesis (Ph.D.)--Naval Postgraduate School, 1981
Includes bibliographical references ( p. 253-255)
Some new results in the scheduling of dynamic multicommodity flows in data communication networks are presented. A new performance measure for effective delivery of backlogged data to their destinations is defined and the solution to the resulting delivery problem is obtained through a sequential linear optimization methodology. Properties of an optimal dynamic multicommodity flow schedule are studied in detail, taking advantage where possible of the linear programming formulation. The special case of the delivery problem in a single destination network also is analyzed. Application of the results to stochastic delivery problems in which the data inputs to the network are modelled as Poisson processes is addressed, and a new dynamic data communication network analysis is presented. Finally, the delivery problem on networks with capacitated links and with traversal delays is considered and some new results obtained
Mode of access: World Wide Web
System requirement: Adobe Acrobat Reader
Israeli Defense Forces author

Subjects:
Language en_US
Publication date December 1981
publication_date QS:P577,+1981-12-00T00:00:00Z/10
Current location
IA Collections: navalpostgraduateschoollibrary; fedlink; americana
Accession number
dynamicmulticomm00feit
Notes some content may be lost due to the binding of the book.
Authority file  OCLC: 1043024271
Source
Internet Archive identifier: dynamicmulticomm00feit
https://archive.org/download/dynamicmulticomm00feit/dynamicmulticomm00feit.pdf

Licensing[edit]

Public domain
This work is in the public domain because it was published in the United States between 1978 and March 1, 1989 without a copyright notice, and its copyright was not subsequently registered with the U.S. Copyright Office within 5 years. Unless its author has been dead for several years, it is copyrighted in the countries or areas that do not apply the rule of the shorter term for US works, such as Canada (50 pma), Mainland China (50 pma, not Hong Kong or Macau), Germany (70 pma), Mexico (100 pma), Switzerland (70 pma), and other countries with individual treaties. See this page for further explanation.

Deutsch  English  español  français  italiano  日本語  한국어  македонски  português  português do Brasil  русский  sicilianu  slovenščina  中文  中文(简体)  中文(繁體)  中文(臺灣)  +/−

File history

Click on a date/time to view the file as it appeared at that time.

Date/TimeThumbnailDimensionsUserComment
current14:06, 29 June 2020Thumbnail for version as of 14:06, 29 June 20201,187 × 1,568, 528 pages (11.71 MB) (talk | contribs)FEDLINK - United States Federal Collection dynamicmulticomm00feit (User talk:Fæ/CCE volumes#Fork8) (batch 1980-1982 #3668)

Metadata