Tesis sobre el tema "Computer networks Packet switching (Data transmission) TCP"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte los 50 mejores tesis para su investigación sobre el tema "Computer networks Packet switching (Data transmission) TCP".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Explore tesis sobre una amplia variedad de disciplinas y organice su bibliografía correctamente.
Chan, Ming Kit. "Active queue management schemes using a capture-recapture model /". View Abstract or Full-Text, 2002. http://library.ust.hk/cgi/db/thesis.pl?COMP%202002%20CHAN.
Texto completoIncludes bibliographical references (leaves 58-61). Also available in electronic version. Access restricted to campus users.
Low, Douglas Wai Kok. "Network processor memory hierarchy designs for IP packet classification /". Thesis, Connect to this title online; UW restricted, 2005. http://hdl.handle.net/1773/6973.
Texto completoMiller, Alan Henry David. "Best effort measurement based congestion control". Thesis, Connect to e-thesis, 2001. http://theses.gla.ac.uk/1015/.
Texto completoIncludes bibliographical references (p.i-xv). Print version also available. Mode of access : World Wide Web. System requirments : Adobe Acrobat reader reuired to view PDF document.
Talau, Marcos. "NGWA: esquema de controle de congestionamento para TCP baseado na banda disponível". Universidade Tecnológica Federal do Paraná, 2012. http://repositorio.utfpr.edu.br/jspui/handle/1/304.
Texto completoThe TCP congestion control mechanism in standard implementations presents several problems; he cannot distinguish if the packet was lost by link failure or by congestion in the net (if the fault was in the link there is no need to active congestion control mechanisms); and the right adjust of your transmission rate requires information from packet loss. This work presents the new generalized window advertising (NGWA), which is a new congestion control scheme for TCP. The NGWA provides information considering the available bandwidth of the network infrastructure to the endpoints of the TCP connection. Results obtained by the NGWA approach were compared with those from TCP New Reno, RED, and standard TCP (using the network simulator NS-3), considering network topologies widely cited in the literature. A NGWA Linux implementation is also presented. The new method proved to be superior when compared with the traditional approaches, presenting a more stable operation, better fairness and lower packet loss, considering the set of tests carried out.
Sazima, Ricardo. "PLEX MPLS : analise, projeto e implementação de uma plataforma para experimentos com MPLS com suporte a QoS". [s.n.], 2004. http://repositorio.unicamp.br/jspui/handle/REPOSIP/259128.
Texto completoDissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação
Made available in DSpace on 2018-08-04T17:32:51Z (GMT). No. of bitstreams: 1 Sazima_Ricardo_M.pdf: 1107563 bytes, checksum: a1179beaec699c0dcd87b45284e4a99c (MD5) Previous issue date: 2004
Resumo: Dados a banda de transmissão atualmente disponível, o protocolo (IP) utilizado para transmitir a maior parte de tráfego e a quantidade de tráfego e seus requisitos de aos, a Engenharia de Tráfego (TE, de Traffic Engineering) tomou-se um componente cada vez mais importante nas redes de comunicações. O padrão do IETF para enncaminhamento roteamento entitulado Multi-Protocol Label Switching (MPLS) preenche lacunas importantes neste cenário e é peça chave das metodologias de TE mais sofisticadas. Nesta dissertação é apresentado um modelo genérico de TE e uma proposta para uma Plataforma para Experimentos com MPLS (PLEX MPLS) que permite que o usuário defina, execute, e analise configurações de Engenharia de Tráfego com MPLS em uma rede IP. Os principais objetivos da PLEX MPLS são: . Estudo da tecnologia MPLS e suporte a outros trabalhos em andamento no contexto do grupo de estudos em MPLS do DCA . Experimentos com engenharia de tráfego com MPLS: validação das tecnologias e conceitos relacionados . Experimentos didáticos em disciplinas de laboratório de redes. Os principais conceitos de TE e MPLS são apresentados como referência, bem como uma descrição do NIST Switch, a plataforma MPLS escolhida para este trabalho. A análise, projeto e implementação da PLEX MPLS são apresentados, pois formam parte significativa do trabalho desenvolvido. A PLEX não só utiliza, como também estende as funcionalidades oferecidas pelo NIST Switch a fim de oferecer um esquema de TE mais completo e eficiente. Na fase de análise, vemos quais os principais requisitos para a implementação desta plataforma, seguindo uma metodologia de Engenharia de Software. Na fase de projeto, vemos as soluções propostas para os problemas identificados na fase de análise e temos uma especificação dos componentes a serem implementados. Na fase seguinte, discutimos a implementação das principais características dos componentes da PLEX, justificando as decisões tomadas. Para validar a implementação da PLEX de acordo com sua proposta, foram realizados alguns experimentos em uma rede de testes com tráfego real. A execução destes experimentos é descrita e seus resultados analisados. Os resultados obtidos assinalam claramente a importância e utilidade de esquemas de TE baseada em MPLS. Uma interessante metodologia para TE, compilada a partir de várias propostas, é apresentada. Finalmente, apontam-se caminhos a seguir em um trabalho futuro de refinamento da PLEX
Abstract: Given the bandwidth currently available, the protocol (IP) used to transmit most Internet traffic, the quantity of traffic produced and its QoS requirements, Traffic Engineering (TE) has become an increasingly important component of communications networks. IETF's standard for forwarding/routing, which is entitled Multi-Protocol Label Switching (MPLS), presents important solutions in this scenario playing a major role in more sophisticated TE methodologies. This work presents a generic methodology for TE and a proposal for a Platform for Experiments with MPLS (PLEX MPLS) which allows the user to define, execute and analyze Traffic Engineering configurations with MPLS in an IP network. The main goals of PLEX MPLS are: . Study of the M PLS technology and support of other ongoing works with M PLS in the DCA . Traffic Engineering experiments with MPLS: validation of the related concepts and technologies . Support of didactic experiments in academic disciplines. The main concepts of MPLS and TE are presented as reference, as well as a brief description of NIST Switch, the MPLS software chosen for the PLEX MPLS implementation. The analysis, project and implementation of PLEX MPLS are presented, since are significant part of the developed work. PLEX not only uses, but also extends NIST Switch functionalities to offer a more complete and efficient TE scheme. In the analysis phase the main requirements for the PLEX implementation are specified, following a well-known Software Engineering methodology. The solutions found for the problems identified in the analysis phase are presented in the project phase alongside with a specification of the components that will be implemented. In the next phase, the implementation of PLEX is discussed focusing on the most important characteristics of PLEX components and justifying the implementation ecisions. In order to validate PLEX implementation and its proposal, some experiments were made in a test network with reallive traffic. These experiments are described and its results analyzed. The results obtained clearly indicate the importance and utility of TE schemes based on MPLS. Also an interesting TE methodology compiled from several proposals is presented. Finally, possible improvements and future work on PLEX MPLS are indicated.
Mestrado
Engenharia de Computação
Mestre em Engenharia Elétrica
Wang, Xinyu. "Differentiated quality of service in packet-switching networks /". Thesis, Connect to this title online; UW restricted, 2001. http://hdl.handle.net/1773/6028.
Texto completoEvequoz, Claude. "On the choice of packet size in computer communication networks". Thesis, McGill University, 1986. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=66158.
Texto completoJahromi, Payam Torab. "Performance analysis of packet-switched networks with tree topology". Diss., Georgia Institute of Technology, 2000. http://hdl.handle.net/1853/15692.
Texto completo劉少華 y Siu-wah Lau. "A novel approach to deadlock prevention in store-and-forward networks". Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1991. http://hub.hku.hk/bib/B31209798.
Texto completoLau, Siu-wah. "A novel approach to deadlock prevention in store-and-forward networks /". [Hong Kong : University of Hong Kong], 1991. http://sunzi.lib.hku.hk/hkuto/record.jsp?B13005625.
Texto completoLou, Jianyu Shen Xiaojun. "Frame-based packet scheduling algorithms for input queued switches". Diss., UMK access, 2006.
Buscar texto completo"A dissertation in computer networking and telecommunications networking." Advisor: Xiaojun Shen. Typescript. Vita. Title from "catalog record" of the print edition Description based on contents viewed Nov. 1, 2007. Includes bibliographical references (leaves 121-127). Online version of the print edition.
Glazer, D. W. (David W. ). "On routing and congestion control in computer communications networks". Thesis, McGill University, 1986. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=66146.
Texto completoLu, Jie. "Performance evaluation of packet video transfer over local area networks". Thesis, This resource online, 1993. http://scholar.lib.vt.edu/theses/available/etd-06162009-063207/.
Texto completoZhang, Ying Ping. "A study of architecture and performance of IBM Cyclops64 interconnection network". Access to citation, abstract and download form provided by ProQuest Information and Learning Company; downloadable PDF file 0.37Mb, 66 p, 2005. http://wwwlib.umi.com/dissertations/fullcit/1428258.
Texto completoMartellaro, John Anthony. "Using the cell processor as an offload streaming assist for sessionization of network traffic for the application of cross packet inspection /". Online version of thesis, 2008. http://hdl.handle.net/1850/7772.
Texto completoMacDonald, Robert J. (Robert James) Carleton University Dissertation Information and Systems Science. ""Performance analysis of two hop" "CSMA_CD/TDMA networks". Ottawa, 1989.
Buscar texto completoLiu, Jing. "Stable and scalable arbitration algorithms for crossbar-based switches/routers /". View Abstract or Full-Text, 2003. http://library.ust.hk/cgi/db/thesis.pl?COMP%202003%20LIUJ.
Texto completoIncludes bibliographical references (leaves 92-96). Also available in electronic version. Access restricted to campus users.
Habib, Christian. "All-optical label swapping strategies for spectral amplitude code labels in packet-switched optical networks". Thesis, McGill University, 2009. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=116005.
Texto completoIn this thesis, three different tabletop topologies for low-cost all-optical swapping of spectral amplitude code labels for packet-switched networks are examined in a proof-of-concept phase. The first uses cross-absorption modulation in an electro-absorption modulator within a semiconductor fiber ring laser (SFRL), the second uses cross-gain modulation (XGM) in a semiconductor optical amplifier (SOA) within an SFRL, and the third makes use of XGM in a SOA as well as injection locking in a Fabry-Perot laser diode for wavelength conversion. The benefits and limitations of each approach as well as future improvements are discussed. Building on these results, a high-performance integrated version of XGM swapper is designed, simulated, and masks are produced for fabrication using indium phosphide technology.
Krishnan, Anupama. "The Multipath Fault-Tolerant Protocol for Routing in Packet-Switched Communication Network". Thesis, University of North Texas, 2003. https://digital.library.unt.edu/ark:/67531/metadc4199/.
Texto completoLent, Marino Ricardo. "On the design and performance of cognitive packets over wired networks and mobile ad hoc networks". Doctoral diss., University of Central Florida, 2003. http://digital.library.ucf.edu/cdm/ref/collection/RTD/id/3553.
Texto completoThis dissertation studied cognitive packet networks (CPN) which build networked learning systems that support adaptive, quality of service-driven routing of packets in wired networks and in wireless, mobile ad hoc networks.
Ph.D.
School of Electrical Engineering and Computer Science
Engineering and Computer Science
Electrical Engineering and Computer Science
160 p.
xvii, 160 leaves, bound : ill. ; 28 cm.
Suryadevara, Usha. "Buffer management in tone allocated multiple access protocol". [Gainesville, Fla.] : University of Florida, 2001. http://purl.fcla.edu/fcla/etd/UFE0000357.
Texto completoTitle from title page of source document. Document formatted into pages; contains vi, 78 p.; also contains graphics. Includes vita. Includes bibliographical references.
Pathirana, Dhammika. "RODMRP : resilient on demand multicast routing protocol /". Online version of thesis, 2007. http://hdl.handle.net/1850/5288.
Texto completoLee, Choong-Soo. "WHITE : achieving fair bandwidth allocation with priority dropping based on round trip times". Link to electronic thesis, 2002. http://www.wpi.edu/Pubs/ETD/Available/etd-0430102-193829.
Texto completoShang, Hao. "Exploiting flow relationships to improve the performance of distributed applications". Link to electronic thesis, 2006. http://www.wpi.edu/Pubs/ETD/Available/etd-040606-025621/.
Texto completoStoica, Ion. "Stateless core : a scalable approach for quality of service in the Internet ; winning thesis of the 2001 ACM doctoral dissertation competition /". Berlin [u.a.] : Springer, 2004. http://www.loc.gov/catdir/enhancements/fy0818/2004104504-d.html.
Texto completoChoi, Myung Cheon. "Traffic flow management for RSVP/ATM edge devices". Diss., Georgia Institute of Technology, 1999. http://hdl.handle.net/1853/15520.
Texto completoThie, Johnson Electrical Engineering & Telecommunications Faculty of Engineering UNSW. "Optimal erasure protection assignment for scalably compressed data over packet-based networks". Awarded by:University of New South Wales. Electrical Engineering and Telecommunications, 2004. http://handle.unsw.edu.au/1959.4/19373.
Texto completoHawkins, William Cory. "Evaluation of the data vortex photonic all-optical path interconnection network for next-generation supercomputers". Available online, Georgia Institute of Technology, 2006, 2006. http://etd.gatech.edu/theses/available/etd-12182006-155304/.
Texto completoDr. Henry L. Owen III, Committee Member ; Dr. David Keezer, Committee Member ; Dr. D. Scott Wills, Committee Chair.
Yan, Zhaohui. "Performance Analysis of A Banyan Based ATM Switching Fabric with Packet Priority". PDXScholar, 1995. https://pdxscholar.library.pdx.edu/open_access_etds/5199.
Texto completoShell, Michael David. "Cascaded All-Optical Shared-Memory Architecture Packet Switches Using Channel Grouping Under Bursty Traffic". Diss., Georgia Institute of Technology, 2004. http://hdl.handle.net/1853/4892.
Texto completoDe, Vega Rodrigo Miguel. "Modeling future all-optical networks without buffering capabilities". Doctoral thesis, Universite Libre de Bruxelles, 2008. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/210455.
Texto completoIn the first part we introduce the basic functionality and structure of OBS and OPS networks. We identify the blocking probability as the main performance parameter of interest.
In the second part we study the statistical properties of the traffic that will likely run through these networks. We use for this purpose a set of traffic traces obtained from the Universidad Politécnica de Catalunya. Our conclusion is that traffic entering the optical domain in future OBS/OPS networks will be long-range dependent (LRD).
In the third part we present the model for bufferless OBS/OPS networks. This model takes into account the results from the second part of the thesis concerning the LRD nature of traffic. It also takes into account specific issues concerning the functionality of a typical bufferless packet-switching network. The resulting model presents scalability problems, so we propose an approximative method to compute the blocking probability from it. We empirically evaluate the accuracy of this method, as well as its scalability.
Doctorat en Sciences de l'ingénieur
info:eu-repo/semantics/nonPublished
Garige, Naga Siddhardha. "A Distributed Routing Algorithm for ER-LSP Setup in MLPS Networks". [Tampa, Fla. : s.n.], 2003. http://purl.fcla.edu/fcla/etd/SFE0000086.
Texto completoLutshete, Sizwe. "An analysis of the correlation beween packet loss and network delay on the perfomance of congested networks and their impact: case study University of Fort Hare". Thesis, University of Fort Hare, 2013. http://hdl.handle.net/10353/d1006843.
Texto completoEddy, Wesley M. "Improving Transport Control Protocol Performance With Path Error Rate Information". Ohio University / OhioLINK, 2004. http://www.ohiolink.edu/etd/view.cgi?ohiou1087844627.
Texto completoBarreto, Fernando. "Esquema de caminhos emergenciais rápidos para amenizar perdas de pacotes". Universidade Tecnológica Federal do Paraná, 2008. http://repositorio.utfpr.edu.br/jspui/handle/1/127.
Texto completoIP network backbones use link state routing protocols to find correct routes. In face of a topology change, e.g. a failure, these protocols need some time to react to it in order to find new routes. During this time, the routes become unstable, causing high packet loss rate and depreciation of backbone reliability. This work presents a proactive approach named Fast Emergency Paths Schema to help the OSPF routing protocol during the convergence period in order to reduce packet loss rate. The approach conducts calculations reusing the routing information base of the OSPF in order to generate these emergency paths, which are represented in the forwarding table as marks. These are then used to guide the packets to correctly bypass a failure. The approach is evaluated by using various artificial and real topologies, and a simulation is also implemented in order to analyze the packet loss rate reduction in relation to the original OSPF. The analysis yielded satisfactory results in terms of the extension of the recovery paths used and of the amount of extra information added to the forwarding table in relation to the concurrent approach.
Nascimento, Marcelo Ribeiro. "Proposta e validação de nova arquitetura de roteamento IP com separação de planos". [s.n.], 2012. http://repositorio.unicamp.br/jspui/handle/REPOSIP/259642.
Texto completoDissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Elétrica e de Computação
Made available in DSpace on 2018-08-21T12:26:00Z (GMT). No. of bitstreams: 1 Nascimento_MarceloRibeiro_M.pdf: 7752631 bytes, checksum: a40f02ea9677aa4dd611e87beec05ab4 (MD5) Previous issue date: 2012
Resumo: Os roteadores atuais implementam uma arquitetura verticalmente integrada composta de uma camada de software e um hardware proprietários. Este modelo resulta em soluções de alto custo e inviabiliza a experimentação de novas idéias. Em contrapartida, existem alternativas de alta flexibilidade baseadas em software e, consequentemente, de baixo custo. Entretanto, essas soluções apresentam baixo desempenho. Motivado pela disponibilidade de uma API aberta para programação do plano de encaminhamento (ex. OpenFlow), esta dissertação apresenta uma proposta de arquitetura de roteamento IP com separação de planos. Trata-se de uma abordagem que procura combinar o alto desempenho de hardwares de prateleira (commodities) com a flexibilidade de uma pilha de roteamento executada remotamente em computadores de uso geral. O grande desafio é garantir confiabilidade, escalabilidade e desempenho à rede, a partir de um controle remoto e centralizado sobre uma arquitetura que permita maior flexibilidade no mapeamento entre os elementos de controle e encaminhamento. O resultado corresponde a uma nova proposta de roteamento IP com perspectivas promissoras do ponto de vista do custo e da flexibilidade. Com o objetivo de avaliar a arquitetura proposta foi desenvolvido um protótipo com base em uma versão simplificada do modelo. Os resultados da avaliação apresentados nesta dissertação comprovam a viabilidade da arquitetura
Abstract: Today's networking gear follows the model of computer mainframes, where closed source software runs on proprietary hardware. This approach results in expensive solutions and prevents equipment owners to put new ideas into practice. In contrast, recent alternatives of highly flexible softwarebased routers promise low cost and programmability at the expense of low performance. Motivated by the availability of an open API to control packet forwarding engines (i.e., OpenFlow), we propose a commodity IP routing architecture that combines the line-rate performance of commercial hardware with the flexibility of open source routing stacks (remotely) running on general-purpose computers. The challenge is to ensure reliability, scalability and performance to a network running a remote and centralized control plane architecture that allows a flexible mapping between the control and forwarding elements. The outcome is a novel point in the design space of cost-effective IP routing solutions with far-reaching implications. The initial experimental evaluation of our prototype implementation validates the feasibility of the design
Mestrado
Engenharia de Computação
Mestre em Engenharia Elétrica
Tenório, Marcos Mincov. "Metodologias para roteamento ótimo em redes de telecomunicações". Universidade Tecnológica Federal do Paraná, 2011. http://repositorio.utfpr.edu.br/jspui/handle/1/395.
Texto completoO gerenciamento do tráfego na Internet tornou-se essencial devido à grande utilização de serviços em rede nos últimos anos. Assim, para executar alguns serviços que demandam um certo grau de qualidade é necessário otimizar o uso de recursos existentes. Organizações mantenedoras de backbones são responsáveis por rotear o tráfego, utilizando protocolos que encaminham dados da origem ao destino. Um dos protocolos de roteamento mais utilizados mundialmente é o Open Shortest Path First (OSPF). A qualidade das rotas oferecidas pelo protocolo OSPF depende dos pesos atribuídos pelo operador de rede às ligações (enlaces). A determinação destes pesos depende dos critérios técnicos ou econômicos considerados necessários por parte da empresa provedora de serviços telemáticos. Nesta dissertação aborda-se o problema de rotear a demanda de tráfego na rede com o objetivo de oferecer uma qualidade de serviço satisfatória por meio de uma atribuição inteligente de pesos aos enlaces. O problema de atribuição de pesos (WSP), consiste em encontrar um conjunto de pesos OSPF que otimiza o desempenho da rede. Para solução deste problema, a literatura científica apresenta algoritmos que, na sua maioria, buscam equilibrar o tráfego na rede pelo ajuste correto da carga de cada enlace. Essa dissertação visa solucionar o WSP propondo uma nova abordagem que leva em consideração a perda de pacotes em caminhos origem-destino e a sobrecarga gerada em cada enlace. Também uma formulação estendida é proposta, permitindo a obtenção de um conjunto de pesos operacionais em ambientes normais e em ambientes onde ocorrem falhas de nós. A aplicação de duas heurísticas conhecidas, Simulated Annealing e Harmony Search, a este problema permite encontrar soluções satisfatórias para os critérios de desempenho especificados.
Internet traffic management becomes essential due the large use of the Internet the past decades. Balancing the use of existing IP resources improves the performance of services. Backbone manteiners are responsible for routing data that are sent along the network links from a source to a destination host. A routing protocol is used to perform this task. One of the most commonly used internal routing protocol is OSPF (Open Shortest Path First). The quality of the routes offered by the OSPF protocol mainly depends on weights that are assigned by the network operator to the links. The determination of these weights depends on technical or economic criteria deemed necessary by the ISPs. This master dissertation addresses the routing problem aiming at providing network quality of service by optimizing the weights assigned to links. The weight setting problem (WSP) corresponds to find a set of OSPF weights that optimize network performance. To solve this problem, the literature shows algorithms that mostly seek to balance the network traffic by correctly setting link loads. This work aims at solving WSP proposing a new approach that takes into account packet losses over origin-destination paths and link overhead. Also an extended formulation is proposed, to obtain a set of operating weights in normal environments and in environments where node failures can occur. The application of two well known heuristics, Simulated Annealing and Harmony Search, to this problem allows to find satisfactory solutions to the performance criteria specified.
"Deadline-ordered burst-based parallel scheduling strategy for IP-over-ATM with QoS support". 2001. http://library.cuhk.edu.hk/record=b5890857.
Texto completoThesis (M.Phil.)--Chinese University of Hong Kong, 2001.
Includes bibliographical references (leaves 66-68).
Abstracts in English and Chinese.
Chapter 1 --- Introduction --- p.1
Chapter 1.1 --- Thesis Overview --- p.3
Chapter 2 --- Background and Related work --- p.4
Chapter 2.1 --- Emergence of IP-over-ATM --- p.4
Chapter 2.2 --- ATM architecture --- p.5
Chapter 2.3 --- Scheduling issues in output-queued switch --- p.6
Chapter 2.4 --- Scheduling issues in input-queued switch --- p.18
Chapter 3 --- The Deadline-ordered Burst-based Parallel Scheduling Strategy --- p.23
Chapter 3.1 --- Introduction --- p.23
Chapter 3.2 --- Switch and queueing model --- p.24
Chapter 3.2.1 --- Switch model --- p.24
Chapter 3.2.2 --- Queueing model --- p.25
Chapter 3.3 --- The DBPS Strategy --- p.26
Chapter 3.3.1 --- Motivation --- p.26
Chapter 3.3.2 --- Strategy --- p.31
Chapter 3.4 --- The Deadline-ordered Burst-based Parallel Iterative Matching --- p.33
Chapter 3.4.1 --- Algorithm --- p.34
Chapter 3.4.2 --- An example of DBPIM --- p.35
Chapter 3.5 --- Simulation results --- p.33
Chapter 3.6 --- Discussions --- p.46
Chapter 3.7 --- Future work --- p.47
Chapter 4 --- The Quasi-static DBPIM Algorithm --- p.50
Chapter 4.1 --- Introduction --- p.50
Chapter 4.2 --- Quasi-static path scheduling principle --- p.51
Chapter 4.3 --- Quasi-static DBPIM algorithm --- p.56
Chapter 4.4 --- An example of Quasi-static DBPIM --- p.59
Chapter 5 --- Conclusion --- p.63
Bibliography --- p.65
"Concentrators in large-scale packet switching". 2001. http://library.cuhk.edu.hk/record=b6073341.
Texto completoThesis (Ph.D.)--Chinese University of Hong Kong, 2001.
Includes bibliographical references (p. 139-145).
Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web.
Mode of access: World Wide Web.
Abstracts in English and Chinese.
"Packet scheduling in wireless networks". 2004. http://library.cuhk.edu.hk/record=b6073672.
Texto completo"August 2004."
Thesis (Ph.D.)--Chinese University of Hong Kong, 2004.
Includes bibliographical references.
Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web.
Mode of access: World Wide Web.
Abstracts in English and Chinese.
"Routing and switching in teleconferencing networks". Chinese University of Hong Kong, 1992. http://library.cuhk.edu.hk/record=b5886969.
Texto completoThesis (Ph.D.)--Chinese University of Hong Kong, 1992.
Includes bibliographical references (leaves 150-157).
Acknowledgments
Abstract
Chapter Chapter 1 --- Introduction --- p.1
Chapter 1.1 --- Background --- p.1
Chapter 1.2 --- Broadband Video Services --- p.1
Chapter 1.3 --- Videoconference Services --- p.7
Chapter 1.4 --- Videoconference Systems --- p.8
Chapter 1.5 --- Chapter Summary and Thesis Organization --- p.18
Chapter Chapter 2 --- Efficient Algorithms for Multiple Destinations Routing --- p.20
Chapter 2.1 --- Background --- p.20
Chapter 2.2 --- Integer Programming Formulation of the MDR Problem --- p.26
Chapter 2.3 --- Heuristics for Multiple Destinations Routing --- p.27
Chapter 2.4 --- Performance Comparisons --- p.40
Chapter 2.5 --- Chapter Summary --- p.50
Chapter Chapter 3 --- Connection Optimization for Two Types of Videoconferences --- p.51
Chapter 3.1 --- Background --- p.51
Chapter 3.2 --- The Videoconference Services --- p.52
Chapter 3.3 --- Connection Optimization --- p.54
Chapter 3.4 --- Performance Analysis --- p.62
Chapter 3.5 --- Chapter Summary --- p.80
Chapter Chapter 4 --- A TDM-based Multibus Packet Switch --- p.81
Chapter 4.1 --- Background --- p.81
Chapter 4.2 --- Architecture of the Multibus Switch --- p.89
Chapter 4.3 --- Operation of the Multibus Switch --- p.93
Chapter 4.4 --- Performance Analysis --- p.95
Chapter 4.5 --- Numerical Results --- p.106
Chapter 4.6 --- Discussions --- p.109
Chapter 4.7 --- Chapter Summary --- p.113
Chapter Chapter 5 --- A Modular Shared Media Video Switch --- p.114
Chapter 5.1 --- System Architecture and Operation --- p.114
Chapter 5.2 --- Slot Assignment for Point-to-Point Transmissions --- p.129
Chapter 5.3 --- Slot Assignment for Point-to-Multipoint Transmissions --- p.132
Chapter 5.4 --- Network Design Example --- p.136
Chapter 5.5 --- Chapter Summary --- p.143
Appendix --- p.144
Chapter Chapter 6 --- Conclusions --- p.147
References --- p.150
Thie, Johnson. "Optimal erasure protection assignment for scalably compressed data over packet-based networks /". 2003. http://www.library.unsw.edu.au/~thesis/adt-NUN/public/adt-NUN20040709.175522/index.html.
Texto completoParsha, Karthik P. Duan Zhenhai. "BCQ bin-based core stateless packet scheduler for scalable and flexible support of guaranteed services /". Diss., 2005. http://etd.lib.fsu.edu/theses/available/etd-09262005-132446.
Texto completoAdvisor: Zhenhai Duan, Florida State University, College of Arts and Sciences, Dept. of Computer Science. Title and description from dissertation home page (viewed Jan. 26, 2006). Document formatted into pages; contains x, 50 pages. Includes bibliographical references.
"On the complexity of concentrators and multi-stage interconnection networks in switching systems". 2000. http://library.cuhk.edu.hk/record=b6073258.
Texto completo"May 2000."
Thesis (Ph.D.)--Chinese University of Hong Kong, 2000.
Includes bibliographical references (p. 135-144).
Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web.
Mode of access: World Wide Web.
Lei, Zhuyu. "Utility-based power control for packet-switched wireless networks". 2009. http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000051040.
Texto completo"A load-sensitive multicast routing protocol". 2004. http://library.cuhk.edu.hk/record=b5891879.
Texto completoThesis (M.Phil.)--Chinese University of Hong Kong, 2004.
Includes bibliographical references (leaves 109-111).
Abstracts in English and Chinese.
Abstract --- p.ii
Acknowledgement --- p.iv
Table of Contents --- p.v
List of Figure --- p.vii
Chapter Chapter 1. --- Introduction --- p.9
Chapter 1.1 --- Introduction --- p.9
Chapter 1.2 --- Background --- p.11
Chapter 1.3 --- Ant Colony Optimization (ACO) --- p.15
Chapter 1.4 --- Main contribution --- p.16
Chapter 1.5 --- Thesis organization --- p.18
Chapter Chapter 2. --- Related Work --- p.19
Chapter 2.1 --- Multicast routing in general --- p.19
Chapter 2.2 --- Multicast routing techniques --- p.22
Chapter 2.3 --- Best-effort multicast routing --- p.25
Chapter 2.4 --- Quality-of-Service (QoS) multicast routing --- p.30
Chapter 2.5 --- Adaptive multicast routing --- p.34
Chapter Chapter 3. --- Load-Sensitive Multicast Routing Protocol (LSMRP) --- p.37
Chapter 3.1 --- Overview --- p.37
Chapter 3.2 --- Problem Formulation --- p.37
Chapter 3.3 --- Types of ant in LSMRP --- p.39
Chapter 3.3.1 --- Forward Ants --- p.39
Chapter 3.3.2 --- Random Ants --- p.41
Chapter 3.3.3 --- Backward Ants --- p.42
Chapter 3.3.4 --- Multicast Ants --- p.44
Chapter 3.3.5 --- Multicast Backward Ants --- p.44
Chapter 3.4 --- Global Algorithm --- p.47
Chapter 3.4.1 --- Pheromone trails stage --- p.50
Chapter 3.4.2 --- Multicast tree stage --- p.53
Chapter 3.4.3 --- Routing table --- p.56
Chapter 3.4.4 --- Messages Exchange and Mechanisms --- p.57
Chapter 3.4.5 --- mapping --- p.58
Chapter 3.4.6 --- Members join --- p.59
Chapter 3.4.7 --- Members update --- p.59
Chapter 3.4.8 --- Members leave --- p.61
Chapter Chapter 4. --- Analysis of LSMRP --- p.63
Chapter 4.1 --- Analysis of pheromone trail values --- p.63
Chapter Chapter 5. --- Evaluation and Experimental Results --- p.80
Chapter 5.1 --- System model --- p.80
Chapter 5.2 --- Result --- p.84
Chapter 5.2.1 --- Packets received --- p.84
Chapter 5.2.2 --- Throughput --- p.86
Chapter 5.2.3 --- Packet Loss --- p.98
Chapter Chapter 6. --- Conclusion --- p.107
Chapter 6.1 --- Future work/ open question --- p.107
References --- p.109
"Performance analysis and protocol design for multipacket reception in wireless networks". 2007. http://library.cuhk.edu.hk/record=b5893131.
Texto completoThesis (M.Phil.)--Chinese University of Hong Kong, 2007.
Includes bibliographical references (leaves 53-57).
Abstracts in English and Chinese.
Abstract --- p.i
Acknowledgments --- p.v
Table of Contents --- p.vi
List of Figures --- p.viii
List of Tables --- p.ix
Chapter Chapter 1 --- Introduction --- p.1
Chapter 1.1 --- Motivation --- p.1
Chapter 1.2 --- Related Work --- p.2
Chapter 1.3 --- Our Contribution --- p.3
Chapter 1.4 --- Organization of the Thesis --- p.4
Chapter Chapter 2 --- Background Overview --- p.6
Chapter 2.1.1 --- Traditional Wireless Networks --- p.6
Chapter 2.2 --- Exponential Backoff --- p.7
Chapter 2.2.1 --- Introduction --- p.7
Chapter 2.2.2 --- Algorithm --- p.8
Chapter 2.2.3 --- Assumptions --- p.9
Chapter 2.3 --- System Description --- p.9
Chapter 2.3.1 --- MPR Capability --- p.9
Chapter 2.3.2 --- Backoff Slot --- p.10
Chapter 2.3.3 --- Carrier-sensing and Non-carrier-sensing Systems --- p.11
Chapter Chapter 3 --- Multipacket Reception in WLAN --- p.12
Chapter 3.1 --- MAC Protocol Description --- p.13
Chapter 3.2 --- Physical Layer Methodology --- p.16
Chapter 3.2.1 --- Blind RTS Separation --- p.17
Chapter 3.2.2 --- Data Packet Detection --- p.19
Chapter Chapter 4 --- Exponential Backoff with MPR --- p.21
Chapter 4.1 --- Analytical Model --- p.22
Chapter 4.1.1 --- Markov Model --- p.22
Chapter 4.1.2 --- Relations betweenpt andpc --- p.23
Chapter 4.2 --- Simulation Settings --- p.26
Chapter 4.3 --- Asymptotic Behavior of Exponential Backoff --- p.27
Chapter 4.3.1 --- Convergence ofpt andpc --- p.27
Chapter 4.3.2 --- Convergence of Npt --- p.29
Chapter Chapter 5 --- Non-carrier-sensing System --- p.31
Chapter 5.1 --- Performance Analysis --- p.31
Chapter 5.1.1 --- Throughput Derivation --- p.31
Chapter 5.1.2 --- Throughput Analysis --- p.32
Chapter 5.1.3 --- Convergence of S --- p.36
Chapter 5.2 --- Infinite Population Model --- p.38
Chapter 5.2.1 --- Attempt Rate --- p.38
Chapter 5.2.2 --- Asymptotic Throughput of Non-carrier-sensing System --- p.39
Chapter Chapter 6 --- Carrier-sensing System --- p.43
Chapter 6.1 --- Throughput Derivation --- p.43
Chapter 6.2 --- Asymptotic Behavior --- p.44
Chapter Chapter 7 --- General MPR Model --- p.48
Chapter Chapter 8 --- Conclusions --- p.51
Bibliography --- p.53
Prakash, Amit. "Architectures and algorithms for high performance switching". Thesis, 2004. http://hdl.handle.net/2152/1295.
Texto completoPrakash, Amit Aziz Adnan. "Architectures and algorithms for high performance switching". 2004. http://wwwlib.umi.com/cr/utexas/fullcit?p3143451.
Texto completo"Photonic signal processing devices and subsystems for all-optical networks". 2004. http://library.cuhk.edu.hk/record=b6073661.
Texto completo"July 2004."
Thesis (Ph.D.)--Chinese University of Hong Kong, 2004.
Includes bibliographical references.
Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web.
Mode of access: World Wide Web.
Abstracts in English and Chinese.