The evolution of the industry, known as industry 4.0, has introduced new technologies such as Virtual Commissioning and Industrial Internet of things. Nowadays, virtual models of automated systems are being created in order to be tested while being built in real life, what includes PLC programs, robots, etc. In order to provide a real behaviour emulation, these virtual models should be as similar to reality as possible. Currently, the components communication in a real system is done through Internet with the use of fieldbuses I/O modules. Right now, these modules are not integrated in the virtual model, as the PLC program returns an error due to the hardware not being found. This implies that the PLC project must be modified, and a workaround must be done in order to connect the I/O cards components of the modules. Furthermore, it means that two PLC projects need to be maintained at the same time, one for the real system and another for the virtual system. In this thesis, a research was done to prove if fieldbuses modules could be emulated, helping to improve Virtual Commissioning. The final goal is to allow a PLC project created for a real system to be run again the corresponding virtual model without any change. To achieve this, a driver able to emulate the communication behaviour of an Ethernet/IP fieldbus module is developed and tested against a real PLC program.

La téléphonie sur IP est devenue un nouveau paradigme pour établir et transmettre les communications téléphoniques directement sur les réseaux IP de manière flexible et à faible coût. Toutefois, les services VoIP sont confrontés à plusieurs problèmes de sécurité qui sont soit hérités de la couche IP soit spécifiques au service lui-même. Une grande variété de mécanismes de protection est disponible pour y faire face. Cependant, ces services nécessitent des performances et une disponibilité du réseau élevé, et les mécanismes de protection peuvent nuire à ces performances. La gestion des risques offre de nouvelles perspectives à l'égard de cette problématique. Nos contributions portent sur l'application et l'automatisation de la gestion de risques dans les infrastructures VoIP selon trois axes. Le premier axe porte sur l'automatisation du processus de gestion des risques dans un réseau VoIP d'entreprise. Dans ce cadre, nous avons développé un modèle pour évaluer les risques, un ensemble de contremesures progressives et des algorithmes de mitigation. Nous l'avons couplé à un système de détection d'anomalies basé sur les SVM et un mécanisme d'auto-configuration qui peut fournir un retour d'expérience sur l'efficacité des contremesures. Le deuxième axe concerne l'extension de notre stratégie dans les réseaux P2PSIP. Nous avons mis en place une solution adaptée à la nature distribuée des environnements pair-à-pair. Nous nous sommes aussi intéressés à l'architecture RELOAD et avons étudié comment traiter les attaques résiduelles à travers des mécanismes de confiance. Nous avons enfin étudié les services VoIP dans le cloud où nous proposons plusieurs stratégies pour le déploiement et l'application des contremesures / IP telephony has become a new paradigm that permits to establish and transmit voice communications with IP networks. Its deployment has been accelerated by the standardization of dedicated signaling protocols. However, VoIP services are faced to several security issues which are inherited from the IP layer or specific to the service. A large variety of protection mechanisms are available to deal with them. However, IP telephony is a real-time service which requires high network performance. The application of countermeasures may significantly affect such a critical service. Risk management provides new perspectives for this issue. This thesis deals with the application of risk management in VoIP infrastructures. The first axis consists in the automation of the risk management process in VoIP enterprise network. In this context, we have developed a mathematical model for assessing risk, a set of progressive countermeasures to counter attackers and mitigation algorithms that evaluate the risk level and takes the decision to activate a subset of countermeasures. To improve our strategy, we have coupled it with an anomaly detection system based on SVM and a self-configuration mechanism which provides feedback about countermeasure efficiency. The second axis deals with the extension of our adaptive risk strategy to P2PSIP infrastructures. We have implemented a specific risk model and a dedicated set of countermeasures with respect to its peer-to-peer nature. For that, we have identified attack sources and established different threat scenarios. We have analyzed the RELOAD framework and proposed trust mechanisms to address its residual attacks. Finally, the third axis focuses on VoIP services in the cloud where we have proposed a risk strategy and several strategies to deploy and apply countermeasures

Com o advento da internet, a comunicação entre sistemas remotos foi amplamente facilitada, tornando viável a aplicação de sistemas supervisórios através dela, principalmente via protocolo TCP/IP. Embora esses sistemas já sejam empregados na indústria, principalmente utilizando como driver os controladores lógicos programáveis (CLP\'s), a implementação de qualquer sistema mais simples de supervisionamento teria um custo elevado, devido tanto ao preço do hardware quanto do software envolvido. Além disso, os programas supervisórios existentes fornecem um número limitado de recursos de visualização, que se restringem principalmente ao software. Assim, o que se propõe nesse trabalho é um sistema supervisório de baixo custo, via TCP/IP, aplicado em máquinas elétricas, mas que pode ser generalizado na supervisão de outros tipos de sistemas, onde o monitoramento remoto é necessário. Além da exibição convencional dos parâmetros supervisionados através de gráficos e labels, o sistema permite também que esses sejam exibidos através de painéis eletrônicos, fornecendo assim, uma nova interface visual ao usuário com o intuito de facilitar sua supervisão. / The advent of internet simplified the comunication between remote systems, allowing the application of supervisory systems through the internet, mainly using the TCP/IP protocol. Although these systems have already been employed in industry, using the Programmer Logic Controller (PLC\'s) as driver, the implementation of any simple supervisory system could have an expensive cost, due to the prices of hardware and software employed. Moreover, the existing supervisory systems provide limited visual resources, restricted to the used software. So, this work presents a low cost supervisory system, via TCP/IP, applied to electric machines but it can be generalized in the supervision of differents types of systems, where the remote monitoring is necessary. Besides the conventional displaying of the monitored parameters through graphics and labels, the developed system allows the exhibition of the supervisioned parameters using eletronic panels, providing an alternative visual interface to the user so that their supervision becomes easier.

by Chung Ling Chi. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2001. / Includes bibliographical references (leaves 74-76). / Abstracts in English and Chinese. / Chapter Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Overview --- p.1 / Chapter 1.2 --- Motivation and Proposed Solution --- p.2 / Chapter 1.3 --- Organization of the Thesis --- p.4 / Chapter Chapter 2 --- Background --- p.5 / Chapter 2.1 --- Basics of Transmission Control Protocol --- p.5 / Chapter 2.1.1 --- Slow Start and Congestion Avoidance --- p.5 / Chapter 2.1.2 --- Fast Retransmit and Fast Recovery --- p.7 / Chapter 2.2 --- SACK TCP Mechanism --- p.8 / Chapter 2.2.1 --- SACK-permitted Option during Three-way Handshake --- p.8 / Chapter 2.2.2 --- SACK blocks in SACK Option --- p.9 / Chapter 2.2.3 --- Interpreting the SACK Option using Scoreboard --- p.10 / Chapter 2.2.4 --- Retransmission Strategy --- p.11 / Chapter 2.3 --- TCP Veno Mechanism --- p.13 / Chapter 2.3.1 --- Refined Additive Increase --- p.13 / Chapter 2.3.2 --- Refined Multiplicative Decrease --- p.14 / Chapter Chapter 3 --- SACK TCPVeno --- p.16 / Chapter 3.1 --- Distinguishing between Types of Packet Loss --- p.17 / Chapter 3.2 --- Refined Multiplicative Decrease --- p.21 / Chapter 3.2.1 --- Algorithm --- p.21 / Chapter 3.2.2 --- Recovery in Consecutive packet Losses --- p.22 / Chapter 3.2.3 --- Recovering Multiple Packet Losses within a Single Window --- p.26 / Chapter 3.3 --- Refined Additive Increase --- p.37 / Chapter 3.3.1 --- Algorithm --- p.37 / Chapter 3.3.2 --- Advantages --- p.40 / Chapter 3.4 --- Other Issues --- p.43 / Chapter 3.4.1 --- Two Side Modifications --- p.43 / Chapter Chapter 4 --- Experiments --- p.44 / Chapter 4.1 --- The Network Scenario --- p.44 / Chapter 4.1.1 --- Dummynet --- p.45 / Chapter 4.2 --- Experiment Results --- p.47 / Chapter 4.2.1 --- Single Connection --- p.47 / Chapter 4.2.1.1 --- Congestion Window Evolution --- p.47 / Chapter 4.2.1.2 --- Sending Rate and Throughput Evolution --- p.49 / Chapter 4.2.1.2.1 --- Impact of Packet Loss Rate Due to Lossy Link --- p.49 / Chapter 4.2.1.2.2 --- Impact of Buffering --- p.52 / Chapter 4.2.1.2.3 --- Impact of Propagation Delay --- p.57 / Chapter 4.2.2 --- Multiple Connections --- p.62 / Chapter 4.2.2.1 --- Fairness --- p.62 / Chapter 4.2.2.2 --- Compatibility --- p.67 / Chapter Chapter 5 --- Conclusion --- p.72 / Bibliography --- p.74

El objetivo de la presente tesis es implementar un laboratorio virtual para simular los mecanismos de transición vigentes en redes IPv4/IPv6, aplicándolos en el enrutamiento dinámico, y para facilitar su implementación en una red de área local con usuarios Windows. La metodología usada en este documento consiste en, por un lado, establecer un enlace a un repositorio remoto con el uso de la herramienta Apache Subversion. En donde, bajo la supervisión del Asesor de la tesis, se realiza el control de versiones de los escenarios virtuales y del documento de la tesis. Así mismo, a través de reuniones presenciales y virtuales con la herramienta de comunicación Skype, se verifica el avance del presente trabajo. Por otro lado, en cuanto al desarrollo de la tesis, en primer lugar, se diseña la topología de los escenarios para su posterior implementación a través de la lógica del lenguaje de programación de la herramienta de virtualización. En segundo lugar, se realiza la ejecución de pruebas de conectividad y eficiencia de los escenarios virtuales. Y, en tercer lugar, a partir del resultado de las pruebas obtenidas en los escenarios virtuales, se selecciona los mecanismos adecuados para lograr la migración de una red con clientes Windows a IPv6. Esto, sin afectar los servicios y la operatividad de la red. En el Capítulo I, se describe la necesidad de adoptar el protocolo IPv6. Se exponen las ventajas del protocolo IPv6 sobre IPv4. Además, se analiza los mecanismos de traducción, NAT64+DNS64, y de túneles, 6to4 y 6RD; se describe el protocolo ICMPv6, el papel que cumple en el direccionamiento dinámico IPv6 y en el sistema de nombres de dominio (DNS) en IPv6. Así mismo, se muestra la situación actual de la Red Académica Peruana RAAP y de los operadores de telecomunicaciones en la adopción de IPv6. En relación a la tendencia actual de los mecanismos de transición en las redes móviles, se describe el estado y uso de las tecnologías, como Dual- Stack y 464XLAT. Por otro lado, el primer aporte de la tesis se muestra en el Capítulo II. La implementación de los escenarios virtuales utilizando una herramienta desarrollada por la Universidad Politécnica de Madrid llamada VNUML. En donde, el único requerimiento que permite ejecutar los escenarios completos es adecuar un solo equipo anfitrión con capacidades de procesamiento y almacenamiento necesarios para la óptima ejecución de cada máquina virtual. En ese sentido, a través del diseño e implementación de cada escenario virtual que corresponde a los mecanismos de traducción NAT64 y DNS64, y los túneles 6to4 y 6RD, se demuestra la capacidad de la herramienta VNUML en el diseño, ejecución y comprobación de los aspectos teóricos señalados en el primer capítulo de esta tesis. El siguiente aporte de esta tesis se muestra en el Capítulo III. La migración de una red privada de usuarios Windows a IPv6. En primer lugar, se hace un despliegue dinámico de direcciones IPv6 a través de DHCPv6 + SLAAC. En segundo lugar, el acceso a los servicios e Internet IPv4 se realiza a través de NAT64 stateful y DNS64. Y, en tercer lugar, el acceso a Internet IPv6 se hace posible con el mecanismo NAT66. De esta manera, se demuestra que es factible desplegar IPv6 de forma transparente para los usuarios finales. / Tesis

Se plantea un problema de cambio de infraestructura y rediseño de red de comunicaciones en una empresa dedicada al servicio de transferencia electrónica de fondos interbancarios a través de una red de cajeros automáticos y al procesamiento y administración de tarjetas de débito y crédito. Tanto en el frente de los cajeros automáticos o terminales transaccionales, como en el frente de los computadores que autorizan las transacciones, se han ido experimentando y exigiendo cambios, los cuales no solo han involucrado nuevas tecnologías y aplicaciones, sino también la apertura a protocolos de comunicación como el TCP/IP con nuevos servicios y posibilidades, en un servicio financiero, que por mantener altos niveles de seguridad, mantenía protocolos de comunicación “heredados” como el X.25 y el SNA. En el presente documento se revisa la situación inicial de la red, los servicios y las necesidades del negocio, y la evolución de las redes de cajeros. Con el fin de conseguir los objetivos, se plantean propuestas de solución para dar soporte a las aplicaciones con protocolos “heredados” en una red IP, se revisan las alternativas técnico-económicas de enlaces de comunicación, las propuestas para la renovación de la infraestructura de comunicaciones y seguridad, y finalmente una serie de recomendaciones para la implantación y la migración a la red IP. Con un adecuado planeamiento e implantación de políticas de seguridad adecuadas, en una red privada, publica o compartida con otra institución, es posible conseguir una red de cajeros automáticos TCP/IP eficiente, segura, con alta disponibilidad, y capaz de brindar mayores servicios. / Tesis

The work presented here is part of a wider research programme oriented around three specific questions. First, how do individual agents appropriate returns from innovation and how is this affected by the availability (or not) of intellectual property rights such as copyrights and patents? Second, how does this translate into the aggregate production of knowledge, once one takes account of the interaction between producers and the cumulative nature of the process of knowledge production? Finally, How can we incorporate this into an estimate of the welfare trade-off inherent in intellectual property rights (the basic prerequisite for formulating rational IP policy)? The dissertation contains theoretical work on each of these questions together with a brief introductory preamble and a review of the existing literature on the economics of knowledge.

Submitted by Sara Ribeiro (sara.ribeiro@ucb.br) on 2017-09-08T18:11:30Z No. of bitstreams: 1 OrzenilBonfimdaSilvaJuniorTeseParcial2017.pdf: 781918 bytes, checksum: 8eef627ca550957f6bfa1f46e54c687c (MD5) / Approved for entry into archive by Sara Ribeiro (sara.ribeiro@ucb.br) on 2017-09-08T18:11:38Z (GMT) No. of bitstreams: 1 OrzenilBonfimdaSilvaJuniorTeseParcial2017.pdf: 781918 bytes, checksum: 8eef627ca550957f6bfa1f46e54c687c (MD5) / Made available in DSpace on 2017-09-08T18:11:38Z (GMT). No. of bitstreams: 1 OrzenilBonfimdaSilvaJuniorTeseParcial2017.pdf: 781918 bytes, checksum: 8eef627ca550957f6bfa1f46e54c687c (MD5) Previous issue date: 2017-07-11 / In the last twenty-five years, we have witnessed the wide adoption of DNA markers for the study of genetic variation in many organisms. A DNA marker must have two or more identifiable allelic DNA sequences to be useful. It usually does not have a biological effect, but instead functions as a traceable landmark in the genome, found in a specific location, and transmitted by the standard laws of inheritance from one generation to the next. Its application goes beyond genetic mapping and includes the analysis of genetic diversity, marker-trait association studies, marker assisted selection and, more recently, with the advent of wholegenome sequencing, whole-genome association and genomic selection. Among the several types of DNA sequence polymorphisms that can be used as DNA marker, Single Nucleotide Polymorphisms (SNPs) are the most powerful for large-scale variation analysis. There are vast numbers of SNPs in every genome and they can be typed by methods that have been proven easy to automate. Detection of alternative alleles is rapid and effortless because it is based on well-known polymerase chain reaction and DNA oligomer hybridization assays. Various strategies have been devised to discriminate alleles at a SNP, including fixed DNA arrays technologies, solution hybridization techniques and many sequencing-based genotyping. In our study, we have developed high-throughput DNA marker systems for non-model, highly heterozygous, diploid tree species. We took advantage of the combined power of Next Generation Sequencing (NGS) technologies, well-established highly automated methods of SNP typing and bioinformatics algorithms to perform genome-wide DNA variation analysis. We used whole genome resequencing of pooled individuals to develop a high-density 60K SNP chip for Eucalyptus species (EucHIP60k) providing a 96% genome-wide coverage with 1 SNP/12???20 kbp, and 47,069 SNPs at ??? 10 kb from 30,444 of the 33,917 genes in the Eucalyptus genome. We then used high-density SNP data and whole-genome pooled resequencing to examine the landscape of population recombination (??) and theta (??), assess the extent of linkage disequilibrium (r2) and build the highest density linkage maps for Eucalyptus to date. Chromosome-wide ancestral recombination graphs allowed us to date the split of Eucalytpus grandis (1.7???4.8 million yr. ago) and identify a scenario for the recent demographic history of the species. In a final set of studies, we built the first genome assembly for a Neotropical forest tree, the Pink Ip?? (Handroanthus impetiginosus), a highly-valued keystone timber species. Genome sequence was screened for the development of a targeted-capture sequencing system for SNP genotyping consisting of nearly 24,000 probe sequences. This genotyping system showed flexibility as it allowed the identification of SNPs across different populations of the species in moderate sample sizes. The good genome coverage, consistent Ts/Tv ratio estimated across samples and fair technical reproducibility between replicates, in terms of recall and precision of the SNP calling and accuracy on genotypes, indicate that this genotyping platform can be confidently used to estimate population genetics parameters and carry out population genomics investigations at the genome-wide scale / ***

No description available.

近年來，使用者通過移動數據網路，如3G和LTE，連接到互聯網的數目急劇增加。眾所周知無線網路和移動數據網路展現的特點和有線網路有很大的不同。儘管如此，大多數移動應用程式的基本構建塊，即傳輸控制協議（TCP），在很大程度上仍是根植於有線網路。本論文通過廣泛的開展多個移動數據網路，包括3G，HSPA，最新的LTE網路的測試和實驗，探討TCP在現代移動數據網路的性能。儘管移動數據網路頻寬的迅速增加，我們的測量結果均顯示，現有的TCP實現在實踐中表現不佳，未能利用高速移動數據網路豐富的頻寬。這項工作解決TCP的性能限制，採用一種新的方法透明協議優化，通過在中間網路設備即時優化TCP，顯著提高TCP的吞吐量。具體來說，這項工作發展（一）一個新穎的機會傳輸算法克服TCP的流量控制的瓶頸;（二）一個傳輸速率控制演算法來解決TCP的拥塞控制的瓶頸;（三）一個新穎的投機重傳演算法，以提高TCP在重傳中的吞吐量;（四）用隨機模型來量化TCP吞吐量性能對移動網路資源利用率的影響;（五）一個新的隊列長度測量算法，為擁塞控制和網路監測打開一條新的途徑。另外，擬議的協議優化技術已全面實施，變成一個移動加速器裝置已經成功在三個不同的3G/LTE生產移動數據網路領域試用，實驗顯示TCP的吞吐量從48%增加至163%。在發明一種新的傳輸協議，或修改現有的TCP實施相比，所提出的方法不要求在用戶端/伺服器的主機現有的TCP實施任何修改，不需要重新配置伺服器或用戶端，並因此可以容易在現今的3G和4G移動網路部署，提高所有現有網路上運行在TCP之上的應用程式的吞吐量性能。 / The number of Internet users which are connected via mobile networks such as 3G and LTE has increased dramatically in recent years. It is well-known that wireless networks in general, and mobile data networks in particular, exhibit characteristics that are very different from their wired counterparts. Nevertheless, the fundamental building block of most Internet applications, namely the Transmission Control Protocol (TCP), is still largely rooted in wired networks. This dissertation investigate the performance of TCP over modern mobile data networks through extensive measurements and experiments carried out in multiple production data networks, ranging from 3G, HSPA, to the latest LTE networks. Despite the rapid increases in mobile network bandwidth, our measurements consistently reveal that existing TCP implementations perform sub-optimally in practice, failing to utilize the abundant bandwidth available in high-speed mobile networks. This work tackles the performance limitations of TCP using a novel approach - transparent protocol optimization, to significantly improve TCP’s throughput performance using on-the-fly protocol optimization carried out by an intermediate network device in-between the TCP end-hosts. Specifically, this work develops (i) a novel opportunistic transmission algorithm to overcome the TCP’s flow control bottleneck; (ii) a transmission rate control algorithm to tackle TCP’s congestion control bottleneck; (iii) a new opportunistic retransmission algorithm to improve TCP’s performance during packet loss recovery; (iv) a stochastic model to quantify the impact of TCP throughput performance on mobile network capacity; and (v) a new queue length estimation algorithm which opens a new avenue for congestion control and network monitoring. In addition, the proposed protocol optimization techniques have been fully implemented into a mobile accelerator device which has been successfully field trialed in three different production 3G/LTE mobile networks, consistently increasing TCP’s throughput by 48% to 163%. In contrast to inventing a new transport protocol or modifying an existing TCP implementation, the proposed approach does not require any modification to the existing TCP implementation at the client/server hosts, does not require any reconfiguration of the server or client, and hence can be deployed readily in today’s 3G and 4G mobile networks, raising the throughput performance of all existing network applications running atop TCP. / Detailed summary in vernacular field only. / Liu, Ke. / Thesis (Ph.D.)--Chinese University of Hong Kong, 2013. / Includes bibliographical references (leaves 166-174). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Abstracts also in Chinese. / Abstract --- p.2 / Acknowledgement --- p.6 / Chapter 1 --- p.1 / Introduction --- p.1 / Chapter 1.1 --- Motivation --- p.1 / Chapter 1.2 --- Contributions --- p.3 / Chapter 1.3 --- Structure of the Thesis --- p.6 / Chapter 2 --- p.9 / Flow and Congestion Control --- p.9 / Chapter 2.1 --- TCP Performance Bottlenecks --- p.9 / Chapter 2.2 --- Background and related works --- p.16 / Chapter 2.3 --- Transparent Protocol Optimization --- p.20 / Chapter 2.3.1 --- Opportunistic Transmission --- p.20 / Chapter 2.3.2 --- Transmission Rate Control --- p.22 / Chapter 2.3.3 --- Lost Packet Recovery --- p.27 / Chapter 2.4 --- Modeling and Analysis --- p.28 / Chapter 2.4.1 --- Background and Assumptions --- p.28 / Chapter 2.4.2 --- Queue Length at the Radio Interface --- p.31 / Chapter 2.4.3 --- Queue Length Bounds --- p.38 / Chapter 2.4.4 --- Guaranteeing Full Bandwidth Utilization --- p.45 / Chapter 2.4.5 --- Link Buffer Size Requirement --- p.47 / Chapter 2.5 --- Performance Evaluation --- p.53 / Chapter 2.5.1 --- Parameter Tuning --- p.53 / Chapter 2.5.2 --- Bandwidth Efficiency --- p.56 / Chapter 3 --- p.62 / Packet Loss Recovery --- p.62 / Chapter 3.1 --- Introduction --- p.62 / Chapter 3.2 --- TCP Loss Recovery Revisited --- p.64 / Chapter 3.2.1 --- Standard TCP Loss Recovery Algorithm --- p.64 / Chapter 3.2.2 --- Loss Recovery Algorithm in Linux --- p.66 / Chapter 3.2.3 --- Loss Recovery Algorithm in A-TCP --- p.67 / Chapter 3.3 --- Efficiency of TCP Loss Recovery Algorithms --- p.68 / Chapter 3.3.1 --- Standard TCP Loss Recovery Algorithm --- p.70 / Chapter 3.3.2 --- TCP Loss Recovery in Linux --- p.72 / Chapter 3.3.3 --- Loss Recovery Algorithm Used in A-TCP --- p.72 / Chapter 3.3.4 --- Discussions --- p.73 / Chapter 3.4 --- Opportunistic Retransmission --- p.74 / Chapter 3.4.1 --- Applications and Performance Analysis --- p.76 / Chapter 3.4.2 --- Bandwidth Utilization During Loss Recovery --- p.78 / Chapter 3.5 --- Experimental Results --- p.81 / Chapter 3.5.1 --- Model Validation --- p.85 / Chapter 3.5.2 --- Impact of Loss Recovery Phase on TCP Throughput --- p.85 / Chapter 3.5.3 --- A-TCP with Opportunistic Retransmission --- p.86 / Chapter 3.6 --- Summary --- p.87 / Chapter 4 --- p.89 / Impact on Mobile Network Capacity --- p.89 / Chapter 4.1 --- Introduction --- p.89 / Chapter 4.2 --- Background and Related Work --- p.91 / Chapter 4.2.1 --- TCP Performance over Mobile Data Networks --- p.91 / Chapter 4.2.2 --- Modeling of Mobile Data Networks --- p.92 / Chapter 4.3 --- System Model --- p.94 / Chapter 4.3.1 --- Mobile Cell Bandwidth Allocation --- p.95 / Chapter 4.3.2 --- Markov Chain Model --- p.96 / Chapter 4.3.3 --- Performance Metric for Mobile Internet --- p.98 / Chapter 4.3.4 --- Protocol-limited Capacity Loss --- p.100 / Chapter 4.3.5 --- Channel-limited Capacity Loss --- p.101 / Chapter 4.4 --- Performance Evaluation --- p.102 / Chapter 4.4.1 --- Service Response Time --- p.103 / Chapter 4.4.2 --- Network Capacity Loss --- p.105 / Chapter 5 --- p.114 / Mobile Link Queue Length Estimation --- p.114 / Chapter 5.1 --- Introduction --- p.115 / Chapter 5.2 --- Sum-of-Delay (SoD) algorithm Revisited --- p.117 / Chapter 5.2.1 --- Queue Length and Link Buffer Size Estimation --- p.117 / Chapter 5.2.2 --- A Bound on Estimation Error --- p.120 / Chapter 5.2.3 --- Impact of Uplink Delay Variations --- p.122 / Chapter 5.3 --- Uplink Delay Variation Compensation --- p.127 / Chapter 5.3.1 --- Exploiting the TCP Timestamp Option --- p.127 / Chapter 5.3.2 --- TCP Timestamp Granularity --- p.130 / Chapter 5.4 --- Performance Evaluation --- p.131 / Chapter 5.4.1 --- Link buffer size estimation under uplink delay variations --- p.132 / Chapter 5.4.2 --- Queue length estimation under uplink delay variations --- p.136 / Chapter 5.5 --- Summary --- p.136 / Chapter 6 --- p.139 / Summary and Future Works --- p.139 / Chapter 6.1 --- Transparent Protocol Optimization --- p.139 / Chapter 6.2 --- Cross-Layer Modeling and Optimization of Mobile Networks --- p.141 / Chapter Appendix A. --- Derivation of Equations (2.24) and (2.25) --- p.143 / Chapter Appendix B. --- Proof of Theorem 2.1 --- p.145 / Chapter Appendix C. --- for Proof of Theorem 2.2 --- p.147 / Chapter Appendix D. --- for Proof of Theorem 2.3 --- p.150 / Chapter Appendix E. --- for Proof of Theorem 2.4 --- p.151 / Chapter Appendix F. --- for Proof of Theorem 2.5 --- p.152 / Chapter Appendix G. --- for Proof of Theorem 2.6 --- p.153 / Chapter Appendix H. --- for Proof of Theorem 2.7 --- p.156 / Chapter Appendix I. --- for Proof of Theorem 2.8 --- p.157 / Chapter Appendix J. --- for Proof of Theorem 3.2 --- p.161 / Chapter Appendix K. --- for Theorem 3.4 --- p.163 / Chapter Appendix H. --- for Theorem 3.5 --- p.164 / Bibliography --- p.166