Titlebook: Switching and Traffic Theory for Integrated Broadband Networks; Joseph Y. Hui Book 1990 Springer Science+Business Media New York 1990 Broa

breath-focus

書目名稱Switching and Traffic Theory for Integrated Broadband Networks影響因子(影響力)




書目名稱Switching and Traffic Theory for Integrated Broadband Networks影響因子(影響力)學(xué)科排名




書目名稱Switching and Traffic Theory for Integrated Broadband Networks網(wǎng)絡(luò)公開度




書目名稱Switching and Traffic Theory for Integrated Broadband Networks網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Switching and Traffic Theory for Integrated Broadband Networks被引頻次




書目名稱Switching and Traffic Theory for Integrated Broadband Networks被引頻次學(xué)科排名




書目名稱Switching and Traffic Theory for Integrated Broadband Networks年度引用




書目名稱Switching and Traffic Theory for Integrated Broadband Networks年度引用學(xué)科排名




書目名稱Switching and Traffic Theory for Integrated Broadband Networks讀者反饋




書目名稱Switching and Traffic Theory for Integrated Broadband Networks讀者反饋學(xué)科排名

半身雕像

Afflict

Integrated Broadband Services and Networks — An Introductionogies are mostly in the area of transmission and switching devices. These device technologies have substantially outpaced their applications in building communication networks and providing new communication services. In this chapter, we first review some key technologies which will drive the advanc

NAVEN

Broadband Integrated Access and Multiplexingor single bit-rate services to multiplexing techniques for multi-rate and possibly bursty services. We then describe some mechanisms for time domain and space domain switching, and how these two could be jointly used for switching.

bourgeois

Oration

From Multi-Rate Circuit Switching to Fast Packet Switchingajor bottleneck on the rate at which circuits can be established. The circuit rearrangement algorithms studied in chapter 3 require excessive computation. Circuit rearrangement algorithms are seldom used in practice. Instead a depth-first-search circuit hunting algorithm is usually employed. This is

surmount

Applying Sorting for Self-Routing and Non-Blocking Switcheshese algorithms have manageable complexity for circuit switching for telephony, they are not fast enough to allocate bandwidth for multi-rate and bursty services. To alleviate the processing bottleneck of bandwidth allocation, we introduced distributed algorithms using self-routing addresses and que

襲擊

征兵

真

Blocking for Multi-Stage Resource Sharingaring multiple stages of resources. Blocking occurs when allocation fails in one of the stages. We shall compute the probability of blocking in these networks. In particular, product form solutions apply for networks with unique path routing, whereas assumptions of independence are needed for approx