N. Mckeown, T. Anderson, H. Balakrishnan, G. Parulkar, L. Peterson et al., OpenFlow, ACM SIGCOMM Computer Communication Review, vol.38, issue.2, pp.69-74, 2008.
DOI : 10.1145/1355734.1355746

J. Hu, C. Lin, X. Li, and J. Huang, Scalability of control planes for Software defined networks: Modeling and evaluation, 2014 IEEE 22nd International Symposium of Quality of Service (IWQoS), pp.147-152, 2014.
DOI : 10.1109/IWQoS.2014.6914314

N. Gude, T. Koponen, J. Pettit, B. Pfaff, M. Casado et al., NOX, ACM SIGCOMM Computer Communication Review, vol.38, issue.3, pp.105-110, 2008.
DOI : 10.1145/1384609.1384625

M. Yu, J. Rexford, M. J. Freedman, and J. Wang, Scalable Flow-based Networking with DIFANE, Proc. ACM SIGCOMM, pp.351-362, 2010.

A. R. Curtis, J. C. Mogul, J. Tourrilhes, P. Yalagandula, P. Sharma et al., DevoFlow: Scaling Flow Management for Highperformance Networks, Proc. ACM SIGCOMM, pp.254-265, 2011.

A. Tootoonchian and Y. Ganjali, Hyperflow: a distributed control plane for openflow, Proc. USENIX INM/WREN, pp.3-3, 2010.

S. , H. Yeganeh, and Y. Ganjali, Kandoo: a framework for efficient and scalable offloading of control applications, Proc. ACM SIG- COMM HotSDN, pp.19-24, 2012.

S. H. Yeganeh and Y. Ganjali, Beehive, Proceedings of the 13th ACM Workshop on Hot Topics in Networks, HotNets-XIII, p.13, 2014.
DOI : 10.1145/1592568.1592575

T. Koponen, M. Casado, N. Gude, J. Stribling, L. Poutievski et al., Onix: A Distributed Control Platform for Large-scale Production Networks, Proc. USENIX OSDI, pp.1-6, 2010.

A. Panda, W. Zheng, X. Hu, A. Krishnamurthy, and S. Shenker, Scl: Simplifying distributed sdn control planes, Proc. USENIX NSDI, 2017.

S. Jain, A. Kumar, S. Mandal, J. Ong, L. Poutievski et al., B4: Experience with a globally-deployed software defined wan, Proc. ACM SIGCOMM, pp.3-14, 2013.

B. Davie, T. Koponen, J. Pettit, B. Pfaff, M. Casado et al., A Database Approach to SDN Control Plane Design, ACM SIGCOMM Computer Communication Review, vol.47, issue.1, pp.15-26, 2017.
DOI : 10.1145/3041027.3041030

M. Wichtlhuber, R. Reinecke, and D. Hausheer, An SDN-Based CDN/ISP Collaboration Architecture for Managing High-Volume Flows, IEEE Transactions on Network and Service Management, vol.12, issue.1, pp.48-60, 2015.
DOI : 10.1109/TNSM.2015.2404792

H. Yamanaka, E. Kawai, and S. Shimojo, [demo]scaling-up flow path computation for a large number of virtual sdn/nfv infrastructures, Proc. ACM SIGCOMM SOSR, 2015.

T. H. Cormen, C. Stein, R. L. Rivest, and C. E. Leiserson, Introduction to Algorithms, 2001.

M. Goudreau, K. Lang, S. Rao, T. Suel, and T. Tsantilas, Towards efficiency and portability, Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures , SPAA '96, pp.1-12, 1996.
DOI : 10.1145/237502.237503

G. Decandia, D. Hastorun, M. Jampani, G. Kakulapati, A. Lakshman et al., Dynamo: amazon's highly available key-value store, pp.205-220, 2007.

C. Mohan, B. Lindsay, and R. Obermarck, Transaction management in the R* distributed database management system, ACM Transactions on Database Systems, vol.11, issue.4, pp.378-396, 1986.
DOI : 10.1145/7239.7266

L. Lamport, Paxos made simple, ACM Sigact News, vol.32, issue.4, pp.18-25, 2001.

M. Canini, P. Kuznetsov, D. Levin, and S. Schmid, A distributed and robust SDN control plane for transactional network updates, 2015 IEEE Conference on Computer Communications (INFOCOM), pp.190-198, 2015.
DOI : 10.1109/INFOCOM.2015.7218382

K. Dashdavaa, S. Date, H. Yamanaka, E. Kawai, Y. Watashiba et al., Architecture of a high-speed mpi bcast leveraging software-defined network, Proc. Springer Euro- Par, pp.885-894, 2014.

R. Raghavendra, J. Lobo, and K. Lee, Dynamic graph query primitives for sdn-based cloud network management, Proc. ACM SIGCOMM HotSDN, pp.97-102, 2012.

M. Jelasity and A. Montresor, Epidemic-style proactive aggregation in large overlay networks, 24th International Conference on Distributed Computing Systems, 2004. Proceedings., pp.102-109, 2004.
DOI : 10.1109/ICDCS.2004.1281573

I. Gupta, A. Kermarrec, and A. J. Ganesh, Efficient and adaptive epidemic-style protocols for reliable and scalable multicast, IEEE Transactions on Parallel and Distributed Systems, vol.17, issue.7, pp.593-605, 2006.
DOI : 10.1109/TPDS.2006.85

J. Holliday, R. Steinke, D. Agrawal, and A. Abbadi, Epidemic algorithms for replicated databases, IEEE Transactions on Knowledge and Data Engineering, vol.15, issue.5, pp.1218-1238, 2003.
DOI : 10.1109/TKDE.2003.1232274

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.8.7287

S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, Randomized gossip algorithms, IEEE Transactions on Information Theory, vol.52, issue.6, pp.2508-2530, 2006.
DOI : 10.1109/TIT.2006.874516

M. Haridasan and R. Van-renesse, Gossip-based distribution estimation in peer-to-peer networks, Proc. USENIX IPTPS, p.13, 2008.

B. Lantz, B. Heller, and N. Mckeown, A network in a laptop, Proceedings of the Ninth ACM SIGCOMM Workshop on Hot Topics in Networks, Hotnets '10, p.19, 2010.
DOI : 10.1145/1868447.1868466

M. L. Eventlet, R. Fredman, D. D. Sedgewick, R. E. Sleator, and . Tarjan, Onos version 1.3. [Online] Available: http://onosproject.org/ [33] Topology zoo The pairing heap: A new form of self-adjusting heap, Algorithmica, vol.1, issue.1, pp.111-129, 1986.

A. Kyrola, G. Blelloch, and C. Guestrin, Graphchi: Large-scale graph computation on just a PC, Presented as part of the 10th USENIX Symposium on Operating Systems Design and Implementation (OSDI), 2012, pp.31-46
DOI : 10.21236/ada603410

Q. Xu, X. Zhang, J. Zhao, X. Wang, and T. Wolf, Fast shortest-path queries on large-scale graphs, Proc. IEEE ICNP, pp.1-10, 2016.

G. Malewicz, M. H. Austern, A. J. Bik, J. C. Dehnert, I. Horn et al., Pregel: a system for large-scale graph processing, Proc. ACM SIGMOD, pp.135-146, 2010.

R. S. Xin, J. E. Gonzalez, M. J. Franklin, and I. Stoica, GraphX, First International Workshop on Graph Data Management Experiences and Systems, GRADES '13, p.2, 2013.
DOI : 10.1145/2484425.2484427

J. E. Gonzalez, Y. Low, H. Gu, D. Bickson, and C. Guestrin, Powergraph: Distributed graph-parallel computation on natural graphs, Proc. USENIX OSDI, pp.17-30, 2012.

J. K. Antonio, G. M. Huang, and W. K. Tsai, A fast distributed shortest path algorithm for a class of hierarchically clustered data networks, IEEE Transactions on Computers, vol.41, issue.6, pp.710-724, 1992.
DOI : 10.1109/12.144623

S. Zhu and G. M. Huang, A new parallel and distributed shortest path algorithm for hierarchically clustered data networks, IEEE Transactions on Parallel and Distributed Systems, vol.9, issue.9, pp.841-855, 1998.
DOI : 10.1109/71.722218

V. T. Chakaravarthy, F. Checconi, P. Murali, F. Petrini, and Y. Sabharwal, Scalable single source shortest path algorithms for massively parallel systems, IEEE Trans. PDS, vol.28, issue.7, pp.2031-2045, 2017.

D. Nanongkai, Distributed approximation algorithms for weighted shortest paths, Proceedings of the 46th Annual ACM Symposium on Theory of Computing, STOC '14, pp.565-573, 2014.
DOI : 10.1007/978-3-642-31585-5_58

URL : http://arxiv.org/abs/1403.5171

B. Patt-shamir and C. Lenzen, Fast Routing Table Construction Using Small Messages, Proc. ACM STOC, pp.381-390, 2013.