├── .gitignore ├── LICENSE ├── Makefile ├── README.md ├── TODO ├── bachelor-common.tex ├── bachelor-coursework.tex ├── bachelor-design.tex ├── bachelor-related.tex ├── bachelor.bib ├── bachelor.tex ├── dtklogos.sty ├── gbt7714-2005-jnu.bst ├── gbt7714-2005.bst ├── get_texmf_dir.sh ├── jnuname.eps ├── jnuname.pdf ├── jnuthesis.cfg ├── jnuthesis.cls ├── jnuthesis.dtx ├── jnuthesis.ins ├── master-blind.tex ├── master-contents.tex ├── master-p-blind.tex ├── master-p.tex ├── master-preamble.tex ├── master.bib ├── master.tex ├── phd.bib ├── phd.tex └── reference ├── bachelor ├── 本科毕业论文模板.doc ├── 毕业设计（论文）相关资料外文资料翻译与原文封面.doc └── 毕业设计（论文）相关资料封面.doc ├── master-p ├── 全日制专业学位硕士学位申请书.doc ├── 全日制专业学位硕士学位论文封面.doc ├── 全日制专业学位论文导师评阅书.doc ├── 全日制专业学位论文抽检封面.doc ├── 全日制专业学位论文盲评评阅书.doc ├── 全日制专业学位论文评阅书.doc ├── 独创性声明.doc ├── 研究生答辩海报.doc ├── 答辩委员会审批表.doc └── 答辩聘请书.doc ├── master ├── 导师评阅书.doc ├── 江大学位论文模板.doc ├── 独创性声明.doc ├── 研究生答辩海报.doc ├── 硕士 学位申请书.doc ├── 硕士学位论文封面.doc ├── 硕士学位论文抽检封面.doc ├── 硕士登记表(留学生).doc ├── 硕士盲评评阅书.doc ├── 硕士答辩委员会审批表.doc ├── 硕士答辩费用结算表-200906.doc ├── 硕士论文评阅书.doc └── 答辩聘请书.doc └── 学位论文封面.pdf /.gitignore: -------------------------------------------------------------------------------- 1 | dtx-style.sty 2 | jnuthesis.pdf 3 | phd.pdf 4 | master.pdf 5 | master-blind.pdf 6 | master-p.pdf 7 | master-p-blind.pdf 8 | bachelor.pdf 9 | bachelor-coursework.pdf 10 | bachelor-design.pdf 11 | bachelor-related.pdf 12 | .~*.doc 13 | 14 | *.hd 15 | *.cmds 16 | *.acn 17 | *.acr 18 | *.alg 19 | *.aux 20 | *.bbl 21 | *.blg 22 | *.dvi 23 | *.fdb_latexmk 24 | *.glg 25 | *.glo 26 | *.gls 27 | *.idx 28 | *.ilg 29 | *.ind 30 | *.ist 31 | *.lof 32 | *.log 33 | *.lot 34 | *.maf 35 | *.mtc 36 | *.mtc0 37 | *.nav 38 | *.nlo 39 | *.out 40 | *.pdfsync 41 | *.ps 42 | *.snm 43 | *.synctex.gz 44 | *.toc 45 | *.vrb 46 | *.xdy 47 | *.tdo 48 | *.thm 49 | .DS_Store 50 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 2, June 1991 3 | 4 | Copyright (C) 1989, 1991 Free Software Foundation, Inc., 5 | 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA 6 | Everyone is permitted to copy and distribute verbatim copies 7 | of this license document, but changing it is not allowed. 8 | 9 | Preamble 10 | 11 | The licenses for most software are designed to take away your 12 | freedom to share and change it. By contrast, the GNU General Public 13 | License is intended to guarantee your freedom to share and change free 14 | software--to make sure the software is free for all its users. This 15 | General Public License applies to most of the Free Software 16 | Foundation's software and to any other program whose authors commit to 17 | using it. (Some other Free Software Foundation software is covered by 18 | the GNU Lesser General Public License instead.) You can apply it to 19 | your programs, too. 20 | 21 | When we speak of free software, we are referring to freedom, not 22 | price. Our General Public Licenses are designed to make sure that you 23 | have the freedom to distribute copies of free software (and charge for 24 | this service if you wish), that you receive source code or can get it 25 | if you want it, that you can change the software or use pieces of it 26 | in new free programs; and that you know you can do these things. 27 | 28 | To protect your rights, we need to make restrictions that forbid 29 | anyone to deny you these rights or to ask you to surrender the rights. 30 | These restrictions translate to certain responsibilities for you if you 31 | distribute copies of the software, or if you modify it. 32 | 33 | For example, if you distribute copies of such a program, whether 34 | gratis or for a fee, you must give the recipients all the rights that 35 | you have. You must make sure that they, too, receive or can get the 36 | source code. And you must show them these terms so they know their 37 | rights. 38 | 39 | We protect your rights with two steps: (1) copyright the software, and 40 | (2) offer you this license which gives you legal permission to copy, 41 | distribute and/or modify the software. 42 | 43 | Also, for each author's protection and ours, we want to make certain 44 | that everyone understands that there is no warranty for this free 45 | software. If the software is modified by someone else and passed on, we 46 | want its recipients to know that what they have is not the original, so 47 | that any problems introduced by others will not reflect on the original 48 | authors' reputations. 49 | 50 | Finally, any free program is threatened constantly by software 51 | patents. We wish to avoid the danger that redistributors of a free 52 | program will individually obtain patent licenses, in effect making the 53 | program proprietary. To prevent this, we have made it clear that any 54 | patent must be licensed for everyone's free use or not licensed at all. 55 | 56 | The precise terms and conditions for copying, distribution and 57 | modification follow. 58 | 59 | GNU GENERAL PUBLIC LICENSE 60 | TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION 61 | 62 | 0. This License applies to any program or other work which contains 63 | a notice placed by the copyright holder saying it may be distributed 64 | under the terms of this General Public License. The "Program", below, 65 | refers to any such program or work, and a "work based on the Program" 66 | means either the Program or any derivative work under copyright law: 67 | that is to say, a work containing the Program or a portion of it, 68 | either verbatim or with modifications and/or translated into another 69 | language. (Hereinafter, translation is included without limitation in 70 | the term "modification".) Each licensee is addressed as "you". 71 | 72 | Activities other than copying, distribution and modification are not 73 | covered by this License; they are outside its scope. The act of 74 | running the Program is not restricted, and the output from the Program 75 | is covered only if its contents constitute a work based on the 76 | Program (independent of having been made by running the Program). 77 | Whether that is true depends on what the Program does. 78 | 79 | 1. You may copy and distribute verbatim copies of the Program's 80 | source code as you receive it, in any medium, provided that you 81 | conspicuously and appropriately publish on each copy an appropriate 82 | copyright notice and disclaimer of warranty; keep intact all the 83 | notices that refer to this License and to the absence of any warranty; 84 | and give any other recipients of the Program a copy of this License 85 | along with the Program. 86 | 87 | You may charge a fee for the physical act of transferring a copy, and 88 | you may at your option offer warranty protection in exchange for a fee. 89 | 90 | 2. You may modify your copy or copies of the Program or any portion 91 | of it, thus forming a work based on the Program, and copy and 92 | distribute such modifications or work under the terms of Section 1 93 | above, provided that you also meet all of these conditions: 94 | 95 | a) You must cause the modified files to carry prominent notices 96 | stating that you changed the files and the date of any change. 97 | 98 | b) You must cause any work that you distribute or publish, that in 99 | whole or in part contains or is derived from the Program or any 100 | part thereof, to be licensed as a whole at no charge to all third 101 | parties under the terms of this License. 102 | 103 | c) If the modified program normally reads commands interactively 104 | when run, you must cause it, when started running for such 105 | interactive use in the most ordinary way, to print or display an 106 | announcement including an appropriate copyright notice and a 107 | notice that there is no warranty (or else, saying that you provide 108 | a warranty) and that users may redistribute the program under 109 | these conditions, and telling the user how to view a copy of this 110 | License. (Exception: if the Program itself is interactive but 111 | does not normally print such an announcement, your work based on 112 | the Program is not required to print an announcement.) 113 | 114 | These requirements apply to the modified work as a whole. If 115 | identifiable sections of that work are not derived from the Program, 116 | and can be reasonably considered independent and separate works in 117 | themselves, then this License, and its terms, do not apply to those 118 | sections when you distribute them as separate works. But when you 119 | distribute the same sections as part of a whole which is a work based 120 | on the Program, the distribution of the whole must be on the terms of 121 | this License, whose permissions for other licensees extend to the 122 | entire whole, and thus to each and every part regardless of who wrote it. 123 | 124 | Thus, it is not the intent of this section to claim rights or contest 125 | your rights to work written entirely by you; rather, the intent is to 126 | exercise the right to control the distribution of derivative or 127 | collective works based on the Program. 128 | 129 | In addition, mere aggregation of another work not based on the Program 130 | with the Program (or with a work based on the Program) on a volume of 131 | a storage or distribution medium does not bring the other work under 132 | the scope of this License. 133 | 134 | 3. You may copy and distribute the Program (or a work based on it, 135 | under Section 2) in object code or executable form under the terms of 136 | Sections 1 and 2 above provided that you also do one of the following: 137 | 138 | a) Accompany it with the complete corresponding machine-readable 139 | source code, which must be distributed under the terms of Sections 140 | 1 and 2 above on a medium customarily used for software interchange; or, 141 | 142 | b) Accompany it with a written offer, valid for at least three 143 | years, to give any third party, for a charge no more than your 144 | cost of physically performing source distribution, a complete 145 | machine-readable copy of the corresponding source code, to be 146 | distributed under the terms of Sections 1 and 2 above on a medium 147 | customarily used for software interchange; or, 148 | 149 | c) Accompany it with the information you received as to the offer 150 | to distribute corresponding source code. (This alternative is 151 | allowed only for noncommercial distribution and only if you 152 | received the program in object code or executable form with such 153 | an offer, in accord with Subsection b above.) 154 | 155 | The source code for a work means the preferred form of the work for 156 | making modifications to it. For an executable work, complete source 157 | code means all the source code for all modules it contains, plus any 158 | associated interface definition files, plus the scripts used to 159 | control compilation and installation of the executable. However, as a 160 | special exception, the source code distributed need not include 161 | anything that is normally distributed (in either source or binary 162 | form) with the major components (compiler, kernel, and so on) of the 163 | operating system on which the executable runs, unless that component 164 | itself accompanies the executable. 165 | 166 | If distribution of executable or object code is made by offering 167 | access to copy from a designated place, then offering equivalent 168 | access to copy the source code from the same place counts as 169 | distribution of the source code, even though third parties are not 170 | compelled to copy the source along with the object code. 171 | 172 | 4. You may not copy, modify, sublicense, or distribute the Program 173 | except as expressly provided under this License. Any attempt 174 | otherwise to copy, modify, sublicense or distribute the Program is 175 | void, and will automatically terminate your rights under this License. 176 | However, parties who have received copies, or rights, from you under 177 | this License will not have their licenses terminated so long as such 178 | parties remain in full compliance. 179 | 180 | 5. You are not required to accept this License, since you have not 181 | signed it. However, nothing else grants you permission to modify or 182 | distribute the Program or its derivative works. These actions are 183 | prohibited by law if you do not accept this License. Therefore, by 184 | modifying or distributing the Program (or any work based on the 185 | Program), you indicate your acceptance of this License to do so, and 186 | all its terms and conditions for copying, distributing or modifying 187 | the Program or works based on it. 188 | 189 | 6. Each time you redistribute the Program (or any work based on the 190 | Program), the recipient automatically receives a license from the 191 | original licensor to copy, distribute or modify the Program subject to 192 | these terms and conditions. You may not impose any further 193 | restrictions on the recipients' exercise of the rights granted herein. 194 | You are not responsible for enforcing compliance by third parties to 195 | this License. 196 | 197 | 7. If, as a consequence of a court judgment or allegation of patent 198 | infringement or for any other reason (not limited to patent issues), 199 | conditions are imposed on you (whether by court order, agreement or 200 | otherwise) that contradict the conditions of this License, they do not 201 | excuse you from the conditions of this License. If you cannot 202 | distribute so as to satisfy simultaneously your obligations under this 203 | License and any other pertinent obligations, then as a consequence you 204 | may not distribute the Program at all. For example, if a patent 205 | license would not permit royalty-free redistribution of the Program by 206 | all those who receive copies directly or indirectly through you, then 207 | the only way you could satisfy both it and this License would be to 208 | refrain entirely from distribution of the Program. 209 | 210 | If any portion of this section is held invalid or unenforceable under 211 | any particular circumstance, the balance of the section is intended to 212 | apply and the section as a whole is intended to apply in other 213 | circumstances. 214 | 215 | It is not the purpose of this section to induce you to infringe any 216 | patents or other property right claims or to contest validity of any 217 | such claims; this section has the sole purpose of protecting the 218 | integrity of the free software distribution system, which is 219 | implemented by public license practices. Many people have made 220 | generous contributions to the wide range of software distributed 221 | through that system in reliance on consistent application of that 222 | system; it is up to the author/donor to decide if he or she is willing 223 | to distribute software through any other system and a licensee cannot 224 | impose that choice. 225 | 226 | This section is intended to make thoroughly clear what is believed to 227 | be a consequence of the rest of this License. 228 | 229 | 8. If the distribution and/or use of the Program is restricted in 230 | certain countries either by patents or by copyrighted interfaces, the 231 | original copyright holder who places the Program under this License 232 | may add an explicit geographical distribution limitation excluding 233 | those countries, so that distribution is permitted only in or among 234 | countries not thus excluded. In such case, this License incorporates 235 | the limitation as if written in the body of this License. 236 | 237 | 9. The Free Software Foundation may publish revised and/or new versions 238 | of the General Public License from time to time. Such new versions will 239 | be similar in spirit to the present version, but may differ in detail to 240 | address new problems or concerns. 241 | 242 | Each version is given a distinguishing version number. If the Program 243 | specifies a version number of this License which applies to it and "any 244 | later version", you have the option of following the terms and conditions 245 | either of that version or of any later version published by the Free 246 | Software Foundation. If the Program does not specify a version number of 247 | this License, you may choose any version ever published by the Free Software 248 | Foundation. 249 | 250 | 10. If you wish to incorporate parts of the Program into other free 251 | programs whose distribution conditions are different, write to the author 252 | to ask for permission. For software which is copyrighted by the Free 253 | Software Foundation, write to the Free Software Foundation; we sometimes 254 | make exceptions for this. Our decision will be guided by the two goals 255 | of preserving the free status of all derivatives of our free software and 256 | of promoting the sharing and reuse of software generally. 257 | 258 | NO WARRANTY 259 | 260 | 11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY 261 | FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN 262 | OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES 263 | PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED 264 | OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF 265 | MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS 266 | TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE 267 | PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, 268 | REPAIR OR CORRECTION. 269 | 270 | 12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 271 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR 272 | REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, 273 | INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING 274 | OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED 275 | TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY 276 | YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER 277 | PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE 278 | POSSIBILITY OF SUCH DAMAGES. 279 | 280 | END OF TERMS AND CONDITIONS 281 | 282 | How to Apply These Terms to Your New Programs 283 | 284 | If you develop a new program, and you want it to be of the greatest 285 | possible use to the public, the best way to achieve this is to make it 286 | free software which everyone can redistribute and change under these terms. 287 | 288 | To do so, attach the following notices to the program. It is safest 289 | to attach them to the start of each source file to most effectively 290 | convey the exclusion of warranty; and each file should have at least 291 | the "copyright" line and a pointer to where the full notice is found. 292 | 293 | The XeLaTeX template for the degree papers of the Nanjing University, China. 中国南京大学学位论文XeLaTeX模板。 294 | Copyright (C) 2013 Haixing Hu 295 | 296 | This program is free software; you can redistribute it and/or modify 297 | it under the terms of the GNU General Public License as published by 298 | the Free Software Foundation; either version 2 of the License, or 299 | (at your option) any later version. 300 | 301 | This program is distributed in the hope that it will be useful, 302 | but WITHOUT ANY WARRANTY; without even the implied warranty of 303 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 304 | GNU General Public License for more details. 305 | 306 | You should have received a copy of the GNU General Public License along 307 | with this program; if not, write to the Free Software Foundation, Inc., 308 | 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. 309 | 310 | Also add information on how to contact you by electronic and paper mail. 311 | 312 | If the program is interactive, make it output a short notice like this 313 | when it starts in an interactive mode: 314 | 315 | Gnomovision version 69, Copyright (C) year name of author 316 | Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 317 | This is free software, and you are welcome to redistribute it 318 | under certain conditions; type `show c' for details. 319 | 320 | The hypothetical commands `show w' and `show c' should show the appropriate 321 | parts of the General Public License. Of course, the commands you use may 322 | be called something other than `show w' and `show c'; they could even be 323 | mouse-clicks or menu items--whatever suits your program. 324 | 325 | You should also get your employer (if you work as a programmer) or your 326 | school, if any, to sign a "copyright disclaimer" for the program, if 327 | necessary. Here is a sample; alter the names: 328 | 329 | Yoyodyne, Inc., hereby disclaims all copyright interest in the program 330 | `Gnomovision' (which makes passes at compilers) written by James Hacker. 331 | 332 | {signature of Ty Coon}, 1 April 1989 333 | Ty Coon, President of Vice 334 | 335 | This General Public License does not permit incorporating your program into 336 | proprietary programs. If your program is a subroutine library, you may 337 | consider it more useful to permit linking proprietary applications with the 338 | library. If this is what you want to do, use the GNU Lesser General 339 | Public License instead of this License. 340 | -------------------------------------------------------------------------------- /Makefile: -------------------------------------------------------------------------------- 1 | ############################################################################### 2 | # 3 | # Makefile for jnuthesis 4 | # 5 | # Copyright (C) 2013-2015 Haixing Hu, 6 | # Department of Computer Science and Technology, Nanjing University. 7 | # 8 | # Home Page of the Project: http://haixing-hu.github.io/nju-thesis/ 9 | # 10 | ############################################################################### 11 | 12 | PACKAGE=jnuthesis 13 | BST_FILE=gbt7714-2005-jnu.bst 14 | BST_URL=https://raw.githubusercontent.com/Haixing-Hu/GBT7714-2005-BibTeX-Style/master/gbt7714-2005.bst 15 | SOURCES=$(PACKAGE).dtx $(PACKAGE).ins 16 | CLS=$(PACKAGE).cls $(PACKAGE).cfg dtx-style.sty dtklogos.sty 17 | SAMPLE_D=phd 18 | SAMPLE_M=master 19 | SAMPLE_MB=master-blind 20 | SAMPLE_MP=master-p 21 | SAMPLE_MPB=master-p-blind 22 | SAMPLE_B=bachelor 23 | SAMPLE_BC=bachelor-coursework 24 | SAMPLE_BD=bachelor-design 25 | SAMPLE_BR=bachelor-related 26 | SAMPLEBIB_D=$(SAMPLE_D).bib 27 | SAMPLEBIB_M=$(SAMPLE_M).bib 28 | SAMPLEBIB_MB=$(SAMPLE_M).bib 29 | SAMPLEBIB_MP=$(SAMPLE_M).bib 30 | SAMPLEBIB_MPB=$(SAMPLE_M).bib 31 | SAMPLEBIB_B=$(SAMPLE_B).bib 32 | PREAMBLE_M=$(SAMPLE_M)-preamble 33 | CONTENTS_M=$(SAMPLE_M)-contents 34 | COMMON_B=$(SAMPLE_B)-common 35 | INSTITUTE_NAME=jnuname.eps jnuname.pdf 36 | TEXMFLOCAL=$(shell get_texmf_dir.sh) 37 | 38 | .PHONY: all clean cls doc phd master masterblind masterpro masterproblind bachelor bachelorcoursework bachelordesign bachelorrelated 39 | 40 | all: bst cls doc phd master masterblind masterpro masterproblind bachelor bachelorcoursework bachelordesign bachelorrelated 41 | 42 | ###### update bst file 43 | bst: $(BST_FILE) 44 | 45 | $(BST_FILE): 46 | curl $(BST_URL) -o $(BST_FILE) 47 | 48 | ###### generate cls/cfg 49 | cls: $(CLS) 50 | 51 | $(CLS): $(SOURCES) 52 | latex $(PACKAGE).ins 53 | 54 | ###### generate doc 55 | 56 | doc: $(PACKAGE).pdf 57 | 58 | $(PACKAGE).pdf: $(CLS) 59 | xelatex $(PACKAGE).dtx 60 | makeindex -s gind.ist -o $(PACKAGE).ind $(PACKAGE).idx 61 | xelatex $(PACKAGE).dtx 62 | xelatex $(PACKAGE).dtx 63 | 64 | ###### for sample 65 | 66 | phd: $(SAMPLE_D).pdf 67 | 68 | $(SAMPLE_D).pdf: $(CLS) $(INSTITUTE_NAME) $(BST_FILE) $(SAMPLE_D).tex $(SAMPLEBIB_D) 69 | xelatex $(SAMPLE_D).tex 70 | bibtex $(SAMPLE_D) 71 | xelatex $(SAMPLE_D).tex 72 | xelatex $(SAMPLE_D).tex 73 | 74 | 75 | master: $(SAMPLE_M).pdf 76 | 77 | $(SAMPLE_M).pdf: $(CLS) $(INSTITUTE_NAME) $(BST_FILE) $(SAMPLE_M).tex $(PREAMBLE_M).tex $(CONTENTS_M).tex $(SAMPLEBIB_M) 78 | xelatex $(SAMPLE_M).tex 79 | bibtex $(SAMPLE_M) 80 | xelatex $(SAMPLE_M).tex 81 | xelatex $(SAMPLE_M).tex 82 | 83 | 84 | masterblind: $(SAMPLE_MB).pdf 85 | 86 | $(SAMPLE_MB).pdf: $(CLS) $(INSTITUTE_NAME) $(BST_FILE) $(SAMPLE_MB).tex $(PREAMBLE_M).tex $(CONTENTS_M).tex $(SAMPLEBIB_MB) 87 | xelatex $(SAMPLE_MB).tex 88 | bibtex $(SAMPLE_MB) 89 | xelatex $(SAMPLE_MB).tex 90 | xelatex $(SAMPLE_MB).tex 91 | 92 | 93 | masterpro: $(SAMPLE_MP).pdf 94 | 95 | $(SAMPLE_MP).pdf: $(CLS) $(INSTITUTE_NAME) $(BST_FILE) $(SAMPLE_MP).tex $(PREAMBLE_M).tex $(CONTENTS_M).tex $(SAMPLEBIB_MP) 96 | xelatex $(SAMPLE_MP).tex 97 | bibtex $(SAMPLE_MP) 98 | xelatex $(SAMPLE_MP).tex 99 | xelatex $(SAMPLE_MP).tex 100 | 101 | 102 | masterproblind: $(SAMPLE_MPB).pdf 103 | 104 | $(SAMPLE_MPB).pdf: $(CLS) $(INSTITUTE_NAME) $(BST_FILE) $(SAMPLE_MPB).tex $(PREAMBLE_M).tex $(CONTENTS_M).tex $(SAMPLEBIB_MP) 105 | xelatex $(SAMPLE_MPB).tex 106 | bibtex $(SAMPLE_MPB) 107 | xelatex $(SAMPLE_MPB).tex 108 | xelatex $(SAMPLE_MPB).tex 109 | 110 | 111 | bachelor: $(SAMPLE_B).pdf 112 | 113 | $(SAMPLE_B).pdf: $(CLS) $(INSTITUTE_NAME) $(BST_FILE) $(SAMPLE_B).tex $(COMMON_B).tex $(SAMPLEBIB_B) 114 | xelatex $(SAMPLE_B).tex 115 | bibtex $(SAMPLE_B) 116 | xelatex $(SAMPLE_B).tex 117 | xelatex $(SAMPLE_B).tex 118 | 119 | 120 | bachelorcoursework: $(SAMPLE_BC).pdf 121 | 122 | $(SAMPLE_BC).pdf: $(CLS) $(INSTITUTE_NAME) $(BST_FILE) $(SAMPLE_BC).tex $(COMMON_B).tex $(SAMPLEBIB_B) 123 | xelatex $(SAMPLE_BC).tex 124 | bibtex $(SAMPLE_B) 125 | xelatex $(SAMPLE_BC).tex 126 | xelatex $(SAMPLE_BC).tex 127 | 128 | 129 | bachelordesign: $(SAMPLE_BD).pdf 130 | 131 | $(SAMPLE_BD).pdf: $(CLS) $(INSTITUTE_NAME) $(BST_FILE) $(SAMPLE_BD).tex $(COMMON_B).tex $(SAMPLEBIB_B) 132 | xelatex $(SAMPLE_BD).tex 133 | bibtex $(SAMPLE_B) 134 | xelatex $(SAMPLE_BD).tex 135 | xelatex $(SAMPLE_BD).tex 136 | 137 | 138 | bachelorrelated: $(SAMPLE_BR).pdf 139 | 140 | $(SAMPLE_BR).pdf: $(CLS) $(INSTITUTE_NAME) $(BST_FILE) $(SAMPLE_BR).tex 141 | xelatex $(SAMPLE_BR).tex 142 | xelatex $(SAMPLE_BR).tex 143 | xelatex $(SAMPLE_BR).tex 144 | 145 | 146 | ###### install 147 | 148 | install: $(SOURCE) $(CLS) $(INSTITUTE_NAME) $(BST_FILE) $(PACKAGE).pdf $(SAMPLE_D).pdf $(SAMPLE_M).pdf $(SAMPLE_MB).pdf $(SAMPLE_B).pdf 149 | mkdir -p $(TEXMFLOCAL)/tex/latex/jnuthesis 150 | cp -rvf $(SOURCES) $(CLS) $(INSTITUTE_NAME) $(TEXMFLOCAL)/tex/latex/jnuthesis/ 151 | mkdir -p $(TEXMFLOCAL)/doc/latex/jnuthesis 152 | cp -rvf $(PACKAGE).pdf $(SAMPLE_D).pdf $(SAMPLE_M).pdf $(SAMPLE_MB).pdf $(SAMPLE_B).pdf $(TEXMFLOCAL)/doc/latex/jnuthesis/ 153 | mkdir -p $(TEXMFLOCAL)/bibtex/bst 154 | cp -rvf $(BST_FILE) $(TEXMFLOCAL)/bibtex/bst/ 155 | texhash 156 | 157 | ###### clean 158 | 159 | clean: 160 | -@rm -f \ 161 | *.aux \ 162 | *.bak \ 163 | *.bbl \ 164 | *.blg \ 165 | *.dvi \ 166 | *.glo \ 167 | *.gls \ 168 | *.idx \ 169 | *.ilg \ 170 | *.ind \ 171 | *.ist \ 172 | *.log \ 173 | *.out \ 174 | *.ps \ 175 | *.thm \ 176 | *.toc \ 177 | *.lof \ 178 | *.lot \ 179 | *.loe \ 180 | *.cfg \ 181 | *.cls \ 182 | dtx-style.sty 183 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # JNU-Thesis 2 | 3 | **注意：本模板虽基本完工，仍可能存在样式问题。请提出您发现的排版问题，欢迎 PR！** 4 | 5 | 本项目提供了一个用于排版江南大学学位论文的XeLaTeX模板。本项目乃[南京大学学位论文模板 NJU-Thesis][njuthesis] 的移植。 6 | 7 | [njuthesis]: https://github.com/Haixing-Hu/nju-thesis 8 | 9 | 目前该模板支持排版学士和硕士（学术型与专业型）的学位论文。 10 | 11 | 虽然该模板主要用于排版江南大学的学位论文，但亦可经过简单的设置或修改用于排版国内其他大学的学位论文。 12 | 13 | ## 功能特色 14 | 15 | * 支持多种江南大学学位论文及相关材料的生成： 16 | - 学术型硕士： 17 | - 学位论文：`master` 选项 18 | - 盲审版论文：`master,blindreview` 选项 19 | - 专业型硕士： 20 | - 学位论文：`master,prodegree` 选项 21 | - 盲审版论文：`master,prodegree,blindreview` 选项 22 | - 学士： 23 | - 学位论文：`bachelor` 选项 24 | - 毕业设计：`bachelordesign` 选项，除“摘要”变为“设计总说明”之外与 `bachelor` 完全相同 25 | - 相关资料，外文资料翻译：详见 [`bachelor-related.tex`](./bachelor-related.tex) 26 | - 本科课程设计：`bachelorcoursework`选项，详见 [`bachelor-coursework.tex`](./bachelor-coursework.tex) 27 | * 使用XeLaTeX作为排版引擎，论文源码需要使用UTF-8编码； 28 | * 支持使用思源系列字体（`sourcefonts`选项）进行排版； 29 | * 自动生成中文封面、中文摘要页、英文摘要页、独创性声明页等必需页面； 30 | * 支持硕博学位论文终稿提交前替换独创性声明页，具体方法见下； 31 | * 支持自动替换所有中文句号为英文句点，方便理工科论文排版：`replaceperiod` 选项。 32 | 33 | ## 注意事项 34 | 35 | ### 关于目录排版 36 | 37 | 不要让任何一级章节编号超过个位数，比如10章或者10节。实际上，良好的文章组织以及篇幅要求的存在，一般情况下不需要担心该情况发生；但以防万一。 38 | 39 | 由于宏包对目录排版的内部设置原因，实现如同Word模板一般的“章节编号与名称之间空一个半角空格”的效果较为困难，实际上该效果是以计算章节编号均为个位数情况下编号的最大长度模拟的。这意味着如果项目编号超长，该行编号与标题文字的间距即被破坏。 40 | 41 | 42 | ### 关于字体要求与等宽字体 43 | 44 | **江南大学学位论文只能使用中易宋体与Times New Roman排版。** 实质上相当于本宏包唯一正确的字体选项为`winfonts`，`sourcefonts`等其他字体选项暂无用户尝试，请慎重使用。（这有可能使您不得不重新打印整份论文，造成经济损失；万一成功，请务必报告情况，以便我们更新此处提示！） 45 | 46 | **本科生注意：查重系统要求文字可正常复制。鉴于`winfonts`选项的已知问题（见“支持环境”一节），可用`sourcefonts`或`adobefonts`选项专门为查重系统编译。** 47 | 48 | 该规定意味着任何其他字体均不能使用，包括等宽字体，这对排版程序代码等内容十分不利。本宏包作者及多位使用者均面临过类似的情况，事实证明江南大学许多学院的字体要求没有谈判空间（见下）。因此，本宏包**默认设置使等宽字体与衬线字体相同，使所有`\texttt`等命令实质上无效，以减少您提交论文时的困扰**。 49 | 50 | 虽然行内代码引用（如变量名、类名、函数/方法调用等）的字体无解，但大段代码引用仍然有可能利用等宽字体。您可以**开启`figure`环境**，将代码置于其中，并在环境中 **设置`\forcedtt`（或`\textforcedtt`）** 以强制选择等宽字体。这样一来，老师会以为等宽排版的代码属于某种形式的截图，而无视字体要求。除了引用代码时要使用“图X-X”这种较为不爽的形式之外，能够使用等宽字体排版代码，应该也属于一种妥协了吧。 51 | 52 | 53 | 确定正文不可使用其他字体的学院： 54 | 55 | * 物联网工程学院 56 | * 理学院 57 | * 数字媒体学院 58 | 59 | 60 | 确定正文可少量使用其他字体的学院： 61 | 62 | * 法学院（直接引语等情况） 63 | 64 | 65 | ### 硕博学位论文：替换独创性声明页 66 | 67 | 所有答辩流程结束之后，需要上传包含已签字独创性声明页面的终稿到系统中。为方便该需求，本宏包内置了相应支持，请按以下方法操作： 68 | 69 | * 论文撰写时：使用 `\makeoriginalitypage` 命令生成独创性声明模板页； 70 | * 答辩结束，准备提交终稿时：**单独打印**一页独创性声明模板页（重要！之后需要扫描或拍照后处理，胶装之后的页面就不方便了），按照要求与胶装版内的独创性声明一起签字； 71 | * 制作待插入图片： 72 | - 使用扫描仪：直接使用输出图片； 73 | - 使用手机： 74 | - 尽量在良好光照下正对纸张拍照，尽量不要有阴影； 75 | - 将照片中纸张部分剪裁，宽高比固定为210:297（A4）。由于打印机像素密度较高，一般为300 dpi往上，建议保留区域大小至少为2480x3507（300 dpi）； 76 | - 用“阈值”等滤镜将图像二值化，缩小体积且方便打印； 77 | - 推荐保存为PNG格式，由于处理后图像为黑白且大片空白，JPEG的压缩算法既引起压缩噪点，又空间占用较大。 78 | * 最后修改 `\makeoriginalitypage` 为 `\makeoriginalitypage{图片相对路径}`。 79 | 80 | 如此即可直接生成符合要求的终稿PDF文档，不必手工完成PDF页面的分离、合并等操作了。 81 | 82 | 83 | ## 支持环境 84 | 85 | 以下环境测试支持： 86 | 87 | * 操作系统 88 | - Linux 89 | - macOS 90 | - Windows 91 | * TeX 发行版 92 | - TeXLive 93 | * 字体选项 94 | - `sourcefonts` 95 | - `adobefonts` 96 | 97 | 以下环境存在已知问题： 98 | 99 | * TeXLive 2016，`winfonts` 选项：PDF 内文字复制粘贴乱码 100 | * （或已修复）macOS，MacTeX BasicTeX：校名 logo 缺失。请使用完整 MacTeX 安装 101 | 102 | 103 | ## TODO 104 | 105 | * 更多论文封面 106 | - 专业学位（在职）学位 107 | - 同等学力硕士学位 108 | - 高校教师硕士学位 109 | -------------------------------------------------------------------------------- /TODO: -------------------------------------------------------------------------------- 1 | 1. 中文化 hyperref 提供的 \autoref，\autopageref 等命令 2 | 2. 撰写 njuthesis 用户手册 -------------------------------------------------------------------------------- /bachelor-common.tex: -------------------------------------------------------------------------------- 1 | %% 使用 jnuthesis 文档类生成南京大学学位论文的示例文档 2 | %% 3 | %% 作者：胡海星，starfish (at) gmail (dot) com 4 | %% 项目主页: http://haixing-hu.github.io/jnu-thesis/ 5 | %% 6 | %% 本样例文档中用到了吕琦同学的博士论文的提高和部分内容，在此对他表示感谢。 7 | %% 8 | 9 | %% jnuthesis 文档类的可选参数有： 10 | %% nobackinfo 取消封二页导师签名信息。注意，按照南大的规定，是需要签名页的。 11 | %% phd/master/bachelor 选择博士/硕士/学士论文 12 | 13 | % 使用 blindtext 宏包自动生成章节文字 14 | % 这仅仅是用于生成样例文档，正式论文中一般用不到该宏包 15 | \usepackage[math]{blindtext} 16 | 17 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 18 | % 设置论文的中文封面 19 | 20 | % 如果论文标题过长，可以分两行，第一行用\titlea{}定义，第二行用\titleb{}定义，将上面的\title{}注释掉 21 | \titlea{半轻衰变$D^+\to \omega(\phi)e^+\nu_e$的研究} 22 | \titleb{和弱衰变$J/\psi \to D_s^{(*)-}e^+\nu_e$的寻找} 23 | 24 | % 论文作者姓名 25 | \author{韦小宝} 26 | % 论文作者学生证号 27 | \studentnum{1234567890} 28 | % 导师姓名职称 29 | \supervisor{陈近南} 30 | \supervisorpos{教授} 31 | % 第二行导师姓名职称，仿照第一行填写，没有则留空 32 | \supervisorb{} 33 | \supervisorbpos{} 34 | % 论文作者的学科与专业方向 35 | \major{数字媒体技术} 36 | % 论文作者所在院系的中文名称，学士学位论文此处不带“学院”二字 37 | \department{数字媒体} 38 | % 论文作者所在学校或机构的名称。此属性可选，默认值为``江南大学''。 39 | \institute{江南大学} 40 | % 学士学位获得日期，需设置年、月，默认为编译日期。 41 | %\bachelordegreeyear{2017} 42 | %\bachelordegreemonth{6} 43 | 44 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 45 | \begin{document} 46 | 47 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 48 | 49 | % 制作中文封面 50 | \maketitle 51 | 52 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 53 | % 开始前言部分 54 | \frontmatter 55 | 56 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 57 | % 论文的中文摘要 58 | \begin{abstract} 59 | 复杂网络的研究可上溯到20世纪60年代对ER网络的研究。90年后代随着Internet 60 | 的发展，以及对人类社会、通信网络、生物网络、社交网络等各领域研究的深入， 61 | 发现了小世界网络和无尺度现象等普适现象与方法。对复杂网络的定性定量的科 62 | 学理解和分析，已成为如今网络时代科学研究的一个重点课题。 63 | 64 | 在此背景下，由于云计算时代的到来，本文针对面向云计算的数据中心网络基础 65 | 设施设计中的若干问题，进行了几方面的研究。……………… 66 | % 中文关键词。关键词之间用中文全角分号隔开，末尾无标点符号。 67 | \keywords{小世界理论；网络模型；数据中心} 68 | \end{abstract} 69 | 70 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 71 | % 论文的英文摘要 72 | \begin{englishabstract} 73 | \blindtext 74 | % 英文关键词。关键词之间用英文半角逗号隔开，末尾无符号。 75 | \englishkeywords{Small World, Network Model, Data Center} 76 | \end{englishabstract} 77 | 78 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 79 | % 生成论文目次 80 | \tableofcontents 81 | 82 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 83 | % 开始正文部分 84 | \mainmatter 85 | 86 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 87 | % 学位论文的正文应以《绪论》作为第一章 88 | \chapter{绪论}\label{chapter_introduction} 89 | \section{研究背景} 90 | 91 | 在分布式网络领域，沿着高性能集群、普世计算、网格计算的方向，现已走入云 92 | 计算时代。 93 | 94 | 云计算对信息技术架构造成了越来越大的影响。例如，借助Amazon EC2云平台， 95 | 用户借助其基础设施，可以十分方便的部署各类应用，以支持企业服务需求。用 96 | 户可以按需购买计算资源，网络带宽，存储空间等各类资源以支持他们的业务需 97 | 求，并在业务完成之后迅速的归还这些资源。通过云技术，用户可以集中在他们 98 | 擅长的核心业务之中，而不会被诸如硬件购买、安装系统、网络设置、备份和安 99 | 全等等问题干扰。 100 | 101 | 与此同时，随着计算机的普及化和微型化，现在的手持设备拥有不输于7年前台式 102 | 机的处理能力。在网络时代面前，智能终端广泛普及，每个人都可成为信息源。 103 | 在信息爆炸的时代，数据挖掘、机器学习、金融分析和模拟等行业中不断涌现新 104 | 的需求，诸如针对用户行为和社会关系的挖掘进行广告精准投放，用户行为预测 105 | 等。为了支撑PB级尺度的数据规模，需要海量的计算节点，催生并不断促进了各 106 | 行各业对云计算基础设施的建设需求。 107 | 108 | 海量的数据需要海量的处理能力，然而海量的处理能力又需要高带宽的网络IO为 109 | 承载。作为云环境中最基础的一环，IaaS层在网络、存储、计算资源的分割这几 110 | 方面，承担起整个系统的基石。虽然并非必须，但一般来说，为考虑沙盘环境， 111 | 以及对资源的细粒度切割分配，IaaS通常会伴随着虚拟化技术的运用。虚拟化具 112 | 有许多与云计算切合的特点，例如，虚拟化可以屏蔽物理环境的差异，可在多物 113 | 理节点中进行无缝迁移，可对系统进行快照和还原。这些特点都与云计算时代所 114 | 追求的灵活性、高伸缩性、快速响应等特点而吻合。 115 | 116 | 在虚拟化实现方面，目前已取得了诸如ESXi，Xen，KVM等成熟成果。然而当虚拟 117 | 化扩大的一定规模，随着节点数目的增多，在网络方面将会面临一系列取舍的问 118 | 题。例如，基于二层交换的扁平网络，当节点数目上升到千数量级时，广播报文 119 | 将会极大的拖累网络性能，必须通过划分子网，通过三层路由等形式重新规划为 120 | 多层网络结构；另一方面，除了联通之外，还需要考虑ACL控制，负载均衡，外网 121 | 通讯等各类防火墙以及NAT规则的实现。这些复杂的网络配置，在一定程度上抵消 122 | 了虚拟机带来的灵活性。例如虽然虚拟机可根据需要动态迁移，但在迁移之后， 123 | 由于网络位置的变化需要重新进行网络参数配置。虽然虚拟机在迁移过程中系统 124 | 内部状态没有变化，但站在网络角度看，该虚拟节点跟关机重启没有区别。 125 | 126 | 针对上述问题，本文站在面向云计算时代的数据中心网络建设的角度，对网络模 127 | 型进行深入研究和探讨。通过改善二层交换网络的ARP机制来解决广播风暴问题， 128 | 引入比树形网络更为复杂的复杂网络理论，指导网络节点的互联模型。从而将网 129 | 络的复杂性隐藏在节点环境之外，在节点层面仅提供简单但巨大的二层交换扁平 130 | 网络。 131 | 132 | \section{研究目的与意义} 133 | \subsection{现有解决方法} 134 | \Blindtext 135 | \begin{table} 136 | \centering 137 | \begin{tabular}{cccp{38mm}} 138 | \toprule 139 | \textbf{文档域类型} & \textbf{Java类型} & \textbf{宽度(字节)} & \textbf{说明} \\ 140 | \midrule 141 | BOOLEAN & boolean & 1 & \\ 142 | CHAR & char & 2 & UTF-16字符 \\ 143 | BYTE & byte & 1 & 有符号8位整数 \\ 144 | SHORT & short & 2 & 有符号16位整数 \\ 145 | INT & int & 4 & 有符号32位整数 \\ 146 | LONG & long & 8 & 有符号64位整数 \\ 147 | STRING & String & 字符串长度 & 以UTF-8编码存储 \\ 148 | DATE & java.util.Date & 8 & 距离GMT时间1970年1月1日0点0分0秒的毫秒数 \\ 149 | BYTE\_ARRAY & byte$[]$ & 数组长度 & 用于存储二进制值 \\ 150 | BIG\_INTEGER & java.math.BigInteger & 和具体值有关 & 任意精度的长整数 \\ 151 | BIG\_DECIMAL & java.math.BigDecimal & 和具体值有关 & 任意精度的十进制实数 \\ 152 | \bottomrule 153 | \end{tabular} 154 | \caption{测试表格}\label{table:test1} 155 | \end{table} 156 | \Blindtext 157 | \subsection{现有问题与不足} 158 | 159 | 测试一下脚注\footnote{测试脚注}，测试一下脚注\footnote{测试脚注}，测试一下脚 160 | 注\footnote{测试脚注}，测试一下脚注\footnote{测试脚注}，测试一下脚注\footnote{测 161 | 试脚注}，测试一下脚注\footnote{测试脚注}，测试一下脚注\footnote{测试脚注}，测 162 | 试一下脚注\footnote{测试脚注}，测试一下脚注\footnote{测试脚注}，测试一下脚 163 | 注\footnote{测试脚注}。 164 | 165 | 测试一下引用\cite{newman2006structure}，连续引用 166 | \cite{newman2001random,aiello2000random,bollobas2001random}，另一个连续引用 167 | \cite{newman2001random,bollobas2001random,barabasi1999emergence}。测试一下带页码 168 | 的引用\cite[124--128]{erdHos1961strength}。 169 | 170 | 下面是一个项目列表： 171 | 172 | \begin{itemize} 173 | \item 这是第一项。这是第一项。 174 | \item 这是第二项。这是第二项。这是第二项。这是第二项。这是第二项。这是第二项。这 175 | 是第二项。这是第二项。这是第二项。这是第二项。这是第二项。 176 | \item 这是第三项。这是第三项。这是第三项。 177 | \begin{itemize} 178 | \item 测试第二层列表。测试第二层列表。 179 | \item 测试第二层列表。测试第二层列表。 180 | \begin{itemize} 181 | \item 测试第三层列表。测试第三层列表。 182 | \item 测试第三层列表。测试第三层列表。 183 | \end{itemize} 184 | \item 测试第二层列表。测试第二层列表。测试第二层列表。测试第二层列表。测试第二 185 | 层列表。 186 | \end{itemize} 187 | \item 这是第四项。这是第四项。这是第四项。 188 | \begin{enumerate} 189 | \item 测试第二层列表。测试第二层列表。测试第二层列表。测试第二层列表。测试第二 190 | 层列表。测试第二层列表。测试第二层列表。测试第二层列表。 191 | \item 测试第二层列表。测试第二层列表。 192 | \item 测试第二层列表。测试第二层列表。测试第二层列表。测试第二层列表。测试第二 193 | 层列表。 194 | \end{enumerate} 195 | \end{itemize} 196 | 197 | 下面是一个编号列表： 198 | 199 | \begin{enumerate} 200 | \item 这是第一项。这是第一项。这是第一项。这是第一项。这是第一项。这是第一项。这 201 | 是第一项。这是第一项。这是第一项。这是第一项。这是第一项。 202 | \item 这是第二项。这是第二项。 203 | \item 这是第三项。这是第三项。这是第三项。 204 | \begin{itemize} 205 | \item 测试第二层列表。测试第二层列表。 206 | \item 测试第二层列表。测试第二层列表。 207 | \item 测试第二层列表。测试第二层列表。测试第二层列表。测试第二层列表。测试第二 208 | 层列表。 209 | \end{itemize} 210 | \item 这是第四项。这是第四项。这是第四项。 211 | \begin{enumerate} 212 | \item 测试第二层列表。测试第二层列表。 213 | \begin{enumerate} 214 | \item 测试第三层列表。测试第三层列表。测试第三层列表。测试第三层列表。测试第三 215 | 层列表。测试第三层列表。 216 | \item 测试第三层列表。测试第三层列表。 217 | \item 测试第三层列表。测试第三层列表。测试第三层列表。 218 | \end{enumerate} 219 | \item 测试第二层列表。测试第二层列表。测试第二层列表。 220 | \end{enumerate} 221 | \end{enumerate} 222 | 223 | 下面是最多三层的阿拉伯数字列表: 224 | \begin{arabicenum} 225 | \item 第1项 226 | \item 第2项 227 | \begin{arabicenum} 228 | \item 第2.1项 229 | \item 第2.2项 230 | \begin{arabicenum} 231 | \item 第2.2.1项 232 | \item 第2.2.2项 233 | \item 第2.2.3项 234 | \end{arabicenum} 235 | \item 第2.3项 236 | \end{arabicenum} 237 | \item 第3项 238 | \end{arabicenum} 239 | 240 | 下面是最多两层的罗马数字列表: 241 | \begin{romanenum} 242 | \item 第1项 243 | \item 第2项 244 | \begin{romanenum} 245 | \item 第2.1项 246 | \item 第2.2项 247 | \item 第2.3项 248 | \end{romanenum} 249 | \item 第3项 250 | \end{romanenum} 251 | 252 | 下面是最多两层的小写字母列表: 253 | \begin{alphaenum} 254 | \item 第1项 255 | \item 第2项 256 | \begin{alphaenum} 257 | \item 第2.1项 258 | \item 第2.2项 259 | \item 第2.3项 260 | \end{alphaenum} 261 | \item 第3项 262 | \end{alphaenum} 263 | 264 | 下面是最多两层的情况列表: 265 | \begin{caseenum} 266 | \item 第1项 267 | \item 第2项 268 | \begin{caseenum} 269 | \item 第2.1项 270 | \item 第2.2项 271 | \item 第2.3项 272 | \end{caseenum} 273 | \item 第3项 274 | \end{caseenum} 275 | 276 | 下面是最多两层的步骤列表: 277 | \begin{stepenum} 278 | \item 第1项 279 | \item 第2项 280 | \begin{stepenum} 281 | \item 第2.1项 282 | \item 第2.2项 283 | \item 第2.3项 284 | \end{stepenum} 285 | \item 第3项 286 | \end{stepenum} 287 | 288 | 下面测试一下引用环境|quote|。下面测试一下引用环境|quote|。下面测试一下引用环境|quote|。 289 | 下面测试一下引用环境|quote|。下面测试一下引用环境|quote|。下面测试一下引用环境|quote|。 290 | 下面测试一下引用环境|quote|。下面测试一下引用环境|quote|。下面测试一下引用环境|quote|。 291 | 292 | \begin{quote} 293 | 这是一段引用。这是一段引用。这是一段引用。这是一段引用。这是一段引用。这是一段引用。 294 | 这是一段引用。这是一段引用。这是一段引用。这是一段引用。这是一段引用。这是一段引用。 295 | 这是一段引用。这是一段引用。这是一段引用。这是一段引用。这是一段引用。 296 | 297 | 这是一段引用。这是一段引用。这是一段引用。这是一段引用。这是一段引用。这是一段引用。 298 | 这是一段引用。这是一段引用。这是一段引用。 299 | 300 | 这是一段引用。这是一段引用。 301 | \end{quote} 302 | 303 | 下面测试一下引用环境|quotation|。下面测试一下引用环境|quotation|。 304 | 下面测试一下引用环境|quotation|。下面测试一下引用环境|quotation|。 305 | 下面测试一下引用环境|quotation|。下面测试一下引用环境|quotation|。 306 | 下面测试一下引用环境|quotation|。下面测试一下引用环境|quotation|。 307 | 下面测试一下引用环境|quotation|。 308 | 309 | \begin{quotation} 310 | 这是一段引用。这是一段引用。这是一段引用。这是一段引用。这是一段引用。这是一段引用。 311 | 这是一段引用。这是一段引用。这是一段引用。这是一段引用。这是一段引用。这是一段引用。 312 | 这是一段引用。这是一段引用。这是一段引用。这是一段引用。这是一段引用。 313 | 314 | 这是一段引用。这是一段引用。这是一段引用。这是一段引用。这是一段引用。这是一段引用。 315 | 这是一段引用。这是一段引用。这是一段引用。 316 | 317 | 这是一段引用。这是一段引用。 318 | \end{quotation} 319 | 320 | 引用结束。引用结束。引用结束。引用结束。引用结束。引用结束。引用结束。引用结束。引用结束。 321 | 引用结束。引用结束。引用结束。 322 | 323 | 测试一下定理环境。 324 | 325 | \begin{theorem}[测试定理] 326 | 测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下 327 | 定理环境。测试一下定理环境。测试一下定理环境。 328 | \end{theorem} 329 | \begin{proof} 330 | \blindtext 331 | \end{proof} 332 | 333 | \blindtext 334 | 335 | \begin{theorem} 336 | 测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下 337 | 定理环境。测试一下定理环境。测试一下定理环境。 338 | \end{theorem} 339 | \begin{proof} 340 | \blindtext 341 | \end{proof} 342 | 343 | \blindtext 344 | 345 | \begin{lemma} 346 | 测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下 347 | 定理环境。测试一下定理环境。测试一下定理环境。 348 | \end{lemma} 349 | \begin{proof} 350 | \blindtext 351 | \end{proof} 352 | 353 | \blindtext 354 | 355 | \begin{definition} 356 | 测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下 357 | 定理环境。测试一下定理环境。测试一下定理环境。 358 | \end{definition} 359 | 360 | \blindtext 361 | 362 | \begin{corollary} 363 | 测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下 364 | 定理环境。测试一下定理环境。测试一下定理环境。 365 | \end{corollary} 366 | 367 | \blindtext 368 | 369 | \begin{proposition} 370 | 测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下 371 | 定理环境。测试一下定理环境。测试一下定理环境。 372 | \end{proposition} 373 | 374 | \blindtext 375 | 376 | \begin{fact} 377 | 测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下 378 | 定理环境。测试一下定理环境。测试一下定理环境。 379 | \end{fact} 380 | 381 | \blindtext 382 | 383 | \begin{assumption} 384 | 测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下 385 | 定理环境。测试一下定理环境。测试一下定理环境。 386 | \end{assumption} 387 | 388 | \blindtext 389 | 390 | \begin{conjecture} 391 | 测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下 392 | 定理环境。测试一下定理环境。测试一下定理环境。 393 | \end{conjecture} 394 | 395 | \blindtext 396 | 397 | \begin{hypothesis} 398 | 测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下 399 | 定理环境。测试一下定理环境。测试一下定理环境。 400 | \end{hypothesis} 401 | 402 | \blindtext 403 | 404 | \begin{axiom} 405 | 测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下 406 | 定理环境。测试一下定理环境。测试一下定理环境。 407 | \end{axiom} 408 | 409 | \blindtext 410 | 411 | \begin{postulate} 412 | 测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下 413 | 定理环境。测试一下定理环境。测试一下定理环境。 414 | \end{postulate} 415 | 416 | \blindtext 417 | 418 | \begin{principle} 419 | 测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下 420 | 定理环境。测试一下定理环境。测试一下定理环境。 421 | \end{principle} 422 | 423 | \blindtext 424 | 425 | \begin{problem} 426 | 测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下 427 | 定理环境。测试一下定理环境。测试一下定理环境。 428 | \end{problem} 429 | \begin{solution} 430 | \blindtext 431 | \end{solution} 432 | 433 | \blindtext 434 | 435 | \begin{problem} 436 | 测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下 437 | 定理环境。测试一下定理环境。测试一下定理环境。 438 | \end{problem} 439 | \begin{solution} 440 | \blindtext 441 | \end{solution} 442 | 443 | \blindtext 444 | 445 | \begin{exercise} 446 | 测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下 447 | 定理环境。测试一下定理环境。测试一下定理环境。 448 | \end{exercise} 449 | 450 | \blindtext 451 | 452 | \begin{exercise} 453 | 测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下 454 | 定理环境。测试一下定理环境。测试一下定理环境。 455 | \end{exercise} 456 | 457 | \begin{algorithm} 458 | 测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下 459 | 定理环境。测试一下定理环境。测试一下定理环境。 460 | \end{algorithm} 461 | 462 | \subsection{中心观点与思想} 463 | 464 | 云计算在概念上通常被分为IaaS、PaaS、SaaS几个层面。但透过分类去理解其本 465 | 质，可认为是上世纪70年代基于大型计算机的中心控制型瘦客户端终端模式，在 466 | 如今技术水平上的一种新的表达，是在技术发展道路中，螺旋上升的结果。 467 | 468 | 与瘦客户端相比，云计算在设计结构上存在一定的相似性。 469 | 470 | \begin{enumerate} 471 | \item 中心控制的模式：通过中心的大规模硬件提供统一的计算，可大大降低管理成本，提 472 | 高硬件资源利用率，同时降低客户端的硬件成本需求。例如Nvidia推出Georce GRID平台 473 | \cite{NVIDIAGRID}，推出了GaaS\footnote{Gaming as a Service}概念。将 474 | GPU放置在云端，使得用户不需要再不断购买升级显卡，并可在更为广泛的终端（包括手机、 475 | 平板、智能电视）和地点体验最新的游戏。 476 | \item 数据集中：由于瘦客户端的关系，数据都集中存储在中心，可对数据提供 477 | 可靠的保护，并且通过按需调用的实现方式，降低对网络带宽的需求。 478 | \end{enumerate} 479 | 480 | 在设计思路上，两者都为了降低管理成本和硬件成本、以低能耗、高弹性等需求 481 | 为设计目标。随着技术的进步，云计算在具体实现形态上与传统的大型机也有很 482 | 大的不同： 483 | 484 | 一方面，云中心不再是传统的一台大型机，而是用大量廉价计算节点的互联来提 485 | 供海量资源。云计算更强调资源规模的无缝、平滑扩展，以及高可靠性，无单点 486 | 故障问题。另一方面，云计算时代的终端，也具备相当计算能力。随着web2.0的 487 | 整合，还有向胖客户端和智能终端发展的趋势。 488 | 489 | 总而言之，云计算在大框架中是传统的中心控制／终端的模式，但在中心与终端 490 | 两方面，都引入分布式技术加以改良。核心的思路是在低成本的前提下做到高可 491 | 靠性、高灵活性和高伸缩性。因此，云计算并不仅仅以数量换性能的表象，本质 492 | 上为低成本高性能，追求高能效比，并在实现层面讲究可实现性和可操作性。 493 | \subsection{需要解决的问题与挑战} 494 | 495 | 测试一下中文字体： 496 | 497 | {\songti\zihao{0} 宋体，初号} 498 | 499 | {\songti\zihao{-0} 宋体，小初} 500 | 501 | {\songti\zihao{1} 宋体，一号} 502 | 503 | {\songti\zihao{-1} 宋体，小一} 504 | 505 | {\songti\zihao{2} 宋体，二号} 506 | 507 | {\songti\zihao{-2} 宋体，小二} 508 | 509 | {\songti\zihao{3} 宋体，三号} 510 | 511 | {\songti\zihao{-3} 宋体，小三} 512 | 513 | {\songti\zihao{4} 宋体，四号} 514 | 515 | {\songti\zihao{-4} 宋体，小四} 516 | 517 | {\songti\zihao{5} 宋体，五号} 518 | 519 | {\songti\zihao{-5} 宋体，小五} 520 | 521 | {\songti\zihao{6} 宋体，六号} 522 | 523 | {\songti\zihao{-6} 宋体，小六} 524 | 525 | {\songti\zihao{7} 宋体，七号} 526 | 527 | {\songti\zihao{8} 宋体，八号} 528 | 529 | {\heiti\zihao{0} 黑体，初号} 530 | 531 | {\heiti\zihao{-0} 黑体，小初} 532 | 533 | {\heiti\zihao{1} 黑体，一号} 534 | 535 | {\heiti\zihao{-1} 黑体，小一} 536 | 537 | {\heiti\zihao{2} 黑体，二号} 538 | 539 | {\heiti\zihao{-2} 黑体，小二} 540 | 541 | {\heiti\zihao{3} 黑体，三号} 542 | 543 | {\heiti\zihao{-3} 黑体，小三} 544 | 545 | {\heiti\zihao{4} 黑体，四号} 546 | 547 | {\heiti\zihao{-4} 黑体，小四} 548 | 549 | {\heiti\zihao{5} 黑体，五号} 550 | 551 | {\heiti\zihao{-5} 黑体，小五} 552 | 553 | {\heiti\zihao{6} 黑体，六号} 554 | 555 | {\heiti\zihao{-6} 黑体，小六} 556 | 557 | {\heiti\zihao{7} 黑体，七号} 558 | 559 | {\heiti\zihao{8} 黑体，八号} 560 | 561 | {\kaishu\zihao{0} 楷书，初号} 562 | 563 | {\kaishu\zihao{-0} 楷书，小初} 564 | 565 | {\kaishu\zihao{1} 楷书，一号} 566 | 567 | {\kaishu\zihao{-1} 楷书，小一} 568 | 569 | {\kaishu\zihao{2} 楷书，二号} 570 | 571 | {\kaishu\zihao{-2} 楷书，小二} 572 | 573 | {\kaishu\zihao{3} 楷书，三号} 574 | 575 | {\kaishu\zihao{-3} 楷书，小三} 576 | 577 | {\kaishu\zihao{4} 楷书，四号} 578 | 579 | {\kaishu\zihao{-4} 楷书，小四} 580 | 581 | {\kaishu\zihao{5} 楷书，五号} 582 | 583 | {\kaishu\zihao{-5} 楷书，小五} 584 | 585 | {\kaishu\zihao{6} 楷书，六号} 586 | 587 | {\kaishu\zihao{-6} 楷书，小六} 588 | 589 | {\kaishu\zihao{7} 楷书，七号} 590 | 591 | {\kaishu\zihao{8} 楷书，八号} 592 | 593 | {\fangsong\zihao{0} 仿宋，初号} 594 | 595 | {\fangsong\zihao{-0} 仿宋，小初} 596 | 597 | {\fangsong\zihao{1} 仿宋，一号} 598 | 599 | {\fangsong\zihao{-1} 仿宋，小一} 600 | 601 | {\fangsong\zihao{2} 仿宋，二号} 602 | 603 | {\fangsong\zihao{-2} 仿宋，小二} 604 | 605 | {\fangsong\zihao{3} 仿宋，三号} 606 | 607 | {\fangsong\zihao{-3} 仿宋，小三} 608 | 609 | {\fangsong\zihao{4} 仿宋，四号} 610 | 611 | {\fangsong\zihao{-4} 仿宋，小四} 612 | 613 | {\fangsong\zihao{5} 仿宋，五号} 614 | 615 | {\fangsong\zihao{-5} 仿宋，小五} 616 | 617 | {\fangsong\zihao{6} 仿宋，六号} 618 | 619 | {\fangsong\zihao{-6} 仿宋，小六} 620 | 621 | {\fangsong\zihao{7} 仿宋，七号} 622 | 623 | {\fangsong\zihao{8} 仿宋，八号} 624 | 625 | 测试一下标准字号： 626 | 627 | {\Huge 汉字，Huge} 628 | 629 | {\huge 汉字，huge} 630 | 631 | {\LARGE 汉字，LARGE} 632 | 633 | {\Large 汉字，Large} 634 | 635 | {\large 汉字，large} 636 | 637 | {\normalsize 汉字，normalsize} 638 | 639 | {\small 汉字，small} 640 | 641 | {\footnotesize 汉字，footnotesize} 642 | 643 | {\scriptsize 汉字，scriptsize} 644 | 645 | {\tiny 汉字，tiny} 646 | 647 | 测试一下标准字体的变形： 648 | 649 | {\songti 宋体} {\heiti 黑体} {\kaishu 楷书} {\fangsong 仿宋} 650 | 651 | {\textsl{textsl字体}} 652 | 653 | {\bfseries bfseries字体} 654 | 655 | {\textbf{textbf字体}} 656 | 657 | {\textit{textit字体}} 658 | 659 | 测试一下数学公式中的字体大小。 660 | 661 | \newcommand{\set}[1]{\left\{\,#1\,\right\}} 662 | \newcommand{\card}[1]{\left|\,#1\,\right|} 663 | 664 | Fall-Out指标计算公式如下： 665 | \begin{equation*} 666 | \mbox{fallout} = \frac{\card{\set{\text{不相关文档}}\cap\set{\text{获取的文档}}}}{\card{\set{\text{不相关文档}}}} 667 | \end{equation*} 668 | 669 | \section{研究的应用背景} 670 | 云计算作为分布式技术的当前表现形式，通过将众多节点资源整合，以冗余、去 671 | 中心化的分布式模式，实现传统技术中需要大型机才能解决的海量信息问题。一 672 | 言而概之，“人多力量大”。 673 | 674 | 但随着节点数目的增多，问题的重点将逐步转换为如何对大量节点进行高效互联。图 675 | \ref{fig:test1}所示为传统IaaS云中心网络结构的一部分。通过BR边界路由器，AR接入路 676 | 由器构建数据中心的主干；核心交换机和接入交换机S，构成二层交换网络层，大量的服务 677 | 器节点通过二层交换机被最终接入整个网络。 678 | \begin{figure}[htbp] 679 | \centering 680 | \includegraphics[width= 0.5\textwidth]{jnuname}\\ 681 | \caption{测试插图}\label{fig:test1} 682 | \end{figure} 683 | 在上述传统网络中，当节点总数达到数千乃至万数量级时，上层链路的聚合带宽 684 | 将不断提高，从而对核心交换机、接入路由器、边界路由器的指标提出了极高的 685 | 要求。以至于少数核心网络设备，成为整个网络中的高价格、高性能单点。一方 686 | 面与原本追求低成本、分布化、去中心化的云技术设计理念背道而驰，另一方面 687 | 也降低了网络的健壮性。因而本文所做工作对数据中心的网络基础设施而言，具 688 | 有较大应用价值。 689 | \subsection{IaaS云中心} 690 | \Blindtext 691 | \subsection{PaaS云中心} 692 | \Blindtext 693 | \section{论文结构} 694 | \Blindtext 695 | 696 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 697 | \chapter{小世界网络模型}\label{chapter_smallworld} 698 | \section{小世界现象} 699 | 700 | 生活中，常出现初次见面的陌生人却拥有双方都认识的共同熟人，于是大家时常 701 | 会感叹：“这世界真小！”。这种现象被称为``小世界现象''，后又称为``六度 702 | 分割理论''。 703 | 704 | \begin{figure}[htbp] 705 | \centering 706 | \includegraphics[width= 0.5\textwidth]{jnuname}\\ 707 | \caption{测试插图}\label{fig:test2} 708 | \end{figure} 709 | 710 | 1909年，现代无线电之父Guglielmo Marconi在其诺贝尔奖致辞中讨论了覆盖整个地球所需 711 | 的无线电中继站数目，并根据他的实验结果计算出平均需要$5.83$（近似为$6$）个中继站 712 | \cite{marconi1909nobel}。这个结论，被认为是``六度分割理论''中的常数$6$的最早出处 713 | \cite{barabasi2003linked}。 714 | 715 | 1929年，匈牙利作家Frigyes Karinthy发表了一部短篇小说集《Everything is 716 | Different》。其中一篇名为《Chain-Links》的小说以抽象的、概念性的和虚 717 | 构的方式研究了网络理论领域的很多问题，而这些问题使得未来几代的数学家、 718 | 社会学家和物理学家都为之着迷\cite{newman2006structure, 719 | barabasi2003linked}。Karinthy认为，随着通讯技术和交通技术的发展，人际 720 | 关系网会变得越来越来大，扩张得越来越远，整个世界将因此而``缩小''。他认 721 | 为，虽然人类个体之间的物理距离可能很远，但人类社交网络密度的增加使得人 722 | 类个体之间的社会性距离变得非常小。根据这个假设，Karinthy的小说的主角相 723 | 信：``任何两个人之间可以通过不超过五个中间人相联系''。Karinthy的想法直 724 | 接或间接地影响了早期的社交网络理论的研究，他被认为是六度分隔(six 725 | degrees of separation)理论的最早提出者\cite{barabasi2003linked}。 726 | 727 | 728 | \begin{table} 729 | \centering 730 | \begin{tabular}{cccp{38mm}} 731 | \toprule 732 | \textbf{文档域类型} & \textbf{Java类型} & \textbf{宽度(字节)} & \textbf{说明} \\ 733 | \midrule 734 | BOOLEAN & boolean & 1 & \\ 735 | CHAR & char & 2 & UTF-16字符 \\ 736 | BYTE & byte & 1 & 有符号8位整数 \\ 737 | SHORT & short & 2 & 有符号16位整数 \\ 738 | INT & int & 4 & 有符号32位整数 \\ 739 | LONG & long & 8 & 有符号64位整数 \\ 740 | STRING & String & 字符串长度 & 以UTF-8编码存储 \\ 741 | DATE & java.util.Date & 8 & 距离GMT时间1970年1月1日0点0分0秒的毫秒数 \\ 742 | BYTE\_ARRAY & byte$[]$ & 数组长度 & 用于存储二进制值 \\ 743 | BIG\_INTEGER & java.math.BigInteger & 和具体值有关 & 任意精度的长整数 \\ 744 | BIG\_DECIMAL & java.math.BigDecimal & 和具体值有关 & 任意精度的十进制实数 \\ 745 | \bottomrule 746 | \end{tabular} 747 | \caption{测试表格}\label{table:test2} 748 | \end{table} 749 | 750 | 1961年，Michael Gurevich在社会学家Ithiel de Sola Pool的指导下完成了他的 751 | 博士论文，对社交网络进行了实验性的研究。随后，数学家Manfred Kochen与 752 | Sola Pool一道在他们的手稿《Contacts and Influences》中对这些实验结果做 753 | 了分析，发现在美国人口中，任意两个人之间通常只需不超过两个中间人即可互 754 | 相联系\cite{pool1978}。1973年他们又利用计算机，基于Gurevich的数据，用 755 | Monte Carlo法做了模拟，并证实了该结论\cite{pool1978}，从而为心理学家 756 | Stanley Milgram后来的发现打下了基础。 757 | 758 | \section{网络结构的重要指标} 759 | 760 | 在刻画复杂网络结构的统计特性上有三个重要的指标：平均路径长度（average 761 | path length）、聚类系数（clustering coefficient）和度分布（degree 762 | distribution）。事实上，Watts和Strogatz提出小世界网络模型的初衷，就是 763 | 想建立一个既具有类似随机图的较小的平均路径长度，又具有类似规则网络的较 764 | 大的聚类系数的网络模型。 765 | 766 | \subsection{平均路径长度} 767 | 768 | \begin{definition}[节点之间的距离] 769 | 网络中两个节点$i$和$j$之间的距离(distance)$d_{ij}$定义为连接这两个节点 770 | 的最短路径上的边数。 771 | \end{definition} 772 | 773 | \begin{definition}[直径] 774 | 网络中任意两个节点之间的距离的最大值称为该网络的直径，记为$D$，即 775 | \begin{equation}\label{eq:dimension} 776 | D = \max_{i,j} d_{ij} 777 | \end{equation} 778 | \end{definition} 779 | 780 | 781 | \begin{figure}[htbp] 782 | \centering 783 | \includegraphics[width= 0.5\textwidth]{jnuname}\\ 784 | \caption{测试插图}\label{fig:test3} 785 | \end{figure} 786 | 787 | \begin{definition}[平均路径长度] 788 | 网络的平均路径长度$L$定义为任意两个节点之间的距离的平均值，即 789 | \begin{equation}\label{eq:avarage_path_lentgh} 790 | L = \frac{2}{N(N+1)}\sum_{i\geq j}d_{ij} 791 | \end{equation} 792 | 其中$N$为网络节点数。网络的平均路径长度也称为网络的特征路径长度。 793 | \end{definition} 794 | 795 | 注意，为了便于数学处理，在公式\eqref{eq:avarage_path_lentgh}中包含了节 796 | 点到其自身的距离（该距离为零）。如果不考虑节点到其自身的距离，那么公式 797 | \eqref{eq:avarage_path_lentgh}的右端需要乘以因子$(N+1)/(N-1)$。在实际应 798 | 用中，该差别可以忽略不计。 799 | 800 | \subsection{聚类系数} 801 | 802 | \begin{table} 803 | \centering 804 | \begin{tabular}{cccp{38mm}} 805 | \toprule 806 | \textbf{文档域类型} & \textbf{Java类型} & \textbf{宽度(字节)} & \textbf{说明} \\ 807 | \midrule 808 | BOOLEAN & boolean & 1 & \\ 809 | CHAR & char & 2 & UTF-16字符 \\ 810 | BYTE & byte & 1 & 有符号8位整数 \\ 811 | SHORT & short & 2 & 有符号16位整数 \\ 812 | INT & int & 4 & 有符号32位整数 \\ 813 | LONG & long & 8 & 有符号64位整数 \\ 814 | STRING & String & 字符串长度 & 以UTF-8编码存储 \\ 815 | DATE & java.util.Date & 8 & 距离GMT时间1970年1月1日0点0分0秒的毫秒数 \\ 816 | BYTE\_ARRAY & byte$[]$ & 数组长度 & 用于存储二进制值 \\ 817 | BIG\_INTEGER & java.math.BigInteger & 和具体值有关 & 任意精度的长整数 \\ 818 | BIG\_DECIMAL & java.math.BigDecimal & 和具体值有关 & 任意精度的十进制实数 \\ 819 | \bottomrule 820 | \end{tabular} 821 | \caption{测试表格}\label{table:test3} 822 | \end{table} 823 | 824 | 在图论中，聚类系数(clustering coefficient)是用来描述一个图中的顶点之间 825 | 结集成团的程度的系数。具体来说，是一个点的邻接点之间相互连接的程度。许 826 | 多大规模的实际网络都具有明显的聚类效应。例如生活社交网络中，你的朋友同 827 | 时也是朋友的概率会随着网络规模的增加而趋向于某个非零常数。这意味着这些 828 | 实际的复杂网络并不是完全随机的，而是在某种程度上具有类似于社会关系网络 829 | 中“物以类聚，人以群分”的特性。 830 | 831 | \begin{figure}[htbp] 832 | \centering 833 | \includegraphics[width= 0.5\textwidth]{jnuname}\\ 834 | \caption{测试插图}\label{fig:test4} 835 | \end{figure} 836 | 837 | 集聚系数分为整体与局部两种。整体集聚系数可以给出一个图中整体的集聚程度 838 | 的评估，而局部集聚系数则可以测量图中每一个结点附近的集聚程度。 839 | 840 | \begin{definition}[整体聚类系数] 841 | 整体集聚系数的定义建立在闭三点组（邻近三点组）之上。假设网络中有一部分 842 | 节点是两两相连的，那么可以找出很多个“三角形”，其对应的三点两两相连， 843 | 称为闭三点组。除此以外还有开三点组，也就是之间连有两条边的三点（缺一条 844 | 边的三角形）。这两种三点组构成了所有的连通三点组。整体集聚系数定义为 845 | 一个网络中所有闭三点组的数量与所有连通三点组（无论开还是闭）的总量之比， 846 | 即 847 | \[ 848 | C_{total}=\frac{3\times G_{\triangle}}{3 \times G_{\triangle} + G_{\wedge}} 849 | \] 850 | 其中$C_{total}$表示网络的整体聚类系数，$G_{\triangle}$表示该网络中闭三 851 | 点组的个数，$G_{\wedge}$表示该网络中开三点组的个数\cite{luce1949method}。 852 | \end{definition} 853 | 854 | 对图中具体的某一个点，它的局部集聚系数$C_i$表示与它相连的点抱成团（完全 855 | 子图）的程度。Watts与Strogatz在1998年的论文 856 | \cite{watts1998smallworld}中首次引入了这个概念，用以判别一个图是否是小 857 | 世界网络。 858 | 859 | \begin{table} 860 | \centering 861 | \begin{tabular}{cccp{38mm}} 862 | \toprule 863 | \textbf{文档域类型} & \textbf{Java类型} & \textbf{宽度(字节)} & \textbf{说明} \\ 864 | \midrule 865 | BOOLEAN & boolean & 1 & \\ 866 | CHAR & char & 2 & UTF-16字符 \\ 867 | BYTE & byte & 1 & 有符号8位整数 \\ 868 | SHORT & short & 2 & 有符号16位整数 \\ 869 | INT & int & 4 & 有符号32位整数 \\ 870 | LONG & long & 8 & 有符号64位整数 \\ 871 | STRING & String & 字符串长度 & 以UTF-8编码存储 \\ 872 | DATE & java.util.Date & 8 & 距离GMT时间1970年1月1日0点0分0秒的毫秒数 \\ 873 | BYTE\_ARRAY & byte$[]$ & 数组长度 & 用于存储二进制值 \\ 874 | BIG\_INTEGER & java.math.BigInteger & 和具体值有关 & 任意精度的长整数 \\ 875 | BIG\_DECIMAL & java.math.BigDecimal & 和具体值有关 & 任意精度的十进制实数 \\ 876 | \bottomrule 877 | \end{tabular} 878 | \caption{测试表格}\label{table:test4} 879 | \end{table} 880 | 881 | \begin{definition}[局部聚类系数] 882 | 883 | 884 | \begin{figure}[htbp] 885 | \centering 886 | \includegraphics[width= 0.5\textwidth]{jnuname}\\ 887 | \caption{测试插图}\label{fig:test5} 888 | \end{figure} 889 | 890 | 假设网络中的一个节点$i$有$k_i$条边与其他节点相连，这$k_i$个节点称为节点 891 | $i$的邻居。显然，在这$k_i$个节点之间最多可能有$k_i(k_i-1)/2$条边。而这 892 | $k_i$个节点之间实际存在的边数$E_i$和总的可能的边数$k_i(k_i-1)/2$之比就 893 | 定义为节点$i$的聚类系数(clustering coefficient)$C_i$，即 894 | \begin{equation}\label{eq:clustering_coefficient} 895 | C_i = \frac{2E_i}{k_i(k_i-1)} 896 | \end{equation} 897 | 从几何特性上看，上式的一个等价定义为： 898 | \begin{equation}\label{eq:clustering_coefficient_triangle} 899 | C_i = \frac{\text{与节点$i$相连的三角形的数量}}{\text{与节点$i$相连 900 | 的三元组的数量}} 901 | \end{equation} 902 | 其中，与节点$i$相连的三元组是指由节点$i$和其两个邻居节点构成的组合。 903 | \end{definition} 904 | 905 | \begin{figure}[htbp] 906 | \centering 907 | \includegraphics[width= 0.5\textwidth]{jnuname}\\ 908 | \caption{测试插图}\label{fig:test6} 909 | \end{figure} 910 | 911 | 知道了一个图里的每一个顶点的局部集聚系数后，可以计算整个图的平均集聚系 912 | 数。这个概念也是Watts与Strogatz在1998年的论文 913 | \cite{watts1998smallworld}中引入的： 914 | 915 | \begin{definition}[平均聚类系数] 916 | 平均聚类系数定义为所有顶点的局部集聚系数的算术平均数，即 917 | \begin{equation} 918 | \bar{C} = \frac{1}{n}\sum_{i=1}^{n} C_i. 919 | \end{equation} 920 | \end{definition} 921 | 922 | \subsection{度分布} 923 | 924 | \begin{definition}[度] 925 | 无向网络中，节点$i$的度(degree)$k_i$定义为与该节点连接的其他节点的数目。 926 | 有向网络中，节点的度分为出度(out-degree)和入度(in-degree)。节点的出度是 927 | 指从该节点指向其他节点的边的数目，节点的入度是指从其他节点指向该节点的 928 | 边的数目。 929 | \end{definition} 930 | 931 | 直观上看，一个节点的度越大就意味着这个节点在某种意义上越“重要”。 932 | 933 | \begin{definition}[平均度] 934 | 网络中所有节点$i$的度$k_i$的平均值称为网络的平均度，记为$Avg{k}$。 935 | \end{definition} 936 | 937 | \begin{definition}[度分布] 938 | 网络中节点的度的分布状况可用分布函数$P(k)$来描述： 939 | \begin{equation}\label{eq:degree_distribution} 940 | P(k) = \text{一个随机选定的节点的度恰好是$k$的概率} 941 | \end{equation} 942 | $P(k)$称为该网络的度分布。 943 | \end{definition} 944 | 945 | \section{小世界网络} 946 | 947 | \begin{definition}[小世界网络] 948 | 若网络的平均路径长度和网络的节点数目的对数成正比，即 949 | \[ 950 | L_{G} \propto \log N 951 | \] 952 | 其中$N$是节点数目，则称这样的网络为``小世界网络''。 953 | \end{definition} 954 | \blindtext 955 | 956 | \section{基于小世界理论的数据中心网络} 957 | \blindtext 958 | \subsection{DS小世界模型} 959 | \Blindtext 960 | \subsection{DS小世界模型的平均网络距离} 961 | \Blindtext 962 | \subsection{高维小世界网络的负载能力与容错分析} 963 | \Blindtext 964 | \section{SIDN网络模型} 965 | \Blindtext 966 | \subsection{SIDN模型构建} 967 | \Blindtext 968 | \subsection{路由策略} 969 | \Blindtext 970 | \section{逻辑节点内部资源分配} 971 | \Blindtext 972 | \subsection{问题描述} 973 | \Blindtext 974 | \subsection{全局路由算法} 975 | \Blindtext 976 | \section{SIDN模型参数分析} 977 | \Blindtext 978 | \subsection{连通性分析} 979 | \Blindtext 980 | \subsection{平均路由跳数} 981 | \Blindtext 982 | \subsection{总网络带宽} 983 | \Blindtext 984 | \subsection{容错能力} 985 | \Blindtext 986 | \section{仿真结果} 987 | \subsection{平均路由跳数} 988 | \Blindtext 989 | \subsection{总网络带宽} 990 | \Blindtext 991 | \subsection{容错能力} 992 | \Blindtext 993 | \section{小结} 994 | \Blindtext 995 | 996 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 997 | \chapter{随机网络模型}\label{chapter_random} 998 | \section{随机网络背景与研究现状} 999 | \Blindtext 1000 | \section{WarpNet网络模型构建}\label{sec:warpnet_construction} 1001 | \subsection{网络结构} 1002 | \Blindtext 1003 | \subsection{双层拓扑结构} 1004 | \Blindtext 1005 | \section{路由算法} 1006 | \subsection{基于flood的路由发现算法} 1007 | \Blindtext 1008 | \section{网络性能分析} 1009 | \blindtext 1010 | \subsection{连通性与互联通率} 1011 | \Blindtext 1012 | \subsection{路由跳数} 1013 | \Blindtext 1014 | \subsection{总带宽} 1015 | \Blindtext 1016 | \subsection{故障对网络的影响} 1017 | \Blindtext 1018 | \section{仿真分析} 1019 | \Blindtext 1020 | \section{实验验证} 1021 | \Blindtext 1022 | \section{小结} 1023 | \blindtext 1024 | 1025 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 1026 | \chapter{无尺度网络模型}\label{chapter_scalefree} 1027 | \section{无尺度网络背景与研究现状} 1028 | \Blindtext 1029 | \section{基于数据中心的无尺度网络运用} 1030 | \subsection{无尺度网络在数据中心运用的分析} 1031 | \Blindtext 1032 | \subsection{无尺度网络与最大度} 1033 | \Blindtext 1034 | \subsection{带最大度约束的无尺度构造算法} 1035 | \Blindtext 1036 | \section{模型分析} 1037 | \subsection{度-度相关性分析} 1038 | \Blindtext 1039 | \subsection{聚类性分析} 1040 | \Blindtext 1041 | \section{基于数据中心的无尺度网络模型构建分析} 1042 | \blindtext 1043 | \subsection{节点结构与网络性能的关系} 1044 | \Blindtext 1045 | \section{平衡因子的参数调整} 1046 | \blindtext 1047 | \subsection{$q=0$的情况} 1048 | \Blindtext 1049 | \subsection{$q>0$的情况} 1050 | \Blindtext 1051 | \subsection{$q<0$的情况} 1052 | \Blindtext 1053 | \section{TPSF模型构建与性能分析} 1054 | \blindtext 1055 | \subsection{平均路由距离} 1056 | \Blindtext 1057 | \subsection{总网络带宽} 1058 | \Blindtext 1059 | \subsection{容错能力} 1060 | \Blindtext 1061 | \section{仿真结果} 1062 | \subsection{平均路由跳数} 1063 | \Blindtext 1064 | \subsection{总网络带宽} 1065 | \Blindtext 1066 | \subsection{容错能力} 1067 | \Blindtext 1068 | \section{小结} 1069 | \blindtext 1070 | 1071 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 1072 | \chapter{网络模型验证框架}\label{chapter_experiments} 1073 | \section{引言} 1074 | \Blindtext 1075 | \section{模拟平台实现} 1076 | \Blindtext 1077 | \subsection{系统结构} 1078 | \Blindtext 1079 | \subsection{构造模块} 1080 | \Blindtext 1081 | \subsection{虚拟网卡实现} 1082 | \Blindtext 1083 | \subsection{控制核心} 1084 | \Blindtext 1085 | \subsection{受控模块} 1086 | \Blindtext 1087 | \subsection{分布式虚拟交换网络} 1088 | \Blindtext 1089 | \section{验证结果} 1090 | \Blindtext 1091 | \subsection{真实环境验证} 1092 | \Blindtext 1093 | \subsection{海量虚拟化的检测与控制} 1094 | \Blindtext 1095 | \section{小结} 1096 | \blindtext 1097 | 1098 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 1099 | % 学位论文的正文应以《结论》作为最后一章 1100 | \chapter{结论}\label{chapter_concludes} 1101 | 1102 | 本文在第\ref{chapter_smallworld}章中，通过考虑数据中心网络布局构建中的最大度限制 1103 | 问题，提出了符合数据中心网络基本要求的DS小世界模型，并分析了它的性质。随后提出 1104 | SIDN，将DS模型映射到具体的网络结构中，并分析了所构成网络的平均直径、网络总带宽、 1105 | 对故障的容错能力等各项网络性能。 1106 | 1107 | 分析与仿真实验证明，SIDN网络具有很好的扩展能力，网络总带宽与网络规模成 1108 | 近似线性增长的关系；具有很强的容错能力，链路损坏与节点损坏几乎无法破坏 1109 | 网络的联通性，故障率对网络性能的影响与破坏节点/链路占总资源比率线性相关。 1110 | 1111 | 随后在第\ref{chapter_scalefree}章中，分析了无尺度网络在数据中心网络构建应用中的 1112 | 理论方面问题。对Scafida \cite{gyarmati2010scafida}文中所述在最大度限制的情况下运 1113 | 用BA算法构造的网络并不会损失无尺度性质的观点，进行了深入的分析，并指出了该论点的 1114 | 局限性。 1115 | 1116 | 在给出了在引入节点最大度限制之后，利用分治和递归的思想，对无尺度网络 1117 | 进行多层构建，对所构造的网络进行度-度相关性，以及聚类性分析。 1118 | 1119 | \begin{table} 1120 | \centering 1121 | \begin{tabular}{cccp{38mm}} 1122 | \toprule 1123 | \textbf{文档域类型} & \textbf{Java类型} & \textbf{宽度(字节)} & \textbf{说明} \\ 1124 | \midrule 1125 | BOOLEAN & boolean & 1 & \\ 1126 | CHAR & char & 2 & UTF-16字符 \\ 1127 | BYTE & byte & 1 & 有符号8位整数 \\ 1128 | SHORT & short & 2 & 有符号16位整数 \\ 1129 | INT & int & 4 & 有符号32位整数 \\ 1130 | LONG & long & 8 & 有符号64位整数 \\ 1131 | STRING & String & 字符串长度 & 以UTF-8编码存储 \\ 1132 | DATE & java.util.Date & 8 & 距离GMT时间1970年1月1日0点0分0秒的毫秒数 \\ 1133 | BYTE\_ARRAY & byte$[]$ & 数组长度 & 用于存储二进制值 \\ 1134 | BIG\_INTEGER & java.math.BigInteger & 和具体值有关 & 任意精度的长整数 \\ 1135 | BIG\_DECIMAL & java.math.BigDecimal & 和具体值有关 & 任意精度的十进制实数 \\ 1136 | \bottomrule 1137 | \end{tabular} 1138 | \caption{测试表格}\label{table:test5} 1139 | \end{table} 1140 | 1141 | 表\ref{table:test5}用于测试表格。随后分析了无尺度网络构造过程中，交换机节点与数 1142 | 据节点的角色区别，分析了两者在不同比率下形成的网络形态，以及对网络性能造成的影响。 1143 | 1144 | 通过理论分析和仿真实验，分析并找出比率因子q的最佳取值。此外，无尺度现象 1145 | 的引入提高了网络的聚类系数，从而在不失灵活性可靠性的基础上，进一步提升 1146 | 了网络的性能。 1147 | 1148 | 在第\ref{chapter_random}章中，将关注点转移到交换机本身。由于图论难以描述数据中心 1149 | 网络中的交换设备，因此放弃基于图的抽象模型，转而基于多维簇划分的思想，提出并设计 1150 | 了WarpNet网络模型。 1151 | 1152 | 该网络模型突破了基于图描述的局限性，并对网络的带宽等指标进行理论分析并 1153 | 给出定量描述。最后对比了理论分析、仿真测试结果，并在实际物理环境中进系 1154 | 真实部署，通过6节点的小规模实验以及1000节点虚拟机的大规模实验，表明该模 1155 | 型的理论分析、仿真测试与实际实验吻合，并在网络性能、容错能力、伸缩性灵 1156 | 活性方面得到了进一步的提升。 1157 | 1158 | 在第\ref{chapter_experiments}章中，针对网络模型研究这一类工作的共性，设计构造通 1159 | 用验证平台系统。以海量虚拟机和虚拟分布式交换机的形式，实现了基于少量物理节点，对 1160 | 大规模节点的模拟。其模拟运行的过程与真实运行在实现层面完全一致，运行的结果与真实 1161 | 环境线性相关。除为本文所涉若干网络模型提供验证外，可进一步推广到更为广泛的领域， 1162 | 为各种网络模型及路由算法的研究工作，提供分析、指导与验证。 1163 | 1164 | % 参考文献。应放在\backmatter之前。 1165 | % 推荐使用BibTeX，若不使用BibTeX时注释掉下面一句。 1166 | \nocite{*} 1167 | \bibliography{bachelor} 1168 | % 不使用 BibTeX 1169 | %\begin{thebibliography}{2} 1170 | % 1171 | %\bibitem{deng:01a} 1172 | %{邓建松,彭冉冉,陈长松}. 1173 | %\newblock {\em \LaTeXe{}科技排版指南}. 1174 | %\newblock 科学出版社,书号:7-03-009239-2/TP.1516, 北京, 2001. 1175 | % 1176 | %\bibitem{wang:00a} 1177 | %王磊. 1178 | %\newblock {\em \LaTeXe{}插图指南}. 1179 | %\newblock 2000. 1180 | %\end{thebibliography} 1181 | 1182 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 1183 | % 致谢，应放在《结论》之后 1184 | \begin{acknowledgement} 1185 | 首先感谢我的母亲韦春花对我的支持。其次感谢我的导师陈近南对我的精心指导和热心帮助。接下来， 1186 | 感谢我的师兄茅十八和风际中，他们阅读了我的论文草稿并提出了很有价值的修改建议。 1187 | 1188 | 最后，感谢我亲爱的老婆们：双儿、苏荃、阿珂、沐剑屏、曾柔、建宁公主、方怡，感谢 1189 | 你们在生活上对我无微不至的关怀和照顾。我爱你们！ 1190 | \end{acknowledgement} 1191 | 1192 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 1193 | \end{document} 1194 | -------------------------------------------------------------------------------- /bachelor-coursework.tex: -------------------------------------------------------------------------------- 1 | % 本科课程设计选项 2 | % 标题为“《课程名称》（换行）课程设计”，其他与正常用法完全相同。 3 | \documentclass[bachelorcoursework,sourcefonts]{jnuthesis} 4 | 5 | % 本科课程设计课程名称 6 | \coursename{图像处理设计} 7 | \input{bachelor-common} 8 | -------------------------------------------------------------------------------- /bachelor-design.tex: -------------------------------------------------------------------------------- 1 | % 本科毕业设计选项 2 | % 中文摘要页的标题为“设计总说明”，其他与 bachelor 选项完全相同。 3 | \documentclass[bachelordesign,sourcefonts]{jnuthesis} 4 | 5 | \input{bachelor-common} 6 | -------------------------------------------------------------------------------- /bachelor-related.tex: -------------------------------------------------------------------------------- 1 | %% 使用 jnuthesis 文档类生成南京大学学位论文的示例文档 2 | %% 3 | %% 作者：胡海星，starfish (at) gmail (dot) com 4 | %% 项目主页: http://haixing-hu.github.io/jnu-thesis/ 5 | %% 6 | %% 本样例文档中用到了吕琦同学的博士论文的提高和部分内容，在此对他表示感谢。 7 | %% 8 | \documentclass[bachelor,sourcefonts]{jnuthesis} 9 | %% jnuthesis 文档类的可选参数有： 10 | %% nobackinfo 取消封二页导师签名信息。注意，按照南大的规定，是需要签名页的。 11 | %% phd/master/bachelor 选择博士/硕士/学士论文 12 | 13 | % 使用 blindtext 宏包自动生成章节文字 14 | % 这仅仅是用于生成样例文档，正式论文中一般用不到该宏包 15 | \usepackage[math]{blindtext} 16 | 17 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 18 | % 设置论文的中文封面 19 | 20 | % 如果论文标题过长，可以分两行，第一行用\titlea{}定义，第二行用\titleb{}定义，将上面的\title{}注释掉 21 | \titlea{半轻衰变$D^+\to \omega(\phi)e^+\nu_e$的研究} 22 | \titleb{和弱衰变$J/\psi \to D_s^{(*)-}e^+\nu_e$的寻找} 23 | 24 | % 论文作者姓名 25 | \author{韦小宝} 26 | % 论文作者学生证号 27 | \studentnum{1234567890} 28 | % 导师姓名职称 29 | \supervisor{陈近南} 30 | \supervisorpos{教授} 31 | % 第二行导师姓名职称，仿照第一行填写，没有则留空 32 | \supervisorb{} 33 | \supervisorbpos{} 34 | % 论文作者的学科与专业方向 35 | \major{数字媒体技术} 36 | % 论文作者所在院系的中文名称，学士学位论文此处不带“学院”二字 37 | \department{数字媒体} 38 | % 论文作者所在学校或机构的名称。此属性可选，默认值为``江南大学''。 39 | \institute{江南大学} 40 | % 学士学位获得日期，需设置年、月，默认为编译日期。 41 | %\bachelordegreeyear{2017} 42 | %\bachelordegreemonth{6} 43 | 44 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 45 | \begin{document} 46 | 47 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 48 | 49 | % 制作中文封面 50 | \makebachelorrelated 51 | 52 | % 制作外文资料翻译封面页 53 | \makebachelortranslation 54 | 55 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 56 | % 开始正文部分 57 | \mainmatter 58 | 59 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 60 | % 外文资料原文；格式仅供参考 61 | \chapter*{原文}\label{chapter_originaltext} 62 | 63 | \Blindtext 64 | 65 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 66 | % 译文；格式仅供参考 67 | \chapter*{翻译}\label{chapter_translation} 68 | 69 | 在分布式网络领域，沿着高性能集群、普世计算、网格计算的方向，现已走入云 70 | 计算时代。 71 | 72 | 云计算对信息技术架构造成了越来越大的影响。例如，借助Amazon EC2云平台， 73 | 用户借助其基础设施，可以十分方便的部署各类应用，以支持企业服务需求。用 74 | 户可以按需购买计算资源，网络带宽，存储空间等各类资源以支持他们的业务需 75 | 求，并在业务完成之后迅速的归还这些资源。通过云技术，用户可以集中在他们 76 | 擅长的核心业务之中，而不会被诸如硬件购买、安装系统、网络设置、备份和安 77 | 全等等问题干扰。 78 | 79 | 与此同时，随着计算机的普及化和微型化，现在的手持设备拥有不输于7年前台式 80 | 机的处理能力。在网络时代面前，智能终端广泛普及，每个人都可成为信息源。 81 | 在信息爆炸的时代，数据挖掘、机器学习、金融分析和模拟等行业中不断涌现新 82 | 的需求，诸如针对用户行为和社会关系的挖掘进行广告精准投放，用户行为预测 83 | 等。为了支撑PB级尺度的数据规模，需要海量的计算节点，催生并不断促进了各 84 | 行各业对云计算基础设施的建设需求。 85 | 86 | 海量的数据需要海量的处理能力，然而海量的处理能力又需要高带宽的网络IO为 87 | 承载。作为云环境中最基础的一环，IaaS层在网络、存储、计算资源的分割这几 88 | 方面，承担起整个系统的基石。虽然并非必须，但一般来说，为考虑沙盘环境， 89 | 以及对资源的细粒度切割分配，IaaS通常会伴随着虚拟化技术的运用。虚拟化具 90 | 有许多与云计算切合的特点，例如，虚拟化可以屏蔽物理环境的差异，可在多物 91 | 理节点中进行无缝迁移，可对系统进行快照和还原。这些特点都与云计算时代所 92 | 追求的灵活性、高伸缩性、快速响应等特点而吻合。 93 | 94 | 在虚拟化实现方面，目前已取得了诸如ESXi，Xen，KVM等成熟成果。然而当虚拟 95 | 化扩大的一定规模，随着节点数目的增多，在网络方面将会面临一系列取舍的问 96 | 题。例如，基于二层交换的扁平网络，当节点数目上升到千数量级时，广播报文 97 | 将会极大的拖累网络性能，必须通过划分子网，通过三层路由等形式重新规划为 98 | 多层网络结构；另一方面，除了联通之外，还需要考虑ACL控制，负载均衡，外网 99 | 通讯等各类防火墙以及NAT规则的实现。这些复杂的网络配置，在一定程度上抵消 100 | 了虚拟机带来的灵活性。例如虽然虚拟机可根据需要动态迁移，但在迁移之后， 101 | 由于网络位置的变化需要重新进行网络参数配置。虽然虚拟机在迁移过程中系统 102 | 内部状态没有变化，但站在网络角度看，该虚拟节点跟关机重启没有区别。 103 | 104 | 针对上述问题，本文站在面向云计算时代的数据中心网络建设的角度，对网络模 105 | 型进行深入研究和探讨。通过改善二层交换网络的ARP机制来解决广播风暴问题， 106 | 引入比树形网络更为复杂的复杂网络理论，指导网络节点的互联模型。从而将网 107 | 络的复杂性隐藏在节点环境之外，在节点层面仅提供简单但巨大的二层交换扁平 108 | 网络。 109 | 110 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 111 | \end{document} 112 | -------------------------------------------------------------------------------- /bachelor.bib: -------------------------------------------------------------------------------- 1 | % -*- coding: utf-8 -*- 2 | 3 | @book{newman2006structure, 4 | title={The structure and dynamics of networks}, 5 | author={Newman, Mark and Barab{\'a}si, Albert-L{\'a}szl{\'o} and Watts, Duncan J}, 6 | year={2006}, 7 | publisher={Princeton University Press}, 8 | address={Princeton}, 9 | } 10 | 11 | @article{newman2001random, 12 | title={Random graphs with arbitrary degree distributions and their applications}, 13 | author={Newman, Mark EJ and Strogatz, Steven H and Watts, Duncan J}, 14 | journal={Physical Review E}, 15 | volume={64}, 16 | number={2}, 17 | pages={026118}, 18 | year={2001}, 19 | publisher={APS}, 20 | } 21 | 22 | @inproceedings{aiello2000random, 23 | title={A random graph model for massive graphs}, 24 | author={Aiello, William and Chung, Fan and Lu, Linyuan}, 25 | booktitle={Proceedings of the thirty-second annual ACM symposium on Theory of computing}, 26 | pages={171--180}, 27 | year={2000}, 28 | publisher = {ACM}, 29 | address = {New York}, 30 | } 31 | 32 | @article{molloy1995critical, 33 | title={A critical point for random graphs with a given degree sequence}, 34 | author={Molloy, Michael and Reed, Bruce}, 35 | journal={Random structures \& algorithms}, 36 | volume={6}, 37 | number={2-3}, 38 | pages={161--180}, 39 | year={1995}, 40 | publisher={Wiley Online Library} 41 | } 42 | 43 | @article{frieze1992independence, 44 | title={On the independence and chromatic numbers of random regular graphs}, 45 | author={Frieze, Alan M and {\L}uczak, T}, 46 | journal={Journal of Combinatorial Theory, Series B}, 47 | volume={54}, 48 | number={1}, 49 | pages={123--132}, 50 | year={1992}, 51 | publisher={Elsevier} 52 | } 53 | 54 | @article{bender1978asymptotic, 55 | title={The asymptotic number of labeled graphs with given degree sequences}, 56 | author={Bender, Edward A and Canfield, E Rodney}, 57 | journal={Journal of Combinatorial Theory, Series A}, 58 | volume={24}, 59 | number={3}, 60 | pages={296--307}, 61 | year={1978}, 62 | publisher={Elsevier} 63 | } 64 | 65 | @book{bollobas2001random, 66 | title={Random graphs}, 67 | author={Bollob{\'a}s, B{\'e}la}, 68 | volume={73}, 69 | year={2001}, 70 | publisher={Cambridge university press} 71 | } 72 | 73 | @article{erdHos1961strength, 74 | title={On the strength of connectedness of a random graph}, 75 | author={Erd{\H{o}}s, Paul and Renyi, Alfred}, 76 | journal={Acta Mathematica Hungarica}, 77 | volume={12}, 78 | number={1}, 79 | pages={261--267}, 80 | year={1961}, 81 | publisher={Akad{\'e}miai Kiad{\'o}, co-published with Springer Science+ Business Media BV, Formerly Kluwer Academic Publishers BV} 82 | } 83 | 84 | @article{erdos1960additive, 85 | title={Additive properties of random sequences of positive integers}, 86 | author={Erd{\"o}s, Paul and R{\'e}nyi, Alfr{\'e}d}, 87 | journal={Acta Arithmetica}, 88 | volume={6}, 89 | number={1}, 90 | pages={83--110}, 91 | year={1960}, 92 | publisher={Institute of Mathematics Polish Academy of Sciences} 93 | } 94 | 95 | @article{vazquez2002modeling, 96 | title={Modeling of protein interaction networks}, 97 | author={V{\'a}zquez, Alexei and Flammini, Alessandro and Maritan, Amos and Vespignani, Alessandro}, 98 | journal={Complexus}, 99 | volume={1}, 100 | number={1}, 101 | pages={38--44}, 102 | year={2002}, 103 | publisher={Karger Publishers} 104 | } 105 | 106 | @article{sole2002model, 107 | title={A model of large-scale proteome evolution}, 108 | author={Sol{\'e}, Ricard V and Pastor-Satorras, Romualdo and Smith, Eric and Kepler, Thomas B}, 109 | journal={Advances in Complex Systems}, 110 | volume={5}, 111 | number={01}, 112 | pages={43--54}, 113 | year={2002}, 114 | publisher={World Scientific} 115 | } 116 | 117 | 118 | @article{goh2002classification, 119 | title={Classification of scale-free networks}, 120 | author={Goh, Kwang-Il and Oh, Eulsik and Jeong, Hawoong and Kahng, Byungnam and Kim, Doochul}, 121 | journal={Proceedings of the National Academy of Sciences}, 122 | volume={99}, 123 | number={20}, 124 | pages={12583--12588}, 125 | year={2002}, 126 | publisher={National Acad Sciences} 127 | } 128 | 129 | @article{anthonisse1971rush, 130 | title={The rush in a graph}, 131 | author={Anthonisse, Jac M}, 132 | journal={Amsterdam: University of Amsterdam Mathematical Centre}, 133 | year={1971} 134 | } 135 | 136 | @article{freeman1977set, 137 | title={A set of measures of centrality based on betweenness}, 138 | author={Freeman, Linton C}, 139 | journal={Sociometry}, 140 | pages={35--41}, 141 | year={1977}, 142 | publisher={JSTOR} 143 | } 144 | 145 | @article{goh2001universal, 146 | title={Universal behavior of load distribution in scale-free networks}, 147 | author={Goh, K-I and Kahng, B and Kim, D}, 148 | journal={Physical Review Letters}, 149 | volume={87}, 150 | number={27}, 151 | pages={278701}, 152 | year={2001}, 153 | publisher={APS} 154 | } 155 | 156 | @article{adamic2000power, 157 | title={Power-law distribution of the world wide web}, 158 | author={Adamic, Lada A and Huberman, Bernardo A}, 159 | journal={Science}, 160 | volume={287}, 161 | number={5461}, 162 | pages={2115--2115}, 163 | year={2000}, 164 | publisher={American Association for the Advancement of Science} 165 | } 166 | 167 | @article{bianconi2001competition, 168 | title={Competition and multiscaling in evolving networks}, 169 | author={Bianconi, Ginestra and Barab{\'a}si, A-L}, 170 | journal={EPL (Europhysics Letters)}, 171 | volume={54}, 172 | number={4}, 173 | pages={436}, 174 | year={2001}, 175 | publisher={IOP Publishing} 176 | } 177 | 178 | @article{krapivsky2000connectivity, 179 | title={Connectivity of growing random networks}, 180 | author={Krapivsky, Paul L and Redner, Sidney and Leyvraz, Francois}, 181 | journal={Physical review letters}, 182 | volume={85}, 183 | number={21}, 184 | pages={4629}, 185 | year={2000}, 186 | publisher={APS} 187 | } 188 | 189 | @article{dorogovtsev2000structure, 190 | title={Structure of growing networks with preferential linking}, 191 | author={Dorogovtsev, Sergey N and Mendes, Jos{\'e} Fernando Ferreira and Samukhin, Alexander N}, 192 | journal={Physical Review Letters}, 193 | volume={85}, 194 | number={21}, 195 | pages={4633}, 196 | year={2000}, 197 | publisher={APS} 198 | } 199 | 200 | @article{barabasi2000scale, 201 | title={Scale-free characteristics of random networks: the topology of the world-wide web}, 202 | author={Barab{\'a}si, Albert-L{\'a}szl{\'o} and Albert, R{\'e}ka and Jeong, Hawoong}, 203 | journal={Physica A: Statistical Mechanics and its Applications}, 204 | volume={281}, 205 | number={1}, 206 | pages={69--77}, 207 | year={2000}, 208 | publisher={Elsevier} 209 | } 210 | 211 | @inproceedings{price1965statistical, 212 | title={Statistical studies of networks of scientific papers}, 213 | author={Price, D}, 214 | booktitle={Statistical Association Methods for Mechanized Documentation: Symposium Proceedings}, 215 | volume={269}, 216 | pages={187}, 217 | year={1965}, 218 | organization={US Government Printing Office} 219 | } 220 | 221 | @article{redner1998popular, 222 | title={How popular is your paper? An empirical study of the citation distribution}, 223 | author={Redner, Sidney}, 224 | journal={The European Physical Journal B-Condensed Matter and Complex Systems}, 225 | volume={4}, 226 | number={2}, 227 | pages={131--134}, 228 | year={1998}, 229 | publisher={Springer} 230 | } 231 | 232 | @article{merton1968matthew, 233 | title={The Matthew effect in science}, 234 | author={Merton, Robert K}, 235 | journal={Science}, 236 | volume={159}, 237 | number={3810}, 238 | pages={56--63}, 239 | year={1968}, 240 | publisher={Washington} 241 | } 242 | 243 | @article{barabasi1999emergence, 244 | title={Emergence of scaling in random networks}, 245 | author={Barab{\'a}si, Albert-L{\'a}szl{\'o} and Albert, R{\'e}ka}, 246 | journal={science}, 247 | volume={286}, 248 | number={5439}, 249 | pages={509--512}, 250 | year={1999}, 251 | publisher={American Association for the Advancement of Science} 252 | } 253 | 254 | 255 | @article{gilbert1959random, 256 | title={Random Graphs}, 257 | author={Edgar Nelson Gilbert}, 258 | journal={Annals of Mathematical Statistics}, 259 | volume={30}, 260 | number={4}, 261 | pages={1141--1144}, 262 | year={1959}, 263 | doi={10.1214/aoms/1177706098}, 264 | url={http://dx.doi.org/10.1214/aoms/1177706098} 265 | } 266 | 267 | @article{erdos1959random, 268 | title={On Random Graphs. I}, 269 | author={Paul Erd{\H{o}}s and Alfr{\'e}d R{\'e}nyi}, 270 | journal={Publicationes Mathematicae}, 271 | volume={6}, 272 | pages={290--297}, 273 | year={1959}, 274 | url={http://www.renyi.hu/~p_erdos/1959-11.pdf} 275 | } 276 | 277 | @article{luce1949method, 278 | title={A method of matrix analysis of group structure}, 279 | author={R. Duncan Luce and Albert D. Perry}, 280 | journal={Psychometrika}, 281 | volume={14}, 282 | number={2}, 283 | pages={95--116}, 284 | year={1949}, 285 | doi={10.1007/BF02289146}, 286 | url={http://dx.doi.org/10.1007/BF02289146}, 287 | publisher={Springer-Verlag} 288 | } 289 | 290 | @article{li2005towards, 291 | title={Towards a theory of scale-free graphs: Definition, properties, and implications}, 292 | author={Li, Lun and Alderson, David and Doyle, John C and Willinger, Walter}, 293 | journal={Internet Mathematics}, 294 | volume={2}, 295 | number={4}, 296 | pages={431--523}, 297 | year={2005}, 298 | publisher={Taylor \& Francis} 299 | } 300 | 301 | @article{solomonoff1951connectivity, 302 | title={Connectivity of random nets}, 303 | author={Ray Solomonoff and Anatol Rapoport}, 304 | year={1951}, 305 | journal={The bulletin of mathematical biophysics}, 306 | volume={13}, 307 | number={2}, 308 | doi={10.1007/BF02478357}, 309 | url={http://dx.doi.org/10.1007/BF02478357}, 310 | publisher={Kluwer Academic Publishers}, 311 | pages={107-117} 312 | } 313 | 314 | 315 | @article{albert1999diameter, 316 | title={The diameter of the world wide web}, 317 | author={Reka Albert and Hawoong Jeong and Albert-L{\'a}szl{\'o} Barab{\'a}si}, 318 | jurnal={Nature}, 319 | volume={401}, 320 | pages={130--131}, 321 | year={1999}, 322 | month={9}, 323 | doi={10.1038/43601} 324 | } 325 | 326 | @article{wang2003complex, 327 | title={Complex networks: small-world, scale-free and beyond}, 328 | author={Xiao Fan Wang and Guanrong Chen}, 329 | journal={Circuits and Systems Magazine, IEEE}, 330 | volume={3}, 331 | number={1}, 332 | pages={6-20}, 333 | year={2003}, 334 | doi={10.1109/MCAS.2003.1228503} 335 | } 336 | 337 | @inproceedings{leskovec2008msn, 338 | title={Planetary-Scale Views on a Large Instant-Messaging Network}, 339 | author={Jure Leskovec and Eric Horvitz}, 340 | booktitle={Proceedings of the 17th international conference on World Wide Web}, 341 | publisher = {ACM}, 342 | address = {New York}, 343 | year={2008}, 344 | } 345 | 346 | @techreport{leskovec2007msn, 347 | title={Worldwide Buzz: Planetary-Scale Views on an Instant-Messaging Network}, 348 | author={Jure Leskovec and Eric Horvitz}, 349 | institution={Microsoft Research}, 350 | year={2007}, 351 | month={7}, 352 | key={Microsoft Research Technical Report MSR-TR-2006-186} 353 | } 354 | 355 | @book{fass1996bacon, 356 | title={Six Degrees of {K}evin {B}acon}, 357 | author={Craig Fass and Brian Turtle and Mike Ginelli}, 358 | year={1996}, 359 | publisher={Plume}, 360 | address={New York City} 361 | } 362 | 363 | @online{reynolds2011bacon, 364 | title={The Oracle of {B}acon}, 365 | author={Patrick Reynolds}, 366 | url = {http://oracleofbacon.org/cgi-bin/center-cgi?who=Kevin+Bacon}, 367 | citedate = {2011-07-12} 368 | } 369 | 370 | @article{newman2001structure, 371 | title = {The structure of scientific collaboration networks}, 372 | author = {Mark Newman}, 373 | journal = {Proceedings of the National Academy of Sciences} , 374 | volume = {98}, 375 | number = {2}, 376 | pages = {404-409}, 377 | year = {2001}, 378 | doi = {10.1073/pnas.98.2.404} 379 | } 380 | 381 | @online{grossman2011erdos, 382 | title={Publications of {P}aul {E}rd{\H{o}}s}, 383 | author={Jerry Grossman}, 384 | url = {http://www.oakland.edu/enp/pubinfo/}, 385 | citedate = {2011-02-01}, 386 | } 387 | 388 | @online{oakland2009erdos, 389 | title={The {E}rd{\H{o}}s Number Project Data Files}, 390 | author={Oakland University}, 391 | year={2009}, 392 | url = {http://www.oakland.edu/enp/thedata/}, 393 | citedate = {2010-05-29} 394 | } 395 | 396 | @article{goffman1969erdos, 397 | title={And what is your {E}rd{\H{o}}s number?}, 398 | author={Casper Goffman}, 399 | journal={American Mathematical Monthly}, 400 | volume={76}, 401 | number={7}, 402 | pages={791}, 403 | year={1969} 404 | } 405 | 406 | @article{milgram1967small, 407 | title={The Small World Problem}, 408 | author={Stanley Milgram}, 409 | journal={Psychology Today}, 410 | volume={2}, 411 | pages={60--67}, 412 | year={1967} 413 | } 414 | 415 | @article{travers1969experimental, 416 | title={An Experimental Study of the Small World Problem}, 417 | author={Jeffrey Travers and Stanley Milgram}, 418 | journal={Sociometry}, 419 | volume={32}, 420 | number={4}, 421 | pages={425--443}, 422 | year={1969} 423 | } 424 | 425 | @phdthesis{gurevich1961phd, 426 | title={The Social Structure of Acquaintanceship Networks}, 427 | author={Michael Gurevich}, 428 | school={Massachusetts Institute of Technology}, 429 | year={1961}, 430 | address={Cambridge, MA} 431 | } 432 | 433 | @incollection{marconi1909nobel, 434 | title={Wireless telegraphic communication}, 435 | author={Guglielmo Marconi}, 436 | booktitle={Nobel Prize address}, 437 | year={1909}, 438 | } 439 | 440 | @article{pool1978, 441 | title = {Contacts and influence}, 442 | author = {{Ithiel} {de Sola Pool} and Manfred Kochen}, 443 | year = {1978}, 444 | journal = {Social Networks}, 445 | pages = {5-51}, 446 | volume = {1}, 447 | issue = {1} 448 | } 449 | 450 | @book{barabasi2003linked, 451 | title={Linked: How Everything is Connected to Everything Else and What It Means for Business, Science, and Everyday Life}, 452 | author={Albert-L{\'a}szl{\'o} Barab{\'a}si}, 453 | year={2003}, 454 | publisher={Plume}, 455 | address={New York} 456 | } 457 | 458 | @inproceedings{herrera2011generating, 459 | title={Generating scale-free networks with adjustable clustering coefficient via random walks}, 460 | author={Herrera, Carlos and Zufiria, Pedro J}, 461 | booktitle={Network Science Workshop (NSW), 2011 IEEE}, 462 | pages={167--172}, 463 | year={2011}, 464 | organization={IEEE} 465 | } 466 | 467 | @article{gyarmati2010scafida, 468 | title={Scafida: A scale-free network inspired data center architecture}, 469 | author={L{\'a}szl{\'o} Gyarmati and {Tuan Anh} {Trinh}}, 470 | journal={ACM SIGCOMM Computer Communication Review}, 471 | volume={40}, 472 | number={5}, 473 | pages={4--12}, 474 | year={2010}, 475 | publisher={ACM} 476 | } 477 | 478 | @inproceedings{greenberg2008towards, 479 | title={Towards a next generation data center architecture: scalability and commoditization}, 480 | author={Greenberg, Albert and Lahiri, Parantap and Maltz, David A and Patel, Parveen and Sengupta, Sudipta}, 481 | booktitle={Proceedings of the ACM workshop on Programmable routers for extensible services of tomorrow}, 482 | pages={57--62}, 483 | year={2008}, 484 | organization={ACM} 485 | } 486 | 487 | @book{leighton1992introduction, 488 | title={Introduction to parallel algorithms and architectures}, 489 | author={Leighton, Frank Thomson}, 490 | year={1992}, 491 | publisher={Morgan Kaufmann San Francisco} 492 | } 493 | 494 | @article{guo2009bcube, 495 | title={BCube: a high performance, server-centric network architecture for modular data centers}, 496 | author={Guo, Chuanxiong and Lu, Guohan and Li, Dan and Wu, Haitao and Zhang, Xuan and Shi, Yunfeng and Tian, Chen and Zhang, Yongguang and Lu, Songwu}, 497 | journal={ACM SIGCOMM Computer Communication Review}, 498 | volume={39}, 499 | number={4}, 500 | pages={63--74}, 501 | year={2009}, 502 | publisher={ACM} 503 | } 504 | 505 | @inproceedings{guo2008dcell, 506 | title={Dcell: a scalable and fault-tolerant network structure for data centers}, 507 | author={Guo, Chuanxiong and Wu, Haitao and Tan, Kun and Shi, Lei and Zhang, Yongguang and Lu, Songwu}, 508 | booktitle={ACM SIGCOMM Computer Communication Review}, 509 | volume={38}, 510 | issue={4}, 511 | pages={75--86}, 512 | year={2008}, 513 | organization={ACM} 514 | } 515 | 516 | @inproceedings{lockwood2007netfpga, 517 | title={NetFPGA--an open platform for gigabit-rate network switching and routing}, 518 | author={Lockwood, John W and McKeown, Nick and Watson, Greg and Gibb, Glen and Hartke, Paul and Naous, Jad and Raghuraman, Ramanan and Luo, Jianying}, 519 | booktitle={Microelectronic Systems Education, 2007. MSE'07. IEEE International Conference on}, 520 | pages={160--161}, 521 | year={2007}, 522 | organization={IEEE} 523 | } 524 | 525 | @online{NVIDIAGRID, 526 | author = {{NVIDIA Corporation}}, 527 | title = {Nvidia GRID}, 528 | year = {2013}, 529 | url = {http://www.nvidia.com/object/cloud-gaming.html}, 530 | citedate = {2013-03-10} 531 | } 532 | 533 | @program{VDE, 534 | author = {{SourceForge}}, 535 | title = {VDE: Virtual Distributed Ethernet}, 536 | year = {2013}, 537 | url = {https://vde.sourceforge.net}, 538 | citedate = {2013-03-09} 539 | } 540 | 541 | @online{QUAGGA, 542 | title = {{Quagga} Routing Suite}, 543 | url = {http://www.nongnu.org/quagga/}, 544 | citedate = {2013-03-09} 545 | } 546 | 547 | @article{kohler2000click, 548 | title={The Click modular router}, 549 | author={Kohler, Eddie and Morris, Robert and Chen, Benjie and Jannotti, John and Kaashoek, M Frans}, 550 | journal={ACM Transactions on Computer Systems (TOCS)}, 551 | volume={18}, 552 | number={3}, 553 | pages={263--297}, 554 | year={2000}, 555 | publisher={ACM} 556 | } 557 | 558 | @article{han2010packetshader, 559 | title={PacketShader: a GPU-accelerated software router}, 560 | author={Han, Sangjin and Jang, Keon and Park, KyoungSoo and Moon, Sue}, 561 | journal={ACM SIGCOMM Computer Communication Review}, 562 | volume={40}, 563 | number={4}, 564 | pages={195--206}, 565 | year={2010}, 566 | publisher={ACM} 567 | } 568 | 569 | @inproceedings{dobrescu2009routebricks, 570 | title={RouteBricks: exploiting parallelism to scale software routers}, 571 | author={Dobrescu, Mihai and Egi, Norbert and Argyraki, Katerina and Chun, Byung-Gon and Fall, Kevin and Iannaccone, Gianluca and Knies, Allan and Manesh, Maziar and Ratnasamy, Sylvia}, 572 | booktitle={Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles}, 573 | pages={15--28}, 574 | year={2009}, 575 | organization={ACM} 576 | } 577 | 578 | @article{hu2011review, 579 | title={A Review on cloud computing: Design challenges in Architecture and Security}, 580 | author={{HU Fei} and {QIU Meikang} and {LI Jiayin} and Grant, Travis and 581 | Taylor, Drew and McCaleb, Seth and Butler, Lee and Hamner, 582 | Richard}, 583 | journal={Journal of Computing and Information Technology}, 584 | volume={19}, 585 | number={1}, 586 | pages={25--55}, 587 | year={2011} 588 | } 589 | 590 | @techreport{varia2010architecting, 591 | title={Architecting for the cloud: Best practices}, 592 | author={Varia, Jinesh}, 593 | institution={Amazon Web Services}, 594 | year={2010} 595 | } 596 | 597 | @inproceedings{greenberg2009vl2, 598 | title={VL2: a scalable and flexible data center network}, 599 | author={Greenberg, Albert and Hamilton, James R and Jain, Navendu and Kandula, Srikanth and Kim, Changhoon and Lahiri, Parantap and Maltz, David A and Patel, Parveen and Sengupta, Sudipta}, 600 | booktitle={ACM SIGCOMM Computer Communication Review}, 601 | volume={39}, 602 | issue={4}, 603 | pages={51--62}, 604 | year={2009}, 605 | organization={ACM} 606 | } 607 | 608 | @inproceedings{al2008scalable, 609 | title={A scalable, commodity data center network architecture}, 610 | author={Al-Fares, Mohammad and Loukissas, Alexander and Vahdat, Amin}, 611 | booktitle={ACM SIGCOMM Computer Communication Review}, 612 | volume={38}, 613 | issue={4}, 614 | pages={63--74}, 615 | year={2008}, 616 | organization={ACM} 617 | } 618 | 619 | @article{pallis2006insight, 620 | title={Insight and perspectives for content delivery networks}, 621 | author={Pallis, George and Vakali, Athena}, 622 | journal={Communications of the ACM}, 623 | volume={49}, 624 | number={1}, 625 | pages={101--106}, 626 | year={2006}, 627 | publisher={ACM} 628 | } 629 | 630 | @article{Dean2009, 631 | author = {Dean, J}, 632 | title = {Designs, Lessons, and Advice from Building Large Distributed Systems.}, 633 | year = {2009}, 634 | month = {Oct}, 635 | journal = {Keynote from LADIS 2009} 636 | } 637 | 638 | @article{broder2000graph, 639 | title={Graph structure in the web}, 640 | author={Broder, Andrei and Kumar, Ravi and Maghoul, Farzin and Raghavan, Prabhakar and Rajagopalan, Sridhar and Stata, Raymie and Tomkins, Andrew and Wiener, Janet}, 641 | journal={Computer networks}, 642 | volume={33}, 643 | number={1}, 644 | pages={309--320}, 645 | year={2000}, 646 | publisher={Elsevier} 647 | } 648 | 649 | @article{kleinberg1999authoritative, 650 | title={Authoritative sources in a hyperlinked environment}, 651 | author={Kleinberg, Jon M}, 652 | journal={Journal of the ACM (JACM)}, 653 | volume={46}, 654 | number={5}, 655 | pages={604--632}, 656 | year={1999}, 657 | publisher={ACM} 658 | } 659 | 660 | @INPROCEEDINGS{Kleinberg00thesmall-world, 661 | author = {Jon Kleinberg}, 662 | title = {The Small-World Phenomenon: An Algorithmic Perspective}, 663 | booktitle = {in Proceedings of the 32nd ACM Symposium on Theory of Computing}, 664 | year = {2000}, 665 | pages = {163--170} 666 | }Ï 667 | 668 | @article{watts1998smallworld, 669 | author = {Duncan Watts and Steven Strogatz}, 670 | title = {Collective dynamics of ``small-world'' networks}, 671 | journal = {Nature}, 672 | year = {1998}, 673 | month = {6}, 674 | volume = {393}, 675 | pages = {440-442}, 676 | doi = {10.1038/30918} 677 | } 678 | 679 | @article{1967Milgram, 680 | author = {Stanley Milgram}, 681 | year = {1967}, 682 | title = {The Small World Problem}, 683 | journal = {Psychology Today}, 684 | volume = 2, 685 | pages = {60-67} 686 | } 687 | 688 | 689 | @webpage{wikipedia_moores_law, 690 | title = {{Moore's law}}, 691 | author = {{Wikipedia contributors}}, 692 | publisher = {Wikipedia, The Free Encyclopedia}, 693 | year = {2015}, 694 | url = {https://en.wikipedia.org/wiki/Moore%27s_law}, 695 | modifydate = {2015/06/14}, 696 | citedate = {2015/06/15} 697 | } 698 | 699 | @webpage{dubash2010, 700 | title = {{Moore's Law is dead, says Gordon Moore}}, 701 | author = {Manek Dubash}, 702 | publisher = {Techworld}, 703 | year = {2010}, 704 | month = {4}, 705 | url = {http://www.techworld.com/news/operating-systems/moores-law-is-dead-says-gordon-moore-3576581/}, 706 | modifydate={2010/4/13}, 707 | citedate={2015/6/16} 708 | } 709 | 710 | @webpage{kanellos2003, 711 | author = {Michael Kanellos}, 712 | title = {{Intel scientists find wall for Moore's Law}}, 713 | publisher = {CNET}, 714 | year = {2003}, 715 | month = {12}, 716 | url = {http://news.cnet.com/2100-1008-5112061.html}, 717 | modifydate={2003/12/1}, 718 | citedate={2015/6/16} 719 | } 720 | 721 | @webpage{intel2014, 722 | title = {{Intel discloses newest microarchitecture and 14 nanometer manufacturing process technical details}}, 723 | author = {{Intel Corporation}}, 724 | publisher = {{Intel Corporation}}, 725 | year = {2014}, 726 | month = {8}, 727 | url = {http://newsroom.intel.com/community/intel_newsroom/blog/2014/08/11/intel-discloses-newest-microarchitecture-and-14-nanometer-manufacturing-process-technical-details}, 728 | modifydate={2014/8/11}, 729 | citedate={2015/6/16} 730 | } 731 | 732 | @webpage{moammer2015, 733 | title = {{TSMC Launching 10nm FinFET Process In 2016, 7nm In 2017}}, 734 | author = {Khalid Moammer}, 735 | publisher = {WCCF Tech}, 736 | year = {2015}, 737 | month = {4}, 738 | url = {http://wccftech.com/tsmc-promises-10nm-production-2016-7nm-2017/}, 739 | modifydate={2015/4/19}, 740 | citedate={2015/6/16} 741 | } 742 | 743 | @webpage{shrout2014, 744 | title = {{Intel Xeon E5-2600 v3 processor overview: Haswell-EP up to 18 cores}}, 745 | author = {Ryan Shrout}, 746 | year = {2014}, 747 | month = {9}, 748 | url = {http://www.pcper.com/reviews/Processors/Intel-Xeon-E5-2600-v3-Processor-Overview-Haswell-EP-18-Cores}, 749 | modifydate = {2014/9/8}, 750 | citedate = {2015/6/16} 751 | } 752 | 753 | @webpage{intel2012, 754 | title = {{Intel chips timeline}}, 755 | author = {{Intel Corporation}}, 756 | publisher = {{Intel Corporation}}, 757 | year = {2012}, 758 | month = {7}, 759 | url = {http://www.intel.co.uk/content/www/uk/en/history/history-intel-chips-timeline-poster.html}, 760 | modifydate={2012/7/13}, 761 | citedate={2015/6/16} 762 | } 763 | 764 | @webpage{wikipedia_transistor_count, 765 | title = {{Transistor count}}, 766 | author = {{Wikipedia contributors}}, 767 | publisher = {Wikipedia, The Free Encyclopedia}, 768 | year = {2015}, 769 | url = {https://en.wikipedia.org/wiki/Transistor_count}, 770 | modifydate = {2015/6/10}, 771 | citedate={2015/6/16} 772 | } 773 | -------------------------------------------------------------------------------- /bachelor.tex: -------------------------------------------------------------------------------- 1 | % 本科毕业论文选项 2 | \documentclass[bachelor,sourcefonts]{jnuthesis} 3 | 4 | \input{bachelor-common} 5 | -------------------------------------------------------------------------------- /dtklogos.sty: -------------------------------------------------------------------------------- 1 | %% 2 | %% This is file `dtklogos.sty', 3 | %% 4 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 5 | %% $Id: dtklogos.sty 138 2014-12-11 17:48:48Z herbert $ 6 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 7 | %% Purpose: 8 | %% LaTeX Class and Styles for ``Die TeXnische Komoedie''. 9 | %% 10 | %% Copyright (C) 1995-1996 Gerd Neugebauer 11 | %% Copyright (C) 1997-2011 DANTE, Deutschsprachige 12 | %% Anwendervereinigung TeX e.V. 13 | %% (C) 2014- Herbert Voss 14 | %% 15 | %% This file may be distributed and/or modified under the 16 | %% conditions of the LaTeX Project Public License, either version 1.3c 17 | %% of this license or (at your option) any later version. 18 | %% The latest version of this license is in 19 | %% http://www.latex-project.org/lppl.txt 20 | %% and version 1.3c or later is part of all distributions of LaTeX 21 | %% version 2005/12/01 or later. 22 | %% 23 | %% This package is still under development and may be replaced with 24 | %% a new version which provides enhanced functionality. 25 | %% 26 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 27 | 28 | \NeedsTeXFormat{LaTeX2e} 29 | \ProvidesPackage{dtklogos}[2014/11/15 v2.2 LaTeX wrapper for `hologo' (RN,HV)] 30 | 31 | \DeclareOption*{\PassOptionsToPackage\CurrentOption{color}} 32 | \ProcessOptions\relax 33 | 34 | \RequirePackage{ifpdf} 35 | 36 | \providecommand*{\exTeX}{% 37 | \textrm{% das Logo grunds^^e4tzlich serifenbehaftet 38 | \ensuremath{\textstyle\varepsilon_{\kern-0.15em\mathcal{X}}}% 39 | \kern-.15em\TeX 40 | }% 41 | } 42 | 43 | \providecommand\eV{e.V\kern-0.18em\@ifnextchar.{}{.}\kern0.18em} 44 | \providecommand\dante{\mbox{DANTE~\eV}} 45 | \providecommand\Dante{DANTE, 46 | Deutschsprachige Anwendervereinigung \TeX~\eV} 47 | \providecommand\DTK{Die \TeX\-ni\-sche Ko\-m{\"o}\-die} 48 | \providecommand\LaTeXe{% 49 | \LaTeX{}\kern.05em2$_{\textstyle\varepsilon}$} 50 | \providecommand\PS{Post\-Script} 51 | \providecommand\TUG{\TeX{} Users Group} 52 | \providecommand\TUGboat{\textsl{TUGboat}} 53 | \let\DANTE\dantelogo 54 | \ifpdf 55 | \providecommand\ThanhVN{H\`an Th\^e\protect\llap{\raise 0.5ex\hbox{\'{}}}} 56 | \providecommand\Thanh{H\`an Th\^e\protect\llap{\raise 0.5ex\hbox{\'{\relax}}} Th\`anh} 57 | \else 58 | \def\ThanhVN{H\`an Th\textcircumacute{e}\protect\llap{\raise 0.5ex\hbox{\'{}}}} 59 | \def\Thanh{H\`an~Th\textcircumacute{e}\llap{\raise 0.5ex\hbox{\'{}}}~Th\`anh} 60 | \fi 61 | \def\ThanhNN{Th\`anh} 62 | \def\pgf/tikz{\textsf{pgf/Ti\textit{k}Z}} 63 | \def\TeXLive{\TeX{}Live} 64 | 65 | \RequirePackage{hologo} 66 | 67 | \endinput 68 | %% End of file `dtklogos.sty'. 69 | -------------------------------------------------------------------------------- /get_texmf_dir.sh: -------------------------------------------------------------------------------- 1 | #!/bin/bash 2 | 3 | ############################################################################### 4 | # 5 | # A shell script used to get the local texmf directory. 6 | # 7 | # Copyright (C) 2013 Haixing Hu, 8 | # Department of Computer Science and Technology, Nanjing University. 9 | # 10 | # Home Page of the Project: https://github.com/Haixing-Hu/nju-thesis 11 | # 12 | ############################################################################### 13 | 14 | TEXMF_DIR=$(kpsewhich --show-path=ls-R | tr : '\n' | grep 'texmf-local' | head -n 1); 15 | if [[ ${TEXMF_DIR} == "" ]]; then 16 | TEXMF_DIR=$(kpsewhich --show-path=ls-R | tr : '\n' | grep 'local' | head -n 1); 17 | fi 18 | if [[ ${TEXMF_DIR} == "" ]]; then 19 | TEXMF_DIR=$(kpsewhich --show-path=ls-R | tr : '\n' | head -n 1); 20 | fi 21 | echo ${TEXMF_DIR}; 22 | -------------------------------------------------------------------------------- /jnuname.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/xen0n/JNUthesis/ebccab3730fdc2540e8e5a54629b11bf73b370ed/jnuname.pdf -------------------------------------------------------------------------------- /jnuthesis.cfg: -------------------------------------------------------------------------------- 1 | %% 2 | %% This is file `jnuthesis.cfg', 3 | %% generated with the docstrip utility. 4 | %% 5 | %% The original source files were: 6 | %% 7 | %% jnuthesis.dtx (with options: `cfg') 8 | %% This is a generated file. 9 | %% 10 | %% Copyright (C) 2013-2016, Haixing Hu. 11 | %% Department of Computer Science and Technology, Nanjing University. 12 | %% 13 | %% Home Page of the Project: http://haixing-hu.github.io/nju-thesis/ 14 | %% 15 | %% It may be distributed and/or modified under the conditions of the LaTeX Project 16 | %% Public License, either version 1.2 of this license or (at your option) any 17 | %% later version. The latest version of this license is in 18 | %% 19 | %% http://www.latex-project.org/lppl.txt 20 | %% 21 | %% and version 1.2 or later is part of all distributions of LaTeX version 22 | %% 1999/12/01 or later. 23 | %% 24 | %% This is the configuration file of the njuthesis package with XeLaTeX. 25 | \ProvidesFile{jnuthesis.cfg} 26 | %% {\jnuthesis}所遵循的江南大学研究生院的要求如下： 27 | %% \begin{itemize} 28 | %% \item \textsl{江南大学硕士答辩流程及相关材料下载}，\\ 29 | %% \url{http://gs.nju.edu.cn/content/xw/ss3.htm} 30 | %% \item \textsl{江南大学博士答辩流程及相关材料下载}，\\ 31 | %% \url{http://gs.nju.edu.cn/content/xw/bs3.htm} 32 | %% \item \textsl{江南大学博士(硕士)学位论文编写格式规定(试行)}\\ 33 | %% \url{http://grawww.nju.edu.cn/content/xw/lwgf.doc} 34 | %% \end{itemize} 35 | \RequirePackage{etoolbox} 36 | \RequirePackage{xstring} 37 | \RequirePackage{xifthen} 38 | \RequirePackage{xparse} 39 | \newcommand*{\jnut@cap@abstractname}{摘　要} 40 | \newcommand*{\jnut@cap@contentsname}{目　录} 41 | \newcommand*{\jnut@cap@contentsname@bachelorhead}{目录} 42 | \newcommand*{\jnut@cap@revisionhistory}{修订历史} 43 | \newcommand*{\jnut@cap@listfigurename}{插图清单} 44 | \newcommand*{\jnut@cap@listtablename}{附表清单} 45 | \newcommand*{\jnut@cap@listsymbolname}{符号清单} 46 | \newcommand*{\jnut@cap@listequationname}{公式清单} 47 | \newcommand*{\jnut@cap@equationname}{公式} 48 | \newcommand*{\jnut@cap@bibname}{参考文献} 49 | \newcommand*{\jnut@cap@glossaryname}{术\hspace{0.5em}语\hspace{0.5em}表} 50 | \newcommand*{\jnut@cap@indexname}{索　引} 51 | \newcommand*{\jnut@cap@figurename}{图} 52 | \newcommand*{\jnut@cap@tablename}{表} 53 | \newcommand*{\jnut@cap@preface}{前　言} 54 | \newcommand*{\jnut@cap@acknowledgementname}{致　谢} 55 | \newcommand*{\jnut@cap@appendixname}{附录\arabic{chapter}} 56 | \newcommand*{\jnut@cap@appendixname@head}{附录} 57 | \newcommand*{\jnut@cap@chaptername}{% 58 | \if@mainmatter{第{\ifjnut@bachelor\arabic{chapter}\else\CJKnumber{\arabic{chapter}}\fi}章}\fi% 59 | } 60 | \newcommand*{\jnut@cap@definition}{定义} 61 | \newcommand*{\jnut@cap@notation}{记号} 62 | \newcommand*{\jnut@cap@theorem}{定理} 63 | \newcommand*{\jnut@cap@lemma}{引理} 64 | \newcommand*{\jnut@cap@corollary}{推论} 65 | \newcommand*{\jnut@cap@proposition}{命题} 66 | \newcommand*{\jnut@cap@fact}{事实} 67 | \newcommand*{\jnut@cap@assumption}{假设} 68 | \newcommand*{\jnut@cap@conjecture}{猜想} 69 | \newcommand*{\jnut@cap@hypothesis}{假说} 70 | \newcommand*{\jnut@cap@axiom}{公理} 71 | \newcommand*{\jnut@cap@postulate}{公设} 72 | \newcommand*{\jnut@cap@principle}{定律} 73 | \newcommand*{\jnut@cap@problem}{问题} 74 | \newcommand*{\jnut@cap@exercise}{练习} 75 | \newcommand*{\jnut@cap@example}{例} 76 | \newcommand*{\jnut@cap@remark}{评注} 77 | \newcommand*{\jnut@cap@proof}{证明} 78 | \newcommand*{\jnut@cap@solution}{解} 79 | \newcommand*{\jnut@cap@algorithm}{算法} 80 | \newcommand*{\jnut@cap@case}{情况} 81 | \newcommand*{\jnut@cap@subcase}{子情况} 82 | \newcommand*{\jnut@cap@step}{步骤} 83 | \newcommand*{\jnut@cap@substep}{子步骤} 84 | \newcommand*{\jnut@cap@year}{年} 85 | \newcommand*{\jnut@cap@month}{月} 86 | \newcommand*{\jnut@cap@day}{日} 87 | \newcommand*{\jnut@cap@to}{至} 88 | \newcommand*{\jnut@cap@phd}{博士} 89 | \newcommand*{\jnut@cap@master}{硕士} 90 | \newcommand*{\jnut@cap@bachelor}{学士} 91 | \newcommand*{\jnut@cap@en@phd}{Doctor of Philosophy} 92 | \newcommand*{\jnut@cap@en@master}{Master} 93 | \newcommand*{\jnut@cap@en@bachelor}{Bachelor} 94 | \newcommand*{\jnut@cap@nlc}{国家图书馆封面} 95 | \newcommand*{\jnut@cap@nlc@classification}{分类号} 96 | \newcommand*{\jnut@cap@nlc@securitylevel}{密级} 97 | \newcommand*{\jnut@cap@nlc@udc}{UDC} 98 | \newcommand*{\jnut@cap@nlc@title}{% 99 | 学\hspace{1em}位\hspace{1em}论\hspace{1em}文% 100 | } 101 | \newcommand*{\jnut@cap@nlc@quotetitle}{（题名和副题名）} 102 | \newcommand*{\jnut@cap@nlc@author}{（作者姓名）} 103 | \newcommand*{\jnut@cap@nlc@supervisor}{% 104 | 指导教师姓名、职务、职称、学位、单位名称及地址% 105 | } 106 | \newcommand*{\jnut@cap@nlc@degree}{申请学位级别} 107 | \newcommand*{\jnut@cap@nlc@major}{专业名称} 108 | \newcommand*{\jnut@cap@nlc@submitdate}{论文提交日期} 109 | \newcommand*{\jnut@cap@nlc@defenddate}{论文答辩日期} 110 | \newcommand*{\jnut@cap@nlc@institute}{学位授予单位和日期} 111 | \newcommand*{\jnut@cap@nlc@chairman}{答辩委员会主席：} 112 | \newcommand*{\jnut@cap@nlc@reviwer}{评阅人：} 113 | \newcommand*{\jnut@cap@nlc@openlevel}{公开} 114 | \newcommand*{\jnut@cap@nlc@controllevel}{限制} 115 | \newcommand*{\jnut@cap@nlc@confidentiallevel}{秘密} 116 | \newcommand*{\jnut@cap@nlc@clasifiedlevel}{机密} 117 | \newcommand*{\jnut@cap@nlc@mostconfidentiallevel}{绝密} 118 | \newcommand*\jnut@circled[1]{\tikz[baseline=(char.base)]{ 119 | \node[shape=circle,draw,inner sep=1pt] (char) {#1};}} 120 | \newcommand*{\jnut@cap@cover}{中文封面} 121 | \newcommand*{\jnut@cap@cover@prodegree@fullday}{全日制专业学位} 122 | \newcommand*{\jnut@cap@cover@prodegree@maybe}{\ifjnut@prodegree\jnut@cap@cover@prodegree@fullday\fi} 123 | \newcommand*{\jnut@cap@cover@thesis}{\jnut@cap@cover@prodegree@maybe{\jnut@value@degree}学位论文} 124 | \newcommand*{\jnut@cap@cover@bachelorthesis@normal}{本科生毕业设计（论文）} 125 | \newcommand*{\jnut@cap@cover@bachelorthesis@related}{毕业设计（论文）} 126 | \newcommand*{\jnut@cap@cover@bachelorthesis@related@b}{相关资料} 127 | \newcommand*{\jnut@cap@cover@bachelorthesis@translation@b}{外文资料翻译} 128 | \newcommand*{\jnut@cap@cover@bachelorthesis@translation@c}{及原文} 129 | \newcommand*{\jnut@cap@cover@bachelorthesis@coursework@a}{《{\jnut@value@coursename}》} 130 | \newcommand*{\jnut@cap@cover@bachelorthesis@coursework@b}{课程设计} 131 | \newcommand*{\jnut@cap@cover@masterthesis@blindreview}{{\jnut@cap@cover@thesis}抽检封面} 132 | \newcommand*{\jnut@cap@cover@apply}{} 133 | \newcommand*{\jnut@cap@cover@title}{题　　　　目} 134 | \newcommand*{\jnut@cap@cover@bachelortitle}{题目：} 135 | \newcommand*{\jnut@cap@cover@entitle}{英文并列题目} 136 | \newcommand*{\jnut@cap@cover@blindreview@number@a}{盲审论文编号} 137 | \newcommand*{\jnut@cap@cover@blindreview@number@b}{[由学位办填写]} 138 | \newcommand*{\jnut@cap@cover@author}{研 　究 　生} 139 | \newcommand*{\jnut@cap@cover@bachelorauthor}{学生姓名} 140 | \newcommand*{\jnut@cap@cover@bachelorstudentnum}{学　　号} 141 | \newcommand*{\jnut@cap@cover@supervisor}{导　　　　师} 142 | \newcommand*{\jnut@cap@cover@supervisor@prodegree@a}{导师~\jnut@circled{1}~姓名} 143 | \newcommand*{\jnut@cap@cover@supervisor@prodegree@b}{导师~\jnut@circled{2}~姓名} 144 | \newcommand*{\jnut@cap@cover@supervisor@prodegree@pos}{职　　　　称} 145 | \newcommand*{\jnut@cap@cover@bachelorsupervisor}{指导教师} 146 | \newcommand*{\jnut@cap@cover@major}{专　　　　业} 147 | \newcommand*{\jnut@cap@cover@major@prodegree}{专 业 名 称} 148 | \newcommand*{\jnut@cap@cover@bachelormajor}{专业} 149 | \newcommand*{\jnut@cap@cover@researchfield}{研 究 方 向} 150 | \newcommand*{\jnut@cap@cover@department}{院系} 151 | \newcommand*{\jnut@cap@cover@bachelordepartment}{学院} 152 | \newcommand*{\jnut@cap@cover@directormembers}{指导小组成员} 153 | \newcommand*{\jnut@cap@cover@degreedate}{学位授予日期} 154 | \newcommand*{\jnut@cap@cover@institute}{江南大学} 155 | \newcommand*{\jnut@cap@coverback@supervisor}{指导教师} 156 | \newcommand*{\jnut@cap@coverback@studentnum}{学号} 157 | \newcommand*{\jnut@cap@coverback@defenddate}{论文答辩日期} 158 | \newcommand*{\jnut@cap@coverback@sign}{\hspace{10em}（签字）} 159 | \newcommand*{\jnut@cap@cover@en@by}{by} 160 | \newcommand*{\jnut@cap@cover@en@in}{in} 161 | \newcommand*{\jnut@cap@cover@en@supervisor}{Supervised by} 162 | \newcommand*{\jnut@cap@cover@en@statement}{% 163 | A dissertation submitted to\\ 164 | the graduate school of {\jnut@value@en@institute}\\ 165 | in partial fulfilment of the requirements for the degree of\\ 166 | {\textsc{\jnut@value@en@degree}}\\ 167 | in\\ 168 | {\jnut@value@en@major} 169 | } 170 | \newcommand*{\jnut@cap@abstract}{中文摘要} 171 | \newcommand*{\jnut@cap@abstract@abstractname}{摘　要} 172 | \newcommand*{\jnut@cap@abstract@abstractname@bachelorhead}{摘要} 173 | \newcommand*{\jnut@cap@abstract@bachelordesign}{设计总说明} 174 | \newcommand*{\jnut@cap@abstract@keywordsname}{关键词} 175 | \newcommand*{\jnut@cap@abstract@en}{英文摘要} 176 | \newcommand*{\jnut@cap@abstract@en@abstractname@bachelor}{ABSTRACT} 177 | \newcommand*{\jnut@cap@abstract@en@abstractname@bachelorhead}{Abstract} 178 | \newcommand*{\jnut@cap@abstract@en@abstractname@other}{Abstract} 179 | \newcommand*{\jnut@cap@abstract@en@abstractname}{% 180 | \ifjnut@bachelor% 181 | \jnut@cap@abstract@en@abstractname@bachelor% 182 | \else% 183 | \jnut@cap@abstract@en@abstractname@other% 184 | \fi% 185 | } 186 | \newcommand*{\jnut@cap@abstract@en@keywordsname}{Keywords} 187 | %% TODO: 完善此处格式 188 | \newcommand*{\jnut@cap@resume@chaptername}{附 录: 作者在攻读{\jnut@value@degree}学位期间发表的论文} 189 | \newcommand*{\jnut@cap@resume@authorinfo}{基本信息} 190 | \newcommand*{\jnut@cap@resume@education}{教育背景} 191 | \newcommand*{\jnut@cap@resume@publications}{% 192 | 攻读{\jnut@value@degree}学位期间完成的学术成果% 193 | } 194 | \newcommand*{\jnut@cap@resume@projects}{% 195 | 攻读{\jnut@value@degree}学位期间参与的科研课题% 196 | } 197 | \newcommand*{\jnut@cap@institute@name}{jnuname} 198 | \newcommand*{\jnut@value@nlc@classification}{(分类)} 199 | \newcommand*{\jnut@value@nlc@securitylevel}{\openlevel} 200 | \newcommand*{\jnut@value@nlc@udc}{} 201 | \newcommand*{\jnut@value@nlc@titlea}{\jnut@value@title} 202 | \newcommand*{\jnut@value@nlc@titleb}{} 203 | \newcommand*{\jnut@value@nlc@titlec}{} 204 | \newcommand*{\jnut@value@nlc@supervisorinfo}{% 205 | (导师的职务、职称、学位、单位名称及地址)% 206 | } 207 | \newcommand*{\jnut@value@nlc@chairman}{(答辩主席)} 208 | \newcommand*{\jnut@value@nlc@reviewera}{(评审人)} 209 | \newcommand*{\jnut@value@nlc@reviewerb}{} 210 | \newcommand*{\jnut@value@nlc@reviewerc}{} 211 | \newcommand*{\jnut@value@nlc@reviewerd}{} 212 | \ifjnut@phd 213 | \newcommand*{\jnut@value@degree}{\jnut@cap@phd} 214 | \else 215 | \ifjnut@master 216 | \newcommand*{\jnut@value@degree}{\jnut@cap@master} 217 | \else 218 | \ifjnut@bachelor 219 | \newcommand*{\jnut@value@degree}{\jnut@cap@bachelor} 220 | \else 221 | \ClassError{jnuthesis}{No degree was selected.}{} 222 | \fi 223 | \fi 224 | \fi 225 | \newcommand*{\jnut@value@coursename}{(本科课程设计课程名称)} 226 | \newcommand*{\jnut@value@title}{(论文标题)} 227 | \newcommand*{\jnut@value@titlea}{(论文长标题第一行)} 228 | \newcommand*{\jnut@value@titleb}{(论文长标题第二行)} 229 | \newcommand*{\jnut@value@author}{(作者姓名)} 230 | \newcommand*{\jnut@value@telphone}{(作者电话号码)} 231 | \newcommand*{\jnut@value@email}{(作者电子邮件)} 232 | \newcommand*{\jnut@value@studentnum}{XXXXXXXX} 233 | \newcommand*{\jnut@value@grade}{XXXX} 234 | \newcommand*{\jnut@value@supervisor}{(导师姓名)} 235 | \newcommand*{\jnut@value@supervisorpos}{(导师职称)} 236 | \newcommand*{\jnut@value@supervisorb}{(第二行导师姓名)} 237 | \newcommand*{\jnut@value@supervisorbpos}{(第二行导师职称)} 238 | \newcommand*{\jnut@value@supervisortelphone}{(导师电话号码)} 239 | \newcommand*{\jnut@value@major}{(作者专业)} 240 | \newcommand*{\jnut@value@researchfield}{(作者研究方向)} 241 | \newcommand*{\jnut@value@department}{(作者所属院系)} 242 | \newcommand*{\jnut@value@directormembers}{(指导小组成员)} 243 | \newcommand*{\jnut@value@degreedate}{(学位授予日期)} 244 | \newcommand*{\jnut@value@bachelordegreeyear}{\number\year} 245 | \newcommand*{\jnut@value@bachelordegreemonth}{\number\month} 246 | \newcommand*{\jnut@value@institute}{江南大学} 247 | \newcommand*{\jnut@value@submitdate}{xxxx年xx月xx日} 248 | \newcommand*{\jnut@value@defenddate}{xxxx年xx月xx日} 249 | \newcommand*{\jnut@value@date}{% 250 | \CJKdigits{\number\year}年\CJKnumber{\number\month}月% 251 | } 252 | \ifjnut@phd 253 | \newcommand*{\jnut@value@en@degree}{\jnut@cap@en@phd} 254 | \else 255 | \ifjnut@master 256 | \newcommand*{\jnut@value@en@degree}{\jnut@cap@en@master} 257 | \else 258 | \ifjnut@bachelor 259 | \newcommand*{\jnut@value@en@degree}{\jnut@cap@en@bachelor} 260 | \else 261 | \ClassError{jnuthesis}{No degree was selected.}{} 262 | \fi 263 | \fi 264 | \fi 265 | \newcommand*{\jnut@value@en@titlea}{(English Title of Thesis)} 266 | \newcommand*{\jnut@value@en@titleb}{(English Title of Thesis)} 267 | \newcommand*{\jnut@value@en@author}{(Author's Name)} 268 | \newcommand*{\jnut@value@en@supervisor}{Professor (Supervisor's Name)} 269 | \newcommand*{\jnut@value@en@major}{Author's Major} 270 | \newcommand*{\jnut@value@en@department}{(Department's Name)} 271 | \newcommand*{\jnut@value@en@institute}{Nanjing University} 272 | \newcommand*{\jnut@value@en@date}{ 273 | \ifcase\month\or 274 | January\or 275 | February\or 276 | March\or 277 | April\or 278 | May\or 279 | June\or 280 | July\or 281 | August\or 282 | September\or 283 | October\or 284 | November\or 285 | December\fi 286 | \number\day, \number\year% 287 | } 288 | \newcommand*{\jnut@value@abstract@titlea}{\jnut@value@title} 289 | \newcommand*{\jnut@value@abstract@titleb}{} 290 | \newcommand*{\jnut@value@abstract@keywords}{} 291 | \newcommand*{\jnut@value@abstract@en@titlea}{\jnut@value@en@titlea} 292 | \newcommand*{\jnut@value@abstract@en@titleb}{\jnut@value@en@titleb} 293 | \newcommand*{\jnut@value@abstract@en@keywords}{} 294 | \newcommand*{\jnut@zhfn@songti@win}{SimSun} 295 | \newcommand*{\jnut@zhfn@heiti@win}{SimHei} 296 | \newcommand*{\jnut@zhfn@kaishu@win}{KaiTi} 297 | \newcommand*{\jnut@zhfn@fangsong@win}{FangSong} 298 | \newcommand*{\jnut@enfn@main@win}{Times New Roman} 299 | \newcommand*{\jnut@enfn@sans@win}{Arial} 300 | \newcommand*{\jnut@enfn@mono@win}{Courier New} 301 | \newcommand*{\jnut@zhfn@songti@linux}{SimSun} 302 | \newcommand*{\jnut@zhfn@heiti@linux}{SimHei} 303 | \newcommand*{\jnut@zhfn@kaishu@linux}{KaiTi} 304 | \newcommand*{\jnut@zhfn@fangsong@linux}{FangSong} 305 | \newcommand*{\jnut@enfn@main@linux}{Times New Roman} 306 | \newcommand*{\jnut@enfn@sans@linux}{Arial} 307 | \newcommand*{\jnut@enfn@mono@linux}{Courier New} 308 | \newcommand*{\jnut@zhfn@songti@mac}{STSong} 309 | \newcommand*{\jnut@zhfn@heiti@mac}{STHeiti} 310 | \newcommand*{\jnut@zhfn@kaishu@mac}{STKaiti} 311 | \newcommand*{\jnut@zhfn@fangsong@mac}{STFangsong} 312 | \newcommand*{\jnut@enfn@main@mac}{Times} 313 | \newcommand*{\jnut@enfn@sans@mac}{Helvetica} 314 | \newcommand*{\jnut@enfn@mono@mac}{Courier} 315 | \newcommand*{\jnut@zhfn@songti@adobe}{Adobe Song Std} 316 | \newcommand*{\jnut@zhfn@heiti@adobe}{Adobe Heiti Std} 317 | \newcommand*{\jnut@zhfn@kaishu@adobe}{Adobe Kaiti Std} 318 | \newcommand*{\jnut@zhfn@fangsong@adobe}{Adobe Fangsong Std} 319 | \newcommand*{\jnut@enfn@main@adobe}{Times New Roman} 320 | \newcommand*{\jnut@enfn@sans@adobe}{Arial} 321 | \newcommand*{\jnut@enfn@mono@adobe}{Courier New} 322 | \newcommand*{\jnut@zhfn@songti@source}{Source Han Serif CN} 323 | \newcommand*{\jnut@zhfn@heiti@source}{Source Han Sans CN} 324 | \newcommand*{\jnut@zhfn@kaishu@source}{AR PL UKai CN} 325 | \newcommand*{\jnut@zhfn@fangsong@source}{\jnut@zhfn@fangsong@adobe} 326 | \newcommand*{\jnut@enfn@main@source}{\jnut@enfn@main@adobe} 327 | \newcommand*{\jnut@enfn@sans@source}{\jnut@enfn@sans@adobe} 328 | \newcommand*{\jnut@enfn@mono@source}{\jnut@enfn@mono@adobe} 329 | \endinput 330 | %% 331 | %% End of file `jnuthesis.cfg'. 332 | -------------------------------------------------------------------------------- /jnuthesis.ins: -------------------------------------------------------------------------------- 1 | %% 2 | %% Copyright (C) 2013-2016, Haixing Hu. 3 | %% Department of Computer Science and Technology, Nanjing University. 4 | %% 5 | %% This file may be distributed and/or modified under the conditions of the 6 | %% LaTeX Project Public License, either version 1.2 of this license or (at your 7 | %% option) any later version. The latest version of this license is in: 8 | %% 9 | %% http://www.latex-project.org/lppl.txt 10 | %% 11 | %% and version 1.2 or later is part of all distributions of LaTeX version 12 | %% 1999/12/01 or later. 13 | %% 14 | %% Home Page of the Project: http://haixing-hu.github.io/nju-thesis/ 15 | %% 16 | %% ---------------- Start of the docstrip commands -------------------- 17 | 18 | \input docstrip 19 | 20 | \askforoverwritefalse 21 | %% \askonceonly 22 | %% \showprogress 23 | \keepsilent 24 | 25 | \usedir{tex/latex/jnuthesis} 26 | 27 | \preamble 28 | This is a generated file. 29 | 30 | Copyright (C) 2013-2016, Haixing Hu. 31 | Department of Computer Science and Technology, Nanjing University. 32 | 33 | Home Page of the Project: http://haixing-hu.github.io/nju-thesis/ 34 | 35 | It may be distributed and/or modified under the conditions of the LaTeX Project 36 | Public License, either version 1.2 of this license or (at your option) any 37 | later version. The latest version of this license is in 38 | 39 | http://www.latex-project.org/lppl.txt 40 | 41 | and version 1.2 or later is part of all distributions of LaTeX version 42 | 1999/12/01 or later. 43 | 44 | To produce the documentation run the original source files ending with `.dtx' 45 | through LaTeX. 46 | \endpreamble 47 | 48 | \declarepreamble\cfgpreamble 49 | This is a generated file. 50 | 51 | Copyright (C) 2013-2016, Haixing Hu. 52 | Department of Computer Science and Technology, Nanjing University. 53 | 54 | Home Page of the Project: http://haixing-hu.github.io/nju-thesis/ 55 | 56 | It may be distributed and/or modified under the conditions of the LaTeX Project 57 | Public License, either version 1.2 of this license or (at your option) any 58 | later version. The latest version of this license is in 59 | 60 | http://www.latex-project.org/lppl.txt 61 | 62 | and version 1.2 or later is part of all distributions of LaTeX version 63 | 1999/12/01 or later. 64 | 65 | This is the configuration file of the njuthesis package with XeLaTeX. 66 | \endpreamble 67 | 68 | \declarepreamble\dtxstypreamble 69 | This is a generated file. 70 | 71 | Copyright (C) 2013-2016, Haixing Hu. 72 | Department of Computer Science and Technology, Nanjing University. 73 | 74 | Home Page of the Project: http://haixing-hu.github.io/nju-thesis/ 75 | 76 | It may be distributed and/or modified under the conditions of the LaTeX Project 77 | Public License, either version 1.2 of this license or (at your option) any 78 | later version. The latest version of this license is in 79 | 80 | http://www.latex-project.org/lppl.txt 81 | 82 | and version 1.2 or later is part of all distributions of LaTeX version 83 | 1999/12/01 or later. 84 | 85 | This is the manual-style file of the njuthesis package with XeLaTeX. 86 | \endpreamble 87 | 88 | \generate{\file{\jobname.cls}{\from{\jobname.dtx}{cls}}% 89 | \usepreamble\cfgpreamble% 90 | \file{\jobname.cfg}{\from{\jobname.dtx}{cfg}}% 91 | \usepreamble\dtxstypreamble% 92 | \file{dtx-style.sty}{\from{\jobname.dtx}{dtx-style}}% 93 | } 94 | 95 | \ifToplevel{ 96 | \Msg{***********************************************************} 97 | \Msg{*} 98 | \Msg{* To finish the installation you have to move the following} 99 | \Msg{* files into a directory searched by TeX:} 100 | \Msg{*} 101 | \Msg{* The recommended directory is TEXMF/tex/latex/jnuthesis} 102 | \Msg{*} 103 | \Msg{* \space\space jnuthesis.cls} 104 | \Msg{* \space\space jnuthesis.cfg} 105 | \Msg{*} 106 | \Msg{* To produce the documentation run the file} 107 | \Msg{* `jnuthesis.dtx' through LaTeX.} 108 | \Msg{*} 109 | \Msg{* Happy TeXing} 110 | \Msg{***********************************************************} 111 | } 112 | 113 | \endbatchfile 114 | -------------------------------------------------------------------------------- /master-blind.tex: -------------------------------------------------------------------------------- 1 | %% 使用 jnuthesis 文档类生成南京大学学位论文的示例文档 2 | %% 3 | %% 作者：胡海星，starfish (at) gmail (dot) com 4 | %% 项目主页: http://haixing-hu.github.io/jnu-thesis/ 5 | %% 6 | %% 本样例文档中用到了吕琦同学的博士论文的提高和部分内容，在此对他表示感谢。 7 | %% 8 | \documentclass[master,sourcefonts,blindreview]{jnuthesis} 9 | %% jnuthesis 文档类的可选参数有： 10 | %% nobackinfo 取消封二页导师签名信息。注意，按照南大的规定，是需要签名页的。 11 | %% phd/master/bachelor 选择博士/硕士/学士论文 12 | 13 | % 引用公共导言 14 | \input{master-preamble} 15 | 16 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 17 | \begin{document} 18 | 19 | % 引用公共正文 20 | \input{master-contents} 21 | 22 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 23 | % 书籍附件 24 | \backmatter 25 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 26 | % 作者简历与科研成果页，应放在backmatter之后 27 | \begin{resume} 28 | % 论文作者在攻读学位期间所发表的文章的列表，按发表日期从近到远排列。 29 | % NOTE: 对于盲审版论文，此处请手工隐去作者信息！ 30 | \begin{publications} 31 | \item 1st Author, ``Voting-on-Grid Clustering for Secure 32 | Localization in Wireless Sensor Networks,'' in \textsl{Proc. IEEE International 33 | Conference on Communications (ICC) 2010}, May. 2010. 34 | \item 1st Author, ``Protecting Source Location Privacy 35 | in Wireless Sensor Networks with Data Aggregation,'' in \textsl{Proc. 6th 36 | International Conference on Ubiquitous Intelligence and Computing (UIC) 37 | 2009}, Oct. 2009. 38 | \end{publications} 39 | \end{resume} 40 | 41 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 42 | \end{document} 43 | -------------------------------------------------------------------------------- /master-contents.tex: -------------------------------------------------------------------------------- 1 | % 制作中文封面 2 | \maketitle 3 | 4 | % 输出独创性声明与论文使用授权说明页面 5 | \makeoriginalitypage 6 | 7 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 8 | % 开始前言部分 9 | \frontmatter 10 | 11 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 12 | % 论文的中文摘要 13 | \begin{abstract} 14 | 复杂网络的研究可上溯到20世纪60年代对ER网络的研究。90年后代随着Internet 15 | 的发展，以及对人类社会、通信网络、生物网络、社交网络等各领域研究的深入， 16 | 发现了小世界网络和无尺度现象等普适现象与方法。对复杂网络的定性定量的科 17 | 学理解和分析，已成为如今网络时代科学研究的一个重点课题。 18 | 19 | 在此背景下，由于云计算时代的到来，本文针对面向云计算的数据中心网络基础 20 | 设施设计中的若干问题，进行了几方面的研究。……………… 21 | % 中文关键词。关键词之间用中文全角分号隔开，末尾无标点符号。 22 | \keywords{小世界理论；网络模型；数据中心} 23 | \end{abstract} 24 | 25 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 26 | % 论文的英文摘要 27 | \begin{englishabstract} 28 | \blindtext 29 | % 英文关键词。关键词之间用英文半角逗号隔开，末尾无符号。 30 | \englishkeywords{Small World, Network Model, Data Center} 31 | \end{englishabstract} 32 | 33 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 34 | % 生成论文目次 35 | \tableofcontents 36 | 37 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 38 | % 开始正文部分 39 | \mainmatter 40 | 41 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 42 | % 学位论文的正文应以《绪论》作为第一章 43 | \chapter{绪论}\label{chapter_introduction} 44 | \section{研究背景} 45 | 46 | 在分布式网络领域，沿着高性能集群、普世计算、网格计算的方向，现已走入云 47 | 计算时代。 48 | 49 | 云计算对信息技术架构造成了越来越大的影响。例如，借助Amazon EC2云平台， 50 | 用户借助其基础设施，可以十分方便的部署各类应用，以支持企业服务需求。用 51 | 户可以按需购买计算资源，网络带宽，存储空间等各类资源以支持他们的业务需 52 | 求，并在业务完成之后迅速的归还这些资源。通过云技术，用户可以集中在他们 53 | 擅长的核心业务之中，而不会被诸如硬件购买、安装系统、网络设置、备份和安 54 | 全等等问题干扰。 55 | 56 | 与此同时，随着计算机的普及化和微型化，现在的手持设备拥有不输于7年前台式 57 | 机的处理能力。在网络时代面前，智能终端广泛普及，每个人都可成为信息源。 58 | 在信息爆炸的时代，数据挖掘、机器学习、金融分析和模拟等行业中不断涌现新 59 | 的需求，诸如针对用户行为和社会关系的挖掘进行广告精准投放，用户行为预测 60 | 等。为了支撑PB级尺度的数据规模，需要海量的计算节点，催生并不断促进了各 61 | 行各业对云计算基础设施的建设需求。 62 | 63 | 海量的数据需要海量的处理能力，然而海量的处理能力又需要高带宽的网络IO为 64 | 承载。作为云环境中最基础的一环，IaaS层在网络、存储、计算资源的分割这几 65 | 方面，承担起整个系统的基石。虽然并非必须，但一般来说，为考虑沙盘环境， 66 | 以及对资源的细粒度切割分配，IaaS通常会伴随着虚拟化技术的运用。虚拟化具 67 | 有许多与云计算切合的特点，例如，虚拟化可以屏蔽物理环境的差异，可在多物 68 | 理节点中进行无缝迁移，可对系统进行快照和还原。这些特点都与云计算时代所 69 | 追求的灵活性、高伸缩性、快速响应等特点而吻合。 70 | 71 | 在虚拟化实现方面，目前已取得了诸如ESXi，Xen，KVM等成熟成果。然而当虚拟 72 | 化扩大的一定规模，随着节点数目的增多，在网络方面将会面临一系列取舍的问 73 | 题。例如，基于二层交换的扁平网络，当节点数目上升到千数量级时，广播报文 74 | 将会极大的拖累网络性能，必须通过划分子网，通过三层路由等形式重新规划为 75 | 多层网络结构；另一方面，除了联通之外，还需要考虑ACL控制，负载均衡，外网 76 | 通讯等各类防火墙以及NAT规则的实现。这些复杂的网络配置，在一定程度上抵消 77 | 了虚拟机带来的灵活性。例如虽然虚拟机可根据需要动态迁移，但在迁移之后， 78 | 由于网络位置的变化需要重新进行网络参数配置。虽然虚拟机在迁移过程中系统 79 | 内部状态没有变化，但站在网络角度看，该虚拟节点跟关机重启没有区别。 80 | 81 | 针对上述问题，本文站在面向云计算时代的数据中心网络建设的角度，对网络模 82 | 型进行深入研究和探讨。通过改善二层交换网络的ARP机制来解决广播风暴问题， 83 | 引入比树形网络更为复杂的复杂网络理论，指导网络节点的互联模型。从而将网 84 | 络的复杂性隐藏在节点环境之外，在节点层面仅提供简单但巨大的二层交换扁平 85 | 网络。 86 | 87 | \section{研究目的与意义} 88 | \subsection{现有解决方法} 89 | \Blindtext 90 | \begin{table} 91 | \centering 92 | \begin{tabular}{cccp{38mm}} 93 | \toprule 94 | \textbf{文档域类型} & \textbf{Java类型} & \textbf{宽度(字节)} & \textbf{说明} \\ 95 | \midrule 96 | BOOLEAN & boolean & 1 & \\ 97 | CHAR & char & 2 & UTF-16字符 \\ 98 | BYTE & byte & 1 & 有符号8位整数 \\ 99 | SHORT & short & 2 & 有符号16位整数 \\ 100 | INT & int & 4 & 有符号32位整数 \\ 101 | LONG & long & 8 & 有符号64位整数 \\ 102 | STRING & String & 字符串长度 & 以UTF-8编码存储 \\ 103 | DATE & java.util.Date & 8 & 距离GMT时间1970年1月1日0点0分0秒的毫秒数 \\ 104 | BYTE\_ARRAY & byte$[]$ & 数组长度 & 用于存储二进制值 \\ 105 | BIG\_INTEGER & java.math.BigInteger & 和具体值有关 & 任意精度的长整数 \\ 106 | BIG\_DECIMAL & java.math.BigDecimal & 和具体值有关 & 任意精度的十进制实数 \\ 107 | \bottomrule 108 | \end{tabular} 109 | \caption{测试表格}\label{table:test1} 110 | \end{table} 111 | \Blindtext 112 | \subsection{现有问题与不足} 113 | 114 | 测试一下脚注\footnote{测试脚注}，测试一下脚注\footnote{测试脚注}，测试一下脚 115 | 注\footnote{测试脚注}，测试一下脚注\footnote{测试脚注}，测试一下脚注\footnote{测 116 | 试脚注}，测试一下脚注\footnote{测试脚注}，测试一下脚注\footnote{测试脚注}，测 117 | 试一下脚注\footnote{测试脚注}，测试一下脚注\footnote{测试脚注}，测试一下脚 118 | 注\footnote{测试脚注}。 119 | 120 | 测试一下引用\cite{newman2006structure}，连续引用 121 | \cite{newman2001random,aiello2000random,bollobas2001random}，另一个连续引用 122 | \cite{newman2001random,bollobas2001random,barabasi1999emergence}。测试一下带页码 123 | 的引用\cite[124--128]{erdHos1961strength}。 124 | 125 | 下面是一个项目列表： 126 | 127 | \begin{itemize} 128 | \item 这是第一项。这是第一项。 129 | \item 这是第二项。这是第二项。这是第二项。这是第二项。这是第二项。这是第二项。这 130 | 是第二项。这是第二项。这是第二项。这是第二项。这是第二项。 131 | \item 这是第三项。这是第三项。这是第三项。 132 | \begin{itemize} 133 | \item 测试第二层列表。测试第二层列表。 134 | \item 测试第二层列表。测试第二层列表。 135 | \begin{itemize} 136 | \item 测试第三层列表。测试第三层列表。 137 | \item 测试第三层列表。测试第三层列表。 138 | \end{itemize} 139 | \item 测试第二层列表。测试第二层列表。测试第二层列表。测试第二层列表。测试第二 140 | 层列表。 141 | \end{itemize} 142 | \item 这是第四项。这是第四项。这是第四项。 143 | \begin{enumerate} 144 | \item 测试第二层列表。测试第二层列表。测试第二层列表。测试第二层列表。测试第二 145 | 层列表。测试第二层列表。测试第二层列表。测试第二层列表。 146 | \item 测试第二层列表。测试第二层列表。 147 | \item 测试第二层列表。测试第二层列表。测试第二层列表。测试第二层列表。测试第二 148 | 层列表。 149 | \end{enumerate} 150 | \end{itemize} 151 | 152 | 下面是一个编号列表： 153 | 154 | \begin{enumerate} 155 | \item 这是第一项。这是第一项。这是第一项。这是第一项。这是第一项。这是第一项。这 156 | 是第一项。这是第一项。这是第一项。这是第一项。这是第一项。 157 | \item 这是第二项。这是第二项。 158 | \item 这是第三项。这是第三项。这是第三项。 159 | \begin{itemize} 160 | \item 测试第二层列表。测试第二层列表。 161 | \item 测试第二层列表。测试第二层列表。 162 | \item 测试第二层列表。测试第二层列表。测试第二层列表。测试第二层列表。测试第二 163 | 层列表。 164 | \end{itemize} 165 | \item 这是第四项。这是第四项。这是第四项。 166 | \begin{enumerate} 167 | \item 测试第二层列表。测试第二层列表。 168 | \begin{enumerate} 169 | \item 测试第三层列表。测试第三层列表。测试第三层列表。测试第三层列表。测试第三 170 | 层列表。测试第三层列表。 171 | \item 测试第三层列表。测试第三层列表。 172 | \item 测试第三层列表。测试第三层列表。测试第三层列表。 173 | \end{enumerate} 174 | \item 测试第二层列表。测试第二层列表。测试第二层列表。 175 | \end{enumerate} 176 | \end{enumerate} 177 | 178 | 下面是最多三层的阿拉伯数字列表: 179 | \begin{arabicenum} 180 | \item 第1项 181 | \item 第2项 182 | \begin{arabicenum} 183 | \item 第2.1项 184 | \item 第2.2项 185 | \begin{arabicenum} 186 | \item 第2.2.1项 187 | \item 第2.2.2项 188 | \item 第2.2.3项 189 | \end{arabicenum} 190 | \item 第2.3项 191 | \end{arabicenum} 192 | \item 第3项 193 | \end{arabicenum} 194 | 195 | 下面是最多两层的罗马数字列表: 196 | \begin{romanenum} 197 | \item 第1项 198 | \item 第2项 199 | \begin{romanenum} 200 | \item 第2.1项 201 | \item 第2.2项 202 | \item 第2.3项 203 | \end{romanenum} 204 | \item 第3项 205 | \end{romanenum} 206 | 207 | 下面是最多两层的小写字母列表: 208 | \begin{alphaenum} 209 | \item 第1项 210 | \item 第2项 211 | \begin{alphaenum} 212 | \item 第2.1项 213 | \item 第2.2项 214 | \item 第2.3项 215 | \end{alphaenum} 216 | \item 第3项 217 | \end{alphaenum} 218 | 219 | 下面是最多两层的情况列表: 220 | \begin{caseenum} 221 | \item 第1项 222 | \item 第2项 223 | \begin{caseenum} 224 | \item 第2.1项 225 | \item 第2.2项 226 | \item 第2.3项 227 | \end{caseenum} 228 | \item 第3项 229 | \end{caseenum} 230 | 231 | 下面是最多两层的步骤列表: 232 | \begin{stepenum} 233 | \item 第1项 234 | \item 第2项 235 | \begin{stepenum} 236 | \item 第2.1项 237 | \item 第2.2项 238 | \item 第2.3项 239 | \end{stepenum} 240 | \item 第3项 241 | \end{stepenum} 242 | 243 | 下面测试一下引用环境|quote|。下面测试一下引用环境|quote|。下面测试一下引用环境|quote|。 244 | 下面测试一下引用环境|quote|。下面测试一下引用环境|quote|。下面测试一下引用环境|quote|。 245 | 下面测试一下引用环境|quote|。下面测试一下引用环境|quote|。下面测试一下引用环境|quote|。 246 | 247 | \begin{quote} 248 | 这是一段引用。这是一段引用。这是一段引用。这是一段引用。这是一段引用。这是一段引用。 249 | 这是一段引用。这是一段引用。这是一段引用。这是一段引用。这是一段引用。这是一段引用。 250 | 这是一段引用。这是一段引用。这是一段引用。这是一段引用。这是一段引用。 251 | 252 | 这是一段引用。这是一段引用。这是一段引用。这是一段引用。这是一段引用。这是一段引用。 253 | 这是一段引用。这是一段引用。这是一段引用。 254 | 255 | 这是一段引用。这是一段引用。 256 | \end{quote} 257 | 258 | 下面测试一下引用环境|quotation|。下面测试一下引用环境|quotation|。 259 | 下面测试一下引用环境|quotation|。下面测试一下引用环境|quotation|。 260 | 下面测试一下引用环境|quotation|。下面测试一下引用环境|quotation|。 261 | 下面测试一下引用环境|quotation|。下面测试一下引用环境|quotation|。 262 | 下面测试一下引用环境|quotation|。 263 | 264 | \begin{quotation} 265 | 这是一段引用。这是一段引用。这是一段引用。这是一段引用。这是一段引用。这是一段引用。 266 | 这是一段引用。这是一段引用。这是一段引用。这是一段引用。这是一段引用。这是一段引用。 267 | 这是一段引用。这是一段引用。这是一段引用。这是一段引用。这是一段引用。 268 | 269 | 这是一段引用。这是一段引用。这是一段引用。这是一段引用。这是一段引用。这是一段引用。 270 | 这是一段引用。这是一段引用。这是一段引用。 271 | 272 | 这是一段引用。这是一段引用。 273 | \end{quotation} 274 | 275 | 引用结束。引用结束。引用结束。引用结束。引用结束。引用结束。引用结束。引用结束。引用结束。 276 | 引用结束。引用结束。引用结束。 277 | 278 | 测试一下定理环境。 279 | 280 | \begin{theorem}[测试定理] 281 | 测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下 282 | 定理环境。测试一下定理环境。测试一下定理环境。 283 | \end{theorem} 284 | \begin{proof} 285 | \blindtext 286 | \end{proof} 287 | 288 | \blindtext 289 | 290 | \begin{theorem} 291 | 测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下 292 | 定理环境。测试一下定理环境。测试一下定理环境。 293 | \end{theorem} 294 | \begin{proof} 295 | \blindtext 296 | \end{proof} 297 | 298 | \blindtext 299 | 300 | \begin{lemma} 301 | 测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下 302 | 定理环境。测试一下定理环境。测试一下定理环境。 303 | \end{lemma} 304 | \begin{proof} 305 | \blindtext 306 | \end{proof} 307 | 308 | \blindtext 309 | 310 | \begin{definition} 311 | 测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下 312 | 定理环境。测试一下定理环境。测试一下定理环境。 313 | \end{definition} 314 | 315 | \blindtext 316 | 317 | \begin{corollary} 318 | 测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下 319 | 定理环境。测试一下定理环境。测试一下定理环境。 320 | \end{corollary} 321 | 322 | \blindtext 323 | 324 | \begin{proposition} 325 | 测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下 326 | 定理环境。测试一下定理环境。测试一下定理环境。 327 | \end{proposition} 328 | 329 | \blindtext 330 | 331 | \begin{fact} 332 | 测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下 333 | 定理环境。测试一下定理环境。测试一下定理环境。 334 | \end{fact} 335 | 336 | \blindtext 337 | 338 | \begin{assumption} 339 | 测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下 340 | 定理环境。测试一下定理环境。测试一下定理环境。 341 | \end{assumption} 342 | 343 | \blindtext 344 | 345 | \begin{conjecture} 346 | 测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下 347 | 定理环境。测试一下定理环境。测试一下定理环境。 348 | \end{conjecture} 349 | 350 | \blindtext 351 | 352 | \begin{hypothesis} 353 | 测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下 354 | 定理环境。测试一下定理环境。测试一下定理环境。 355 | \end{hypothesis} 356 | 357 | \blindtext 358 | 359 | \begin{axiom} 360 | 测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下 361 | 定理环境。测试一下定理环境。测试一下定理环境。 362 | \end{axiom} 363 | 364 | \blindtext 365 | 366 | \begin{postulate} 367 | 测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下 368 | 定理环境。测试一下定理环境。测试一下定理环境。 369 | \end{postulate} 370 | 371 | \blindtext 372 | 373 | \begin{principle} 374 | 测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下 375 | 定理环境。测试一下定理环境。测试一下定理环境。 376 | \end{principle} 377 | 378 | \blindtext 379 | 380 | \begin{problem} 381 | 测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下 382 | 定理环境。测试一下定理环境。测试一下定理环境。 383 | \end{problem} 384 | \begin{solution} 385 | \blindtext 386 | \end{solution} 387 | 388 | \blindtext 389 | 390 | \begin{problem} 391 | 测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下 392 | 定理环境。测试一下定理环境。测试一下定理环境。 393 | \end{problem} 394 | \begin{solution} 395 | \blindtext 396 | \end{solution} 397 | 398 | \blindtext 399 | 400 | \begin{exercise} 401 | 测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下 402 | 定理环境。测试一下定理环境。测试一下定理环境。 403 | \end{exercise} 404 | 405 | \blindtext 406 | 407 | \begin{exercise} 408 | 测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下 409 | 定理环境。测试一下定理环境。测试一下定理环境。 410 | \end{exercise} 411 | 412 | \begin{algorithm} 413 | 测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下定理环境。测试一下 414 | 定理环境。测试一下定理环境。测试一下定理环境。 415 | \end{algorithm} 416 | 417 | \subsection{中心观点与思想} 418 | 419 | 云计算在概念上通常被分为IaaS、PaaS、SaaS几个层面。但透过分类去理解其本 420 | 质，可认为是上世纪70年代基于大型计算机的中心控制型瘦客户端终端模式，在 421 | 如今技术水平上的一种新的表达，是在技术发展道路中，螺旋上升的结果。 422 | 423 | 与瘦客户端相比，云计算在设计结构上存在一定的相似性。 424 | 425 | \begin{enumerate} 426 | \item 中心控制的模式：通过中心的大规模硬件提供统一的计算，可大大降低管理成本，提 427 | 高硬件资源利用率，同时降低客户端的硬件成本需求。例如Nvidia推出Georce GRID平台 428 | \cite{NVIDIAGRID}，推出了GaaS\footnote{Gaming as a Service}概念。将 429 | GPU放置在云端，使得用户不需要再不断购买升级显卡，并可在更为广泛的终端（包括手机、 430 | 平板、智能电视）和地点体验最新的游戏。 431 | \item 数据集中：由于瘦客户端的关系，数据都集中存储在中心，可对数据提供 432 | 可靠的保护，并且通过按需调用的实现方式，降低对网络带宽的需求。 433 | \end{enumerate} 434 | 435 | 在设计思路上，两者都为了降低管理成本和硬件成本、以低能耗、高弹性等需求 436 | 为设计目标。随着技术的进步，云计算在具体实现形态上与传统的大型机也有很 437 | 大的不同： 438 | 439 | 一方面，云中心不再是传统的一台大型机，而是用大量廉价计算节点的互联来提 440 | 供海量资源。云计算更强调资源规模的无缝、平滑扩展，以及高可靠性，无单点 441 | 故障问题。另一方面，云计算时代的终端，也具备相当计算能力。随着web2.0的 442 | 整合，还有向胖客户端和智能终端发展的趋势。 443 | 444 | 总而言之，云计算在大框架中是传统的中心控制／终端的模式，但在中心与终端 445 | 两方面，都引入分布式技术加以改良。核心的思路是在低成本的前提下做到高可 446 | 靠性、高灵活性和高伸缩性。因此，云计算并不仅仅以数量换性能的表象，本质 447 | 上为低成本高性能，追求高能效比，并在实现层面讲究可实现性和可操作性。 448 | \subsection{需要解决的问题与挑战} 449 | 450 | 测试一下中文字体： 451 | 452 | {\songti\zihao{0} 宋体，初号} 453 | 454 | {\songti\zihao{-0} 宋体，小初} 455 | 456 | {\songti\zihao{1} 宋体，一号} 457 | 458 | {\songti\zihao{-1} 宋体，小一} 459 | 460 | {\songti\zihao{2} 宋体，二号} 461 | 462 | {\songti\zihao{-2} 宋体，小二} 463 | 464 | {\songti\zihao{3} 宋体，三号} 465 | 466 | {\songti\zihao{-3} 宋体，小三} 467 | 468 | {\songti\zihao{4} 宋体，四号} 469 | 470 | {\songti\zihao{-4} 宋体，小四} 471 | 472 | {\songti\zihao{5} 宋体，五号} 473 | 474 | {\songti\zihao{-5} 宋体，小五} 475 | 476 | {\songti\zihao{6} 宋体，六号} 477 | 478 | {\songti\zihao{-6} 宋体，小六} 479 | 480 | {\songti\zihao{7} 宋体，七号} 481 | 482 | {\songti\zihao{8} 宋体，八号} 483 | 484 | {\heiti\zihao{0} 黑体，初号} 485 | 486 | {\heiti\zihao{-0} 黑体，小初} 487 | 488 | {\heiti\zihao{1} 黑体，一号} 489 | 490 | {\heiti\zihao{-1} 黑体，小一} 491 | 492 | {\heiti\zihao{2} 黑体，二号} 493 | 494 | {\heiti\zihao{-2} 黑体，小二} 495 | 496 | {\heiti\zihao{3} 黑体，三号} 497 | 498 | {\heiti\zihao{-3} 黑体，小三} 499 | 500 | {\heiti\zihao{4} 黑体，四号} 501 | 502 | {\heiti\zihao{-4} 黑体，小四} 503 | 504 | {\heiti\zihao{5} 黑体，五号} 505 | 506 | {\heiti\zihao{-5} 黑体，小五} 507 | 508 | {\heiti\zihao{6} 黑体，六号} 509 | 510 | {\heiti\zihao{-6} 黑体，小六} 511 | 512 | {\heiti\zihao{7} 黑体，七号} 513 | 514 | {\heiti\zihao{8} 黑体，八号} 515 | 516 | {\kaishu\zihao{0} 楷书，初号} 517 | 518 | {\kaishu\zihao{-0} 楷书，小初} 519 | 520 | {\kaishu\zihao{1} 楷书，一号} 521 | 522 | {\kaishu\zihao{-1} 楷书，小一} 523 | 524 | {\kaishu\zihao{2} 楷书，二号} 525 | 526 | {\kaishu\zihao{-2} 楷书，小二} 527 | 528 | {\kaishu\zihao{3} 楷书，三号} 529 | 530 | {\kaishu\zihao{-3} 楷书，小三} 531 | 532 | {\kaishu\zihao{4} 楷书，四号} 533 | 534 | {\kaishu\zihao{-4} 楷书，小四} 535 | 536 | {\kaishu\zihao{5} 楷书，五号} 537 | 538 | {\kaishu\zihao{-5} 楷书，小五} 539 | 540 | {\kaishu\zihao{6} 楷书，六号} 541 | 542 | {\kaishu\zihao{-6} 楷书，小六} 543 | 544 | {\kaishu\zihao{7} 楷书，七号} 545 | 546 | {\kaishu\zihao{8} 楷书，八号} 547 | 548 | {\fangsong\zihao{0} 仿宋，初号} 549 | 550 | {\fangsong\zihao{-0} 仿宋，小初} 551 | 552 | {\fangsong\zihao{1} 仿宋，一号} 553 | 554 | {\fangsong\zihao{-1} 仿宋，小一} 555 | 556 | {\fangsong\zihao{2} 仿宋，二号} 557 | 558 | {\fangsong\zihao{-2} 仿宋，小二} 559 | 560 | {\fangsong\zihao{3} 仿宋，三号} 561 | 562 | {\fangsong\zihao{-3} 仿宋，小三} 563 | 564 | {\fangsong\zihao{4} 仿宋，四号} 565 | 566 | {\fangsong\zihao{-4} 仿宋，小四} 567 | 568 | {\fangsong\zihao{5} 仿宋，五号} 569 | 570 | {\fangsong\zihao{-5} 仿宋，小五} 571 | 572 | {\fangsong\zihao{6} 仿宋，六号} 573 | 574 | {\fangsong\zihao{-6} 仿宋，小六} 575 | 576 | {\fangsong\zihao{7} 仿宋，七号} 577 | 578 | {\fangsong\zihao{8} 仿宋，八号} 579 | 580 | 测试一下标准字号： 581 | 582 | {\Huge 汉字，Huge} 583 | 584 | {\huge 汉字，huge} 585 | 586 | {\LARGE 汉字，LARGE} 587 | 588 | {\Large 汉字，Large} 589 | 590 | {\large 汉字，large} 591 | 592 | {\normalsize 汉字，normalsize} 593 | 594 | {\small 汉字，small} 595 | 596 | {\footnotesize 汉字，footnotesize} 597 | 598 | {\scriptsize 汉字，scriptsize} 599 | 600 | {\tiny 汉字，tiny} 601 | 602 | 测试一下标准字体的变形： 603 | 604 | {\songti 宋体} {\heiti 黑体} {\kaishu 楷书} {\fangsong 仿宋} 605 | 606 | {\textsl{textsl字体}} 607 | 608 | {\bfseries bfseries字体} 609 | 610 | {\textbf{textbf字体}} 611 | 612 | {\textit{textit字体}} 613 | 614 | 测试一下数学公式中的字体大小。 615 | 616 | \newcommand{\set}[1]{\left\{\,#1\,\right\}} 617 | \newcommand{\card}[1]{\left|\,#1\,\right|} 618 | 619 | Fall-Out指标计算公式如下： 620 | \begin{equation*} 621 | \mbox{fallout} = \frac{\card{\set{\text{不相关文档}}\cap\set{\text{获取的文档}}}}{\card{\set{\text{不相关文档}}}} 622 | \end{equation*} 623 | 624 | \section{研究的应用背景} 625 | 云计算作为分布式技术的当前表现形式，通过将众多节点资源整合，以冗余、去 626 | 中心化的分布式模式，实现传统技术中需要大型机才能解决的海量信息问题。一 627 | 言而概之，“人多力量大”。 628 | 629 | 但随着节点数目的增多，问题的重点将逐步转换为如何对大量节点进行高效互联。图 630 | \ref{fig:test1}所示为传统IaaS云中心网络结构的一部分。通过BR边界路由器，AR接入路 631 | 由器构建数据中心的主干；核心交换机和接入交换机S，构成二层交换网络层，大量的服务 632 | 器节点通过二层交换机被最终接入整个网络。 633 | \begin{figure}[htbp] 634 | \centering 635 | \includegraphics[width= 0.5\textwidth]{jnuname}\\ 636 | \caption{测试插图}\label{fig:test1} 637 | \end{figure} 638 | 在上述传统网络中，当节点总数达到数千乃至万数量级时，上层链路的聚合带宽 639 | 将不断提高，从而对核心交换机、接入路由器、边界路由器的指标提出了极高的 640 | 要求。以至于少数核心网络设备，成为整个网络中的高价格、高性能单点。一方 641 | 面与原本追求低成本、分布化、去中心化的云技术设计理念背道而驰，另一方面 642 | 也降低了网络的健壮性。因而本文所做工作对数据中心的网络基础设施而言，具 643 | 有较大应用价值。 644 | \subsection{IaaS云中心} 645 | \Blindtext 646 | \subsection{PaaS云中心} 647 | \Blindtext 648 | \section{论文结构} 649 | \Blindtext 650 | 651 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 652 | \chapter{小世界网络模型}\label{chapter_smallworld} 653 | \section{小世界现象} 654 | 655 | 生活中，常出现初次见面的陌生人却拥有双方都认识的共同熟人，于是大家时常 656 | 会感叹：“这世界真小！”。这种现象被称为``小世界现象''，后又称为``六度 657 | 分割理论''。 658 | 659 | \begin{figure}[htbp] 660 | \centering 661 | \includegraphics[width= 0.5\textwidth]{jnuname}\\ 662 | \caption{测试插图}\label{fig:test2} 663 | \end{figure} 664 | 665 | 1909年，现代无线电之父Guglielmo Marconi在其诺贝尔奖致辞中讨论了覆盖整个地球所需 666 | 的无线电中继站数目，并根据他的实验结果计算出平均需要$5.83$（近似为$6$）个中继站 667 | \cite{marconi1909nobel}。这个结论，被认为是``六度分割理论''中的常数$6$的最早出处 668 | \cite{barabasi2003linked}。 669 | 670 | 1929年，匈牙利作家Frigyes Karinthy发表了一部短篇小说集《Everything is 671 | Different》。其中一篇名为《Chain-Links》的小说以抽象的、概念性的和虚 672 | 构的方式研究了网络理论领域的很多问题，而这些问题使得未来几代的数学家、 673 | 社会学家和物理学家都为之着迷\cite{newman2006structure, 674 | barabasi2003linked}。Karinthy认为，随着通讯技术和交通技术的发展，人际 675 | 关系网会变得越来越来大，扩张得越来越远，整个世界将因此而``缩小''。他认 676 | 为，虽然人类个体之间的物理距离可能很远，但人类社交网络密度的增加使得人 677 | 类个体之间的社会性距离变得非常小。根据这个假设，Karinthy的小说的主角相 678 | 信：``任何两个人之间可以通过不超过五个中间人相联系''。Karinthy的想法直 679 | 接或间接地影响了早期的社交网络理论的研究，他被认为是六度分隔(six 680 | degrees of separation)理论的最早提出者\cite{barabasi2003linked}。 681 | 682 | 683 | \begin{table} 684 | \centering 685 | \begin{tabular}{cccp{38mm}} 686 | \toprule 687 | \textbf{文档域类型} & \textbf{Java类型} & \textbf{宽度(字节)} & \textbf{说明} \\ 688 | \midrule 689 | BOOLEAN & boolean & 1 & \\ 690 | CHAR & char & 2 & UTF-16字符 \\ 691 | BYTE & byte & 1 & 有符号8位整数 \\ 692 | SHORT & short & 2 & 有符号16位整数 \\ 693 | INT & int & 4 & 有符号32位整数 \\ 694 | LONG & long & 8 & 有符号64位整数 \\ 695 | STRING & String & 字符串长度 & 以UTF-8编码存储 \\ 696 | DATE & java.util.Date & 8 & 距离GMT时间1970年1月1日0点0分0秒的毫秒数 \\ 697 | BYTE\_ARRAY & byte$[]$ & 数组长度 & 用于存储二进制值 \\ 698 | BIG\_INTEGER & java.math.BigInteger & 和具体值有关 & 任意精度的长整数 \\ 699 | BIG\_DECIMAL & java.math.BigDecimal & 和具体值有关 & 任意精度的十进制实数 \\ 700 | \bottomrule 701 | \end{tabular} 702 | \caption{测试表格}\label{table:test2} 703 | \end{table} 704 | 705 | 1961年，Michael Gurevich在社会学家Ithiel de Sola Pool的指导下完成了他的 706 | 博士论文，对社交网络进行了实验性的研究。随后，数学家Manfred Kochen与 707 | Sola Pool一道在他们的手稿《Contacts and Influences》中对这些实验结果做 708 | 了分析，发现在美国人口中，任意两个人之间通常只需不超过两个中间人即可互 709 | 相联系\cite{pool1978}。1973年他们又利用计算机，基于Gurevich的数据，用 710 | Monte Carlo法做了模拟，并证实了该结论\cite{pool1978}，从而为心理学家 711 | Stanley Milgram后来的发现打下了基础。 712 | 713 | \section{网络结构的重要指标} 714 | 715 | 在刻画复杂网络结构的统计特性上有三个重要的指标：平均路径长度（average 716 | path length）、聚类系数（clustering coefficient）和度分布（degree 717 | distribution）。事实上，Watts和Strogatz提出小世界网络模型的初衷，就是 718 | 想建立一个既具有类似随机图的较小的平均路径长度，又具有类似规则网络的较 719 | 大的聚类系数的网络模型。 720 | 721 | \subsection{平均路径长度} 722 | 723 | \begin{definition}[节点之间的距离] 724 | 网络中两个节点$i$和$j$之间的距离(distance)$d_{ij}$定义为连接这两个节点 725 | 的最短路径上的边数。 726 | \end{definition} 727 | 728 | \begin{definition}[直径] 729 | 网络中任意两个节点之间的距离的最大值称为该网络的直径，记为$D$，即 730 | \begin{equation}\label{eq:dimension} 731 | D = \max_{i,j} d_{ij} 732 | \end{equation} 733 | \end{definition} 734 | 735 | 736 | \begin{figure}[htbp] 737 | \centering 738 | \includegraphics[width= 0.5\textwidth]{jnuname}\\ 739 | \caption{测试插图}\label{fig:test3} 740 | \end{figure} 741 | 742 | \begin{definition}[平均路径长度] 743 | 网络的平均路径长度$L$定义为任意两个节点之间的距离的平均值，即 744 | \begin{equation}\label{eq:avarage_path_lentgh} 745 | L = \frac{2}{N(N+1)}\sum_{i\geq j}d_{ij} 746 | \end{equation} 747 | 其中$N$为网络节点数。网络的平均路径长度也称为网络的特征路径长度。 748 | \end{definition} 749 | 750 | 注意，为了便于数学处理，在公式\eqref{eq:avarage_path_lentgh}中包含了节 751 | 点到其自身的距离（该距离为零）。如果不考虑节点到其自身的距离，那么公式 752 | \eqref{eq:avarage_path_lentgh}的右端需要乘以因子$(N+1)/(N-1)$。在实际应 753 | 用中，该差别可以忽略不计。 754 | 755 | \subsection{聚类系数} 756 | 757 | \begin{table} 758 | \centering 759 | \begin{tabular}{cccp{38mm}} 760 | \toprule 761 | \textbf{文档域类型} & \textbf{Java类型} & \textbf{宽度(字节)} & \textbf{说明} \\ 762 | \midrule 763 | BOOLEAN & boolean & 1 & \\ 764 | CHAR & char & 2 & UTF-16字符 \\ 765 | BYTE & byte & 1 & 有符号8位整数 \\ 766 | SHORT & short & 2 & 有符号16位整数 \\ 767 | INT & int & 4 & 有符号32位整数 \\ 768 | LONG & long & 8 & 有符号64位整数 \\ 769 | STRING & String & 字符串长度 & 以UTF-8编码存储 \\ 770 | DATE & java.util.Date & 8 & 距离GMT时间1970年1月1日0点0分0秒的毫秒数 \\ 771 | BYTE\_ARRAY & byte$[]$ & 数组长度 & 用于存储二进制值 \\ 772 | BIG\_INTEGER & java.math.BigInteger & 和具体值有关 & 任意精度的长整数 \\ 773 | BIG\_DECIMAL & java.math.BigDecimal & 和具体值有关 & 任意精度的十进制实数 \\ 774 | \bottomrule 775 | \end{tabular} 776 | \caption{测试表格}\label{table:test3} 777 | \end{table} 778 | 779 | 在图论中，聚类系数(clustering coefficient)是用来描述一个图中的顶点之间 780 | 结集成团的程度的系数。具体来说，是一个点的邻接点之间相互连接的程度。许 781 | 多大规模的实际网络都具有明显的聚类效应。例如生活社交网络中，你的朋友同 782 | 时也是朋友的概率会随着网络规模的增加而趋向于某个非零常数。这意味着这些 783 | 实际的复杂网络并不是完全随机的，而是在某种程度上具有类似于社会关系网络 784 | 中“物以类聚，人以群分”的特性。 785 | 786 | \begin{figure}[htbp] 787 | \centering 788 | \includegraphics[width= 0.5\textwidth]{jnuname}\\ 789 | \caption{测试插图}\label{fig:test4} 790 | \end{figure} 791 | 792 | 集聚系数分为整体与局部两种。整体集聚系数可以给出一个图中整体的集聚程度 793 | 的评估，而局部集聚系数则可以测量图中每一个结点附近的集聚程度。 794 | 795 | \begin{definition}[整体聚类系数] 796 | 整体集聚系数的定义建立在闭三点组（邻近三点组）之上。假设网络中有一部分 797 | 节点是两两相连的，那么可以找出很多个“三角形”，其对应的三点两两相连， 798 | 称为闭三点组。除此以外还有开三点组，也就是之间连有两条边的三点（缺一条 799 | 边的三角形）。这两种三点组构成了所有的连通三点组。整体集聚系数定义为 800 | 一个网络中所有闭三点组的数量与所有连通三点组（无论开还是闭）的总量之比， 801 | 即 802 | \[ 803 | C_{total}=\frac{3\times G_{\triangle}}{3 \times G_{\triangle} + G_{\wedge}} 804 | \] 805 | 其中$C_{total}$表示网络的整体聚类系数，$G_{\triangle}$表示该网络中闭三 806 | 点组的个数，$G_{\wedge}$表示该网络中开三点组的个数\cite{luce1949method}。 807 | \end{definition} 808 | 809 | 对图中具体的某一个点，它的局部集聚系数$C_i$表示与它相连的点抱成团（完全 810 | 子图）的程度。Watts与Strogatz在1998年的论文 811 | \cite{watts1998smallworld}中首次引入了这个概念，用以判别一个图是否是小 812 | 世界网络。 813 | 814 | \begin{table} 815 | \centering 816 | \begin{tabular}{cccp{38mm}} 817 | \toprule 818 | \textbf{文档域类型} & \textbf{Java类型} & \textbf{宽度(字节)} & \textbf{说明} \\ 819 | \midrule 820 | BOOLEAN & boolean & 1 & \\ 821 | CHAR & char & 2 & UTF-16字符 \\ 822 | BYTE & byte & 1 & 有符号8位整数 \\ 823 | SHORT & short & 2 & 有符号16位整数 \\ 824 | INT & int & 4 & 有符号32位整数 \\ 825 | LONG & long & 8 & 有符号64位整数 \\ 826 | STRING & String & 字符串长度 & 以UTF-8编码存储 \\ 827 | DATE & java.util.Date & 8 & 距离GMT时间1970年1月1日0点0分0秒的毫秒数 \\ 828 | BYTE\_ARRAY & byte$[]$ & 数组长度 & 用于存储二进制值 \\ 829 | BIG\_INTEGER & java.math.BigInteger & 和具体值有关 & 任意精度的长整数 \\ 830 | BIG\_DECIMAL & java.math.BigDecimal & 和具体值有关 & 任意精度的十进制实数 \\ 831 | \bottomrule 832 | \end{tabular} 833 | \caption{测试表格}\label{table:test4} 834 | \end{table} 835 | 836 | \begin{definition}[局部聚类系数] 837 | 838 | 839 | \begin{figure}[htbp] 840 | \centering 841 | \includegraphics[width= 0.5\textwidth]{jnuname}\\ 842 | \caption{测试插图}\label{fig:test5} 843 | \end{figure} 844 | 845 | 假设网络中的一个节点$i$有$k_i$条边与其他节点相连，这$k_i$个节点称为节点 846 | $i$的邻居。显然，在这$k_i$个节点之间最多可能有$k_i(k_i-1)/2$条边。而这 847 | $k_i$个节点之间实际存在的边数$E_i$和总的可能的边数$k_i(k_i-1)/2$之比就 848 | 定义为节点$i$的聚类系数(clustering coefficient)$C_i$，即 849 | \begin{equation}\label{eq:clustering_coefficient} 850 | C_i = \frac{2E_i}{k_i(k_i-1)} 851 | \end{equation} 852 | 从几何特性上看，上式的一个等价定义为： 853 | \begin{equation}\label{eq:clustering_coefficient_triangle} 854 | C_i = \frac{\text{与节点$i$相连的三角形的数量}}{\text{与节点$i$相连 855 | 的三元组的数量}} 856 | \end{equation} 857 | 其中，与节点$i$相连的三元组是指由节点$i$和其两个邻居节点构成的组合。 858 | \end{definition} 859 | 860 | \begin{figure}[htbp] 861 | \centering 862 | \includegraphics[width= 0.5\textwidth]{jnuname}\\ 863 | \caption{测试插图}\label{fig:test6} 864 | \end{figure} 865 | 866 | 知道了一个图里的每一个顶点的局部集聚系数后，可以计算整个图的平均集聚系 867 | 数。这个概念也是Watts与Strogatz在1998年的论文 868 | \cite{watts1998smallworld}中引入的： 869 | 870 | \begin{definition}[平均聚类系数] 871 | 平均聚类系数定义为所有顶点的局部集聚系数的算术平均数，即 872 | \begin{equation} 873 | \bar{C} = \frac{1}{n}\sum_{i=1}^{n} C_i. 874 | \end{equation} 875 | \end{definition} 876 | 877 | \subsection{度分布} 878 | 879 | \begin{definition}[度] 880 | 无向网络中，节点$i$的度(degree)$k_i$定义为与该节点连接的其他节点的数目。 881 | 有向网络中，节点的度分为出度(out-degree)和入度(in-degree)。节点的出度是 882 | 指从该节点指向其他节点的边的数目，节点的入度是指从其他节点指向该节点的 883 | 边的数目。 884 | \end{definition} 885 | 886 | 直观上看，一个节点的度越大就意味着这个节点在某种意义上越“重要”。 887 | 888 | \begin{definition}[平均度] 889 | 网络中所有节点$i$的度$k_i$的平均值称为网络的平均度，记为$Avg{k}$。 890 | \end{definition} 891 | 892 | \begin{definition}[度分布] 893 | 网络中节点的度的分布状况可用分布函数$P(k)$来描述： 894 | \begin{equation}\label{eq:degree_distribution} 895 | P(k) = \text{一个随机选定的节点的度恰好是$k$的概率} 896 | \end{equation} 897 | $P(k)$称为该网络的度分布。 898 | \end{definition} 899 | 900 | \section{小世界网络} 901 | 902 | \begin{definition}[小世界网络] 903 | 若网络的平均路径长度和网络的节点数目的对数成正比，即 904 | \[ 905 | L_{G} \propto \log N 906 | \] 907 | 其中$N$是节点数目，则称这样的网络为``小世界网络''。 908 | \end{definition} 909 | \blindtext 910 | 911 | \section{基于小世界理论的数据中心网络} 912 | \blindtext 913 | \subsection{DS小世界模型} 914 | \Blindtext 915 | \subsection{DS小世界模型的平均网络距离} 916 | \Blindtext 917 | \subsection{高维小世界网络的负载能力与容错分析} 918 | \Blindtext 919 | \section{SIDN网络模型} 920 | \Blindtext 921 | \subsection{SIDN模型构建} 922 | \Blindtext 923 | \subsection{路由策略} 924 | \Blindtext 925 | \section{逻辑节点内部资源分配} 926 | \Blindtext 927 | \subsection{问题描述} 928 | \Blindtext 929 | \subsection{全局路由算法} 930 | \Blindtext 931 | \section{SIDN模型参数分析} 932 | \Blindtext 933 | \subsection{连通性分析} 934 | \Blindtext 935 | \subsection{平均路由跳数} 936 | \Blindtext 937 | \subsection{总网络带宽} 938 | \Blindtext 939 | \subsection{容错能力} 940 | \Blindtext 941 | \section{仿真结果} 942 | \subsection{平均路由跳数} 943 | \Blindtext 944 | \subsection{总网络带宽} 945 | \Blindtext 946 | \subsection{容错能力} 947 | \Blindtext 948 | \section{小结} 949 | \Blindtext 950 | 951 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 952 | \chapter{随机网络模型}\label{chapter_random} 953 | \section{随机网络背景与研究现状} 954 | \Blindtext 955 | \section{WarpNet网络模型构建}\label{sec:warpnet_construction} 956 | \subsection{网络结构} 957 | \Blindtext 958 | \subsection{双层拓扑结构} 959 | \Blindtext 960 | \section{路由算法} 961 | \subsection{基于flood的路由发现算法} 962 | \Blindtext 963 | \section{网络性能分析} 964 | \blindtext 965 | \subsection{连通性与互联通率} 966 | \Blindtext 967 | \subsection{路由跳数} 968 | \Blindtext 969 | \subsection{总带宽} 970 | \Blindtext 971 | \subsection{故障对网络的影响} 972 | \Blindtext 973 | \section{仿真分析} 974 | \Blindtext 975 | \section{实验验证} 976 | \Blindtext 977 | \section{小结} 978 | \blindtext 979 | 980 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 981 | \chapter{无尺度网络模型}\label{chapter_scalefree} 982 | \section{无尺度网络背景与研究现状} 983 | \Blindtext 984 | \section{基于数据中心的无尺度网络运用} 985 | \subsection{无尺度网络在数据中心运用的分析} 986 | \Blindtext 987 | \subsection{无尺度网络与最大度} 988 | \Blindtext 989 | \subsection{带最大度约束的无尺度构造算法} 990 | \Blindtext 991 | \section{模型分析} 992 | \subsection{度-度相关性分析} 993 | \Blindtext 994 | \subsection{聚类性分析} 995 | \Blindtext 996 | \section{基于数据中心的无尺度网络模型构建分析} 997 | \blindtext 998 | \subsection{节点结构与网络性能的关系} 999 | \Blindtext 1000 | \section{平衡因子的参数调整} 1001 | \blindtext 1002 | \subsection{$q=0$的情况} 1003 | \Blindtext 1004 | \subsection{$q>0$的情况} 1005 | \Blindtext 1006 | \subsection{$q<0$的情况} 1007 | \Blindtext 1008 | \section{TPSF模型构建与性能分析} 1009 | \blindtext 1010 | \subsection{平均路由距离} 1011 | \Blindtext 1012 | \subsection{总网络带宽} 1013 | \Blindtext 1014 | \subsection{容错能力} 1015 | \Blindtext 1016 | \section{仿真结果} 1017 | \subsection{平均路由跳数} 1018 | \Blindtext 1019 | \subsection{总网络带宽} 1020 | \Blindtext 1021 | \subsection{容错能力} 1022 | \Blindtext 1023 | \section{小结} 1024 | \blindtext 1025 | 1026 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 1027 | \chapter{网络模型验证框架}\label{chapter_experiments} 1028 | \section{引言} 1029 | \Blindtext 1030 | \section{模拟平台实现} 1031 | \Blindtext 1032 | \subsection{系统结构} 1033 | \Blindtext 1034 | \subsection{构造模块} 1035 | \Blindtext 1036 | \subsection{虚拟网卡实现} 1037 | \Blindtext 1038 | \subsection{控制核心} 1039 | \Blindtext 1040 | \subsection{受控模块} 1041 | \Blindtext 1042 | \subsection{分布式虚拟交换网络} 1043 | \Blindtext 1044 | \section{验证结果} 1045 | \Blindtext 1046 | \subsection{真实环境验证} 1047 | \Blindtext 1048 | \subsection{海量虚拟化的检测与控制} 1049 | \Blindtext 1050 | \section{小结} 1051 | \blindtext 1052 | 1053 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 1054 | % 学位论文的正文应以《结论》作为最后一章 1055 | \chapter{结论}\label{chapter_concludes} 1056 | 1057 | 本文在第\ref{chapter_smallworld}章中，通过考虑数据中心网络布局构建中的最大度限制 1058 | 问题，提出了符合数据中心网络基本要求的DS小世界模型，并分析了它的性质。随后提出 1059 | SIDN，将DS模型映射到具体的网络结构中，并分析了所构成网络的平均直径、网络总带宽、 1060 | 对故障的容错能力等各项网络性能。 1061 | 1062 | 分析与仿真实验证明，SIDN网络具有很好的扩展能力，网络总带宽与网络规模成 1063 | 近似线性增长的关系；具有很强的容错能力，链路损坏与节点损坏几乎无法破坏 1064 | 网络的联通性，故障率对网络性能的影响与破坏节点/链路占总资源比率线性相关。 1065 | 1066 | 随后在第\ref{chapter_scalefree}章中，分析了无尺度网络在数据中心网络构建应用中的 1067 | 理论方面问题。对Scafida \cite{gyarmati2010scafida}文中所述在最大度限制的情况下运 1068 | 用BA算法构造的网络并不会损失无尺度性质的观点，进行了深入的分析，并指出了该论点的 1069 | 局限性。 1070 | 1071 | 在给出了在引入节点最大度限制之后，利用分治和递归的思想，对无尺度网络 1072 | 进行多层构建，对所构造的网络进行度-度相关性，以及聚类性分析。 1073 | 1074 | \begin{table} 1075 | \centering 1076 | \begin{tabular}{cccp{38mm}} 1077 | \toprule 1078 | \textbf{文档域类型} & \textbf{Java类型} & \textbf{宽度(字节)} & \textbf{说明} \\ 1079 | \midrule 1080 | BOOLEAN & boolean & 1 & \\ 1081 | CHAR & char & 2 & UTF-16字符 \\ 1082 | BYTE & byte & 1 & 有符号8位整数 \\ 1083 | SHORT & short & 2 & 有符号16位整数 \\ 1084 | INT & int & 4 & 有符号32位整数 \\ 1085 | LONG & long & 8 & 有符号64位整数 \\ 1086 | STRING & String & 字符串长度 & 以UTF-8编码存储 \\ 1087 | DATE & java.util.Date & 8 & 距离GMT时间1970年1月1日0点0分0秒的毫秒数 \\ 1088 | BYTE\_ARRAY & byte$[]$ & 数组长度 & 用于存储二进制值 \\ 1089 | BIG\_INTEGER & java.math.BigInteger & 和具体值有关 & 任意精度的长整数 \\ 1090 | BIG\_DECIMAL & java.math.BigDecimal & 和具体值有关 & 任意精度的十进制实数 \\ 1091 | \bottomrule 1092 | \end{tabular} 1093 | \caption{测试表格}\label{table:test5} 1094 | \end{table} 1095 | 1096 | 表\ref{table:test5}用于测试表格。随后分析了无尺度网络构造过程中，交换机节点与数 1097 | 据节点的角色区别，分析了两者在不同比率下形成的网络形态，以及对网络性能造成的影响。 1098 | 1099 | 通过理论分析和仿真实验，分析并找出比率因子q的最佳取值。此外，无尺度现象 1100 | 的引入提高了网络的聚类系数，从而在不失灵活性可靠性的基础上，进一步提升 1101 | 了网络的性能。 1102 | 1103 | 在第\ref{chapter_random}章中，将关注点转移到交换机本身。由于图论难以描述数据中心 1104 | 网络中的交换设备，因此放弃基于图的抽象模型，转而基于多维簇划分的思想，提出并设计 1105 | 了WarpNet网络模型。 1106 | 1107 | 该网络模型突破了基于图描述的局限性，并对网络的带宽等指标进行理论分析并 1108 | 给出定量描述。最后对比了理论分析、仿真测试结果，并在实际物理环境中进系 1109 | 真实部署，通过6节点的小规模实验以及1000节点虚拟机的大规模实验，表明该模 1110 | 型的理论分析、仿真测试与实际实验吻合，并在网络性能、容错能力、伸缩性灵 1111 | 活性方面得到了进一步的提升。 1112 | 1113 | 在第\ref{chapter_experiments}章中，针对网络模型研究这一类工作的共性，设计构造通 1114 | 用验证平台系统。以海量虚拟机和虚拟分布式交换机的形式，实现了基于少量物理节点，对 1115 | 大规模节点的模拟。其模拟运行的过程与真实运行在实现层面完全一致，运行的结果与真实 1116 | 环境线性相关。除为本文所涉若干网络模型提供验证外，可进一步推广到更为广泛的领域， 1117 | 为各种网络模型及路由算法的研究工作，提供分析、指导与验证。 1118 | 1119 | 1120 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 1121 | % 致谢，应放在《结论》之后 1122 | \begin{acknowledgement} 1123 | 首先感谢我的母亲韦春花对我的支持。其次感谢我的导师陈近南对我的精心指导和热心帮助。接下来， 1124 | 感谢我的师兄茅十八和风际中，他们阅读了我的论文草稿并提出了很有价值的修改建议。 1125 | 1126 | 最后，感谢我亲爱的老婆们：双儿、苏荃、阿珂、沐剑屏、曾柔、建宁公主、方怡，感谢 1127 | 你们在生活上对我无微不至的关怀和照顾。我爱你们！ 1128 | \end{acknowledgement} 1129 | 1130 | 1131 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 1132 | % 参考文献。应放在\backmatter之前。 1133 | % 推荐使用BibTeX，若不使用BibTeX时注释掉下面一句。 1134 | \nocite{*} 1135 | \bibliography{master} 1136 | % 不使用 BibTeX 1137 | %\begin{thebibliography}{2} 1138 | % 1139 | %\bibitem{deng:01a} 1140 | %{邓建松,彭冉冉,陈长松}. 1141 | %\newblock {\em \LaTeXe{}科技排版指南}. 1142 | %\newblock 科学出版社,书号:7-03-009239-2/TP.1516, 北京, 2001. 1143 | % 1144 | %\bibitem{wang:00a} 1145 | %王磊. 1146 | %\newblock {\em \LaTeXe{}插图指南}. 1147 | %\newblock 2000. 1148 | %\end{thebibliography} 1149 | -------------------------------------------------------------------------------- /master-p-blind.tex: -------------------------------------------------------------------------------- 1 | %% 使用 jnuthesis 文档类生成南京大学学位论文的示例文档 2 | %% 3 | %% 作者：胡海星，starfish (at) gmail (dot) com 4 | %% 项目主页: http://haixing-hu.github.io/jnu-thesis/ 5 | %% 6 | %% 本样例文档中用到了吕琦同学的博士论文的提高和部分内容，在此对他表示感谢。 7 | %% 8 | \documentclass[master,sourcefonts,prodegree,blindreview]{jnuthesis} 9 | %% jnuthesis 文档类的可选参数有： 10 | %% nobackinfo 取消封二页导师签名信息。注意，按照南大的规定，是需要签名页的。 11 | %% phd/master/bachelor 选择博士/硕士/学士论文 12 | 13 | % 引用公共导言 14 | \input{master-preamble} 15 | 16 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 17 | \begin{document} 18 | 19 | % 引用公共正文 20 | \input{master-contents} 21 | 22 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 23 | % 书籍附件 24 | \backmatter 25 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 26 | % 作者简历与科研成果页，应放在backmatter之后 27 | \begin{resume} 28 | % 论文作者在攻读学位期间所发表的文章的列表，按发表日期从近到远排列。 29 | \begin{publications} 30 | \item 1st Author, ``Voting-on-Grid Clustering for Secure 31 | Localization in Wireless Sensor Networks,'' in \textsl{Proc. IEEE International 32 | Conference on Communications (ICC) 2010}, May. 2010. 33 | \item 1st Author, ``Protecting Source Location Privacy 34 | in Wireless Sensor Networks with Data Aggregation,'' in \textsl{Proc. 6th 35 | International Conference on Ubiquitous Intelligence and Computing (UIC) 36 | 2009}, Oct. 2009. 37 | \end{publications} 38 | \end{resume} 39 | 40 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 41 | \end{document} 42 | -------------------------------------------------------------------------------- /master-p.tex: -------------------------------------------------------------------------------- 1 | %% 使用 jnuthesis 文档类生成南京大学学位论文的示例文档 2 | %% 3 | %% 作者：胡海星，starfish (at) gmail (dot) com 4 | %% 项目主页: http://haixing-hu.github.io/jnu-thesis/ 5 | %% 6 | %% 本样例文档中用到了吕琦同学的博士论文的提高和部分内容，在此对他表示感谢。 7 | %% 8 | \documentclass[master,sourcefonts,prodegree]{jnuthesis} 9 | %% jnuthesis 文档类的可选参数有： 10 | %% nobackinfo 取消封二页导师签名信息。注意，按照南大的规定，是需要签名页的。 11 | %% phd/master/bachelor 选择博士/硕士/学士论文 12 | 13 | % 引用公共导言 14 | \input{master-preamble} 15 | 16 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 17 | \begin{document} 18 | 19 | % 引用公共正文 20 | \input{master-contents} 21 | 22 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 23 | % 书籍附件 24 | \backmatter 25 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 26 | % 作者简历与科研成果页，应放在backmatter之后 27 | \begin{resume} 28 | % 论文作者在攻读学位期间所发表的文章的列表，按发表日期从近到远排列。 29 | \begin{publications} 30 | \item Xiaobao Wei, Jinnan Chen, ``Voting-on-Grid Clustering for Secure 31 | Localization in Wireless Sensor Networks,'' in \textsl{Proc. IEEE International 32 | Conference on Communications (ICC) 2010}, May. 2010. 33 | \item Xiaobao Wei, Shiba Mao, Jinnan Chen, ``Protecting Source Location Privacy 34 | in Wireless Sensor Networks with Data Aggregation,'' in \textsl{Proc. 6th 35 | International Conference on Ubiquitous Intelligence and Computing (UIC) 36 | 2009}, Oct. 2009. 37 | \end{publications} 38 | \end{resume} 39 | 40 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 41 | \end{document} 42 | -------------------------------------------------------------------------------- /master-preamble.tex: -------------------------------------------------------------------------------- 1 | % 使用 blindtext 宏包自动生成章节文字 2 | % 这仅仅是用于生成样例文档，正式论文中一般用不到该宏包 3 | \usepackage[math]{blindtext} 4 | 5 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 6 | % 设置论文的中文封面 7 | \titlea{基于Docker, Android与Web的社会关系研究} 8 | \titleb{——以江南大学为例} 9 | % 论文的英文标题第一行 10 | \englishtitlea{A Research on Social Relationships based on Docker, Android and Web} 11 | % 论文的英文标题第二行 12 | \englishtitleb{-- Take Jiangnan University as an Example} 13 | 14 | % 分类号 15 | \classification{TP391} 16 | % 密级 17 | \securitylevel{\openlevel} 18 | 19 | % 论文作者姓名 20 | \author{韦小宝} 21 | % 导师姓名职称 22 | \supervisor{陈近南} 23 | \supervisorpos{教授} 24 | % 第二行导师姓名职称，仿照第一行填写，没有则留空 25 | \supervisorb{} 26 | \supervisorbpos{} 27 | % 论文作者的学科与专业方向 28 | \major{数字媒体技术} 29 | % 论文作者的研究方向 30 | \researchfield{网络媒体应用与安全技术} 31 | % 论文作者所在学校或机构的名称。此属性可选，默认值为``江南大学''。 32 | \institute{江南大学} 33 | % 论文的指导小组成员。 34 | \directormembers{} 35 | % 论文的提交日期，需设置年、月、日。 36 | \submitdate{2017年5月} 37 | % 论文的答辩日期，需设置年、月、日。 38 | \defenddate{2017年6月} 39 | % 答辩委员会主席。 40 | \chairman{} 41 | % 论文的定稿日期，需设置年、月、日。此属性可选，默认值为最后一次编译时的日期，精确到日。 42 | %% \date{2013年5月1日} 43 | % 获得学位日期。 44 | \degreedate{} 45 | -------------------------------------------------------------------------------- /master.bib: -------------------------------------------------------------------------------- 1 | % -*- coding: utf-8 -*- 2 | 3 | @book{newman2006structure, 4 | title={The structure and dynamics of networks}, 5 | author={Newman, Mark and Barab{\'a}si, Albert-L{\'a}szl{\'o} and Watts, Duncan J}, 6 | year={2006}, 7 | publisher={Princeton University Press}, 8 | address={Princeton}, 9 | } 10 | 11 | @article{newman2001random, 12 | title={Random graphs with arbitrary degree distributions and their applications}, 13 | author={Newman, Mark EJ and Strogatz, Steven H and Watts, Duncan J}, 14 | journal={Physical Review E}, 15 | volume={64}, 16 | number={2}, 17 | pages={026118}, 18 | year={2001}, 19 | publisher={APS}, 20 | } 21 | 22 | @inproceedings{aiello2000random, 23 | title={A random graph model for massive graphs}, 24 | author={Aiello, William and Chung, Fan and Lu, Linyuan}, 25 | booktitle={Proceedings of the thirty-second annual ACM symposium on Theory of computing}, 26 | pages={171--180}, 27 | year={2000}, 28 | publisher = {ACM}, 29 | address = {New York}, 30 | } 31 | 32 | @article{molloy1995critical, 33 | title={A critical point for random graphs with a given degree sequence}, 34 | author={Molloy, Michael and Reed, Bruce}, 35 | journal={Random structures \& algorithms}, 36 | volume={6}, 37 | number={2-3}, 38 | pages={161--180}, 39 | year={1995}, 40 | publisher={Wiley Online Library} 41 | } 42 | 43 | @article{frieze1992independence, 44 | title={On the independence and chromatic numbers of random regular graphs}, 45 | author={Frieze, Alan M and {\L}uczak, T}, 46 | journal={Journal of Combinatorial Theory, Series B}, 47 | volume={54}, 48 | number={1}, 49 | pages={123--132}, 50 | year={1992}, 51 | publisher={Elsevier} 52 | } 53 | 54 | @article{bender1978asymptotic, 55 | title={The asymptotic number of labeled graphs with given degree sequences}, 56 | author={Bender, Edward A and Canfield, E Rodney}, 57 | journal={Journal of Combinatorial Theory, Series A}, 58 | volume={24}, 59 | number={3}, 60 | pages={296--307}, 61 | year={1978}, 62 | publisher={Elsevier} 63 | } 64 | 65 | @book{bollobas2001random, 66 | title={Random graphs}, 67 | author={Bollob{\'a}s, B{\'e}la}, 68 | volume={73}, 69 | year={2001}, 70 | publisher={Cambridge university press} 71 | } 72 | 73 | @article{erdHos1961strength, 74 | title={On the strength of connectedness of a random graph}, 75 | author={Erd{\H{o}}s, Paul and Renyi, Alfred}, 76 | journal={Acta Mathematica Hungarica}, 77 | volume={12}, 78 | number={1}, 79 | pages={261--267}, 80 | year={1961}, 81 | publisher={Akad{\'e}miai Kiad{\'o}, co-published with Springer Science+ Business Media BV, Formerly Kluwer Academic Publishers BV} 82 | } 83 | 84 | @article{erdos1960additive, 85 | title={Additive properties of random sequences of positive integers}, 86 | author={Erd{\"o}s, Paul and R{\'e}nyi, Alfr{\'e}d}, 87 | journal={Acta Arithmetica}, 88 | volume={6}, 89 | number={1}, 90 | pages={83--110}, 91 | year={1960}, 92 | publisher={Institute of Mathematics Polish Academy of Sciences} 93 | } 94 | 95 | @article{vazquez2002modeling, 96 | title={Modeling of protein interaction networks}, 97 | author={V{\'a}zquez, Alexei and Flammini, Alessandro and Maritan, Amos and Vespignani, Alessandro}, 98 | journal={Complexus}, 99 | volume={1}, 100 | number={1}, 101 | pages={38--44}, 102 | year={2002}, 103 | publisher={Karger Publishers} 104 | } 105 | 106 | @article{sole2002model, 107 | title={A model of large-scale proteome evolution}, 108 | author={Sol{\'e}, Ricard V and Pastor-Satorras, Romualdo and Smith, Eric and Kepler, Thomas B}, 109 | journal={Advances in Complex Systems}, 110 | volume={5}, 111 | number={01}, 112 | pages={43--54}, 113 | year={2002}, 114 | publisher={World Scientific} 115 | } 116 | 117 | 118 | @article{goh2002classification, 119 | title={Classification of scale-free networks}, 120 | author={Goh, Kwang-Il and Oh, Eulsik and Jeong, Hawoong and Kahng, Byungnam and Kim, Doochul}, 121 | journal={Proceedings of the National Academy of Sciences}, 122 | volume={99}, 123 | number={20}, 124 | pages={12583--12588}, 125 | year={2002}, 126 | publisher={National Acad Sciences} 127 | } 128 | 129 | @article{anthonisse1971rush, 130 | title={The rush in a graph}, 131 | author={Anthonisse, Jac M}, 132 | journal={Amsterdam: University of Amsterdam Mathematical Centre}, 133 | year={1971} 134 | } 135 | 136 | @article{freeman1977set, 137 | title={A set of measures of centrality based on betweenness}, 138 | author={Freeman, Linton C}, 139 | journal={Sociometry}, 140 | pages={35--41}, 141 | year={1977}, 142 | publisher={JSTOR} 143 | } 144 | 145 | @article{goh2001universal, 146 | title={Universal behavior of load distribution in scale-free networks}, 147 | author={Goh, K-I and Kahng, B and Kim, D}, 148 | journal={Physical Review Letters}, 149 | volume={87}, 150 | number={27}, 151 | pages={278701}, 152 | year={2001}, 153 | publisher={APS} 154 | } 155 | 156 | @article{adamic2000power, 157 | title={Power-law distribution of the world wide web}, 158 | author={Adamic, Lada A and Huberman, Bernardo A}, 159 | journal={Science}, 160 | volume={287}, 161 | number={5461}, 162 | pages={2115--2115}, 163 | year={2000}, 164 | publisher={American Association for the Advancement of Science} 165 | } 166 | 167 | @article{bianconi2001competition, 168 | title={Competition and multiscaling in evolving networks}, 169 | author={Bianconi, Ginestra and Barab{\'a}si, A-L}, 170 | journal={EPL (Europhysics Letters)}, 171 | volume={54}, 172 | number={4}, 173 | pages={436}, 174 | year={2001}, 175 | publisher={IOP Publishing} 176 | } 177 | 178 | @article{krapivsky2000connectivity, 179 | title={Connectivity of growing random networks}, 180 | author={Krapivsky, Paul L and Redner, Sidney and Leyvraz, Francois}, 181 | journal={Physical review letters}, 182 | volume={85}, 183 | number={21}, 184 | pages={4629}, 185 | year={2000}, 186 | publisher={APS} 187 | } 188 | 189 | @article{dorogovtsev2000structure, 190 | title={Structure of growing networks with preferential linking}, 191 | author={Dorogovtsev, Sergey N and Mendes, Jos{\'e} Fernando Ferreira and Samukhin, Alexander N}, 192 | journal={Physical Review Letters}, 193 | volume={85}, 194 | number={21}, 195 | pages={4633}, 196 | year={2000}, 197 | publisher={APS} 198 | } 199 | 200 | @article{barabasi2000scale, 201 | title={Scale-free characteristics of random networks: the topology of the world-wide web}, 202 | author={Barab{\'a}si, Albert-L{\'a}szl{\'o} and Albert, R{\'e}ka and Jeong, Hawoong}, 203 | journal={Physica A: Statistical Mechanics and its Applications}, 204 | volume={281}, 205 | number={1}, 206 | pages={69--77}, 207 | year={2000}, 208 | publisher={Elsevier} 209 | } 210 | 211 | @inproceedings{price1965statistical, 212 | title={Statistical studies of networks of scientific papers}, 213 | author={Price, D}, 214 | booktitle={Statistical Association Methods for Mechanized Documentation: Symposium Proceedings}, 215 | volume={269}, 216 | pages={187}, 217 | year={1965}, 218 | organization={US Government Printing Office} 219 | } 220 | 221 | @article{redner1998popular, 222 | title={How popular is your paper? An empirical study of the citation distribution}, 223 | author={Redner, Sidney}, 224 | journal={The European Physical Journal B-Condensed Matter and Complex Systems}, 225 | volume={4}, 226 | number={2}, 227 | pages={131--134}, 228 | year={1998}, 229 | publisher={Springer} 230 | } 231 | 232 | @article{merton1968matthew, 233 | title={The Matthew effect in science}, 234 | author={Merton, Robert K}, 235 | journal={Science}, 236 | volume={159}, 237 | number={3810}, 238 | pages={56--63}, 239 | year={1968}, 240 | publisher={Washington} 241 | } 242 | 243 | @article{barabasi1999emergence, 244 | title={Emergence of scaling in random networks}, 245 | author={Barab{\'a}si, Albert-L{\'a}szl{\'o} and Albert, R{\'e}ka}, 246 | journal={science}, 247 | volume={286}, 248 | number={5439}, 249 | pages={509--512}, 250 | year={1999}, 251 | publisher={American Association for the Advancement of Science} 252 | } 253 | 254 | 255 | @article{gilbert1959random, 256 | title={Random Graphs}, 257 | author={Edgar Nelson Gilbert}, 258 | journal={Annals of Mathematical Statistics}, 259 | volume={30}, 260 | number={4}, 261 | pages={1141--1144}, 262 | year={1959}, 263 | doi={10.1214/aoms/1177706098}, 264 | url={http://dx.doi.org/10.1214/aoms/1177706098} 265 | } 266 | 267 | @article{erdos1959random, 268 | title={On Random Graphs. I}, 269 | author={Paul Erd{\H{o}}s and Alfr{\'e}d R{\'e}nyi}, 270 | journal={Publicationes Mathematicae}, 271 | volume={6}, 272 | pages={290--297}, 273 | year={1959}, 274 | url={http://www.renyi.hu/~p_erdos/1959-11.pdf} 275 | } 276 | 277 | @article{luce1949method, 278 | title={A method of matrix analysis of group structure}, 279 | author={R. Duncan Luce and Albert D. Perry}, 280 | journal={Psychometrika}, 281 | volume={14}, 282 | number={2}, 283 | pages={95--116}, 284 | year={1949}, 285 | doi={10.1007/BF02289146}, 286 | url={http://dx.doi.org/10.1007/BF02289146}, 287 | publisher={Springer-Verlag} 288 | } 289 | 290 | @article{li2005towards, 291 | title={Towards a theory of scale-free graphs: Definition, properties, and implications}, 292 | author={Li, Lun and Alderson, David and Doyle, John C and Willinger, Walter}, 293 | journal={Internet Mathematics}, 294 | volume={2}, 295 | number={4}, 296 | pages={431--523}, 297 | year={2005}, 298 | publisher={Taylor \& Francis} 299 | } 300 | 301 | @article{solomonoff1951connectivity, 302 | title={Connectivity of random nets}, 303 | author={Ray Solomonoff and Anatol Rapoport}, 304 | year={1951}, 305 | journal={The bulletin of mathematical biophysics}, 306 | volume={13}, 307 | number={2}, 308 | doi={10.1007/BF02478357}, 309 | url={http://dx.doi.org/10.1007/BF02478357}, 310 | publisher={Kluwer Academic Publishers}, 311 | pages={107-117} 312 | } 313 | 314 | 315 | @article{albert1999diameter, 316 | title={The diameter of the world wide web}, 317 | author={Reka Albert and Hawoong Jeong and Albert-L{\'a}szl{\'o} Barab{\'a}si}, 318 | jurnal={Nature}, 319 | volume={401}, 320 | pages={130--131}, 321 | year={1999}, 322 | month={9}, 323 | doi={10.1038/43601} 324 | } 325 | 326 | @article{wang2003complex, 327 | title={Complex networks: small-world, scale-free and beyond}, 328 | author={Xiao Fan Wang and Guanrong Chen}, 329 | journal={Circuits and Systems Magazine, IEEE}, 330 | volume={3}, 331 | number={1}, 332 | pages={6-20}, 333 | year={2003}, 334 | doi={10.1109/MCAS.2003.1228503} 335 | } 336 | 337 | @inproceedings{leskovec2008msn, 338 | title={Planetary-Scale Views on a Large Instant-Messaging Network}, 339 | author={Jure Leskovec and Eric Horvitz}, 340 | booktitle={Proceedings of the 17th international conference on World Wide Web}, 341 | publisher = {ACM}, 342 | address = {New York}, 343 | year={2008}, 344 | } 345 | 346 | @techreport{leskovec2007msn, 347 | title={Worldwide Buzz: Planetary-Scale Views on an Instant-Messaging Network}, 348 | author={Jure Leskovec and Eric Horvitz}, 349 | institution={Microsoft Research}, 350 | year={2007}, 351 | month={7}, 352 | key={Microsoft Research Technical Report MSR-TR-2006-186} 353 | } 354 | 355 | @book{fass1996bacon, 356 | title={Six Degrees of {K}evin {B}acon}, 357 | author={Craig Fass and Brian Turtle and Mike Ginelli}, 358 | year={1996}, 359 | publisher={Plume}, 360 | address={New York City} 361 | } 362 | 363 | @online{reynolds2011bacon, 364 | title={The Oracle of {B}acon}, 365 | author={Patrick Reynolds}, 366 | url = {http://oracleofbacon.org/cgi-bin/center-cgi?who=Kevin+Bacon}, 367 | citedate = {2011-07-12} 368 | } 369 | 370 | @article{newman2001structure, 371 | title = {The structure of scientific collaboration networks}, 372 | author = {Mark Newman}, 373 | journal = {Proceedings of the National Academy of Sciences} , 374 | volume = {98}, 375 | number = {2}, 376 | pages = {404-409}, 377 | year = {2001}, 378 | doi = {10.1073/pnas.98.2.404} 379 | } 380 | 381 | @online{grossman2011erdos, 382 | title={Publications of {P}aul {E}rd{\H{o}}s}, 383 | author={Jerry Grossman}, 384 | url = {http://www.oakland.edu/enp/pubinfo/}, 385 | citedate = {2011-02-01}, 386 | } 387 | 388 | @online{oakland2009erdos, 389 | title={The {E}rd{\H{o}}s Number Project Data Files}, 390 | author={Oakland University}, 391 | year={2009}, 392 | url = {http://www.oakland.edu/enp/thedata/}, 393 | citedate = {2010-05-29} 394 | } 395 | 396 | @article{goffman1969erdos, 397 | title={And what is your {E}rd{\H{o}}s number?}, 398 | author={Casper Goffman}, 399 | journal={American Mathematical Monthly}, 400 | volume={76}, 401 | number={7}, 402 | pages={791}, 403 | year={1969} 404 | } 405 | 406 | @article{milgram1967small, 407 | title={The Small World Problem}, 408 | author={Stanley Milgram}, 409 | journal={Psychology Today}, 410 | volume={2}, 411 | pages={60--67}, 412 | year={1967} 413 | } 414 | 415 | @article{travers1969experimental, 416 | title={An Experimental Study of the Small World Problem}, 417 | author={Jeffrey Travers and Stanley Milgram}, 418 | journal={Sociometry}, 419 | volume={32}, 420 | number={4}, 421 | pages={425--443}, 422 | year={1969} 423 | } 424 | 425 | @phdthesis{gurevich1961phd, 426 | title={The Social Structure of Acquaintanceship Networks}, 427 | author={Michael Gurevich}, 428 | school={Massachusetts Institute of Technology}, 429 | year={1961}, 430 | address={Cambridge, MA} 431 | } 432 | 433 | @incollection{marconi1909nobel, 434 | title={Wireless telegraphic communication}, 435 | author={Guglielmo Marconi}, 436 | booktitle={Nobel Prize address}, 437 | year={1909}, 438 | } 439 | 440 | @article{pool1978, 441 | title = {Contacts and influence}, 442 | author = {{Ithiel} {de Sola Pool} and Manfred Kochen}, 443 | year = {1978}, 444 | journal = {Social Networks}, 445 | pages = {5-51}, 446 | volume = {1}, 447 | issue = {1} 448 | } 449 | 450 | @book{barabasi2003linked, 451 | title={Linked: How Everything is Connected to Everything Else and What It Means for Business, Science, and Everyday Life}, 452 | author={Albert-L{\'a}szl{\'o} Barab{\'a}si}, 453 | year={2003}, 454 | publisher={Plume}, 455 | address={New York} 456 | } 457 | 458 | @inproceedings{herrera2011generating, 459 | title={Generating scale-free networks with adjustable clustering coefficient via random walks}, 460 | author={Herrera, Carlos and Zufiria, Pedro J}, 461 | booktitle={Network Science Workshop (NSW), 2011 IEEE}, 462 | pages={167--172}, 463 | year={2011}, 464 | organization={IEEE} 465 | } 466 | 467 | @article{gyarmati2010scafida, 468 | title={Scafida: A scale-free network inspired data center architecture}, 469 | author={L{\'a}szl{\'o} Gyarmati and {Tuan Anh} {Trinh}}, 470 | journal={ACM SIGCOMM Computer Communication Review}, 471 | volume={40}, 472 | number={5}, 473 | pages={4--12}, 474 | year={2010}, 475 | publisher={ACM} 476 | } 477 | 478 | @inproceedings{greenberg2008towards, 479 | title={Towards a next generation data center architecture: scalability and commoditization}, 480 | author={Greenberg, Albert and Lahiri, Parantap and Maltz, David A and Patel, Parveen and Sengupta, Sudipta}, 481 | booktitle={Proceedings of the ACM workshop on Programmable routers for extensible services of tomorrow}, 482 | pages={57--62}, 483 | year={2008}, 484 | organization={ACM} 485 | } 486 | 487 | @book{leighton1992introduction, 488 | title={Introduction to parallel algorithms and architectures}, 489 | author={Leighton, Frank Thomson}, 490 | year={1992}, 491 | publisher={Morgan Kaufmann San Francisco} 492 | } 493 | 494 | @article{guo2009bcube, 495 | title={BCube: a high performance, server-centric network architecture for modular data centers}, 496 | author={Guo, Chuanxiong and Lu, Guohan and Li, Dan and Wu, Haitao and Zhang, Xuan and Shi, Yunfeng and Tian, Chen and Zhang, Yongguang and Lu, Songwu}, 497 | journal={ACM SIGCOMM Computer Communication Review}, 498 | volume={39}, 499 | number={4}, 500 | pages={63--74}, 501 | year={2009}, 502 | publisher={ACM} 503 | } 504 | 505 | @inproceedings{guo2008dcell, 506 | title={Dcell: a scalable and fault-tolerant network structure for data centers}, 507 | author={Guo, Chuanxiong and Wu, Haitao and Tan, Kun and Shi, Lei and Zhang, Yongguang and Lu, Songwu}, 508 | booktitle={ACM SIGCOMM Computer Communication Review}, 509 | volume={38}, 510 | issue={4}, 511 | pages={75--86}, 512 | year={2008}, 513 | organization={ACM} 514 | } 515 | 516 | @inproceedings{lockwood2007netfpga, 517 | title={NetFPGA--an open platform for gigabit-rate network switching and routing}, 518 | author={Lockwood, John W and McKeown, Nick and Watson, Greg and Gibb, Glen and Hartke, Paul and Naous, Jad and Raghuraman, Ramanan and Luo, Jianying}, 519 | booktitle={Microelectronic Systems Education, 2007. MSE'07. IEEE International Conference on}, 520 | pages={160--161}, 521 | year={2007}, 522 | organization={IEEE} 523 | } 524 | 525 | @online{NVIDIAGRID, 526 | author = {{NVIDIA Corporation}}, 527 | title = {Nvidia GRID}, 528 | year = {2013}, 529 | url = {http://www.nvidia.com/object/cloud-gaming.html}, 530 | citedate = {2013-03-10} 531 | } 532 | 533 | @program{VDE, 534 | author = {{SourceForge}}, 535 | title = {VDE: Virtual Distributed Ethernet}, 536 | year = {2013}, 537 | url = {https://vde.sourceforge.net}, 538 | citedate = {2013-03-09} 539 | } 540 | 541 | @online{QUAGGA, 542 | title = {{Quagga} Routing Suite}, 543 | url = {http://www.nongnu.org/quagga/}, 544 | citedate = {2013-03-09} 545 | } 546 | 547 | @article{kohler2000click, 548 | title={The Click modular router}, 549 | author={Kohler, Eddie and Morris, Robert and Chen, Benjie and Jannotti, John and Kaashoek, M Frans}, 550 | journal={ACM Transactions on Computer Systems (TOCS)}, 551 | volume={18}, 552 | number={3}, 553 | pages={263--297}, 554 | year={2000}, 555 | publisher={ACM} 556 | } 557 | 558 | @article{han2010packetshader, 559 | title={PacketShader: a GPU-accelerated software router}, 560 | author={Han, Sangjin and Jang, Keon and Park, KyoungSoo and Moon, Sue}, 561 | journal={ACM SIGCOMM Computer Communication Review}, 562 | volume={40}, 563 | number={4}, 564 | pages={195--206}, 565 | year={2010}, 566 | publisher={ACM} 567 | } 568 | 569 | @inproceedings{dobrescu2009routebricks, 570 | title={RouteBricks: exploiting parallelism to scale software routers}, 571 | author={Dobrescu, Mihai and Egi, Norbert and Argyraki, Katerina and Chun, Byung-Gon and Fall, Kevin and Iannaccone, Gianluca and Knies, Allan and Manesh, Maziar and Ratnasamy, Sylvia}, 572 | booktitle={Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles}, 573 | pages={15--28}, 574 | year={2009}, 575 | organization={ACM} 576 | } 577 | 578 | @article{hu2011review, 579 | title={A Review on cloud computing: Design challenges in Architecture and Security}, 580 | author={{HU Fei} and {QIU Meikang} and {LI Jiayin} and Grant, Travis and 581 | Taylor, Drew and McCaleb, Seth and Butler, Lee and Hamner, 582 | Richard}, 583 | journal={Journal of Computing and Information Technology}, 584 | volume={19}, 585 | number={1}, 586 | pages={25--55}, 587 | year={2011} 588 | } 589 | 590 | @techreport{varia2010architecting, 591 | title={Architecting for the cloud: Best practices}, 592 | author={Varia, Jinesh}, 593 | institution={Amazon Web Services}, 594 | year={2010} 595 | } 596 | 597 | @inproceedings{greenberg2009vl2, 598 | title={VL2: a scalable and flexible data center network}, 599 | author={Greenberg, Albert and Hamilton, James R and Jain, Navendu and Kandula, Srikanth and Kim, Changhoon and Lahiri, Parantap and Maltz, David A and Patel, Parveen and Sengupta, Sudipta}, 600 | booktitle={ACM SIGCOMM Computer Communication Review}, 601 | volume={39}, 602 | issue={4}, 603 | pages={51--62}, 604 | year={2009}, 605 | organization={ACM} 606 | } 607 | 608 | @inproceedings{al2008scalable, 609 | title={A scalable, commodity data center network architecture}, 610 | author={Al-Fares, Mohammad and Loukissas, Alexander and Vahdat, Amin}, 611 | booktitle={ACM SIGCOMM Computer Communication Review}, 612 | volume={38}, 613 | issue={4}, 614 | pages={63--74}, 615 | year={2008}, 616 | organization={ACM} 617 | } 618 | 619 | @article{pallis2006insight, 620 | title={Insight and perspectives for content delivery networks}, 621 | author={Pallis, George and Vakali, Athena}, 622 | journal={Communications of the ACM}, 623 | volume={49}, 624 | number={1}, 625 | pages={101--106}, 626 | year={2006}, 627 | publisher={ACM} 628 | } 629 | 630 | @article{Dean2009, 631 | author = {Dean, J}, 632 | title = {Designs, Lessons, and Advice from Building Large Distributed Systems.}, 633 | year = {2009}, 634 | month = {Oct}, 635 | journal = {Keynote from LADIS 2009} 636 | } 637 | 638 | @article{broder2000graph, 639 | title={Graph structure in the web}, 640 | author={Broder, Andrei and Kumar, Ravi and Maghoul, Farzin and Raghavan, Prabhakar and Rajagopalan, Sridhar and Stata, Raymie and Tomkins, Andrew and Wiener, Janet}, 641 | journal={Computer networks}, 642 | volume={33}, 643 | number={1}, 644 | pages={309--320}, 645 | year={2000}, 646 | publisher={Elsevier} 647 | } 648 | 649 | @article{kleinberg1999authoritative, 650 | title={Authoritative sources in a hyperlinked environment}, 651 | author={Kleinberg, Jon M}, 652 | journal={Journal of the ACM (JACM)}, 653 | volume={46}, 654 | number={5}, 655 | pages={604--632}, 656 | year={1999}, 657 | publisher={ACM} 658 | } 659 | 660 | @INPROCEEDINGS{Kleinberg00thesmall-world, 661 | author = {Jon Kleinberg}, 662 | title = {The Small-World Phenomenon: An Algorithmic Perspective}, 663 | booktitle = {in Proceedings of the 32nd ACM Symposium on Theory of Computing}, 664 | year = {2000}, 665 | pages = {163--170} 666 | }Ï 667 | 668 | @article{watts1998smallworld, 669 | author = {Duncan Watts and Steven Strogatz}, 670 | title = {Collective dynamics of ``small-world'' networks}, 671 | journal = {Nature}, 672 | year = {1998}, 673 | month = {6}, 674 | volume = {393}, 675 | pages = {440-442}, 676 | doi = {10.1038/30918} 677 | } 678 | 679 | @article{1967Milgram, 680 | author = {Stanley Milgram}, 681 | year = {1967}, 682 | title = {The Small World Problem}, 683 | journal = {Psychology Today}, 684 | volume = 2, 685 | pages = {60-67} 686 | } 687 | 688 | 689 | @webpage{wikipedia_moores_law, 690 | title = {{Moore's law}}, 691 | author = {{Wikipedia contributors}}, 692 | publisher = {Wikipedia, The Free Encyclopedia}, 693 | year = {2015}, 694 | url = {https://en.wikipedia.org/wiki/Moore%27s_law}, 695 | modifydate = {2015/06/14}, 696 | citedate = {2015/06/15} 697 | } 698 | 699 | @webpage{dubash2010, 700 | title = {{Moore's Law is dead, says Gordon Moore}}, 701 | author = {Manek Dubash}, 702 | publisher = {Techworld}, 703 | year = {2010}, 704 | month = {4}, 705 | url = {http://www.techworld.com/news/operating-systems/moores-law-is-dead-says-gordon-moore-3576581/}, 706 | modifydate={2010/4/13}, 707 | citedate={2015/6/16} 708 | } 709 | 710 | @webpage{kanellos2003, 711 | author = {Michael Kanellos}, 712 | title = {{Intel scientists find wall for Moore's Law}}, 713 | publisher = {CNET}, 714 | year = {2003}, 715 | month = {12}, 716 | url = {http://news.cnet.com/2100-1008-5112061.html}, 717 | modifydate={2003/12/1}, 718 | citedate={2015/6/16} 719 | } 720 | 721 | @webpage{intel2014, 722 | title = {{Intel discloses newest microarchitecture and 14 nanometer manufacturing process technical details}}, 723 | author = {{Intel Corporation}}, 724 | publisher = {{Intel Corporation}}, 725 | year = {2014}, 726 | month = {8}, 727 | url = {http://newsroom.intel.com/community/intel_newsroom/blog/2014/08/11/intel-discloses-newest-microarchitecture-and-14-nanometer-manufacturing-process-technical-details}, 728 | modifydate={2014/8/11}, 729 | citedate={2015/6/16} 730 | } 731 | 732 | @webpage{moammer2015, 733 | title = {{TSMC Launching 10nm FinFET Process In 2016, 7nm In 2017}}, 734 | author = {Khalid Moammer}, 735 | publisher = {WCCF Tech}, 736 | year = {2015}, 737 | month = {4}, 738 | url = {http://wccftech.com/tsmc-promises-10nm-production-2016-7nm-2017/}, 739 | modifydate={2015/4/19}, 740 | citedate={2015/6/16} 741 | } 742 | 743 | @webpage{shrout2014, 744 | title = {{Intel Xeon E5-2600 v3 processor overview: Haswell-EP up to 18 cores}}, 745 | author = {Ryan Shrout}, 746 | year = {2014}, 747 | month = {9}, 748 | url = {http://www.pcper.com/reviews/Processors/Intel-Xeon-E5-2600-v3-Processor-Overview-Haswell-EP-18-Cores}, 749 | modifydate = {2014/9/8}, 750 | citedate = {2015/6/16} 751 | } 752 | 753 | @webpage{intel2012, 754 | title = {{Intel chips timeline}}, 755 | author = {{Intel Corporation}}, 756 | publisher = {{Intel Corporation}}, 757 | year = {2012}, 758 | month = {7}, 759 | url = {http://www.intel.co.uk/content/www/uk/en/history/history-intel-chips-timeline-poster.html}, 760 | modifydate={2012/7/13}, 761 | citedate={2015/6/16} 762 | } 763 | 764 | @webpage{wikipedia_transistor_count, 765 | title = {{Transistor count}}, 766 | author = {{Wikipedia contributors}}, 767 | publisher = {Wikipedia, The Free Encyclopedia}, 768 | year = {2015}, 769 | url = {https://en.wikipedia.org/wiki/Transistor_count}, 770 | modifydate = {2015/6/10}, 771 | citedate={2015/6/16} 772 | } 773 | -------------------------------------------------------------------------------- /master.tex: -------------------------------------------------------------------------------- 1 | %% 使用 jnuthesis 文档类生成南京大学学位论文的示例文档 2 | %% 3 | %% 作者：胡海星，starfish (at) gmail (dot) com 4 | %% 项目主页: http://haixing-hu.github.io/jnu-thesis/ 5 | %% 6 | %% 本样例文档中用到了吕琦同学的博士论文的提高和部分内容，在此对他表示感谢。 7 | %% 8 | \documentclass[master,sourcefonts]{jnuthesis} 9 | %% jnuthesis 文档类的可选参数有： 10 | %% nobackinfo 取消封二页导师签名信息。注意，按照南大的规定，是需要签名页的。 11 | %% phd/master/bachelor 选择博士/硕士/学士论文 12 | 13 | % 引用公共导言 14 | \input{master-preamble} 15 | 16 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 17 | \begin{document} 18 | 19 | % 引用公共正文 20 | \input{master-contents} 21 | 22 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 23 | % 书籍附件 24 | \backmatter 25 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 26 | % 作者简历与科研成果页，应放在backmatter之后 27 | \begin{resume} 28 | % 论文作者在攻读学位期间所发表的文章的列表，按发表日期从近到远排列。 29 | \begin{publications} 30 | \item Xiaobao Wei, Jinnan Chen, ``Voting-on-Grid Clustering for Secure 31 | Localization in Wireless Sensor Networks,'' in \textsl{Proc. IEEE International 32 | Conference on Communications (ICC) 2010}, May. 2010. 33 | \item Xiaobao Wei, Shiba Mao, Jinnan Chen, ``Protecting Source Location Privacy 34 | in Wireless Sensor Networks with Data Aggregation,'' in \textsl{Proc. 6th 35 | International Conference on Ubiquitous Intelligence and Computing (UIC) 36 | 2009}, Oct. 2009. 37 | \end{publications} 38 | \end{resume} 39 | 40 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 41 | \end{document} 42 | -------------------------------------------------------------------------------- /phd.bib: -------------------------------------------------------------------------------- 1 | % -*- coding: utf-8 -*- 2 | 3 | @book{newman2006structure, 4 | title={The structure and dynamics of networks}, 5 | author={Newman, Mark and Barab{\'a}si, Albert-L{\'a}szl{\'o} and Watts, Duncan J}, 6 | year={2006}, 7 | publisher={Princeton University Press}, 8 | address={Princeton}, 9 | } 10 | 11 | @article{newman2001random, 12 | title={Random graphs with arbitrary degree distributions and their applications}, 13 | author={Newman, Mark EJ and Strogatz, Steven H and Watts, Duncan J}, 14 | journal={Physical Review E}, 15 | volume={64}, 16 | number={2}, 17 | pages={026118}, 18 | year={2001}, 19 | publisher={APS}, 20 | } 21 | 22 | @inproceedings{aiello2000random, 23 | title={A random graph model for massive graphs}, 24 | author={Aiello, William and Chung, Fan and Lu, Linyuan}, 25 | booktitle={Proceedings of the thirty-second annual ACM symposium on Theory of computing}, 26 | pages={171--180}, 27 | year={2000}, 28 | publisher = {ACM}, 29 | address = {New York}, 30 | } 31 | 32 | @article{molloy1995critical, 33 | title={A critical point for random graphs with a given degree sequence}, 34 | author={Molloy, Michael and Reed, Bruce}, 35 | journal={Random structures \& algorithms}, 36 | volume={6}, 37 | number={2-3}, 38 | pages={161--180}, 39 | year={1995}, 40 | publisher={Wiley Online Library} 41 | } 42 | 43 | @article{frieze1992independence, 44 | title={On the independence and chromatic numbers of random regular graphs}, 45 | author={Frieze, Alan M and {\L}uczak, T}, 46 | journal={Journal of Combinatorial Theory, Series B}, 47 | volume={54}, 48 | number={1}, 49 | pages={123--132}, 50 | year={1992}, 51 | publisher={Elsevier} 52 | } 53 | 54 | @article{bender1978asymptotic, 55 | title={The asymptotic number of labeled graphs with given degree sequences}, 56 | author={Bender, Edward A and Canfield, E Rodney}, 57 | journal={Journal of Combinatorial Theory, Series A}, 58 | volume={24}, 59 | number={3}, 60 | pages={296--307}, 61 | year={1978}, 62 | publisher={Elsevier} 63 | } 64 | 65 | @book{bollobas2001random, 66 | title={Random graphs}, 67 | author={Bollob{\'a}s, B{\'e}la}, 68 | volume={73}, 69 | year={2001}, 70 | publisher={Cambridge university press} 71 | } 72 | 73 | @article{erdHos1961strength, 74 | title={On the strength of connectedness of a random graph}, 75 | author={Erd{\H{o}}s, Paul and Renyi, Alfred}, 76 | journal={Acta Mathematica Hungarica}, 77 | volume={12}, 78 | number={1}, 79 | pages={261--267}, 80 | year={1961}, 81 | publisher={Akad{\'e}miai Kiad{\'o}, co-published with Springer Science+ Business Media BV, Formerly Kluwer Academic Publishers BV} 82 | } 83 | 84 | @article{erdos1960additive, 85 | title={Additive properties of random sequences of positive integers}, 86 | author={Erd{\"o}s, Paul and R{\'e}nyi, Alfr{\'e}d}, 87 | journal={Acta Arithmetica}, 88 | volume={6}, 89 | number={1}, 90 | pages={83--110}, 91 | year={1960}, 92 | publisher={Institute of Mathematics Polish Academy of Sciences} 93 | } 94 | 95 | @article{vazquez2002modeling, 96 | title={Modeling of protein interaction networks}, 97 | author={V{\'a}zquez, Alexei and Flammini, Alessandro and Maritan, Amos and Vespignani, Alessandro}, 98 | journal={Complexus}, 99 | volume={1}, 100 | number={1}, 101 | pages={38--44}, 102 | year={2002}, 103 | publisher={Karger Publishers} 104 | } 105 | 106 | @article{sole2002model, 107 | title={A model of large-scale proteome evolution}, 108 | author={Sol{\'e}, Ricard V and Pastor-Satorras, Romualdo and Smith, Eric and Kepler, Thomas B}, 109 | journal={Advances in Complex Systems}, 110 | volume={5}, 111 | number={01}, 112 | pages={43--54}, 113 | year={2002}, 114 | publisher={World Scientific} 115 | } 116 | 117 | 118 | @article{goh2002classification, 119 | title={Classification of scale-free networks}, 120 | author={Goh, Kwang-Il and Oh, Eulsik and Jeong, Hawoong and Kahng, Byungnam and Kim, Doochul}, 121 | journal={Proceedings of the National Academy of Sciences}, 122 | volume={99}, 123 | number={20}, 124 | pages={12583--12588}, 125 | year={2002}, 126 | publisher={National Acad Sciences} 127 | } 128 | 129 | @article{anthonisse1971rush, 130 | title={The rush in a graph}, 131 | author={Anthonisse, Jac M}, 132 | journal={Amsterdam: University of Amsterdam Mathematical Centre}, 133 | year={1971} 134 | } 135 | 136 | @article{freeman1977set, 137 | title={A set of measures of centrality based on betweenness}, 138 | author={Freeman, Linton C}, 139 | journal={Sociometry}, 140 | pages={35--41}, 141 | year={1977}, 142 | publisher={JSTOR} 143 | } 144 | 145 | @article{goh2001universal, 146 | title={Universal behavior of load distribution in scale-free networks}, 147 | author={Goh, K-I and Kahng, B and Kim, D}, 148 | journal={Physical Review Letters}, 149 | volume={87}, 150 | number={27}, 151 | pages={278701}, 152 | year={2001}, 153 | publisher={APS} 154 | } 155 | 156 | @article{adamic2000power, 157 | title={Power-law distribution of the world wide web}, 158 | author={Adamic, Lada A and Huberman, Bernardo A}, 159 | journal={Science}, 160 | volume={287}, 161 | number={5461}, 162 | pages={2115--2115}, 163 | year={2000}, 164 | publisher={American Association for the Advancement of Science} 165 | } 166 | 167 | @article{bianconi2001competition, 168 | title={Competition and multiscaling in evolving networks}, 169 | author={Bianconi, Ginestra and Barab{\'a}si, A-L}, 170 | journal={EPL (Europhysics Letters)}, 171 | volume={54}, 172 | number={4}, 173 | pages={436}, 174 | year={2001}, 175 | publisher={IOP Publishing} 176 | } 177 | 178 | @article{krapivsky2000connectivity, 179 | title={Connectivity of growing random networks}, 180 | author={Krapivsky, Paul L and Redner, Sidney and Leyvraz, Francois}, 181 | journal={Physical review letters}, 182 | volume={85}, 183 | number={21}, 184 | pages={4629}, 185 | year={2000}, 186 | publisher={APS} 187 | } 188 | 189 | @article{dorogovtsev2000structure, 190 | title={Structure of growing networks with preferential linking}, 191 | author={Dorogovtsev, Sergey N and Mendes, Jos{\'e} Fernando Ferreira and Samukhin, Alexander N}, 192 | journal={Physical Review Letters}, 193 | volume={85}, 194 | number={21}, 195 | pages={4633}, 196 | year={2000}, 197 | publisher={APS} 198 | } 199 | 200 | @article{barabasi2000scale, 201 | title={Scale-free characteristics of random networks: the topology of the world-wide web}, 202 | author={Barab{\'a}si, Albert-L{\'a}szl{\'o} and Albert, R{\'e}ka and Jeong, Hawoong}, 203 | journal={Physica A: Statistical Mechanics and its Applications}, 204 | volume={281}, 205 | number={1}, 206 | pages={69--77}, 207 | year={2000}, 208 | publisher={Elsevier} 209 | } 210 | 211 | @inproceedings{price1965statistical, 212 | title={Statistical studies of networks of scientific papers}, 213 | author={Price, D}, 214 | booktitle={Statistical Association Methods for Mechanized Documentation: Symposium Proceedings}, 215 | volume={269}, 216 | pages={187}, 217 | year={1965}, 218 | organization={US Government Printing Office} 219 | } 220 | 221 | @article{redner1998popular, 222 | title={How popular is your paper? An empirical study of the citation distribution}, 223 | author={Redner, Sidney}, 224 | journal={The European Physical Journal B-Condensed Matter and Complex Systems}, 225 | volume={4}, 226 | number={2}, 227 | pages={131--134}, 228 | year={1998}, 229 | publisher={Springer} 230 | } 231 | 232 | @article{merton1968matthew, 233 | title={The Matthew effect in science}, 234 | author={Merton, Robert K}, 235 | journal={Science}, 236 | volume={159}, 237 | number={3810}, 238 | pages={56--63}, 239 | year={1968}, 240 | publisher={Washington} 241 | } 242 | 243 | @article{barabasi1999emergence, 244 | title={Emergence of scaling in random networks}, 245 | author={Barab{\'a}si, Albert-L{\'a}szl{\'o} and Albert, R{\'e}ka}, 246 | journal={science}, 247 | volume={286}, 248 | number={5439}, 249 | pages={509--512}, 250 | year={1999}, 251 | publisher={American Association for the Advancement of Science} 252 | } 253 | 254 | 255 | @article{gilbert1959random, 256 | title={Random Graphs}, 257 | author={Edgar Nelson Gilbert}, 258 | journal={Annals of Mathematical Statistics}, 259 | volume={30}, 260 | number={4}, 261 | pages={1141--1144}, 262 | year={1959}, 263 | doi={10.1214/aoms/1177706098}, 264 | url={http://dx.doi.org/10.1214/aoms/1177706098} 265 | } 266 | 267 | @article{erdos1959random, 268 | title={On Random Graphs. I}, 269 | author={Paul Erd{\H{o}}s and Alfr{\'e}d R{\'e}nyi}, 270 | journal={Publicationes Mathematicae}, 271 | volume={6}, 272 | pages={290--297}, 273 | year={1959}, 274 | url={http://www.renyi.hu/~p_erdos/1959-11.pdf} 275 | } 276 | 277 | @article{luce1949method, 278 | title={A method of matrix analysis of group structure}, 279 | author={R. Duncan Luce and Albert D. Perry}, 280 | journal={Psychometrika}, 281 | volume={14}, 282 | number={2}, 283 | pages={95--116}, 284 | year={1949}, 285 | doi={10.1007/BF02289146}, 286 | url={http://dx.doi.org/10.1007/BF02289146}, 287 | publisher={Springer-Verlag} 288 | } 289 | 290 | @article{li2005towards, 291 | title={Towards a theory of scale-free graphs: Definition, properties, and implications}, 292 | author={Li, Lun and Alderson, David and Doyle, John C and Willinger, Walter}, 293 | journal={Internet Mathematics}, 294 | volume={2}, 295 | number={4}, 296 | pages={431--523}, 297 | year={2005}, 298 | publisher={Taylor \& Francis} 299 | } 300 | 301 | @article{solomonoff1951connectivity, 302 | title={Connectivity of random nets}, 303 | author={Ray Solomonoff and Anatol Rapoport}, 304 | year={1951}, 305 | journal={The bulletin of mathematical biophysics}, 306 | volume={13}, 307 | number={2}, 308 | doi={10.1007/BF02478357}, 309 | url={http://dx.doi.org/10.1007/BF02478357}, 310 | publisher={Kluwer Academic Publishers}, 311 | pages={107-117} 312 | } 313 | 314 | 315 | @article{albert1999diameter, 316 | title={The diameter of the world wide web}, 317 | author={Reka Albert and Hawoong Jeong and Albert-L{\'a}szl{\'o} Barab{\'a}si}, 318 | jurnal={Nature}, 319 | volume={401}, 320 | pages={130--131}, 321 | year={1999}, 322 | month={9}, 323 | doi={10.1038/43601} 324 | } 325 | 326 | @article{wang2003complex, 327 | title={Complex networks: small-world, scale-free and beyond}, 328 | author={Xiao Fan Wang and Guanrong Chen}, 329 | journal={Circuits and Systems Magazine, IEEE}, 330 | volume={3}, 331 | number={1}, 332 | pages={6-20}, 333 | year={2003}, 334 | doi={10.1109/MCAS.2003.1228503} 335 | } 336 | 337 | @inproceedings{leskovec2008msn, 338 | title={Planetary-Scale Views on a Large Instant-Messaging Network}, 339 | author={Jure Leskovec and Eric Horvitz}, 340 | booktitle={Proceedings of the 17th international conference on World Wide Web}, 341 | publisher = {ACM}, 342 | address = {New York}, 343 | year={2008}, 344 | } 345 | 346 | @techreport{leskovec2007msn, 347 | title={Worldwide Buzz: Planetary-Scale Views on an Instant-Messaging Network}, 348 | author={Jure Leskovec and Eric Horvitz}, 349 | institution={Microsoft Research}, 350 | year={2007}, 351 | month={7}, 352 | key={Microsoft Research Technical Report MSR-TR-2006-186} 353 | } 354 | 355 | @book{fass1996bacon, 356 | title={Six Degrees of {K}evin {B}acon}, 357 | author={Craig Fass and Brian Turtle and Mike Ginelli}, 358 | year={1996}, 359 | publisher={Plume}, 360 | address={New York City} 361 | } 362 | 363 | @online{reynolds2011bacon, 364 | title={The Oracle of {B}acon}, 365 | author={Patrick Reynolds}, 366 | url = {http://oracleofbacon.org/cgi-bin/center-cgi?who=Kevin+Bacon}, 367 | citedate = {2011-07-12} 368 | } 369 | 370 | @article{newman2001structure, 371 | title = {The structure of scientific collaboration networks}, 372 | author = {Mark Newman}, 373 | journal = {Proceedings of the National Academy of Sciences} , 374 | volume = {98}, 375 | number = {2}, 376 | pages = {404-409}, 377 | year = {2001}, 378 | doi = {10.1073/pnas.98.2.404} 379 | } 380 | 381 | @online{grossman2011erdos, 382 | title={Publications of {P}aul {E}rd{\H{o}}s}, 383 | author={Jerry Grossman}, 384 | url = {http://www.oakland.edu/enp/pubinfo/}, 385 | citedate = {2011-02-01}, 386 | } 387 | 388 | @online{oakland2009erdos, 389 | title={The {E}rd{\H{o}}s Number Project Data Files}, 390 | author={Oakland University}, 391 | year={2009}, 392 | url = {http://www.oakland.edu/enp/thedata/}, 393 | citedate = {2010-05-29} 394 | } 395 | 396 | @article{goffman1969erdos, 397 | title={And what is your {E}rd{\H{o}}s number?}, 398 | author={Casper Goffman}, 399 | journal={American Mathematical Monthly}, 400 | volume={76}, 401 | number={7}, 402 | pages={791}, 403 | year={1969} 404 | } 405 | 406 | @article{milgram1967small, 407 | title={The Small World Problem}, 408 | author={Stanley Milgram}, 409 | journal={Psychology Today}, 410 | volume={2}, 411 | pages={60--67}, 412 | year={1967} 413 | } 414 | 415 | @article{travers1969experimental, 416 | title={An Experimental Study of the Small World Problem}, 417 | author={Jeffrey Travers and Stanley Milgram}, 418 | journal={Sociometry}, 419 | volume={32}, 420 | number={4}, 421 | pages={425--443}, 422 | year={1969} 423 | } 424 | 425 | @phdthesis{gurevich1961phd, 426 | title={The Social Structure of Acquaintanceship Networks}, 427 | author={Michael Gurevich}, 428 | school={Massachusetts Institute of Technology}, 429 | year={1961}, 430 | address={Cambridge, MA} 431 | } 432 | 433 | @incollection{marconi1909nobel, 434 | title={Wireless telegraphic communication}, 435 | author={Guglielmo Marconi}, 436 | booktitle={Nobel Prize address}, 437 | year={1909}, 438 | } 439 | 440 | @article{pool1978, 441 | title = {Contacts and influence}, 442 | author = {{Ithiel} {de Sola Pool} and Manfred Kochen}, 443 | year = {1978}, 444 | journal = {Social Networks}, 445 | pages = {5-51}, 446 | volume = {1}, 447 | issue = {1} 448 | } 449 | 450 | @book{barabasi2003linked, 451 | title={Linked: How Everything is Connected to Everything Else and What It Means for Business, Science, and Everyday Life}, 452 | author={Albert-L{\'a}szl{\'o} Barab{\'a}si}, 453 | year={2003}, 454 | publisher={Plume}, 455 | address={New York} 456 | } 457 | 458 | @inproceedings{herrera2011generating, 459 | title={Generating scale-free networks with adjustable clustering coefficient via random walks}, 460 | author={Herrera, Carlos and Zufiria, Pedro J}, 461 | booktitle={Network Science Workshop (NSW), 2011 IEEE}, 462 | pages={167--172}, 463 | year={2011}, 464 | organization={IEEE} 465 | } 466 | 467 | @article{gyarmati2010scafida, 468 | title={Scafida: A scale-free network inspired data center architecture}, 469 | author={L{\'a}szl{\'o} Gyarmati and {Tuan Anh} {Trinh}}, 470 | journal={ACM SIGCOMM Computer Communication Review}, 471 | volume={40}, 472 | number={5}, 473 | pages={4--12}, 474 | year={2010}, 475 | publisher={ACM} 476 | } 477 | 478 | @inproceedings{greenberg2008towards, 479 | title={Towards a next generation data center architecture: scalability and commoditization}, 480 | author={Greenberg, Albert and Lahiri, Parantap and Maltz, David A and Patel, Parveen and Sengupta, Sudipta}, 481 | booktitle={Proceedings of the ACM workshop on Programmable routers for extensible services of tomorrow}, 482 | pages={57--62}, 483 | year={2008}, 484 | organization={ACM} 485 | } 486 | 487 | @book{leighton1992introduction, 488 | title={Introduction to parallel algorithms and architectures}, 489 | author={Leighton, Frank Thomson}, 490 | year={1992}, 491 | publisher={Morgan Kaufmann San Francisco} 492 | } 493 | 494 | @article{guo2009bcube, 495 | title={BCube: a high performance, server-centric network architecture for modular data centers}, 496 | author={Guo, Chuanxiong and Lu, Guohan and Li, Dan and Wu, Haitao and Zhang, Xuan and Shi, Yunfeng and Tian, Chen and Zhang, Yongguang and Lu, Songwu}, 497 | journal={ACM SIGCOMM Computer Communication Review}, 498 | volume={39}, 499 | number={4}, 500 | pages={63--74}, 501 | year={2009}, 502 | publisher={ACM} 503 | } 504 | 505 | @inproceedings{guo2008dcell, 506 | title={Dcell: a scalable and fault-tolerant network structure for data centers}, 507 | author={Guo, Chuanxiong and Wu, Haitao and Tan, Kun and Shi, Lei and Zhang, Yongguang and Lu, Songwu}, 508 | booktitle={ACM SIGCOMM Computer Communication Review}, 509 | volume={38}, 510 | issue={4}, 511 | pages={75--86}, 512 | year={2008}, 513 | organization={ACM} 514 | } 515 | 516 | @inproceedings{lockwood2007netfpga, 517 | title={NetFPGA--an open platform for gigabit-rate network switching and routing}, 518 | author={Lockwood, John W and McKeown, Nick and Watson, Greg and Gibb, Glen and Hartke, Paul and Naous, Jad and Raghuraman, Ramanan and Luo, Jianying}, 519 | booktitle={Microelectronic Systems Education, 2007. MSE'07. IEEE International Conference on}, 520 | pages={160--161}, 521 | year={2007}, 522 | organization={IEEE} 523 | } 524 | 525 | @online{NVIDIAGRID, 526 | author = {{NVIDIA Corporation}}, 527 | title = {Nvidia GRID}, 528 | year = {2013}, 529 | url = {http://www.nvidia.com/object/cloud-gaming.html}, 530 | citedate = {2013-03-10} 531 | } 532 | 533 | @program{VDE, 534 | author = {{SourceForge}}, 535 | title = {VDE: Virtual Distributed Ethernet}, 536 | year = {2013}, 537 | url = {https://vde.sourceforge.net}, 538 | citedate = {2013-03-09} 539 | } 540 | 541 | @online{QUAGGA, 542 | title = {{Quagga} Routing Suite}, 543 | url = {http://www.nongnu.org/quagga/}, 544 | citedate = {2013-03-09} 545 | } 546 | 547 | @article{kohler2000click, 548 | title={The Click modular router}, 549 | author={Kohler, Eddie and Morris, Robert and Chen, Benjie and Jannotti, John and Kaashoek, M Frans}, 550 | journal={ACM Transactions on Computer Systems (TOCS)}, 551 | volume={18}, 552 | number={3}, 553 | pages={263--297}, 554 | year={2000}, 555 | publisher={ACM} 556 | } 557 | 558 | @article{han2010packetshader, 559 | title={PacketShader: a GPU-accelerated software router}, 560 | author={Han, Sangjin and Jang, Keon and Park, KyoungSoo and Moon, Sue}, 561 | journal={ACM SIGCOMM Computer Communication Review}, 562 | volume={40}, 563 | number={4}, 564 | pages={195--206}, 565 | year={2010}, 566 | publisher={ACM} 567 | } 568 | 569 | @inproceedings{dobrescu2009routebricks, 570 | title={RouteBricks: exploiting parallelism to scale software routers}, 571 | author={Dobrescu, Mihai and Egi, Norbert and Argyraki, Katerina and Chun, Byung-Gon and Fall, Kevin and Iannaccone, Gianluca and Knies, Allan and Manesh, Maziar and Ratnasamy, Sylvia}, 572 | booktitle={Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles}, 573 | pages={15--28}, 574 | year={2009}, 575 | organization={ACM} 576 | } 577 | 578 | @article{hu2011review, 579 | title={A Review on cloud computing: Design challenges in Architecture and Security}, 580 | author={{HU Fei} and {QIU Meikang} and {LI Jiayin} and Grant, Travis and 581 | Taylor, Drew and McCaleb, Seth and Butler, Lee and Hamner, 582 | Richard}, 583 | journal={Journal of Computing and Information Technology}, 584 | volume={19}, 585 | number={1}, 586 | pages={25--55}, 587 | year={2011} 588 | } 589 | 590 | @techreport{varia2010architecting, 591 | title={Architecting for the cloud: Best practices}, 592 | author={Varia, Jinesh}, 593 | institution={Amazon Web Services}, 594 | year={2010} 595 | } 596 | 597 | @inproceedings{greenberg2009vl2, 598 | title={VL2: a scalable and flexible data center network}, 599 | author={Greenberg, Albert and Hamilton, James R and Jain, Navendu and Kandula, Srikanth and Kim, Changhoon and Lahiri, Parantap and Maltz, David A and Patel, Parveen and Sengupta, Sudipta}, 600 | booktitle={ACM SIGCOMM Computer Communication Review}, 601 | volume={39}, 602 | issue={4}, 603 | pages={51--62}, 604 | year={2009}, 605 | organization={ACM} 606 | } 607 | 608 | @inproceedings{al2008scalable, 609 | title={A scalable, commodity data center network architecture}, 610 | author={Al-Fares, Mohammad and Loukissas, Alexander and Vahdat, Amin}, 611 | booktitle={ACM SIGCOMM Computer Communication Review}, 612 | volume={38}, 613 | issue={4}, 614 | pages={63--74}, 615 | year={2008}, 616 | organization={ACM} 617 | } 618 | 619 | @article{pallis2006insight, 620 | title={Insight and perspectives for content delivery networks}, 621 | author={Pallis, George and Vakali, Athena}, 622 | journal={Communications of the ACM}, 623 | volume={49}, 624 | number={1}, 625 | pages={101--106}, 626 | year={2006}, 627 | publisher={ACM} 628 | } 629 | 630 | @article{Dean2009, 631 | author = {Dean, J}, 632 | title = {Designs, Lessons, and Advice from Building Large Distributed Systems.}, 633 | year = {2009}, 634 | month = {Oct}, 635 | journal = {Keynote from LADIS 2009} 636 | } 637 | 638 | @article{broder2000graph, 639 | title={Graph structure in the web}, 640 | author={Broder, Andrei and Kumar, Ravi and Maghoul, Farzin and Raghavan, Prabhakar and Rajagopalan, Sridhar and Stata, Raymie and Tomkins, Andrew and Wiener, Janet}, 641 | journal={Computer networks}, 642 | volume={33}, 643 | number={1}, 644 | pages={309--320}, 645 | year={2000}, 646 | publisher={Elsevier} 647 | } 648 | 649 | @article{kleinberg1999authoritative, 650 | title={Authoritative sources in a hyperlinked environment}, 651 | author={Kleinberg, Jon M}, 652 | journal={Journal of the ACM (JACM)}, 653 | volume={46}, 654 | number={5}, 655 | pages={604--632}, 656 | year={1999}, 657 | publisher={ACM} 658 | } 659 | 660 | @INPROCEEDINGS{Kleinberg00thesmall-world, 661 | author = {Jon Kleinberg}, 662 | title = {The Small-World Phenomenon: An Algorithmic Perspective}, 663 | booktitle = {in Proceedings of the 32nd ACM Symposium on Theory of Computing}, 664 | year = {2000}, 665 | pages = {163--170} 666 | }Ï 667 | 668 | @article{watts1998smallworld, 669 | author = {Duncan Watts and Steven Strogatz}, 670 | title = {Collective dynamics of ``small-world'' networks}, 671 | journal = {Nature}, 672 | year = {1998}, 673 | month = {6}, 674 | volume = {393}, 675 | pages = {440-442}, 676 | doi = {10.1038/30918} 677 | } 678 | 679 | @article{1967Milgram, 680 | author = {Stanley Milgram}, 681 | year = {1967}, 682 | title = {The Small World Problem}, 683 | journal = {Psychology Today}, 684 | volume = 2, 685 | pages = {60-67} 686 | } 687 | 688 | 689 | @webpage{wikipedia_moores_law, 690 | title = {{Moore's law}}, 691 | author = {{Wikipedia contributors}}, 692 | publisher = {Wikipedia, The Free Encyclopedia}, 693 | year = {2015}, 694 | url = {https://en.wikipedia.org/wiki/Moore%27s_law}, 695 | modifydate = {2015/06/14}, 696 | citedate = {2015/06/15} 697 | } 698 | 699 | @webpage{dubash2010, 700 | title = {{Moore's Law is dead, says Gordon Moore}}, 701 | author = {Manek Dubash}, 702 | publisher = {Techworld}, 703 | year = {2010}, 704 | month = {4}, 705 | url = {http://www.techworld.com/news/operating-systems/moores-law-is-dead-says-gordon-moore-3576581/}, 706 | modifydate={2010/4/13}, 707 | citedate={2015/6/16} 708 | } 709 | 710 | @webpage{kanellos2003, 711 | author = {Michael Kanellos}, 712 | title = {{Intel scientists find wall for Moore's Law}}, 713 | publisher = {CNET}, 714 | year = {2003}, 715 | month = {12}, 716 | url = {http://news.cnet.com/2100-1008-5112061.html}, 717 | modifydate={2003/12/1}, 718 | citedate={2015/6/16} 719 | } 720 | 721 | @webpage{intel2014, 722 | title = {{Intel discloses newest microarchitecture and 14 nanometer manufacturing process technical details}}, 723 | author = {{Intel Corporation}}, 724 | publisher = {{Intel Corporation}}, 725 | year = {2014}, 726 | month = {8}, 727 | url = {http://newsroom.intel.com/community/intel_newsroom/blog/2014/08/11/intel-discloses-newest-microarchitecture-and-14-nanometer-manufacturing-process-technical-details}, 728 | modifydate={2014/8/11}, 729 | citedate={2015/6/16} 730 | } 731 | 732 | @webpage{moammer2015, 733 | title = {{TSMC Launching 10nm FinFET Process In 2016, 7nm In 2017}}, 734 | author = {Khalid Moammer}, 735 | publisher = {WCCF Tech}, 736 | year = {2015}, 737 | month = {4}, 738 | url = {http://wccftech.com/tsmc-promises-10nm-production-2016-7nm-2017/}, 739 | modifydate={2015/4/19}, 740 | citedate={2015/6/16} 741 | } 742 | 743 | @webpage{shrout2014, 744 | title = {{Intel Xeon E5-2600 v3 processor overview: Haswell-EP up to 18 cores}}, 745 | author = {Ryan Shrout}, 746 | year = {2014}, 747 | month = {9}, 748 | url = {http://www.pcper.com/reviews/Processors/Intel-Xeon-E5-2600-v3-Processor-Overview-Haswell-EP-18-Cores}, 749 | modifydate = {2014/9/8}, 750 | citedate = {2015/6/16} 751 | } 752 | 753 | @webpage{intel2012, 754 | title = {{Intel chips timeline}}, 755 | author = {{Intel Corporation}}, 756 | publisher = {{Intel Corporation}}, 757 | year = {2012}, 758 | month = {7}, 759 | url = {http://www.intel.co.uk/content/www/uk/en/history/history-intel-chips-timeline-poster.html}, 760 | modifydate={2012/7/13}, 761 | citedate={2015/6/16} 762 | } 763 | 764 | @webpage{wikipedia_transistor_count, 765 | title = {{Transistor count}}, 766 | author = {{Wikipedia contributors}}, 767 | publisher = {Wikipedia, The Free Encyclopedia}, 768 | year = {2015}, 769 | url = {https://en.wikipedia.org/wiki/Transistor_count}, 770 | modifydate = {2015/6/10}, 771 | citedate={2015/6/16} 772 | } 773 | -------------------------------------------------------------------------------- /reference/bachelor/本科毕业论文模板.doc: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/xen0n/JNUthesis/ebccab3730fdc2540e8e5a54629b11bf73b370ed/reference/bachelor/本科毕业论文模板.doc -------------------------------------------------------------------------------- /reference/bachelor/毕业设计（论文）相关资料外文资料翻译与原文封面.doc: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/xen0n/JNUthesis/ebccab3730fdc2540e8e5a54629b11bf73b370ed/reference/bachelor/毕业设计（论文）相关资料外文资料翻译与原文封面.doc -------------------------------------------------------------------------------- /reference/bachelor/毕业设计（论文）相关资料封面.doc: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/xen0n/JNUthesis/ebccab3730fdc2540e8e5a54629b11bf73b370ed/reference/bachelor/毕业设计（论文）相关资料封面.doc -------------------------------------------------------------------------------- /reference/master-p/全日制专业学位硕士学位申请书.doc: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/xen0n/JNUthesis/ebccab3730fdc2540e8e5a54629b11bf73b370ed/reference/master-p/全日制专业学位硕士学位申请书.doc -------------------------------------------------------------------------------- /reference/master-p/全日制专业学位硕士学位论文封面.doc: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/xen0n/JNUthesis/ebccab3730fdc2540e8e5a54629b11bf73b370ed/reference/master-p/全日制专业学位硕士学位论文封面.doc -------------------------------------------------------------------------------- /reference/master-p/全日制专业学位论文导师评阅书.doc: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/xen0n/JNUthesis/ebccab3730fdc2540e8e5a54629b11bf73b370ed/reference/master-p/全日制专业学位论文导师评阅书.doc -------------------------------------------------------------------------------- /reference/master-p/全日制专业学位论文抽检封面.doc: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/xen0n/JNUthesis/ebccab3730fdc2540e8e5a54629b11bf73b370ed/reference/master-p/全日制专业学位论文抽检封面.doc -------------------------------------------------------------------------------- /reference/master-p/全日制专业学位论文盲评评阅书.doc: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/xen0n/JNUthesis/ebccab3730fdc2540e8e5a54629b11bf73b370ed/reference/master-p/全日制专业学位论文盲评评阅书.doc -------------------------------------------------------------------------------- /reference/master-p/全日制专业学位论文评阅书.doc: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/xen0n/JNUthesis/ebccab3730fdc2540e8e5a54629b11bf73b370ed/reference/master-p/全日制专业学位论文评阅书.doc -------------------------------------------------------------------------------- /reference/master-p/独创性声明.doc: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/xen0n/JNUthesis/ebccab3730fdc2540e8e5a54629b11bf73b370ed/reference/master-p/独创性声明.doc -------------------------------------------------------------------------------- /reference/master-p/研究生答辩海报.doc: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/xen0n/JNUthesis/ebccab3730fdc2540e8e5a54629b11bf73b370ed/reference/master-p/研究生答辩海报.doc -------------------------------------------------------------------------------- /reference/master-p/答辩委员会审批表.doc: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/xen0n/JNUthesis/ebccab3730fdc2540e8e5a54629b11bf73b370ed/reference/master-p/答辩委员会审批表.doc -------------------------------------------------------------------------------- /reference/master-p/答辩聘请书.doc: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/xen0n/JNUthesis/ebccab3730fdc2540e8e5a54629b11bf73b370ed/reference/master-p/答辩聘请书.doc -------------------------------------------------------------------------------- /reference/master/导师评阅书.doc: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/xen0n/JNUthesis/ebccab3730fdc2540e8e5a54629b11bf73b370ed/reference/master/导师评阅书.doc -------------------------------------------------------------------------------- /reference/master/江大学位论文模板.doc: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/xen0n/JNUthesis/ebccab3730fdc2540e8e5a54629b11bf73b370ed/reference/master/江大学位论文模板.doc -------------------------------------------------------------------------------- /reference/master/独创性声明.doc: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/xen0n/JNUthesis/ebccab3730fdc2540e8e5a54629b11bf73b370ed/reference/master/独创性声明.doc -------------------------------------------------------------------------------- /reference/master/研究生答辩海报.doc: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/xen0n/JNUthesis/ebccab3730fdc2540e8e5a54629b11bf73b370ed/reference/master/研究生答辩海报.doc -------------------------------------------------------------------------------- /reference/master/硕士 学位申请书.doc: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/xen0n/JNUthesis/ebccab3730fdc2540e8e5a54629b11bf73b370ed/reference/master/硕士 学位申请书.doc -------------------------------------------------------------------------------- /reference/master/硕士学位论文封面.doc: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/xen0n/JNUthesis/ebccab3730fdc2540e8e5a54629b11bf73b370ed/reference/master/硕士学位论文封面.doc -------------------------------------------------------------------------------- /reference/master/硕士学位论文抽检封面.doc: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/xen0n/JNUthesis/ebccab3730fdc2540e8e5a54629b11bf73b370ed/reference/master/硕士学位论文抽检封面.doc -------------------------------------------------------------------------------- /reference/master/硕士登记表(留学生).doc: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/xen0n/JNUthesis/ebccab3730fdc2540e8e5a54629b11bf73b370ed/reference/master/硕士登记表(留学生).doc -------------------------------------------------------------------------------- /reference/master/硕士盲评评阅书.doc: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/xen0n/JNUthesis/ebccab3730fdc2540e8e5a54629b11bf73b370ed/reference/master/硕士盲评评阅书.doc -------------------------------------------------------------------------------- /reference/master/硕士答辩委员会审批表.doc: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/xen0n/JNUthesis/ebccab3730fdc2540e8e5a54629b11bf73b370ed/reference/master/硕士答辩委员会审批表.doc -------------------------------------------------------------------------------- /reference/master/硕士答辩费用结算表-200906.doc: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/xen0n/JNUthesis/ebccab3730fdc2540e8e5a54629b11bf73b370ed/reference/master/硕士答辩费用结算表-200906.doc -------------------------------------------------------------------------------- /reference/master/硕士论文评阅书.doc: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/xen0n/JNUthesis/ebccab3730fdc2540e8e5a54629b11bf73b370ed/reference/master/硕士论文评阅书.doc -------------------------------------------------------------------------------- /reference/master/答辩聘请书.doc: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/xen0n/JNUthesis/ebccab3730fdc2540e8e5a54629b11bf73b370ed/reference/master/答辩聘请书.doc -------------------------------------------------------------------------------- /reference/学位论文封面.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/xen0n/JNUthesis/ebccab3730fdc2540e8e5a54629b11bf73b370ed/reference/学位论文封面.pdf --------------------------------------------------------------------------------