信息網(wǎng)絡(luò)理論基礎(chǔ)

第1章 信息網(wǎng)絡(luò)概論 1                  
 1.1 信息網(wǎng)絡(luò)的基本構(gòu)成 1                  
 1.1.1 數(shù)據(jù)傳輸鏈路 2                  
 1.1.2 數(shù)據(jù)傳輸網(wǎng)絡(luò) 3                  
 1.2 協(xié)議體系及分層的概念 7                  
 1.2.1 分層的概念 8                  
 1.2.2 OSI協(xié)議的體系結(jié)構(gòu) 9                  
 1.2.3 TCP/IP協(xié)議的體系結(jié)構(gòu) 11                  
 1.2.4 混合的分層協(xié)議體系 12                  
 1.3 信息網(wǎng)絡(luò)的基本理論問(wèn)題 13                  
 習(xí)題 14                  
 第2章 點(diǎn)對(duì)點(diǎn)的傳輸協(xié)議 15                  
 2.1 鏈路層的差錯(cuò)控制技術(shù) 15                  
 2.1.1 差錯(cuò)檢測(cè) 15                  
 2.1.2 ARQ協(xié)議 16                  
 2.2 組幀技術(shù) 25                  
 2.2.1 面向字符的組幀技術(shù) 25                  
 2.2.2 面向比特的組幀技術(shù) 26                  
 2.2.3 采用長(zhǎng)度計(jì)數(shù)的組幀技術(shù) 27                  
 2.2.4 最佳幀長(zhǎng)度 28                  
 2.3 標(biāo)準(zhǔn)的數(shù)據(jù)鏈路控制協(xié)議及其初始化 29                  
 2.3.1 標(biāo)準(zhǔn)的數(shù)據(jù)鏈路控制協(xié)議 29                  
 2.3.2 數(shù)據(jù)鏈路層協(xié)議的初始化 33                  
 2.4 網(wǎng)絡(luò)層和運(yùn)輸層的點(diǎn)對(duì)點(diǎn)傳輸協(xié)議 36                  
 2.4.1 網(wǎng)絡(luò)層(子網(wǎng)層)的點(diǎn)對(duì)點(diǎn)傳輸協(xié)議 37                  
 2.4.2 網(wǎng)際層(互連層)的傳輸協(xié)議--IP協(xié)議 42                  
 2.4.3 運(yùn)輸層的點(diǎn)對(duì)點(diǎn)傳輸協(xié)議 45                  
 小結(jié) 49                  
 習(xí)題 49                  
 第3章 網(wǎng)絡(luò)的時(shí)延模型 53                  
 3.1 Little定理 53                  
 3.1.1 Little定理 54                  
 3.1.2 Little定理的應(yīng)用 56                  
 3.2 M/M/m型排隊(duì)系統(tǒng) 57                  
 3.2.1 M/M/1排隊(duì)系統(tǒng) 57                  
 3.2.2 M/M/m排隊(duì)系統(tǒng) 61                  
 3.3 M/G/1型排隊(duì)系統(tǒng) 64                  
 3.3.1 M/G/1型排隊(duì)系統(tǒng) 64                  
 3.3.2 服務(wù)員有休假的M/G/1排隊(duì)系統(tǒng) 67                  
 3.3.3 采用不同服務(wù)規(guī)則的M/G/1排隊(duì)系統(tǒng) 70                  
 3.4 排隊(duì)網(wǎng)絡(luò) 77                  
 3.4.1 Kleinrock獨(dú)立性近似 78                  
 3.4.2 Burke定理 80                  
 3.4.3 Jackson定理 85                  
 小結(jié) 91                  
 習(xí)題 91                  
 第4章 多址技術(shù) 95                  
 4.1 多址協(xié)議概述 95                  
 4.2 純隨機(jī)多址協(xié)議--ALOHA協(xié)議 97                  
 4.2.1 時(shí)隙ALOHA協(xié)議及其穩(wěn)定性 97                  
 4.2.2 穩(wěn)定的時(shí)隙ALOHA協(xié)議 101                  
 4.2.3 純ALOHA協(xié)議 104                  
 4.3 沖突分解算法--分裂算法 105                  
 4.3.1 樹形算法 106                  
 4.3.2 FCFS分裂算法 107                  
 4.4 載波偵聽型多址協(xié)議 109                  
 4.4.1 時(shí)隙CSMA協(xié)議 109                  
 4.4.2 穩(wěn)定的時(shí)隙CSMA協(xié)議 111                  
 4.4.3 非時(shí)隙CSMA 112                  
 4.5 預(yù)約多址協(xié)議 113                  
 4.5.1 時(shí)隙預(yù)約多址協(xié)議 113                  
 4.5.2 CSMA/CD 116                  
 4.5.3 預(yù)約與沖突分解相結(jié)合的多址協(xié)議 118                  
 4.6 分組無(wú)線網(wǎng) 119                  
 4.6.1 時(shí)分復(fù)用(TDM)在PRNET中的應(yīng)用 119                  
 4.6.2 PRNET中的沖突分解 120                  
 4.6.3 CSMA多址協(xié)議的改進(jìn) 121                  
 4.6.4 IEEE802.11多址協(xié)議 123                  
 小結(jié) 125                  
 習(xí)題 125                  
 第5章 路由算法 128                  
 5.1 路由算法概論 128                  
 5.1.1 路由算法的作用 128                  
 5.1.2 常用的路由算法 130                  
 5.2 最短路由算法 133                  
 5.2.1 最小重量生成樹 133                  
 5.2.2 最短路徑算法 136                  
 5.3 分布式最短路由算法 142                  
 5.3.1 分布式異步Bellman Ford算法 142                  
 5.3.2 距離矢量路由算法 143                  
 5.3.3 鏈路狀態(tài)路由算法 145                  
 5.3.4 自適應(yīng)最短路徑的穩(wěn)定性 148                  
 5.4 路由信息廣播 153                  
 5.4.1 ARPANET的泛洪算法 154                  
 5.4.2 不采用序號(hào)的廣播算法 155                  
 5.5 最佳路由 159                  
 5.5.1 最佳路由的特性 160                  
 5.5.2 最佳路由求解的可行方向法 162                  
 小結(jié) 166                  
 習(xí)題 166                  
 第6章 流量和擁塞控制 170                  
 6.1 流量和擁塞控制概論 170                  
 6.2 窗口式流量和擁塞控制 175                  
 6.2.1 端到端窗口流控 175                  
 6.2.2 虛電路中逐跳窗口流控 177                  
 6.2.3 統(tǒng)一窗口流控 177                  
 6.2.4 流控窗口的動(dòng)態(tài)調(diào)整 177                  
 6.3 漏斗式速率控制算法 178                  
 6.3.1 漏斗算法 178                  
 6.3.2 令牌漏斗算法 179                  
 6.4 實(shí)際系統(tǒng)中的流量和擁塞控制算法 182                  
 6.4.1 ARPANET中的流量和擁塞控制 182                  
 6.4.2 SNA網(wǎng)中的流量和擁塞控制 182                  
 6.4.3 PARIS網(wǎng)絡(luò)中的流量和擁塞控制 182                  
 6.5 最佳速率調(diào)整算法 183                  
 6.5.1 組合最佳路由和流控算法 183                  
 6.5.2 最大最小流控制 187                  
 小結(jié) 190                  
 習(xí)題 191                  
 第7章 網(wǎng)絡(luò)拓?fù)湓O(shè)計(jì) 193                  
 7.1 網(wǎng)絡(luò)拓?fù)湓O(shè)計(jì)的基本問(wèn)題 193                  
 7.2 子網(wǎng)拓?fù)湓O(shè)計(jì) 194                  
 7.3 接入網(wǎng)拓?fù)湓O(shè)計(jì) 199                  
 7.3.1 有線接入網(wǎng)的設(shè)計(jì) 199                  
 7.3.2 無(wú)線接入網(wǎng)的設(shè)計(jì) 200                  
 小結(jié) 205                  
 習(xí)題 205                  
 參考文獻(xiàn) 207