✦ LIBER ✦

Dynamic Max‐Min fairness in ring networks

✍ Scribed by G. Anastasi; L. Lenzini; M. La Porta; Y. Ofek

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Max–min fair survivable networks

✍ A. Bashllari; D. Nace; E. Gourdin; O. Klopfenstein 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 534 KB

Maximizing network utilization with max–

✍ Avinash Sridharan; Bhaskar Krishnamachari 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 1008 KB

Power Allocation with Max–Min and Min–Ma

✍ Tang Lun, Yan Jing-lin, Li Qing, Chen Qian-bin, Wang Huan 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 793 KB

Max–min fairness in multi-commodity flow

✍ Dritan Nace; Linh Nhat Doan; Olivier Klopfenstein; Alfred Bashllari 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 877 KB

On Exploiting Spatial-Temporal Uncertain

✍ Chih-Cheng Hsu; Lin, K.C.-J.; Ying-Ru Lai; Cheng-Fu Chou 📂 Article 📅 2010 🏛 IEEE 🌐 English ⚖ 376 KB

Min/max bounds for dynamic network flows

✍ W. L. Wilkinson 📂 Article 📅 1973 🏛 John Wiley and Sons 🌐 English ⚖ 582 KB