You are here

ECE PhD Defense: "Optimization of Content Centric Networks," Milad Mahdian


226 Richards Hall

September 25, 2017 10:00 am
September 25, 2017 10:00 am

Today’s Internet has become widely a distribution network where its end users are not concerned with where the data is located, but mainly interested in obtaining the data they want. To evolve the Internet toward its current primary use, Information-Centric Networking (ICN) architectures were developed with in-network caching as one of their key features.  
However, they have yet to settle on specific traffic engineering and caching strategies.

In the first chapter of this thesis, we model and formulate the traffic engineering (forward- ing strategy) and in-network caching jointly under ICN architectures into an optimization problem, with the objective of minimizing the network delay. We then solve the problem and develop fully distributed and modular algorithms for both hop-by-hop forwarding and caching strategies. Through extensive simulations, we demonstrate that our forwarding and caching strategies outperform the state-of-the-art schemes out there in terms of network delay.

In chapter two, we propose a novel framework for incorporating storage functionality into the problem of minimum-cost multicast in a multi-commodity setting with network coding. The proposed framework can model architectures such as ICN, Content Distribution Networks (CDNs), Peer-to-Peer (P2P) networks, as well as CDN-P2P hybrid architectures in a coded environment. We first formulate the problem with given multicast rates using convex cost functions and present primal-dual algorithms to solve the convex problem. We then add congestion control mechanism to accommodate elastic traffic. Next as a special case, we consider linear cost functions and adopt a simple and distributed dual subgradient algorithm to find the minimum-cost integrated multicast and caching strategy.

In chapter three, we develop MIRCC, a rate-based, multipath-aware congestion control approach for ICN. We first present MIRCC’s algorithm for single-path flows and develop a non-recursive rate-calculation algorithm which achieves max-min fairness, high link utilization and short flow completion time. We then focus on multi-path flows and design a novel hybrid scheme with dual-class rate management, in which each flow has two rate levels: the primary rate is ensured a level of max-min fairness between all flows and the secondary rate is managed to consume remaining bandwidth resulting in full link utilization.

  • Professor Edmund Yeh (Advisor)
  • Professor Stratis Ioannidis
  • Professor Milica Stojanovic