Thesis

Uniform multicommodity flows in random networks

Abstract:

Given a network 𝒩, and a collection 𝒱 of unordered pairs of vertices in 𝒩, a corresponding uniform multicommodity flow F of volume φ consists of simultaneous flows of volume φ of unique commodities between each pair of vertices in 𝒱. The maximum uniform flow volume is the maximum value of φ such that there is a uniform multicommodity flow of volume φ in 𝒩, within the capacity constraints.

This thesis cons...

Authors

More by this author
Division:
MPLS
Department:
Mathematical Institute
Role:
Author

Contributors

Role:
Supervisor
Role:
Supervisor
Type of award:
DPhil
Level of award:
Doctoral
Awarding institution:
University of Oxford
Language:
English
Keywords:
UUID:
uuid:f7e79942-400d-4d2a-af78-bf0427e6d0d6
Deposit date:
2016-03-09