1 / 15

9761133 劉立恆

Traffic engineering for information-centric networks Martin J. Reed, IEEE ICC 2012 - Next-Generation Networking Symposium. 9761133 劉立恆. Abstract. Information-centric network (ICN) Intra-domain traffic engineering (TE). Information-centric network (ICN).

ross-norris
Download Presentation

9761133 劉立恆

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Traffic engineering for information-centric networksMartin J. Reed, IEEE ICC 2012 - Next-Generation Networking Symposium 9761133 劉立恆

  2. Abstract Information-centric network (ICN) Intra-domain traffic engineering (TE)

  3. Information-centric network (ICN) • publish-subscribe Internet routing paradigm (PSIRP) • Bloom filter (BF)A source routing methodAnother method mentioned is Multi-Protocol Label Switch (MLPS) • line speed publish-subscribe inter-networking (LIPSIN)LIPSIN = PSIRP + BF

  4. Bloom filter (BF) • Hash • False positive • Forwarding Identifier (FID) in header (routing information) • Link Identifiers (LID) for each link

  5. Publish-Subscribe Internet Routing Paradigm (PSIRP)with BF = LIne speed Publish-Subscribe Inter-Networking (LIPSIN)

  6. Intra-domain traffic engineering (TE) • Loss Rate • Throughput • MFMC是TE的其中一個目的 (resource reservation) • 降低使用律 (最大化沒用到的傳輸能力) • 應付未來可能增加的需求

  7. Multicommodity Flow with Minimum Congestion (MFMC) x(p): path p的流量, u(e): edge e的容量, ΓL: 剩餘容量 d : 需求量 • 流量小於edge的容量 (容量已扣除保留的部分) • flow須滿足需求

  8. Integer Multicommodity Flow with Minimum Congestion (IMFMC) 對IP based network (同一個link不可不同path) • 流量小於edge的容量 (容量已扣除保留的部分) • flow須滿足需求每一個demand (d) 對應一個path (p)不可將demand分割成多條path

  9. Maximum Concurrent Flow (MCF) 令 MCFC等於MCF的變體

  10. The Garg and Konemann algorithm • Lagrange dual problem • Iterative processing • ϵ step, ϵ-optimize • Run time :

  11. Network simulation • Degree: Weibull distribution ( k=0.42 ) • Edge generation: Viger and Latapylognormal distribution ( μ = 16.6 and σ = 1.04 )

  12. MFMC v.s. Shortest Path Route (SPR) 高負載 =0 低負載 =1 15 個nodes 20 個虛擬情境

  13. MFMC v.s. IMFMC 高負載 =0 低負載 =1 15 個nodes 20 個虛擬情境

  14. Variance of IMFMC 高負載 =0.1 NPC algorithm

  15. Conclusion 延伸討論 • Information-Centric Network的應用？ • IMFMC的實際架構？ • 20個模擬情境？ • MFMC與理想狀況的差距？

More Related