| Description |
1 online resource (xxvii, 979 pages) : illustrations |
| Contents |
CONTENTS -- PREFACE -- Network Architecture & Protocol -- An Analytic Model for Evaluating The Performance of AQM Algorithms with Self-similar Traffic Wang Hao, Yan Wei, Huang Minghe ... -- 1. Introduction -- 2. The Analytic Model for AQM Algorithms -- 2.1.. A Formal DeJinition u f AQM Algorithms -- 2.2. Thinning of Input Flows -- 2.3. The Analytic Model of AQMAlgorithms -- 2.4. The performance mefrics of AQM algorithms -- 2.4.1. The packet loss rate -- 2.4.2. l%e link utilization |
|
2.4.3. The mean and variance of the buffer queue length3. The Computational Analysis of AQM algorithms -- 4. Conclusions -- Appendix A. The RED and GRED Algorithms -- References -- Study on the Description and Simulation Methods of Complex Networks Liu Luying, Kang Jiachu, Hun Xu ... -- 1. Introduction -- 2. Orderliness of Complex Networks -- 2.1. Parameters for Describing Complex Networks -- 2.2. Network Models -- 3. Simulations of Small-World and Scale-Free Networks |
|
4. Discover the Essential Feature of Complex Networks Using Data Field Method5. Conclusions -- References -- Absorptlydine: Typical Unification of Voice-Over-IP and the Lookaside Buffer Luo Wei -- 1. Introduction -- 2. Related Work -- 3. AbsorptLydine Investigation -- 4. Implementation -- 5. Results -- 5.1. Hardware and Software Configuration -- 5.2. Dogfaoding Our Solution -- 6. Conclusion -- References -- LSP Rerouting Algorithms Comparative Analysis in MPLS Xu Jie, Luo Chuang -- 1. Guidelines -- 2. Definition of the RSP problem |
|
2.1. Graph based definition3. Algorithms and Analysis -- 3.1. Minimal Vio Lation(MV) -- 3.2. Maximal Freeing(MF) -- 3.3. The Most Reroutable(MR) -- 3.4. Computational Complexity -- 4. Maximal Decreasing(MD) Algorithm -- 5. Conclusion and Future Work -- References -- High Speed Flow Matching Algorithm Based on Hash-Tree Yu Lei, Deng Yaping, En Ke -- 1. Introduction -- 2. Hash Algorithm in Flow Matching -- 2.1. Non-collision Hash Algorithm -- 2.2. Collision Hash Algorithm -- 3. FMBHT -- 3.1. Basic Idea of FMBHT -- 3.2. FMBHT in The Packet Flow |
|
3.3. How to Select P4. Performance Analysis and Simulation Results -- 4.1 Performance Analysis -- 4.2. Simulation Results -- 5. Conclusion -- References -- On a Novel Filtering Mechanism for Capacity Estimation Lv Shaohe, En Jianping, Cai Zhiping, Liu Chi -- 1. Introduction -- 2. The Mechanism -- 2.1. Nutatiuns -- 2.2. Overview ofthe Mechunism and Tool -- 2.3. Descriptions -- 2.3. I One-way Delay Visiting -- 2.3.2 Packet Pair Reconstruction -- 3. Experiments -- 3.1. Simulations -- 3.1.1 Setup -- 3.I.2 Results -- 3.2. Internet Measurements |
| Summary |
This book presents the latest techniques, algorithms, research accomplishments and trend in computer science and engineering. It collects together 222 peer reviewed papers presented at the 11th Joint International Computer Conference. The theme of this year is "IT: Intellectual Capital for the Betterment of Human Life". The articles in this book cover a wide range of active and interesting areas such as Digital Entertainment, Grid Computing, Embedded System, Web Service and Knowledge Engineering. This book serves as a good reference not only for researchers but also for graduate students in corresponding fields |
| Notes |
"The theme for this year is "IT: Intellectual Capital for the Betterment of Human Life""--Preface |
| Bibliography |
Includes bibliographical references |
| Notes |
Print version record |
| Subject |
Computers -- Congresses
|
|
COMPUTERS -- Reference.
|
|
COMPUTERS -- Machine Theory.
|
|
COMPUTERS -- Computer Literacy.
|
|
COMPUTERS -- Information Technology.
|
|
COMPUTERS -- Data Processing.
|
|
COMPUTERS -- Computer Science.
|
|
COMPUTERS -- Hardware -- General.
|
|
Computers
|
| Genre/Form |
Conference papers and proceedings
|
| Form |
Electronic book
|
| Author |
Zhu, Qingsheng
|
| ISBN |
9812701532 |
|
9789812701534 |
|
1281372757 |
|
9781281372758 |
|
