Proceedings Of The 11th Joint International Computer Conference : Jicc 2005.

Intro -- CONTENTS -- PREFACE -- Network Architecture &amp -- 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 length -- 3. 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 Method -- 5. 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 definition -- 3. 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 P -- 4. 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 -- 3.2.1 Topology -- 3.2.2 Results -- 4. Related Work -- 5. Conclusions -- References -- Analyzing the Management Mechanism in Infiniband Architecture LiJindei, Sun Guoqiang -- 1. Introduction -- 2. InfiniBand management model -- 3. Subnet Management and General management Service -- 3.1. Subnet Management -- 3.1.1 Subnet Manger -- 3.1.2 subnet management agent -- 3.1.3 messaging mechanism of subnet management -- 3.2. Generai Management Services -- 4. Summary -- References -- Anycast Scalability Design and Implementation in IPV6 Rbvlg Xiaonan, Qian Huanyan -- 1. Introduction -- 2. Anycast Scalability -- 3. Implementation of Anycast Service on Application Layer -- 3.1. Address -- 3.2. Joining an Anycast Group -- 3.3. Routing Analysis -- 3.3.1. Intra-Domain Routing -- 3.3.2.Inter-Domain Routing -- 3.4. Error Tolerance -- 3.5. Performance Analysis -- 4. Conclusion -- References -- Empirical Analysis and Evaluation of LAN Traffic of a University Laboratory Chen Hongwei, Wang Huirun.

1. Introduction -- 2. The Test Environment -- 2.1. Description of the laboratory Network under Test -- 2.2. The Research Objectives -- 3. Trace Collection -- 3.1. Collecting Traffic with Windump -- 3.2. Collecting Traffic with Ethereal -- 4. Analyses And Result -- 4.1. Traffic of the Lab -- 4.2. Bandwidth of the Lab -- 4.3. Traffic Distribution over Application Layer Protocol -- 4.4. Trafflc Characteristics of HTTP Protocol -- 4.4. I The http request length model -- 4.4.2 the http respunse length model -- 4.4.3 the response time model -- 5. Conclusions -- References -- Optimal Sequences for Scheduling Divisible Load on Heterogeneous System in Nonblocking Mode of Communication Shang Mingsheng, Wang Qingxian -- 1. Introduction -- 2. The System Model -- 3. Optimal Scheduling Sequences -- 4. Simulation -- 5. Conclusion -- References -- Optimal Algorithms of Node-To-Node Fault Tolerant Routing in @&amp -- )-Star Graph Lv YuEi, Xiang Yonghong, Zhuu Yongheng -- 1. Introduction -- 2. Definitions -- 3. Routing Algorithms -- 4. Conclusion -- Acknowledgments -- References -- Queuing Delay Estimation in Fast TCP by Red Chen Jing, Lu Quarz -- 1. Introduction -- 2. Background on FAST TCP and RED -- 3. RED based on FAST TCP -- 4. Simulation -- 5. Conclusions and future work -- References -- Fuzzy Control and Analysis on Network Data Flow Deng Na, Su Qingxin, Shao Shihuang -- 1. Introduction -- 2. Description of Network Queuing System -- 3. Establishment of Fuzzy Controller -- 4. Analysis of Fuzzy Controller Used Discrete-time Queuing System -- 4.1. Simulation of every arrival rate is random number -- 4.1.1 The comparison between ignoring slow server and with fizzy controller -- 4.1.2 The comparison between without fizzy controller and withfizv controller -- 4.2 Simulation of every arrival rate overlap last time with uncertain probabitity.

4.3 Simulation of arrive rate having outbreak event with certain probabitity -- 5. Conclusion -- References -- Cryptography &amp -- Information Security -- Attribute Analysis of Usage Control (UCON) Li Zude, EXiaojun -- 1. Introduction -- 1.1. Usage Control Concept -- 1.2. UCONABc Model -- 2. Attribute Taxonomy -- 3. Attribute Using -- 3.1. Usage Decision -- 3.2. Usage Model with Attributes -- 4. Attribute-based UCON Model -- 4.1. Attribute Mutability -- 4.2. UCON Redefinition -- 4.3. Compact Version -- 5. Conclusion -- References -- A New Capability Description for Audio Information Hiding Ma Yiping, Han JiqingLi Zude, EXiaojun -- 1. Introduction -- 2. Discussion about Capacity and Capability -- 3. Normal Power Distribution -- 4. A New Description -- 5. Conclusion -- References -- Analysis of Enhanced Separation of Duty in Role-Based Access Control Model Zhang Zhikun, Geng Youping, Li Tingyan, Xiao Jianguo -- 1. Introduction -- 2. Role Based Access Control Model -- 3. Role-Based Separation of Duty -- 4. Limitations on Role-Based SOD -- 5. Permission-based Separation of Duty -- 6. Object-based Separation of Duty -- 7. User-Based Separation of Duty -- 8. Role Hierarchy Separation of Duty -- 9. Summary -- References -- A New Data Fusion Model of Intrusion Detection-IDSFM Tian Junfeng, Zhao Weidong, Du Ruizhong, Zhang Zhe -- 1. Introduction -- 2. Fusion Model-IDSFM -- 2.1. Alert Correlation Module -- 2.1.1. The method of calculating the dissimilarity of diflerent types of attributes -- 2.1.2. The method of the total calculating dissimilarity -- 2.1.3. The method ofdistributing the weight for the attributes of an alert -- 2.2. Security Situation Estimation Module -- 2.2.1. Alert aggregation module -- 2.2.2. D-S Evidence Theory introduce [I I ] -- 2.2.3. Inference module appbing D-S Evidence Theory -- 2.3. Management &amp -- Control Module.

3. Experiments and Analysis -- 4. Conclusions -- References -- Design and Implementation of a Chaos-Based Public Key Encryption Scheme Wang Xuebing, Zhang Linhua, Wu Yong -- 1. Introduction -- 2. Chebyshev polynomials -- 3. Chaos-based public-key cryptosystem -- 4. Security anaIysis -- 5. Experimental tests and performance analyses -- 5.1. GNUMP -- 5.2. Stuthticul tests for randomness -- 5.2.1. Munobit test -- 5.2.2. Run test -- 5.2.3. Poker test -- 5.2.4. Long run rest -- 5.3. Implement of the proposed algorithm -- 6. Conclusion -- Acknowledgments -- References -- Rough Set Theory's Application on Intrusion Detection Based on System Calls Wang Lijun, Gao Chao -- 1. Introduction -- 2. Construction of the normal model using Rough Set theory -- 3. Experiment Testing -- 3.1. Test Data Set -- 3.2. Detection Flow Chart -- 3.3. Experiment results -- 4. Testing Analysis -- 5. Conclusion -- References -- A Four-Layer Architecture for Web Application System Security Assurance A Safeguard Mechanism Research Xu Lixin, Zhang Xincheng, He Min, Wu Xianglin, Ru Qingyun -- 1. Introduction -- 2. A secure four-layer architecture model -- 3. Function definition of the four-layer architecture model -- 3.1. Presentation layer -- 3.2. Business layer -- 3.3. Data layer -- 3.4. Security control layer -- 4. Security transmitting data flow description -- 5. Conclusions -- References -- An Efficient Hierarchical ID-Based Signature Scheme Yu Jia, Li Daxing, Ha0 Rong -- 1. Introduction -- 2. Definitions -- 3. The Proposed Hierarchical ID-Based Signature Scheme -- 4. Efficiency and Security -- 4. I Efficiency Analysis -- 4.2 Security Proof -- 5. Extensions -- 6. Conclusions and open problems -- References -- An Improved Scheme for Group Signature Lin Song, Wang Biao, He Dequan -- 1. Introduction -- 2. Ao-Chen-Bai Group Signature Scheme -- 2.1. Scheme Introduction.

2.1.1. Initialization.

Description based on publisher supplied metadata and other sources.

Electronic reproduction. Ann Arbor, Michigan : ProQuest Ebook Central, 2024. Available via World Wide Web. Access may be limited to ProQuest Ebook Central affiliated libraries.