| LDR | | 02035nam u200397 4500 |
| 001 | | 000000418703 |
| 005 | | 20190215163059 |
| 008 | | 181129s2018 |||||||||||||||||c||eng d |
| 020 | |
▼a 9780438343634 |
| 035 | |
▼a (MiAaPQ)AAI10845607 |
| 035 | |
▼a (MiAaPQ)cornellgrad:10998 |
| 040 | |
▼a MiAaPQ
▼c MiAaPQ
▼d 247004 |
| 082 | 0 |
▼a 004 |
| 100 | 1 |
▼a Basu, Shrutarshi. |
| 245 | 10 |
▼a Languages for Path-Based Network Programming. |
| 260 | |
▼a [S.l.]:
▼b Cornell University.,
▼c 2018. |
| 260 | 1 |
▼a Ann Arbor:
▼b ProQuest Dissertations & Theses,
▼c 2018. |
| 300 | |
▼a 112 p. |
| 500 | |
▼a Source: Dissertation Abstracts International, Volume: 80-01(E), Section: B. |
| 500 | |
▼a Adviser: John N. Foster. |
| 502 | 1 |
▼a Thesis (Ph.D.)--Cornell University, 2018. |
| 520 | |
▼a The notion of a path is an important abstraction for reasoning about and managing computer networks. By thinking of network configuration in terms of paths (instead of individual devices), network administrators can reap significant benefits in |
| 520 | |
▼a This dissertation shows that it is possible to use specifications of network paths, extended with constraints on traffic classes, bandwidth, and the capabilities of network devices, to enable flexible management of modern networks. This is reali |
| 520 | |
▼a Furthermore, by leveraging techniques and tools such as mixed-integer programming, SAT solvers and SDN controller frameworks, we have built practical compilers and runtimes for these languages. These compilers take high-level specifications of n |
| 590 | |
▼a School code: 0058. |
| 650 | 4 |
▼a Computer science. |
| 690 | |
▼a 0984 |
| 710 | 20 |
▼a Cornell University.
▼b Computer Science. |
| 773 | 0 |
▼t Dissertation Abstracts International
▼g 80-01B(E). |
| 773 | |
▼t Dissertation Abstract International |
| 790 | |
▼a 0058 |
| 791 | |
▼a Ph.D. |
| 792 | |
▼a 2018 |
| 793 | |
▼a English |
| 856 | 40 |
▼u http://www.riss.kr/pdu/ddodLink.do?id=T15000073
▼n KERIS
▼z 이 자료의 원문은 한국교육학술정보원에서 제공합니다. |
| 980 | |
▼a 201812
▼f 2019 |
| 990 | |
▼a ***1012033 |