close
1.

電子ブック
ＥＢ
1. Secure Transaction Protocol Analysis
Qingfeng Chen, Takeo Kanade, Chengqi Zhang, Shichao Zhang
出版情報: Springer eBooks Computer Science , Springer Berlin Heidelberg, 2008
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
What Is Security Protocol? / 1.1：
Needs of Formal Analysis for Secure Transaction Protocols / 1.2：
Formal Methods and Related Areas / 1.3：
Emerging Issues and Trends / 1.4：
A Brief Discussion on the Chapters / 1.5：
Summary / 1.6：
Overview of Security Protocol Analysis / 2：
The Formalism / 2.1：
Basic Notations and Terminology / 2.1.1：
Inference Rules / 2.1.2：
Security Protocols / 2.2：
SET Protocol / 2.2.1：
Netbill Protocol / 2.2.2：
Security Services / 2.2.3：
Principles of Cryptography / 2.2.4：
Threats in Security Protocols / 2.2.5：
Research into Analysis of Security Protocols / 2.3：
A Discussion of Formal Methods and Security Protocols / 2.3.1：
A Brief Introduction to Protocol Abstraction / 2.3.2：
A Classification of Approaches for Protocol Analysis / 2.3.3：
Attack-Construction Approach / 2.4：
Approaches by Dolev and Yao / 2.4.1：
NRL Protocol Analyser / 2.4.2：
Inference-Construction Approach / 2.5：
BAN Logic / 2.5.1：
Extensions to BAN Logic / 2.5.2：
Proof-Construction Approach / 2.6：
Approaches Using Formal Tools and Specification Languages / 2.7：
Formal Analysis of Secure Transaction Protocols / 2.8：
Research into Verifying Electronic Transaction Protocols / 3.1：
Formalism for Protocol Analysis Using Process Calculi / 3.2.1：
Formal Analysis Using an Observational Transition System / 3.2.2：
Formal Analysis of Card-Based Payment Systems in Mobile Devices / 3.2.3：
A Computational Model / 3.3：
Basic Terms and Statements / 3.4：
Logical Framework and Statement of ENDL / 3.5：
Axiom / 3.5.1：
Inference Format / 3.5.2：
Verification Instances of Security Protocols in ENDL / 3.5.4：
Model Checking in Security Protocol Analysis / 3.6：
An Overview of Model Checking in Analysing E-Commerce Protocols / 4.1：
Model Checking for Failure Analysis of Protocols / 4.1.1：
Automatic Analysis of E-commerce Protocols Using UML / 4.1.2：
An ENDL-Based Verification Model / 4.2：
Components / 4.2.1：
Designing the Model / 4.2.2：
Handling the Knowledge and Facts / 4.2.3：
Recognition / 4.2.4：
Comparison with Theorem Proving / 4.3：
Discussion / 4.4：
Uncertainty Issues in Secure Messages / 4.5：
Estimation of Inconsistency of Secure Messages / 5.1：
Related Work / 5.2.1：
Semantics Description / 5.2.2：
Measuring Inconsistency in Secure Messages / 5.2.3：
Examples of Measuring Inconsistency / 5.2.4：
Experiments / 5.2.5：
Integration of Conflicting Beliefs in Secure Messages / 5.3：
Basic Concepts / 5.3.1：
Handling Inconsistent Beliefs in Secure Messages / 5.3.3：
Applications of Data Mining in Protocol Analysis / 5.3.4：
Association Rule Mining for Inconsistent Secure Messages / 6.1：
The Basics of Association Rule Mining / 6.4.1：
Data Preparation / 6.4.2：
Identifying Association Rules of Interest / 6.4.3：
Algorithms and Experiments / 6.5：
Algorithms / 6.5.1：
Detection Models of Collusion Attacks / 6.5.2：
Identification of Frequent Patterns for Collusion Attack Detection / 7.1：
A Framework to Detect Collusion Attacks / 7.3.1：
Dealing with Knowledge and Facts / 7.3.3：
A Case Study / 7.3.4：
Estimation of the Probability of Collusion Attacks / 7.4：
Motivations / 7.4.1：
Preliminaries / 7.4.2：
Identifying Collusion Attack Using Bayesian Network / 7.4.3：
Conclusion and Future Works / 7.4.4：
Conclusion / 8.1：
Future Work / 8.2：
References
Index
Introduction / 1：
What Is Security Protocol? / 1.1：
Needs of Formal Analysis for Secure Transaction Protocols / 1.2：
2.

電子ブック
ＥＢ
2. Secure Transaction Protocol Analysis
Qingfeng Chen, Takeo Kanade, Chengqi Zhang, Shichao Zhang
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2008
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1：
What Is Security Protocol? / 1.1：
Needs of Formal Analysis for Secure Transaction Protocols / 1.2：
Formal Methods and Related Areas / 1.3：
Emerging Issues and Trends / 1.4：
A Brief Discussion on the Chapters / 1.5：
Summary / 1.6：
Overview of Security Protocol Analysis / 2：
The Formalism / 2.1：
Basic Notations and Terminology / 2.1.1：
Inference Rules / 2.1.2：
Security Protocols / 2.2：
SET Protocol / 2.2.1：
Netbill Protocol / 2.2.2：
Security Services / 2.2.3：
Principles of Cryptography / 2.2.4：
Threats in Security Protocols / 2.2.5：
Research into Analysis of Security Protocols / 2.3：
A Discussion of Formal Methods and Security Protocols / 2.3.1：
A Brief Introduction to Protocol Abstraction / 2.3.2：
A Classification of Approaches for Protocol Analysis / 2.3.3：
Attack-Construction Approach / 2.4：
Approaches by Dolev and Yao / 2.4.1：
NRL Protocol Analyser / 2.4.2：
Inference-Construction Approach / 2.5：
BAN Logic / 2.5.1：
Extensions to BAN Logic / 2.5.2：
Proof-Construction Approach / 2.6：
Approaches Using Formal Tools and Specification Languages / 2.7：
Formal Analysis of Secure Transaction Protocols / 2.8：
Research into Verifying Electronic Transaction Protocols / 3.1：
Formalism for Protocol Analysis Using Process Calculi / 3.2.1：
Formal Analysis Using an Observational Transition System / 3.2.2：
Formal Analysis of Card-Based Payment Systems in Mobile Devices / 3.2.3：
A Computational Model / 3.3：
Basic Terms and Statements / 3.4：
Logical Framework and Statement of ENDL / 3.5：
Axiom / 3.5.1：
Inference Format / 3.5.2：
Verification Instances of Security Protocols in ENDL / 3.5.4：
Model Checking in Security Protocol Analysis / 3.6：
An Overview of Model Checking in Analysing E-Commerce Protocols / 4.1：
Model Checking for Failure Analysis of Protocols / 4.1.1：
Automatic Analysis of E-commerce Protocols Using UML / 4.1.2：
An ENDL-Based Verification Model / 4.2：
Components / 4.2.1：
Designing the Model / 4.2.2：
Handling the Knowledge and Facts / 4.2.3：
Recognition / 4.2.4：
Comparison with Theorem Proving / 4.3：
Discussion / 4.4：
Uncertainty Issues in Secure Messages / 4.5：
Estimation of Inconsistency of Secure Messages / 5.1：
Related Work / 5.2.1：
Semantics Description / 5.2.2：
Measuring Inconsistency in Secure Messages / 5.2.3：
Examples of Measuring Inconsistency / 5.2.4：
Experiments / 5.2.5：
Integration of Conflicting Beliefs in Secure Messages / 5.3：
Basic Concepts / 5.3.1：
Handling Inconsistent Beliefs in Secure Messages / 5.3.3：
Applications of Data Mining in Protocol Analysis / 5.3.4：
Association Rule Mining for Inconsistent Secure Messages / 6.1：
The Basics of Association Rule Mining / 6.4.1：
Data Preparation / 6.4.2：
Identifying Association Rules of Interest / 6.4.3：
Algorithms and Experiments / 6.5：
Algorithms / 6.5.1：
Detection Models of Collusion Attacks / 6.5.2：
Identification of Frequent Patterns for Collusion Attack Detection / 7.1：
A Framework to Detect Collusion Attacks / 7.3.1：
Dealing with Knowledge and Facts / 7.3.3：
A Case Study / 7.3.4：
Estimation of the Probability of Collusion Attacks / 7.4：
Motivations / 7.4.1：
Preliminaries / 7.4.2：
Identifying Collusion Attack Using Bayesian Network / 7.4.3：
Conclusion and Future Works / 7.4.4：
Conclusion / 8.1：
Future Work / 8.2：
References
Index
Introduction / 1：
What Is Security Protocol? / 1.1：
Needs of Formal Analysis for Secure Transaction Protocols / 1.2：
3.

電子ブック
ＥＢ
3. Resource Allocation in Wireless Networks
S?�?��awomir Staanczak, Holger Boche, Takeo Kanade, Marcin Wiczanowski
出版情報: Springer eBooks Computer Science , Springer Berlin Heidelberg, 2006
所蔵情報: loading…
目次情報: 続きを見る
List of Symbols
Theory / Part I：
On the Perron Root of Irreducible Matrices / 1：
Some Basic Definitions / 1.1：
Some Bounds on the Perron Root and Their Applications / 1.2：
Concavity of the Perron Root on Some Subsets of Irreducible Matrices / 1.2.1：
Kullback-Leibler Divergence Characterization / 1.2.2：
Some Extended Perron Root Characterizations / 1.2.3：
Collatz-Wielandt-Type Characterization of the Perron Root / 1.2.4：
Convexity of the Perron Root / 1.3：
Some Definitions / 1.3.1：
Sufficient Conditions / 1.3.2：
Convexity of the Feasibility Set / 1.3.3：
Necessary Conditions / 1.3.4：
Special Classes of Matrices / 1.4：
Symmetric Matrices / 1.4.1：
Symmetric Positive Semidefinite Matrices / 1.4.2：
The Perron Root Under the Linear Mapping / 1.5：
Some Bounds / 1.5.1：
Disproof of the Conjecture / 1.5.2：
Some Remarks on Arbitrary Nonnegative Matrices / 1.6：
Log-Convexity of the Spectral Radius / 1.6.1：
Characterization of the Spectral Radius / 1.6.2：
Collatz-Wielandt-Type Characterization of the Spectral Radius / 1.6.3：
Bibliograpical Notes / 1.7：
On the Positive Solution to a Linear System with Nonnegative Coefficients / 2：
Basic Concepts and Definitions / 2.1：
Feasibility Sets / 2.2：
Convexity Results / 2.3：
Log-Convexity of the Positive Solution / 2.3.1：
Strict Log-Convexity / 2.3.2：
Strict Convexity of the Feasibility Sets / 2.3.4：
The Linear Case / 2.4：
Applications and Algorithms / Part II：
Introduction / 3：
Network Model / 4：
Basic Definitions / 4.1：
Medium Access Control / 4.2：
Wireless Communication Channel / 4.3：
Signal-to-Interference Ratio / 4.3.1：
Power Constraints / 4.3.2：
Data Rate Model / 4.3.3：
Two Examples / 4.3.4：
Resource Allocation Problem in Communications Networks / 5：
End-to-End Rate Control in Wired Networks / 5.1：
Fairness Criteria / 5.1.1：
Algorithms / 5.1.2：
Problem Formulation for Wireless Networks / 5.2：
Joint Power Control and Link Scheduling / 5.2.1：
Feasible Rate Region / 5.2.2：
End-to-End Window-Based Rate Control for Wireless Networks / 5.2.3：
MAC Layer Fair Rate Control for Wireless Networks / 5.2.4：
Utility-Based Power Control / 5.2.5：
Interpretation in the QoS Domain / 5.3：
Remarks on Joint Power Control and Link Scheduling / 5.4：
Optimal Joint Power Control and Link Scheduling / 5.4.1：
High SIR Regime / 5.4.2：
Low SIR Regime / 5.4.3：
Wireless Links with Self-Interference / 5.4.4：
Remarks on the Efficiency-Fairness Trade Off / 5.5：
Efficiency of the Max-Min Fair Power Allocation / 5.5.1：
Axiom-Based Interference Model / 5.5.2：
Power Control Algorithm / 6：
Convex Statement of the Problem / 6.1：
Strong Convexity Conditions / 6.3：
Gradient Projection Algorithm / 6.4：
Global Convergence / 6.4.1：
Rate of Convergence / 6.4.2：
Diagonal Scaling / 6.4.3：
Projection on a Closed Convex Set / 6.4.4：
Distributed Implementation / 6.5：
Local and Global Parts of the Gradient Vector / 6.5.1：
Adjoint Network / 6.5.2：
Distributed Handshake Protocol / 6.5.3：
Noisy Measurements / 6.5.4：
Appendices / Part III：
Some Concepts and Results from Matrix Analysis / A：
Vectors and Vector Norms / A.1：
Matrices and Matrix Norms / A.2：
Square Matrices and Eigenvalues / A.3：
Spectral Radius and Neumann Series / A.3.1：
Orthogonal, Symmetric and Positive Semidefinite Matrices / A.3.2：
Perron-Frobenius Theory / A.4：
Perron-Frobenius Theorem for Irreducible Matrices / A.4.1：
Perron-Frobenius Theorem for Primitive Matrices / A.4.2：
Some Remarks on Reducible Matrices / A.4.3：
The Existence of a Positive Solution p to ([alpha]I - X)p = b / A.4.4：
Some Concepts and Results from Convex Analysis / B：
Sets and Functions / B.1：
Convex Sets and Functions / B.2：
Strong Convexity / B.2.1：
Log-Convex Functions / B.3：
Inverse Functions of Monotonic Log-Convex Functions / B.3.1：
Convergence of Gradient Projection Algorithms / B.4：
References
List of Symbols
Theory / Part I：
On the Perron Root of Irreducible Matrices / 1：
4.

電子ブック
ＥＢ
4. Resource Allocation in Wireless Networks
SŁ°awomir Staanczak, Holger Boche, Takeo Kanade, Marcin Wiczanowski
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2006
所蔵情報: loading…
目次情報: 続きを見る
List of Symbols
Theory / Part I：
On the Perron Root of Irreducible Matrices / 1：
Some Basic Definitions / 1.1：
Some Bounds on the Perron Root and Their Applications / 1.2：
Concavity of the Perron Root on Some Subsets of Irreducible Matrices / 1.2.1：
Kullback-Leibler Divergence Characterization / 1.2.2：
Some Extended Perron Root Characterizations / 1.2.3：
Collatz-Wielandt-Type Characterization of the Perron Root / 1.2.4：
Convexity of the Perron Root / 1.3：
Some Definitions / 1.3.1：
Sufficient Conditions / 1.3.2：
Convexity of the Feasibility Set / 1.3.3：
Necessary Conditions / 1.3.4：
Special Classes of Matrices / 1.4：
Symmetric Matrices / 1.4.1：
Symmetric Positive Semidefinite Matrices / 1.4.2：
The Perron Root Under the Linear Mapping / 1.5：
Some Bounds / 1.5.1：
Disproof of the Conjecture / 1.5.2：
Some Remarks on Arbitrary Nonnegative Matrices / 1.6：
Log-Convexity of the Spectral Radius / 1.6.1：
Characterization of the Spectral Radius / 1.6.2：
Collatz-Wielandt-Type Characterization of the Spectral Radius / 1.6.3：
Bibliograpical Notes / 1.7：
On the Positive Solution to a Linear System with Nonnegative Coefficients / 2：
Basic Concepts and Definitions / 2.1：
Feasibility Sets / 2.2：
Convexity Results / 2.3：
Log-Convexity of the Positive Solution / 2.3.1：
Strict Log-Convexity / 2.3.2：
Strict Convexity of the Feasibility Sets / 2.3.4：
The Linear Case / 2.4：
Applications and Algorithms / Part II：
Introduction / 3：
Network Model / 4：
Basic Definitions / 4.1：
Medium Access Control / 4.2：
Wireless Communication Channel / 4.3：
Signal-to-Interference Ratio / 4.3.1：
Power Constraints / 4.3.2：
Data Rate Model / 4.3.3：
Two Examples / 4.3.4：
Resource Allocation Problem in Communications Networks / 5：
End-to-End Rate Control in Wired Networks / 5.1：
Fairness Criteria / 5.1.1：
Algorithms / 5.1.2：
Problem Formulation for Wireless Networks / 5.2：
Joint Power Control and Link Scheduling / 5.2.1：
Feasible Rate Region / 5.2.2：
End-to-End Window-Based Rate Control for Wireless Networks / 5.2.3：
MAC Layer Fair Rate Control for Wireless Networks / 5.2.4：
Utility-Based Power Control / 5.2.5：
Interpretation in the QoS Domain / 5.3：
Remarks on Joint Power Control and Link Scheduling / 5.4：
Optimal Joint Power Control and Link Scheduling / 5.4.1：
High SIR Regime / 5.4.2：
Low SIR Regime / 5.4.3：
Wireless Links with Self-Interference / 5.4.4：
Remarks on the Efficiency-Fairness Trade Off / 5.5：
Efficiency of the Max-Min Fair Power Allocation / 5.5.1：
Axiom-Based Interference Model / 5.5.2：
Power Control Algorithm / 6：
Convex Statement of the Problem / 6.1：
Strong Convexity Conditions / 6.3：
Gradient Projection Algorithm / 6.4：
Global Convergence / 6.4.1：
Rate of Convergence / 6.4.2：
Diagonal Scaling / 6.4.3：
Projection on a Closed Convex Set / 6.4.4：
Distributed Implementation / 6.5：
Local and Global Parts of the Gradient Vector / 6.5.1：
Adjoint Network / 6.5.2：
Distributed Handshake Protocol / 6.5.3：
Noisy Measurements / 6.5.4：
Appendices / Part III：
Some Concepts and Results from Matrix Analysis / A：
Vectors and Vector Norms / A.1：
Matrices and Matrix Norms / A.2：
Square Matrices and Eigenvalues / A.3：
Spectral Radius and Neumann Series / A.3.1：
Orthogonal, Symmetric and Positive Semidefinite Matrices / A.3.2：
Perron-Frobenius Theory / A.4：
Perron-Frobenius Theorem for Irreducible Matrices / A.4.1：
Perron-Frobenius Theorem for Primitive Matrices / A.4.2：
Some Remarks on Reducible Matrices / A.4.3：
The Existence of a Positive Solution p to ([alpha]I - X)p = b / A.4.4：
Some Concepts and Results from Convex Analysis / B：
Sets and Functions / B.1：
Convex Sets and Functions / B.2：
Strong Convexity / B.2.1：
Log-Convex Functions / B.3：
Inverse Functions of Monotonic Log-Convex Functions / B.3.1：
Convergence of Gradient Projection Algorithms / B.4：
References
List of Symbols
Theory / Part I：
On the Perron Root of Irreducible Matrices / 1：
5.

電子ブック
ＥＢ
5. Towards Digital Optical Networks
Ioannis Tomkos, Karin Ennser, Takeo Kanade, Martin K?hn, Branko Mikac, Maria Spyropoulou
出版情報: Springer eBooks Computer Science , Springer Berlin Heidelberg, 2009
所蔵情報: loading…
目次情報: 続きを見る
Introduction
Introduction (Part I) / Part I：
Novel Transponder Interfaces: Novel Modulation Formats / 1：
Transmission of 8-Level 240 Gb/s RZ-DQPSK-ASK / 1.1：
Four Bits per Symbol 16-ary Transmission Experiments / 1.3：
Optical Rate Conversion Units / 1.4：
Optical Packet Compression and Expansion / 1.4.1：
Optical Compression/Expansion Loop / 1.4.2：
Optical Delay Line Structure / 1.4.3：
Scalable Packet Compression/Expansion Units / 1.4.4：
Transmission Efficiency / 1.4.5：
References
Electronic Channel Equalization Techniques / 2：
Electronic Equalizers / 2.1：
Fundamental Limits of MLSE Performance with Large Number of States / 2.3：
No PD-Filter, 8 Samples/Bit / 2.3.1：
With PD-Filter, 2 Samples/Bit / 2.3.2：
Large Optical Filter, 2 Samples/Bit / 2.3.3：
Large Optical Filter, 1 Sample/Bit / 2.3.4：
Compensation of SPM Using MLSE / 2.3.5：
Nonlinear Electrical Equalization for Different Modulation Formats / 2.4：
Introduction of NL-FFE-DFE / 2.4.1：
System Setups and Parameters / 2.4.2：
EDC Performance for Different Modulation Formats / 2.4.3：
Optical Single Sideband Modulation / 2.5：
Compensation of Optical Dispersion / 2.5.1：
Reduction of Nonlinear Transmission Effects / 2.5.2：
Enhancing the Performance DML Transmitters / 2.6：
Conclusions / 2.7：
Optical Signal Processing Techniques for Signal Regeneration and Digital Logic / 3：
Optical Regeneration and Wavelength Conversion / 3.1：
640 Gbit/s Wavelength Conversion Based on XPM in HNLF / 3.1.1：
Wavelength Conversion and Regeneration Based on Supercontinuum Generation / 3.1.2：
Multi-Wavelength Conversion at 10 Gb/s and 40 GHz Using a Hybrid Integrated SOA Mach-Zehnder Interferometer / 3.1.3：
All-Optical Multi-Wavelength Regeneration Based on Quantum-Dot Semiconductor Optical Amplifiers for High Bit Rates / 3.1.4：
Optoelectronic Clock Recovery, Retiming and OTDM Demultiplexing / 3.2：
320 Gbit/s Clock Transmission and Channel Identification / 3.2.1：
Filtering-Assisted Cross-Phase Modulation in a Semiconductor Optical Amplifier Enabling 320 Gb/s Clock Recovery / 3.2.2：
640 Gbit/s Data Transmission and Clock Recovery Using an Ultra-Fast Periodically Poled Lithium Niobate Device / 3.2.3：
All-Optical Clock Extraction Circuit Based on a Mode-Locked Ring Laser Comprising SOA and FP Filter / 3.2.4：
OTDM Demux Based on Induced Modulation on an Auxiliary Carrier by Means of Super-Continuum Generation / 3.2.5：
160 Gb/s Retiming Using Rectangular Pulses Generated Using a Superstructured Fibre Bragg Grating / 3.2.6：
Timing Jitter Tolerant 640 Gb/s Demultiplexing Using a Long-Period Fibre Grating-Based Flat-Top Pulse Shaper / 3.2.7：
Evolution of Optical Access Networks / 4：
Introduction: FTTX Developments / 4.1：
FTTX Architectures / 4.1.1：
Current Standard PON Deployment Worldwide / 4.1.2：
Emerging Standards for 100 Gbit Ethernet Access and Beyond / 4.2：
Introduction - Why Higher Speed Ethernet? / 4.2.1：
100 Gbit Ethernet Challenges / 4.2.2：
Transparent Optical Transmission For 100 Gbit Ethernet / 4.2.3：
Future Directions / 4.2.4：
Interoperability of TDM and WDM PONs / 4.3：
Network Architecture / 4.3.1：
Network Routing Performance / 4.3.3：
3G Radio Distribution over Fibre / 4.3.4：
Optical Wireless for Last Mile Access / 4.4.1：
FSO Networks / 4.5.1：
Propagation Results / 4.5.3：
Dynamic Bandwidth Allocation Protocols over GPONs / 4.5.4：
Dynamic Bandwidth Allocation Protocols / 4.6.1：
Innovative Architecture and Control Plane for Metro-Access Convergence / 4.6.3：
Motivation for Metro-Access Convergence / 4.7.1：
Unified Metro-Access Networks Criteria / 4.7.2：
A Few Examples of Unified Metro-Access Networks (UMAN) / 4.7.3：
The Success + Network / 4.7.4：
The Success + Network Topology / 4.7.5：
The Success + UMAN Control Plane / 4.7.6：
Conclusion / 4.7.7：
Protection Schemes for PONs / 4.8：
Evolution of PON Protection Schemes / 4.8.1：
Recent PON Protection Architectures / 4.8.2：
Hybrid WDM/TDM PON / 4.8.3：
Reliability Performance Evaluation / 4.8.4：
Novel Switch Architectures / 5：
Application of Quantum-Dot SOAs for the Realization of All-Optical Buffer Architectures up to 160 Gb/s / 5.1：
Multiwavelength Optical Buffers / 5.3：
New Buffer Architectures / 5.3.1：
Scheduling Algorithms / 5.3.2：
Performance Evaluation / 5.3.3：
Multi-Stage Optical Switches with Optical Recirculation Buffers / 5.4：
The Switching Fabric Architecture / 5.4.1：
Scheduling Algorithms for the Single-Stage Shared FDL Switch / 5.4.2：
Scheduling Algorithms for the Three-Stage Shared FDL Optical Clos-Network Switch / 5.4.3：
Simulation Experiments / 5.4.4：
Optical Asynchronous Packet Switch Architectures / 5.5：
All-Optical Buffer Technologies / 5.5.1：
Node Architectures / 5.5.2：
Future Outlook (Part I) / 5.5.3：
Introduction (Part II) / Part II：
Cross-Layer Optimization Issues for Realizing Transparent Mesh Optical Networks / 6：
An Impairment Aware Networking Approach for Transparent Mesh Optical Networks / 6.1：
Transparent Optical Network Challenges / 6.1.1：
Proposed Approach / 6.1.3：
Mutual Impact of Physical Impairments and Traffic Grooming Capable Nodes with Limited Number of O/E/O / 6.2：
Motivation / 6.2.1：
Modelling the Physical Layer Impairments / 6.2.2：
The Routing Model / 6.2.3：
Simulation Results / 6.2.4：
Performance Issues in Optical Burst/Packet Switching / 6.3：
OBS/OPS Performance / 7.1：
Introduction and State-of-the-Art / 7.2.1：
On the Use of Balking for Estimation of the Blocking Probability for OBS Routers with FDL Lines / 7.2.2：
A Performance Comparison of Synchronous Slotted OPS Switches / 7.2.3：
A Performance Comparison of OBS and OpMiGua Paradigms / 7.2.4：
Burstification Mechanisms / 7.3：
Delay-Throughput Curves for Timer-Based OBS Burstifiers with Light Load / 7.3.2：
Performance Evaluation of Adaptive Burst Assembly Algorithms in OBS Networks with Self-Similar Traffic Sources / 7.3.3：
QoS Provisioning / 7.4：
Performance Overview of QoS Mechanisms in OBS Networks / 7.4.1：
Evaluation of Preemption Probabilities in OBS Networks with Burst Segmentation / 7.4.3：
Routing Algorithms / 7.5：
Optimization of Multi-Path Routing in Optical Burst Switching Networks / 7.5.1：
TCP over OBS Networks / 7.6：
Burst Reordering Impact on TCP over OBS Networks / 7.6.1：
Multi-layer Traffic Engineering (MTE) in Grooming Enabled ASON/GMPLS Networks / 7.7：
Routing and Grooming in Multi-layer Networks / 8.1：
Basic Schemes / 8.2.1：
Adaptive Integrated Multi-layer Routing / 8.2.2：
Simulation Study / 8.2.3：
Improvements for Multi-layer Routing and Grooming Schemes / 8.3：
Online Optimization at Connection Teardown / 8.3.1：
Admission Control for Improving Fairness / 8.3.2：
Evaluation of Traffic and Network Patterns / 8.4：
Network Resilience in Future Optical Networks / 9：
Terminology / 9.1：
Basic Resilience Techniques and Failure Management / 9.3：
Resilient Network Performance Improvement, Evaluation Methods and Parameters / 9.4：
Availability Calculation in Optical Network / 9.4.1：
Recovery Time / 9.4.2：
Network Performance Improvement through Differentiated Survivability / 9.4.3：
Security Issues in Transparent Optical Networks / 9.5：
Multilayer Resilience / 9.6：
Single Layer Recovery in Multilayer Networks / 9.6.1：
Interworking between Layers / 9.6.2：
Multilayer Survivability Strategies / 9.6.3：
Logical Topology Design / 9.6.4：
Optical Storage Area Networks / 9.7：
Storage Area Networks (SANS) / 10.1：
Data Mirroring Techniques / 10.1.2：
Network Architectures / 10.2：
Proposed Mirroring Technique / 10.3：
Single Section Ring Architecture / 10.4：
Two Sections Ring Architecture / 10.4.2：
Future Outlook (Part II) / 10.5：
Introduction (Part III) / Part III：
Software Tools and Methods for Modelling Physical Layer Issues / 11：
Modelling of Optoelectronic Components (Lasers and Semiconductor Optical Amplifiers) / 11.1：
Frequency-Domain Approaches / 11.1.1：
Time-Domain Models / 11.1.3：
Lumped-Element Models / 11.1.4：
Distributed Time-Domain Models / 11.1.5：
Modeling of Hybrid Mode-Locked Lasers / 11.1.6：
Modelling of Travelling-Wave Semiconductor Optical Amplifiers / 11.1.7：
Simulation Tool MOVE-IT / 11.2：
Numerical Models for Simulation of Transient Effect in Raman Fibre Amplifiers / 11.3：
Split-Step-Fourier-Method in Modeling of WDM Links / 11.4：
Pre-simulated Local Errors S-SSMF / 11.4.1：
Results / 11.4.2：
Software Tools and Methods for Research and Education in Optical Networks / 11.4.3：
Models and Simulations / 12.1：
Modelling / 12.1.1：
Simulation Techniques / 12.1.2：
Simulation and Model Verification / 12.1.3：
Summary on Modelling / 12.1.4：
Tool Integration Perspectives / 12.2：
Integration: Definitions / 12.2.1：
Obstacles to Integration and Possible Diversions / 12.2.2：
Conclusions and Future Outlook / 12.2.3：
Modelling with OPNET: A Practical Example / 12.3：
OPNET Domains / 12.3.1：
The OPNET Project Editor / 12.3.2：
Developing Models with OPNET: Conclusion / 12.3.3：
Simulation of ASON/GMPLS Using OMNET++ Simulator / 12.4：
The OMNET Simulator and the INET Framework / 12.4.1：
IP/MPLS over ASON/GMPLS Simulator / 12.4.2：
WDM Network Planning: The MatPlanWDM Tool / 12.4.3：
Distinctions Between Planning Problems / 12.5.1：
Integrated Tool / 12.5.2：
Extension of the Tool / 12.5.3：
The Javanco Environment / 12.6：
History and Predecessors / 12.6.1：
General Architecture / 12.6.2：
Utilisations / 12.6.3：
Future Developments and Conclusion / 12.6.4：
IKR Simulation Library / 12.7：
Conceptual Structure / 12.7.1：
Libraries / 12.7.2：
Application of the Simulation Library / 12.7.3：
Summary / 12.7.4：
Future Outlook (Part III)
Future Outlook
Introduction
Introduction (Part I) / Part I：
Novel Transponder Interfaces: Novel Modulation Formats / 1：
6.

電子ブック
ＥＢ
6. Towards Digital Optical Networks
Ioannis Tomkos, Karin Ennser, Takeo Kanade, Martin Köhn, Branko Mikac, Maria Spyropoulou
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2009
所蔵情報: loading…
目次情報: 続きを見る
Introduction
Introduction (Part I) / Part I：
Novel Transponder Interfaces: Novel Modulation Formats / 1：
Transmission of 8-Level 240 Gb/s RZ-DQPSK-ASK / 1.1：
Four Bits per Symbol 16-ary Transmission Experiments / 1.3：
Optical Rate Conversion Units / 1.4：
Optical Packet Compression and Expansion / 1.4.1：
Optical Compression/Expansion Loop / 1.4.2：
Optical Delay Line Structure / 1.4.3：
Scalable Packet Compression/Expansion Units / 1.4.4：
Transmission Efficiency / 1.4.5：
References
Electronic Channel Equalization Techniques / 2：
Electronic Equalizers / 2.1：
Fundamental Limits of MLSE Performance with Large Number of States / 2.3：
No PD-Filter, 8 Samples/Bit / 2.3.1：
With PD-Filter, 2 Samples/Bit / 2.3.2：
Large Optical Filter, 2 Samples/Bit / 2.3.3：
Large Optical Filter, 1 Sample/Bit / 2.3.4：
Compensation of SPM Using MLSE / 2.3.5：
Nonlinear Electrical Equalization for Different Modulation Formats / 2.4：
Introduction of NL-FFE-DFE / 2.4.1：
System Setups and Parameters / 2.4.2：
EDC Performance for Different Modulation Formats / 2.4.3：
Optical Single Sideband Modulation / 2.5：
Compensation of Optical Dispersion / 2.5.1：
Reduction of Nonlinear Transmission Effects / 2.5.2：
Enhancing the Performance DML Transmitters / 2.6：
Conclusions / 2.7：
Optical Signal Processing Techniques for Signal Regeneration and Digital Logic / 3：
Optical Regeneration and Wavelength Conversion / 3.1：
640 Gbit/s Wavelength Conversion Based on XPM in HNLF / 3.1.1：
Wavelength Conversion and Regeneration Based on Supercontinuum Generation / 3.1.2：
Multi-Wavelength Conversion at 10 Gb/s and 40 GHz Using a Hybrid Integrated SOA Mach-Zehnder Interferometer / 3.1.3：
All-Optical Multi-Wavelength Regeneration Based on Quantum-Dot Semiconductor Optical Amplifiers for High Bit Rates / 3.1.4：
Optoelectronic Clock Recovery, Retiming and OTDM Demultiplexing / 3.2：
320 Gbit/s Clock Transmission and Channel Identification / 3.2.1：
Filtering-Assisted Cross-Phase Modulation in a Semiconductor Optical Amplifier Enabling 320 Gb/s Clock Recovery / 3.2.2：
640 Gbit/s Data Transmission and Clock Recovery Using an Ultra-Fast Periodically Poled Lithium Niobate Device / 3.2.3：
All-Optical Clock Extraction Circuit Based on a Mode-Locked Ring Laser Comprising SOA and FP Filter / 3.2.4：
OTDM Demux Based on Induced Modulation on an Auxiliary Carrier by Means of Super-Continuum Generation / 3.2.5：
160 Gb/s Retiming Using Rectangular Pulses Generated Using a Superstructured Fibre Bragg Grating / 3.2.6：
Timing Jitter Tolerant 640 Gb/s Demultiplexing Using a Long-Period Fibre Grating-Based Flat-Top Pulse Shaper / 3.2.7：
Evolution of Optical Access Networks / 4：
Introduction: FTTX Developments / 4.1：
FTTX Architectures / 4.1.1：
Current Standard PON Deployment Worldwide / 4.1.2：
Emerging Standards for 100 Gbit Ethernet Access and Beyond / 4.2：
Introduction - Why Higher Speed Ethernet? / 4.2.1：
100 Gbit Ethernet Challenges / 4.2.2：
Transparent Optical Transmission For 100 Gbit Ethernet / 4.2.3：
Future Directions / 4.2.4：
Interoperability of TDM and WDM PONs / 4.3：
Network Architecture / 4.3.1：
Network Routing Performance / 4.3.3：
3G Radio Distribution over Fibre / 4.3.4：
Optical Wireless for Last Mile Access / 4.4.1：
FSO Networks / 4.5.1：
Propagation Results / 4.5.3：
Dynamic Bandwidth Allocation Protocols over GPONs / 4.5.4：
Dynamic Bandwidth Allocation Protocols / 4.6.1：
Innovative Architecture and Control Plane for Metro-Access Convergence / 4.6.3：
Motivation for Metro-Access Convergence / 4.7.1：
Unified Metro-Access Networks Criteria / 4.7.2：
A Few Examples of Unified Metro-Access Networks (UMAN) / 4.7.3：
The Success + Network / 4.7.4：
The Success + Network Topology / 4.7.5：
The Success + UMAN Control Plane / 4.7.6：
Conclusion / 4.7.7：
Protection Schemes for PONs / 4.8：
Evolution of PON Protection Schemes / 4.8.1：
Recent PON Protection Architectures / 4.8.2：
Hybrid WDM/TDM PON / 4.8.3：
Reliability Performance Evaluation / 4.8.4：
Novel Switch Architectures / 5：
Application of Quantum-Dot SOAs for the Realization of All-Optical Buffer Architectures up to 160 Gb/s / 5.1：
Multiwavelength Optical Buffers / 5.3：
New Buffer Architectures / 5.3.1：
Scheduling Algorithms / 5.3.2：
Performance Evaluation / 5.3.3：
Multi-Stage Optical Switches with Optical Recirculation Buffers / 5.4：
The Switching Fabric Architecture / 5.4.1：
Scheduling Algorithms for the Single-Stage Shared FDL Switch / 5.4.2：
Scheduling Algorithms for the Three-Stage Shared FDL Optical Clos-Network Switch / 5.4.3：
Simulation Experiments / 5.4.4：
Optical Asynchronous Packet Switch Architectures / 5.5：
All-Optical Buffer Technologies / 5.5.1：
Node Architectures / 5.5.2：
Future Outlook (Part I) / 5.5.3：
Introduction (Part II) / Part II：
Cross-Layer Optimization Issues for Realizing Transparent Mesh Optical Networks / 6：
An Impairment Aware Networking Approach for Transparent Mesh Optical Networks / 6.1：
Transparent Optical Network Challenges / 6.1.1：
Proposed Approach / 6.1.3：
Mutual Impact of Physical Impairments and Traffic Grooming Capable Nodes with Limited Number of O/E/O / 6.2：
Motivation / 6.2.1：
Modelling the Physical Layer Impairments / 6.2.2：
The Routing Model / 6.2.3：
Simulation Results / 6.2.4：
Performance Issues in Optical Burst/Packet Switching / 6.3：
OBS/OPS Performance / 7.1：
Introduction and State-of-the-Art / 7.2.1：
On the Use of Balking for Estimation of the Blocking Probability for OBS Routers with FDL Lines / 7.2.2：
A Performance Comparison of Synchronous Slotted OPS Switches / 7.2.3：
A Performance Comparison of OBS and OpMiGua Paradigms / 7.2.4：
Burstification Mechanisms / 7.3：
Delay-Throughput Curves for Timer-Based OBS Burstifiers with Light Load / 7.3.2：
Performance Evaluation of Adaptive Burst Assembly Algorithms in OBS Networks with Self-Similar Traffic Sources / 7.3.3：
QoS Provisioning / 7.4：
Performance Overview of QoS Mechanisms in OBS Networks / 7.4.1：
Evaluation of Preemption Probabilities in OBS Networks with Burst Segmentation / 7.4.3：
Routing Algorithms / 7.5：
Optimization of Multi-Path Routing in Optical Burst Switching Networks / 7.5.1：
TCP over OBS Networks / 7.6：
Burst Reordering Impact on TCP over OBS Networks / 7.6.1：
Multi-layer Traffic Engineering (MTE) in Grooming Enabled ASON/GMPLS Networks / 7.7：
Routing and Grooming in Multi-layer Networks / 8.1：
Basic Schemes / 8.2.1：
Adaptive Integrated Multi-layer Routing / 8.2.2：
Simulation Study / 8.2.3：
Improvements for Multi-layer Routing and Grooming Schemes / 8.3：
Online Optimization at Connection Teardown / 8.3.1：
Admission Control for Improving Fairness / 8.3.2：
Evaluation of Traffic and Network Patterns / 8.4：
Network Resilience in Future Optical Networks / 9：
Terminology / 9.1：
Basic Resilience Techniques and Failure Management / 9.3：
Resilient Network Performance Improvement, Evaluation Methods and Parameters / 9.4：
Availability Calculation in Optical Network / 9.4.1：
Recovery Time / 9.4.2：
Network Performance Improvement through Differentiated Survivability / 9.4.3：
Security Issues in Transparent Optical Networks / 9.5：
Multilayer Resilience / 9.6：
Single Layer Recovery in Multilayer Networks / 9.6.1：
Interworking between Layers / 9.6.2：
Multilayer Survivability Strategies / 9.6.3：
Logical Topology Design / 9.6.4：
Optical Storage Area Networks / 9.7：
Storage Area Networks (SANS) / 10.1：
Data Mirroring Techniques / 10.1.2：
Network Architectures / 10.2：
Proposed Mirroring Technique / 10.3：
Single Section Ring Architecture / 10.4：
Two Sections Ring Architecture / 10.4.2：
Future Outlook (Part II) / 10.5：
Introduction (Part III) / Part III：
Software Tools and Methods for Modelling Physical Layer Issues / 11：
Modelling of Optoelectronic Components (Lasers and Semiconductor Optical Amplifiers) / 11.1：
Frequency-Domain Approaches / 11.1.1：
Time-Domain Models / 11.1.3：
Lumped-Element Models / 11.1.4：
Distributed Time-Domain Models / 11.1.5：
Modeling of Hybrid Mode-Locked Lasers / 11.1.6：
Modelling of Travelling-Wave Semiconductor Optical Amplifiers / 11.1.7：
Simulation Tool MOVE-IT / 11.2：
Numerical Models for Simulation of Transient Effect in Raman Fibre Amplifiers / 11.3：
Split-Step-Fourier-Method in Modeling of WDM Links / 11.4：
Pre-simulated Local Errors S-SSMF / 11.4.1：
Results / 11.4.2：
Software Tools and Methods for Research and Education in Optical Networks / 11.4.3：
Models and Simulations / 12.1：
Modelling / 12.1.1：
Simulation Techniques / 12.1.2：
Simulation and Model Verification / 12.1.3：
Summary on Modelling / 12.1.4：
Tool Integration Perspectives / 12.2：
Integration: Definitions / 12.2.1：
Obstacles to Integration and Possible Diversions / 12.2.2：
Conclusions and Future Outlook / 12.2.3：
Modelling with OPNET: A Practical Example / 12.3：
OPNET Domains / 12.3.1：
The OPNET Project Editor / 12.3.2：
Developing Models with OPNET: Conclusion / 12.3.3：
Simulation of ASON/GMPLS Using OMNET++ Simulator / 12.4：
The OMNET Simulator and the INET Framework / 12.4.1：
IP/MPLS over ASON/GMPLS Simulator / 12.4.2：
WDM Network Planning: The MatPlanWDM Tool / 12.4.3：
Distinctions Between Planning Problems / 12.5.1：
Integrated Tool / 12.5.2：
Extension of the Tool / 12.5.3：
The Javanco Environment / 12.6：
History and Predecessors / 12.6.1：
General Architecture / 12.6.2：
Utilisations / 12.6.3：
Future Developments and Conclusion / 12.6.4：
IKR Simulation Library / 12.7：
Conceptual Structure / 12.7.1：
Libraries / 12.7.2：
Application of the Simulation Library / 12.7.3：
Summary / 12.7.4：
Future Outlook (Part III)
Future Outlook
Introduction
Introduction (Part I) / Part I：
Novel Transponder Interfaces: Novel Modulation Formats / 1：
7.

電子ブック
ＥＢ
7. Proceedings of the 1st IFIP TC6 /WG8.8 /WG11.2 international conference on Information security theory and practices: smart cards, mobile and ubiquitous computing systems
Damien Sauveron, Angelos Bilas, Takeo Kanade, Konstantinos Markantonakis, Jean-Jacques Quisquater, Association for Computing Machinery-Digital Library., International Federation for Information Processing.
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2007
所蔵情報: loading…
8.

電子ブック
ＥＢ
8. Algorithms for Sensor and Ad Hoc Networks
Dorothea Wagner, Takeo Kanade, Roger Wattenhofer, Roger Peter Wattenhofer
出版情報: Springer eBooks Computer Science , Springer Berlin Heidelberg, 2007
所蔵情報: loading…
目次情報: 続きを見る
Preface
Applications of Sensor Networks / H.-J. Hof1：
Introduction / 1.1：
Current Hardware Platforms / 1.2：
Upcoming Applications / 1.4：
Chapter Notes / 1.5：
Modeling Sensor and Ad Hoc Networks / F. Schuh2：
Distributed Algorithms / 2.1：
Communication / 2.3：
Energy / 2.4：
Mobility / 2.5：
Clustering / T. Moscibroda2.6：
Models / 3.1：
Clustering Algorithms for Unit Disk Graphs / 3.3：
Clustering Algorithms for General Graphs / 3.4：
Conclusionsand Open Problems / 3.5：
MAC Layer and Coloring / S. Mecke3.6：
Algorithms for Vertex Coloring / 4.1：
Conclusion / 4.3：
Topology Control / K. Buchin ; M. Buchin4.4：
Quality Criteria / 5.1：
Locally Defined Geometric Graphs and Further Proximity Graphs / 5.3：
Localized Algorithms / 5.4：
Interference and Signal-to-Noise-Ratio / A. Kröller5.5：
Interference Models / 6.1：
Low-Interference Topologies / 6.3：
Topology Scheduling / 6.4：
Flow and Path Scheduling / 6.5：
Lower Bounds / Z. Benenson6.6：
A Lower Boundon3-Coloringa Ring / 7.1：
Locally Checkable Labelings / 7.3：
Minimum-Weight Spanning Trees / 7.4：
Facility Location / C. Frank7.5：
Problem Definition / 8.1：
Centralized Approximations / 8.3：
Simple Distributed Approximation / 8.4：
Fast Distributed Approximation / 8.5：
Discussionand Outlook / 8.6：
Geographic Routing / A. Zollinger8.7：
Related Work / 9.1：
Models and Preliminaries / 9.3：
Greedy Routing / 9.4：
Routing with Faces / 9.5：
A Lower Bound / 9.6：
Combining Greedy and Face Routing / 9.7：
Compact Routing / M. Dom9.8：
Definitions / 10.1：
Overview / 10.3：
Algorithms / 10.4：
Pseudo Geometric Routing for Sensor Networks / O. Landsiedel10.5：
Routing Algorithmsfor Sensor Networks / 11.1：
Virtual Coordinate Based Routing / 11.3：
Beacon Vector Routing / 11.4：
Algorithmic View / 11.5：
Minimal Range Assignments for Broadcasts / C. Gunia11.6：
The Algorithm RAPMST and Its Analysis / 12.1：
Distributed Computation of an MST / 12.3：
Further Advances / 12.4：
Conclusion and Open Questions / 12.5：
Data Gathering in Sensor Networks / L. Scharf12.6：
Network Model / 13.1：
Minimum Energy Data Gathering / 13.3：
Maximum Lifetime Data Gathering / 13.4：
Location Services / B. Fabian ; M. Fischmann ; S.F. Gürses13.5：
Grid Location Service (GLS) / 14.1：
Locality-Aware Location Service (LLS) / 14.3：
Mobility-Aware Location Service (MLS) / 14.4：
Outlook / 14.5：
Positioning / D. Fleischer ; C. Pich14.6：
Hardness Results / 15.1：
Security / E.-O. Blaß15.3：
Symmetric Key Distribution / 16.1：
Public-Key Distribution / 16.3：
Open Questions / 16.4：
Trust Mechanisms and Reputation Systems / E. Buchmann16.5：
General Trust Models / 17.1：
Reputation-Based Trust Protocols in Ad Hoc Networks / 17.3：
Open Problems / 17.4：
Selfish Agents and Economic Aspects / 17.5：
Mechanism Design / 18.1：
Unicast in Selfish Networks / 18.3：
Multicast in Selfish Networks / 18.5：
Time Synchronization / M. Busse ; T. Streichert18.6：
Time Synchronization Approaches / 19.1：
Synchronizing Clocks in the Presence of Faults / 19.3：
Theoretical Bounds for Clock Synchronization and Ordering ofEvents / 19.4：
Gradient Clock Synchronization / 19.5：
Bibliography / 19.6：
Author Index
Subject Index
Preface
Applications of Sensor Networks / H.-J. Hof1：
Introduction / 1.1：
9.

電子ブック
ＥＢ
9. Algorithms for Sensor and Ad Hoc Networks
Dorothea Wagner, Takeo Kanade, Roger Wattenhofer, Roger Peter Wattenhofer, Josef Kittler
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2007
所蔵情報: loading…
目次情報: 続きを見る
Preface
Applications of Sensor Networks / H.-J. Hof1：
Introduction / 1.1：
Current Hardware Platforms / 1.2：
Upcoming Applications / 1.4：
Chapter Notes / 1.5：
Modeling Sensor and Ad Hoc Networks / F. Schuh2：
Distributed Algorithms / 2.1：
Communication / 2.3：
Energy / 2.4：
Mobility / 2.5：
Clustering / T. Moscibroda2.6：
Models / 3.1：
Clustering Algorithms for Unit Disk Graphs / 3.3：
Clustering Algorithms for General Graphs / 3.4：
Conclusionsand Open Problems / 3.5：
MAC Layer and Coloring / S. Mecke3.6：
Algorithms for Vertex Coloring / 4.1：
Conclusion / 4.3：
Topology Control / K. Buchin ; M. Buchin4.4：
Quality Criteria / 5.1：
Locally Defined Geometric Graphs and Further Proximity Graphs / 5.3：
Localized Algorithms / 5.4：
Interference and Signal-to-Noise-Ratio / A. Kröller5.5：
Interference Models / 6.1：
Low-Interference Topologies / 6.3：
Topology Scheduling / 6.4：
Flow and Path Scheduling / 6.5：
Lower Bounds / Z. Benenson6.6：
A Lower Boundon3-Coloringa Ring / 7.1：
Locally Checkable Labelings / 7.3：
Minimum-Weight Spanning Trees / 7.4：
Facility Location / C. Frank7.5：
Problem Definition / 8.1：
Centralized Approximations / 8.3：
Simple Distributed Approximation / 8.4：
Fast Distributed Approximation / 8.5：
Discussionand Outlook / 8.6：
Geographic Routing / A. Zollinger8.7：
Related Work / 9.1：
Models and Preliminaries / 9.3：
Greedy Routing / 9.4：
Routing with Faces / 9.5：
A Lower Bound / 9.6：
Combining Greedy and Face Routing / 9.7：
Compact Routing / M. Dom9.8：
Definitions / 10.1：
Overview / 10.3：
Algorithms / 10.4：
Pseudo Geometric Routing for Sensor Networks / O. Landsiedel10.5：
Routing Algorithmsfor Sensor Networks / 11.1：
Virtual Coordinate Based Routing / 11.3：
Beacon Vector Routing / 11.4：
Algorithmic View / 11.5：
Minimal Range Assignments for Broadcasts / C. Gunia11.6：
The Algorithm RAPMST and Its Analysis / 12.1：
Distributed Computation of an MST / 12.3：
Further Advances / 12.4：
Conclusion and Open Questions / 12.5：
Data Gathering in Sensor Networks / L. Scharf12.6：
Network Model / 13.1：
Minimum Energy Data Gathering / 13.3：
Maximum Lifetime Data Gathering / 13.4：
Location Services / B. Fabian ; M. Fischmann ; S.F. Gürses13.5：
Grid Location Service (GLS) / 14.1：
Locality-Aware Location Service (LLS) / 14.3：
Mobility-Aware Location Service (MLS) / 14.4：
Outlook / 14.5：
Positioning / D. Fleischer ; C. Pich14.6：
Hardness Results / 15.1：
Security / E.-O. Blaß15.3：
Symmetric Key Distribution / 16.1：
Public-Key Distribution / 16.3：
Open Questions / 16.4：
Trust Mechanisms and Reputation Systems / E. Buchmann16.5：
General Trust Models / 17.1：
Reputation-Based Trust Protocols in Ad Hoc Networks / 17.3：
Open Problems / 17.4：
Selfish Agents and Economic Aspects / 17.5：
Mechanism Design / 18.1：
Unicast in Selfish Networks / 18.3：
Multicast in Selfish Networks / 18.5：
Time Synchronization / M. Busse ; T. Streichert18.6：
Time Synchronization Approaches / 19.1：
Synchronizing Clocks in the Presence of Faults / 19.3：
Theoretical Bounds for Clock Synchronization and Ordering ofEvents / 19.4：
Gradient Clock Synchronization / 19.5：
Bibliography / 19.6：
Author Index
Subject Index
Preface
Applications of Sensor Networks / H.-J. Hof1：
Introduction / 1.1：
10.

電子ブック
ＥＢ
10. Incentives, Overlays, and Economic Traffic Control
Burkhard Stiller, Tobias Ho?feld, Takeo Kanade, George D. Stamoulis
出版情報: Springer eBooks Computer Science , Springer Berlin Heidelberg, 2010
所蔵情報: loading…
目次情報: 続きを見る
Keynote
Socio-economic Challenges for the Internet of the Future: The Case of Congestion Control / Costas Courcoubetis
P2P and Overlay Management
An Incentive-Based Approach to Traffic Management for Peer-to-Peer Overlays / Konstantin Pussep ; Sergey Kuleshov ; Christian Gro? ; Sergios Soursos
Quantifying Operational Cost-Savings through ALTO-Guidance for P2P Live Streaming / Jan Seedorf ; Saverio Niccolini ; Martin Stiemerling ; Ettore Ferranti ; Rolf Winter
Overlay Connection Usage in BitTorrent Swarms / Simon Oechsner ; Frank Lehrieder ; Dirk Staehle
Evaluations and Estimations
Implementation and Performance Evaluation of the re-ECN Protocol / Mirja Kühlewind ; Michael Scharf
Estimating AS Relationships for Application-Layer Traffic Optimization / Hirochika Asai ; Hiroshi Esaki
Mobile Internet in Stereo: An End-to-End Scenario / Henna Warma ; Tapio Levä ; Lars Eggert ; Heikki Hämmäinen ; Jukka Manner
Short Papers
A Study of Non-neutral Networks with Usage-Based Prices / Eitan Altman ; Pierre Bernhard ; Stephane Caron ; George Kesidis ; Julio Rojas-Mora ; Sulan Wong
Stability of Alliances between Service Providers / Hélène Le Cadre
Business-Driven QoS Management of B2C Web Servers / Grazyna Suchacka ; Leszek Borzemski
The Applicability of Context-Based Multicast - A Shopping Centre Scenario / Thomas Wozniak ; Katarina Stanoevska-Slabeva ; Diogo Gomes ; Hans D. Schotten
Author Index
Keynote
Socio-economic Challenges for the Internet of the Future: The Case of Congestion Control / Costas Courcoubetis
P2P and Overlay Management
文献の複写および貸借の依頼を行う
 文献複写・貸借依頼