Back to search

Boston University

Synthesis of a time dependent communication network

Abstract

dc:description.abstract

In this paper, an algorithm for the min-cost synthesis of a communication network, which is able to handle flows of all time periods, is given. The algorithm used is the dual simplex me t hod. The first part of the paper is devoted to the explanation of a general network and the methods of finding maximal flows. Then I restrict the discussion to a communication network; in particular, a time dependent communication network. Although the example in Chanter V of this paper is restricted to two distinct time periods, the theory preceding it allows us to discuss a communication network with infinitely many time periods. The only thing to he kept in mind is that each new time period involves much calculation in order to set up the proper constraint equations for it, so an example with more than two time periods would prove to be quite impractical if solved manually.

Degree

thesis:*
Name thesis:degree_name
Master of Arts
Level thesis:degree_level
masters
Discipline thesis:degree_discipline
Engineering
Grantor dc:publisher
Boston University
Year dc:date.issued
1966

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Stick, Marvin Earl

Rights

Language dc:language.iso
en_US

Identifiers

dc:identifier.*
Dc Identifier Barcode
11719025652654
Dc Identifier Bibid
99181594230001161
Dc Identifier Other
b14571973

Chain of custody

source
Harvested from
Boston University
Base URL
open.bu.edu/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
related terms
citation

Stick, Marvin Earl. Synthesis of a time dependent communication network. masters thesis, Boston University, 1966. https://hdl.handle.net/2144/34726