To see the other types of publications on this topic, follow the link: Packet switching (Data transmission) Telecommunication Algorithms.
Dissertations / Theses on the topic 'Packet switching (Data transmission) Telecommunication Algorithms'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 46 dissertations / theses for your research on the topic 'Packet switching (Data transmission) Telecommunication Algorithms.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
Pun, Kong Hong. "Static round-robin scheduling algorithms for scalable switches /." View Abstract or Full-Text, 2002. http://library.ust.hk/cgi/db/thesis.pl?COMP%202002%20PUN.
Full textAbstract:
Thesis (M. Phil.)--Hong Kong University of Science and Technology, 2002.Includes bibliographical references (leaves 47-48). Also available in electronic version. Access restricted to campus users.
2
Wu, Bin. "Algorithm design in optical networking." Click to view the E-thesis via HKUTO, 2007. http://sunzi.lib.hku.hk/hkuto/record/B39329161.
Full text
3
Wu, Bin, and 吳斌. "Algorithm design in optical networking." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2007. http://hub.hku.hk/bib/B39329161.
Full text
4
Diao, Zhifeng. "Adaptive packet scheduling in OFDM systems." Click to view the E-thesis via HKUTO, 2005. http://sunzi.lib.hku.hk/hkuto/record/B32059541.
Full text
5
Diao, Zhifeng, and 刁志峰. "Adaptive packet scheduling in OFDM systems." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2005. http://hub.hku.hk/bib/B32059541.
Full text
6
Zhao, Yi. "Studies on error control of 3-D zerotree wavelet video streaming." Connect to resource, 2005. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1124811298.
Full textAbstract:
Thesis (Ph. D.)--Ohio State University, 2005.Title from first page of PDF file. Document formatted into pages; contains xix, 136 p.; also includes graphics (some col.). Includes bibliographical references (p. 129-136). Available online via OhioLINK's ETD Center
7
Hu, Bing, and 胡冰. "Feedback-based two stage switch architecture for high speed router design." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2009. http://hub.hku.hk/bib/B43278693.
Full text
8
Hu, Bing. "Feedback-based two stage switch architecture for high speed router design." Click to view the E-thesis via HKUTO, 2009. http://sunzi.lib.hku.hk/hkuto/record/B43278693.
Full text
9
Li, Xin. "Scheduling optical packet switches with reconfiguration delay /." View abstract or full-text, 2005. http://library.ust.hk/cgi/db/thesis.pl?COMP%202005%20LI.
Full text
10
Lou, Jianyu Shen Xiaojun. "Frame-based packet scheduling algorithms for input queued switches." Diss., UMK access, 2006.
Find full textAbstract:
Thesis (Ph. D.)--School of Computing and Engineering. University of Missouri--Kansas City, 2006."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.
11
Tsoi, Yiu-lun Kelvin, and 蔡耀倫. "Real-time scheduling techniques with QoS support and their applications in packet video transmission." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1999. http://hub.hku.hk/bib/B31221786.
Full text
12
Wanichworanant, Noppadol. "A traffic engineering approach employing genetic algorithms over MPLS networks." online access from Digital Dissertation Consortium access full-text, 2003. http://libweb.cityu.edu.hk/cgi-bin/er/db/ddcdiss.pl?3134009.
Full text
13
Mhamdi, Lotfi. "High-performance scheduling algorithms for buffered crossbar switches /." View Abstract or Full-Text, 2002. http://library.ust.hk/cgi/db/thesis.pl?COMP%202002%20MHAMDI.
Full textAbstract:
Thesis (M. Phil.)--Hong Kong University of Science and Technology, 2002.Includes bibliographical references (leaves 116-123). Also available in electronic version. Access restricted to campus users.
14
Liu, 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.
Full textAbstract:
Thesis (M. Phil.)--Hong Kong University of Science and Technology, 2003.Includes bibliographical references (leaves 92-96). Also available in electronic version. Access restricted to campus users.
15
Akay, Mehmet Fatih Katsinis Constantine. "Contention resolution and memory load balancing algorithms on distributed shared memory multiprocessors /." Philadelphia, Pa. : Drexel University, 2005. http://dspace.library.drexel.edu/handle/1860/510.
Full text
16
Bali, Halima. "Performance analysis of star architecture packet-switched VSAT network using roll-call polling multiple access scheme." Thesis, Virginia Polytechnic Institute and State University, 1988. http://hdl.handle.net/10919/80105.
Full textAbstract:
Data link control, multiple access, and flow control for data communication have at last advanced to the state that it is possible for applications that require combining these techniques to be carried out. Therefore, research efforts are now beginning to focus on the performance of these applications, rather than the previous trend of carrying out the performance of each scheme separately.
This study analyses the performance of a Very Small Aperture Terminal (VSAT) satellite star network. The network uses roll-call polling as its multiple access scheme, High-level Data Link Control or HDLC, and go-back-N Automatic Repeat Request, for error control. The network is a VSAT packet-switched network, that carries out its communications task on a Time Division Multiplexing (TDM) satellite channel. This research consists of three major parts. First, the performance analysis of the single-hop star architecture network is carried out. This includes the study of a polling communication system for the inbound, VSAT-to-Hub line. The time delay of a packet using the inbound line is evaluated. Secondly, the performance analysis of the TDM outbound Hub-to-VSAT line is represented. The throughput of the multiplexed system for the outbound Hub-to-VSAT line, as well as the average time delay of a packet are determined. Thirdly, both the analysis of the inbound, and outbound lines are combined to provide the performance of the double-hop architecture of the network. The time delay of a VSAT-to-VSAT packet is found.Master of Science
17
Abu-Saymeh, Dirar. "CERL-switch : an ATM voice switch /." free to MU campus, to others for purchase, 1998. http://wwwlib.umi.com/cr/mo/fullcit?p9904832.
Full text
18
Tan, Xu. "Protocols for wide band satellite systems with a large number of small voice and data users." Thesis, University of British Columbia, 1987. http://hdl.handle.net/2429/26745.
Full textAbstract:
Multiaccess protocols for integrated voice and data transmissions over satellite channels are studied, based on the SENET(slotted envelope network) structure. The satellite system is characterized as a wide band system with a large number of geographically distributed small voice and data users. Performance evaluations of commonly used protocols, i.e., ALOHA and reservation protocols, are first conducted, both analytically and by simulations. The effect of different voice backgrounds on data access protocols are shown explicitly.
Based on these results, a control algorithm is proposed. Analyses and simulations
show that ALOHA protocol incorporated with such a control mechanism is globally stable under the integrated environment; moreover, the performance deterioration due to voice backgrounds is dramatically reduced. The actual implementation
aspects of the control algorithm are considered.
An extension of the above results leads to a combined random/reservation protocol. Simulation and analysis results show that the combined protocol exhibits
desired low delay and high throughput performance characteristics, with satisfactory voice blocking probability, under the worst user population assumption,
i.e., all the voice sources and data sources are independent of each other — reflecting the nature of small earth station environment. The absence of the need for mini-slot structure lends ease and simplicity to the implementation of the combined protocol.Applied Science, Faculty of
Electrical and Computer Engineering, Department of
Graduate
19
Choi, Myung Cheon. "Traffic flow management for RSVP/ATM edge devices." Diss., Georgia Institute of Technology, 1999. http://hdl.handle.net/1853/15520.
Full text
20
Wang, Rui. "Gossiping in meshes in all-port mode and with short packets." Click to view the E-thesis via HKUTO, 2006. http://sunzi.lib.hku.hk/hkuto/record/B37046494.
Full text
21
Wang, Rui, and 王銳. "Gossiping in meshes in all-port mode and with short packets." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2006. http://hub.hku.hk/bib/B37046494.
Full text
22
Hawkins, 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/.
Full textAbstract:
Thesis (Ph. D.)--Electrical and Computer Engineering, Georgia Institute of Technology, 2007.Dr. Henry L. Owen III, Committee Member ; Dr. David Keezer, Committee Member ; Dr. D. Scott Wills, Committee Chair.
23
Yeo, Yong-Kee. "Dynamically Reconfigurable Optical Buffer and Multicast-Enabled Switch Fabric for Optical Packet Switching." Diss., Georgia Institute of Technology, 2006. http://hdl.handle.net/1853/14615.
Full textAbstract:
Optical packet switching (OPS) is one of the more promising solutions for meeting the diverse needs of broadband networking applications of the future. By virtue of its small data traffic granularity as well as its nanoseconds switching speed, OPS can be used to provide connection-oriented or connectionless services for different groups of users with very different networking requirements. The optical buffer and the switch fabric are two of the most important components in an OPS router. In this research, novel designs for the optical buffer and switch fabric are proposed and experimentally demonstrated. In particular, an optical buffer that is based on a folded-path delay-line tree architecture will be discussed. This buffer is the most compact non-recirculating optical delay line buffer to date, and it uses an array of high-speed ON-OFF optical reflectors to dynamically reconfigure its delay within several nanoseconds. A major part of this research is devoted to the design and performance optimization of these high-speed reflectors. Simulations and measurements are used to compare different reflector designs as well as to determine their optimal operating conditions. Another important component in the OPS router is the switch fabric, and it is used to perform space switching for the optical packets. Optical switch fabrics are used to overcome the limitations imposed by conventional electronic switch fabrics: high power consumption and dependency on the modulation format and bit-rate of the signals. Currently, only those fabrics that are based on the broadcast-and-select architecture can provide truly non-blocking multicast services to all input ports. However, a major drawback of these fabrics is that they are implemented using a large number of optical gates based on semiconductor optical amplifiers (SOA). This results in large component count and high energy consumption. In this research, a new multicast-capable switch fabric which does not require any SOA gates is proposed. This fabric relies on a passive all-optical gate that is based on the Four-wave mixing (FWM) wavelength conversion process in a highly-nonlinear fiber. By using this new switch architecture, a significant reduction in component count can be expected.
24
De, 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.
Full textAbstract:
In this thesis we provide a model for a bufferless optical burst switching (OBS) and an optical packet switching (OPS) network. The thesis is divided in three parts. In 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
25
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.
Full text
26
Lutshete, 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.
Full textAbstract:
In this paper we study packet delay and loss rate at the University of Fort Hare network. The focus of this paper is to evaluate the information derived from a multipoint measurement of, University of Fort Hare network which will be collected for a duration of three Months during June 2011 to August 2011 at the TSC uplink and Ethernet hubs outside and inside relative to the Internet firewall host. The specific value of this data set lies in the end to end instrumentation of all devices operating at the packet level, combined with the duration of observation. We will provide measures for the normal day−to−day operation of the University of fort hare network both at off-peak and during peak hours. We expect to show the impact of delay and loss rate at the University of Fort Hare network. The data set will include a number of areas, where service quality (delay and packet loss) is extreme, moderate, good and we will examine the causes and impacts on network users.
27
Oliveira, Vinicius Garcia de. "Arquitetura e implementação de uma rede em anel de comutação optica de pacotes." [s.n.], 2009. http://repositorio.unicamp.br/jspui/handle/REPOSIP/322006.
Full textAbstract:
Orientadores: Peter Jurgen Tatsch, Marcos Rogerio SalvadorDissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação
Made available in DSpace on 2018-08-14T19:15:56Z (GMT). No. of bitstreams: 1 Oliveira_ViniciusGarciade_M.pdf: 16025820 bytes, checksum: 7d131f46cf420654c7f70129842770a7 (MD5) Previous issue date: 2009
Resumo: A convergência das aplicações, dos serviços e das redes de telecomunicação está mudando o mundo e o jeito como as pessoas agem e interagem. Embora com limitações, computação distribuída, teleconferência, tele-educação rádio, televisão e jogos já são possíveis na Internet. É razoável propor que em um futuro próximo estas limitações tendam a desaparecer e será possível suportar aplicações bem mais sofisticadas e complexas, tais como realidade virtual e tele-presença. ...Observação: O resumo, na íntegra, poderá ser visualizado no texto completo da tese digital.
Abstract: The convergence of the services, applications and telecommunication networks is changing the way people do their things and interact to each other. With limitations, distributed computing, teleconference, tele-education, radio, television and games are already possible through the Internet. In a close future these limitations probably will disappear and it will be possible to provide new and more sophisticated applications as virtual reality and tele-presence....Note: The complete abstract is available with the full electronic document
Mestrado
Telecomunicações
Mestre em Engenharia Elétrica
28
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.
Full textAbstract:
Fundação AraucáriaO 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.
29
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.
Full textAbstract:
Orientador: Mauricio Ferreira MagalhãesDissertaçã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
30
"Deadline-ordered parallel iterative matching with QoS guarantee." 2000. http://library.cuhk.edu.hk/record=b5890379.
Full textAbstract:
by Lui Hung Ngai.Thesis (M.Phil.)--Chinese University of Hong Kong, 2000.
Includes bibliographical references (leaves 56-[59]).
Abstracts in English and Chinese.
Chapter 1 --- Introduction --- p.1
Chapter 1.1 --- Thesis Overview --- p.3
Chapter 2 --- Background & Related work --- p.4
Chapter 2.1 --- Scheduling problem in ATM switch --- p.4
Chapter 2.2 --- Traffic Scheduling in output-buffered switch --- p.5
Chapter 2.3 --- Traffic Scheduling in Input buffered Switch --- p.16
Chapter 3 --- Deadline-ordered Parallel Iterative Matching (DLPIM) --- p.22
Chapter 3.1 --- Introduction --- p.22
Chapter 3.2 --- Switch model --- p.23
Chapter 3.3 --- Deadline-ordered Parallel Iterative Matching (DLPIM) --- p.24
Chapter 3.3.1 --- Motivation --- p.24
Chapter 3.3.2 --- Algorithm --- p.26
Chapter 3.3.3 --- An example of DLPIM --- p.28
Chapter 3.4 --- Simulation --- p.30
Chapter 4 --- DLPIM with static scheduling algorithm --- p.41
Chapter 4.1 --- Introduction --- p.41
Chapter 4.2 --- Static scheduling algorithm --- p.42
Chapter 4.3 --- DLPIM with static scheduling algorithm --- p.48
Chapter 4.4 --- An example of DLPIM with static scheduling algorithm --- p.50
Chapter 5 --- Conclusion --- p.54
Bibliography --- p.56
31
"Reconfiguration issues in a quasi-static packet switch." 2003. http://library.cuhk.edu.hk/record=b5891682.
Full textAbstract:
by Man Wai-Hung.Thesis (M.Phil.)--Chinese University of Hong Kong, 2003.
Includes bibliographical references (leaves 62-66).
Abstracts in English and Chinese.
Chapter 1 --- Introduction --- p.1
Chapter 1.1 --- General Types of Switch Architecture --- p.2
Chapter 1.1.1 --- Input-Buffered Switch --- p.2
Chapter 1.1.2 --- Output-Buffered Switch --- p.4
Chapter 1.1.3 --- Crossbar-Based Switch --- p.4
Chapter 1.1.4 --- Shared Buffer Memory Switch --- p.5
Chapter 1.2 --- From Clos Network to Cross-path Switch --- p.6
Chapter 1.3 --- Motivation and Organization --- p.12
Chapter 2 --- Route Reconfiguration in Clos Network --- p.14
Chapter 2.1 --- Connection Matrix in Clos Network --- p.15
Chapter 2.2 --- Rearranging Central Modules in Clos Network --- p.18
Chapter 2.3 --- Changing the Connection Matrix --- p.20
Chapter 2.4 --- One Step Route Reconfiguration --- p.21
Chapter 2.5 --- Closing Remarks --- p.25
Chapter 3. --- Frame-Based Reconfiguration Scheme in Cross-Path Switch --- p.26
Chapter 3.1 --- Route Assignment in Cross-Path Switch --- p.27
Chapter 3.1.1 --- Requirement Matrix and Capacity Matrix --- p.27
Chapter 3.1.2 --- Allocation Vector --- p.29
Chapter 3.2 --- Progress Tracing in Cross-Path Switch --- p.30
Chapter 3.3 --- Implementing Frame-Based Reconfiguration --- p.32
Chapter 3.3.1 --- Recognizing Receiver Virtual Path --- p.33
Chapter 3.3.2 --- Finding Donor Virtual Path --- p.34
Chapter 3.4 --- Simulation Results --- p.36
Chapter 3.4.1 --- Fixed Requirement Matrix --- p.36
Chapter 3.4.2 --- Time-Varying Requirement Matrix --- p.38
Chapter 3.5 --- Unfavourable Reconfigurations --- p.39
Chapter 3.6 --- Closing Remarks --- p.41
Chapter 4. --- Performance and Delay Tradeoff in Frame-Based Reconfiguration Scheme --- p.43
Chapter 4.1 --- Service Curve and Cross-Path Switch --- p.44
Chapter 4.2 --- Service Curve of Cross-Path Switch under Reconfiguration --- p.45
Chapter 4.3 --- Impact of Reconfiguration Algorithms to Maximum Delay Increase --- p.48
Chapter 4.4 --- Numerical Example --- p.56
Chapter 4.5 --- Closing Remarks --- p.57
Chapter 5. --- Conclusions and Future Researches --- p.59
Chapter 5.1 --- Suggestions for Future Researches --- p.60
Bibliography --- p.62
32
"Concentrators in large-scale packet switching." 2001. http://library.cuhk.edu.hk/record=b6073341.
Full textAbstract:
Lam Wan.Thesis (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.
33
"Providing quality of service guarantees in cross-path packet switch." 2000. http://library.cuhk.edu.hk/record=b6073259.
Full textAbstract:
by Chan Man Chi."June 2000."
Thesis (Ph.D.)--Chinese University of Hong Kong, 2000.
Includes bibliographical references (p. 150-[160]).
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.
34
"Path switching over multirate Benes network." 2003. http://library.cuhk.edu.hk/record=b5891662.
Full textAbstract:
Mui Sze Wai.Thesis (M.Phil.)--Chinese University of Hong Kong, 2003.
Includes bibliographical references (leaves 62-65).
Abstracts in English and Chinese.
Chapter 1. --- Introduction --- p.1
Chapter 1.1 --- Evolution of Multirate Networks --- p.2
Chapter 1.2 --- Some Results from Previous Work --- p.2
Chapter 1.3 --- Multirate Traffic on Benes Network --- p.5
Chapter 1.4 --- Organization --- p.7
Chapter 2. --- Background Knowledge on Benes Network and Path Switching --- p.8
Chapter 2.1 --- Benes Network --- p.9
Chapter 2.1.1 --- Construction of Large Switching Fabrics --- p.9
Chapter 2.1.2 --- Routing in Benes Network --- p.11
Chapter 2.1.3 --- Performance when Operated as a Large Switch Fabric --- p.13
Chapter 2.2 --- Path Switching --- p.14
Chapter 2.2.1 --- Basic Concept of Path Switching --- p.14
Chapter 2.2.2 --- Capacity Allocation and Route Assignment --- p.15
Chapter 3. --- Path Switching over Benes Network --- p.20
Chapter 3.1 --- The Model of path-switched Benes Network --- p.21
Chapter 3.2 --- Module-to-Module Implementation --- p.21
Chapter 3.2.1 --- The First Stage (Input Module) --- p.22
Chapter 3.2.2 --- The Middle Stage (Central Module) --- p.23
Chapter 3.2.3 --- The Last Stage (Output Module) --- p.24
Chapter 3.3 --- Port-to-Port Implementation --- p.24
Chapter 3.3.1 --- Uniform Traffic --- p.25
Chapter 3.3.2 --- Mult irate Traffic --- p.26
Chapter 3.4 --- Closing remarks --- p.29
Chapter 4. --- Performance Analysis --- p.31
Chapter 4.1 --- Traffic Constraints and Perform- ance Guarantees --- p.32
Chapter 4.1.1 --- Arrival Curve and Service Curve --- p.33
Chapter 4.1.2 --- Delay Bound and Backlog Bound --- p.36
Chapter 4.2 --- Service Guarantees --- p.39
Chapter 4.3 --- Deterministic Bounds --- p.42
Chapter 4.3.1 --- Delay --- p.42
Chapter 4.3.2 --- Backlog at Input Module --- p.44
Chapter 4.3.3 --- Backlog at Output Module --- p.47
Chapter 5. --- Simulation Results --- p.52
Chapter 5.1 --- Uniform Traffic --- p.53
Chapter 5.2 --- Multirate Traffic --- p.55
Chapter 6. --- Conclusions and Future Research --- p.59
Chapter 6.1 --- Suggestions for future research --- p.61
Bibliography --- p.62
35
"On the complexity of concentrators and multi-stage interconnection networks in switching systems." 2000. http://library.cuhk.edu.hk/record=b6073258.
Full textAbstract:
Hui Li."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.
36
Gomba, Ndadzibaya Masimba. "Contention and congestion minimization in OBS networks." Thesis, 2017. http://hdl.handle.net/10321/2465.
Full textAbstract:
Submitted in partial fulfillment for the Masters in Engineering Degree: Electrical Engineering, Department of Electrical Engineering, Durban University of Technology, Durban, South Africa, 2017.All-optical networks (AON) based optical burst switching (OBS) promise to be the ultimate backbone network technology solution for next generation( NG) as well as fu ture generation (FG)networks because of their relatively higher resources utilization, great flexibility at lower cost and potential massive bandwidth capacities both at trans mission and switching levels. By design, buffering is not provisioned in interior nodes. End users exchange data with one another through end-to-end light channels, called lightpaths in which wavelength continuity is maintained. In practice, their establish ing, in a cost effective manner remains an inescapable challenge. The routing and wave length assignment (RWA) problem entices successful establishment of a physical route for each lightpath connection request, assigning a wavelength to each route and at the same time ensm·ing end to end continuity, subject to the limited number of wave lengths. The wavelengths must be assigned such that no lightpaths can share the same wavelength simultaneously on a given fibre, or else contentions may occur. Some data bursts may be discarded whenever contention occurs among multiple bursts that arrive simultaneously at any interior node using the same wavelength and are intended for the same output port. Because of the buffer-less nature of OBS networks, conten tion/congestion in the core network can quickly lead to degradation in overall network performance at moderate to high traffic levels due to heavy burst loses. In this disser tation we propose and evaluate a congestion management approach we refer to as '"en hanced congestion management" which gears towards rendering and guaranteeing a consistent QoS as well as rational and fair use of available network links. Simulation results show that the scheme can effectively minimize both contention and congestion and at the same time improving both throughput and effective utilization under mod erate to high network traffic loads
M
37
Prakash, Amit. "Architectures and algorithms for high performance switching." Thesis, 2004. http://hdl.handle.net/2152/1295.
Full text
38
Prakash, Amit Aziz Adnan. "Architectures and algorithms for high performance switching." 2004. http://wwwlib.umi.com/cr/utexas/fullcit?p3143451.
Full text
39
"Designing a large scale switch interconnection architecture and a study of ATM scheduling algorithms." 1997. http://library.cuhk.edu.hk/record=b5889253.
Full textAbstract:
by Yee Ka Chi.Thesis (M.Phil.)--Chinese University of Hong Kong, 1997.
Includes bibliographical references (leaves 101-[106]).
Chapter 1 --- Introduction --- p.1
Chapter 1.1 --- Background --- p.1
Chapter 1.1.1 --- Large Scale Switch Interconnections --- p.2
Chapter 1.1.2 --- Multichannel Switching and Resequencing --- p.6
Chapter 1.1.3 --- Scheduling --- p.7
Chapter 2 --- Hierarchical Banyan Switch Interconnection --- p.12
Chapter 2.1 --- Introduction --- p.12
Chapter 2.2 --- Switch Architecture --- p.13
Chapter 2.3 --- Switch Operation --- p.19
Chapter 2.3.1 --- Call Setup --- p.19
Chapter 2.3.2 --- Cell Routing --- p.21
Chapter 2.3.3 --- Fault Tolerance --- p.27
Chapter 2.4 --- Call Blocking Analysis --- p.28
Chapter 2.4.1 --- Dilated Banyan --- p.29
Chapter 2.4.2 --- Dilated Benes Network --- p.30
Chapter 2.4.3 --- HBSI --- p.30
Chapter 2.5 --- Results and Discussions --- p.31
Chapter 2.6 --- Summary --- p.37
Chapter 3 --- Multichannel Switching and Resequencing --- p.40
Chapter 3.1 --- Introduction --- p.40
Chapter 3.2 --- Channel Assignment --- p.41
Chapter 3.2.1 --- VC-Based Channel Allocation Mechanism --- p.41
Chapter 3.2.2 --- Port-Based Channel Allocation Mechanism --- p.45
Chapter 3.2.3 --- Trunk-Based Channel Allocation Mechanism --- p.46
Chapter 3.3 --- Resequencer --- p.50
Chapter 3.3.1 --- Resequencing Algorithm --- p.50
Chapter 3.4 --- Results and Discussion --- p.55
Chapter 3.5 --- Summary --- p.60
Chapter 4 --- Scheduling --- p.62
Chapter 4.1 --- Introduction --- p.62
Chapter 4.2 --- Virtual Clock Scheduling (VCS) --- p.62
Chapter 4.3 --- Gated Virtual Clock Scheduling (GVCS) --- p.70
Chapter 4.4 --- Time-Priority Model --- p.75
Chapter 4.5 --- Programmable Rate-based Scheduler (PRS) --- p.80
Chapter 4.6 --- Integration with Resequencer --- p.83
Chapter 4.7 --- Results and Discussions --- p.86
Chapter 4.8 --- Summary --- p.96
Chapter 5 --- Conclusion --- p.99
Bibliography --- p.101
40
"Statistical traffic balancing control in path-switching Clos network." 2002. http://library.cuhk.edu.hk/record=b5891213.
Full textAbstract:
An Zhuo.Thesis (M.Phil.)--Chinese University of Hong Kong, 2002.
Includes bibliographical references (leaves 62-65).
Abstracts in English and Chinese.
Acknowledgments --- p.i
摘要 --- p.ii
Abstract --- p.iii
Chapter Chapter 1 --- Introduction --- p.1
Chapter 1.1 --- Circuit switching and Packet switching --- p.2
Chapter 1.2 --- Virtual paths in high-speed networks --- p.6
Chapter 1.3 --- BEF in cross-path switch --- p.8
Chapter 1.4 --- Organization --- p.11
Chapter Chapter 2 --- Analysis models --- p.12
Chapter 2.1 --- Routing schemes in Clos network --- p.12
Chapter 2.2 --- Path Switching --- p.15
Chapter 2.3 --- Traffic Model of Input Modules --- p.17
Chapter 2.4 --- Traffic Model of Output Modules --- p.19
Chapter 2.5 --- Summary --- p.23
Chapter Chapter 3 --- Throughput Performance of Input Modules in Path Switching --- p.24
Chapter 3.1 --- Throughput performance vs. BEF --- p.24
Chapter 3.2 --- Throughput performance vs. number of virtual paths --- p.30
Chapter 3.2.1 --- Throughput performance vs. integer group size m/k --- p.33
Chapter 3.2.2 --- Throughput performance vs. group size 0
Chapter 3.3 --- Summary --- p.48
Chapter Chapter 4 --- Traffic Balancing Control in Path Switching --- p.50
Chapter 4.1 --- Loss Probability in Output Modules --- p.50
Chapter 4.1.1 --- Loss probability vs. number of central modules m --- p.51
Chapter 4.1.2 --- Loss probability vs. knockout group size R and cluster size g --- p.52
Chapter 4.2 --- Simulation Comparison of look-ahead scheme --- p.53
Chapter 4.3 --- Simulation result of throughput vs. BEF --- p.55
Chapter 4.4 --- Traffic Balancing Control --- p.55
Chapter 4.5 --- Summary --- p.53
Chapter Chapter 5 --- Conclusion --- p.60
Bibliography --- p.62
41
"Performance analysis of iterative matching scheduling algorithms in ATM input-buffered switches." 1999. http://library.cuhk.edu.hk/record=b5889961.
Full textAbstract:
by Cheng Sze Wan.Thesis (M.Phil.)--Chinese University of Hong Kong, 1999.
Includes bibliographical references (leaves 72-[76]).
Abstracts in English and Chinese.
Chapter 1 --- Introduction --- p.1
Chapter 1.1 --- Background --- p.1
Chapter 1.2 --- Traffic Scheduling in Input-buffered Switches .。 --- p.3
Chapter 1.3 --- Organization of Thesis --- p.7
Chapter 2 --- Principle of Enchanced PIM Algorithm --- p.8
Chapter 2.1 --- Introduction --- p.8
Chapter 2.1.1 --- Switch Model --- p.9
Chapter 2.2 --- Enhanced Parallel Iterative Matching Algorithm (EPIM) --- p.10
Chapter 2.2.1 --- Motivation --- p.10
Chapter 2.2.2 --- Algorithm --- p.12
Chapter 2.3 --- Performance Evaluation --- p.16
Chapter 2.3.1 --- Simulation --- p.16
Chapter 2.3.2 --- Delay Analysis --- p.18
Chapter 3 --- Providing Bandwidth Guarantee in Input-Buffered Switches --- p.25
Chapter 3.1 --- Introduction --- p.25
Chapter 3.2 --- Bandwidth Reservation in Static Scheduling Algorithm --- p.26
Chapter 3.3 --- Incorporation of Dynamic and Static Scheduling Algorithms .。 --- p.32
Chapter 3.4 --- Simulation --- p.34
Chapter 3.4.1 --- Switch Model --- p.35
Chapter 3.4.2 --- Simulation Results --- p.36
Chapter 3.5 --- Comparison with Existing Schemes --- p.42
Chapter 3.5.1 --- Statistical Matching --- p.42
Chapter 3.5.2 --- Weighted Probabilistic Iterative Matching --- p.45
Chapter 4 --- EPIM and Cross-Path Switch --- p.50
Chapter 4.1 --- Introduction --- p.50
Chapter 4.2 --- Concept of Cross-Path Switching --- p.51
Chapter 4.2.1 --- Principle --- p.51
Chapter 4.2.2 --- Supporting Performance Guarantee in Cross-Path Switch --- p.52
Chapter 4.3 --- Implication of EPIM on Cross-Path switch --- p.55
Chapter 4.3.1 --- Problem Re-definition --- p.55
Chapter 4.3.2 --- Scheduling in Input Modules with EPIM --- p.58
Chapter 4.4 --- Simulation --- p.63
Chapter 5 --- Conclusion --- p.70
Bibliography --- p.72
42
"Switch scheduling based on round robin algorithms." Thesis, 2006. http://library.cuhk.edu.hk/record=b6074292.
Full textAbstract:
Recently, the Birkhoff-von Neumann (BvN) switch has become a typical model for providing QoS in input-queued switch. The major idea is to consider a set of predetermined permutation matrices as independent flows, and the scheduling problem in the input-queued switch can be simply handled by single-server scheduling algorithms, such as weighted fair queueing (WFQ). However, a number of problems are observed. Firstly, although WFQ is a fair algorithm, it has a poor delay performance that depends on the port counts. Secondly, the BvN switch does not perform well under certain traffic requirement, thus unable to provide tight performance guarantees. In this thesis, a set of admission control strategies and scheduling algorithms are therefore developed to improve the QoS performance.The input-queued switch architecture is widely used in Internet routers, due to its ability to run at very high speeds. A central problem in designing an input-queued switch is choosing the scheduling algorithm, i.e. deciding which packets to transfer from input ports to output ports in a given timeslot. Recent research in packet switch scheduling algorithms has moved beyond throughput maximization to quality of service (QoS) control.
Choy Man Ting.
"September 2006."
Adviser: Tony T. Lee.
Source: Dissertation Abstracts International, Volume: 68-03, Section: B, page: 1815.
Thesis (Ph.D.)--Chinese University of Hong Kong, 2006.
Includes bibliographical references (p. 89-94).
Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web.
Electronic reproduction. [Ann Arbor, MI] : ProQuest Information and Learning, [200-] System requirements: Adobe Acrobat Reader. Available via World Wide Web.
Abstracts in English and Chinese.
School code: 1307.
43
"A multiple ant colony optimization approach for load-balancing." 2003. http://library.cuhk.edu.hk/record=b5891640.
Full textAbstract:
Sun Weng Hong.Thesis submitted in: October 2002.
Thesis (M.Phil.)--Chinese University of Hong Kong, 2003.
Includes bibliographical references (leaves 116-121).
Abstracts in English and Chinese.
Chapter 1. --- Introduction --- p.7
Chapter 2. --- Ant Colony Optimization (ACO) --- p.9
Chapter 2.1 --- ACO vs. Traditional Routing --- p.10
Chapter 2.1.1 --- Routing information --- p.10
Chapter 2.1.2 --- Routing overhead --- p.12
Chapter 2.1.3 --- Adaptivity and Stagnation --- p.14
Chapter 2.2 --- Approaches to Mitigate Stagnation --- p.15
Chapter 2.2.1 --- Pheromone control --- p.15
Chapter 2.2.1.1 --- Evaporation: --- p.15
Chapter 2.2.1.2 --- Aging: --- p.16
Chapter 2.2.1.3 --- Limiting and smoothing pheromone: --- p.17
Chapter 2.2.2 --- Pheromone-Heuristic Control --- p.18
Chapter 2.2.3 --- Privileged Pheromone Laying --- p.19
Chapter 2.2.4 --- Critique and Comparison --- p.21
Chapter 2.2.4.1 --- Aging --- p.22
Chapter 2.2.4.2 --- Limiting pheromone --- p.22
Chapter 2.2.4.3 --- Pheromone smoothing --- p.23
Chapter 2.2.4.4 --- Evaporation --- p.25
Chapter 2.2.4.5 --- Privileged Pheromone Laying --- p.25
Chapter 2.2.4.6 --- Pheromone-heuristic control --- p.26
Chapter 2.3 --- ACO in Routing and Load Balancing --- p.27
Chapter 2.3.1 --- Ant-based Control and Its Ramifications --- p.27
Chapter 2.3.2 --- AntNet and Its Extensions --- p.35
Chapter 2.3.3 --- ASGA and SynthECA --- p.40
Chapter 3. --- Multiple Ant Colony Optimization (MACO) --- p.45
Chapter 4. --- MACO vs. ACO --- p.51
Chapter 4.1 --- Analysis of MACO vs. ACO --- p.53
Chapter 5. --- Applying MACO in Load Balancing --- p.89
Chapter 5.1 --- Applying MACO in Load-balancing --- p.89
Chapter 5.2 --- Problem Formulation --- p.91
Chapter 5.3 --- Types of ant in MACO --- p.93
Chapter 5.3.1 --- Allocator. --- p.94
Chapter 5.3.2 --- Destagnator. --- p.95
Chapter 5.3.3 --- Deallocator. --- p.100
Chapter 5.4 --- Global Algorithm --- p.100
Chapter 5.5 --- Discussion of the number of ant colonies --- p.103
Chapter 6. --- Experimental Results --- p.105
Chapter 7. --- Conclusion --- p.114
Chapter 8. --- References --- p.116
Appendix A. Ants in MACO --- p.122
Appendix B. Ants in SACO. --- p.123
44
"Traffic management framework for supporting integrated services in cross-path switch." 2000. http://library.cuhk.edu.hk/record=b5890383.
Full textAbstract:
Lau Tsz-ming.Thesis (M.Phil.)--Chinese University of Hong Kong, 2000.
Includes bibliographical references (leaves 57-[61]).
Abstracts in English and Chinese.
Chapter 1 --- Introduction --- p.1
Chapter 1.1 --- Integrated Services Architecture --- p.2
Chapter 1.2 --- Cross-path Switch --- p.4
Chapter 1.2.1 --- Path Switching --- p.5
Chapter 1.3 --- Organization of Thesis --- p.9
Chapter 2 --- Module Architecture --- p.10
Chapter 2.1 --- Introduction --- p.10
Chapter 2.2 --- Notable Features --- p.11
Chapter 3 --- Connection Admission Control and Resource Allocation --- p.14
Chapter 3.1 --- Introduction --- p.14
Chapter 3.2 --- Connection Admission Control --- p.15
Chapter 3.2.1 --- Guaranteed Service --- p.15
Chapter 3.2.2 --- Controlled-Load Service --- p.18
Chapter 3.3 --- Resource Allocation --- p.27
Chapter 4 --- Resource Management --- p.31
Chapter 4.1 --- Introduction --- p.31
Chapter 4.2 --- Scheduling Algorithm --- p.32
Chapter 4.2.1 --- Input and Output Module --- p.32
Chapter 4.2.2 --- Central Module --- p.34
Chapter 4.3 --- Buffer Management --- p.39
Chapter 4.3.1 --- Buffer Partitioning --- p.40
Chapter 4.3.2 --- Dicard Policy --- p.40
Chapter 5 --- Design Issue of Cross-path Switch --- p.43
Chapter 5.1 --- Introduction --- p.43
Chapter 5.2 --- Stability Condition --- p.44
Chapter 5.3 --- Supplementary Admission Control Scheme --- p.46
Chapter 5.4 --- Simulation --- p.50
Chapter 6 --- Conclusion --- p.55
Bibliography --- p.57
45
Chana, Amish Harkisan. "Performance analysis of signalling system No. 7 networks during signalling transfer point congestion." Thesis, 2002. http://hdl.handle.net/10413/4074.
Full textAbstract:
The growth of mobile networks and the imminent deployment of third generation networks and services will require signalling networks to maintain their integrity during increased unanticipated traffic volumes. As signalling networks become larger and more complex, an analysis ofprotocol operation is necessary to determine the effectiveness of the current protocol implementation and to evaluate the applicability of the proposed enhancements. The objective of this study ,is to develop analytical models to analyse the impact of Signalling Transfer Point congestion on network performance when simple message discard schemes are used as the primary flow control mechanism, and to investigate suitable congestion and flow control mechanisms to help alleviate the congestion. Unlike previous studies, that are localised and only concentrate on the nodes around the congested entity, the models presented here examine the impact of network wide and focused overloads on the entire network. The study considers both the fixed-line and mobile network environments, and analyses the performance of the ISDN User Part and Mobile Application Part protocols. The call completion rate and location update success rate are used to measure performance, instead of message throughput, since these parameters provide a more appropriate measure of the grade-of-service and more accurately reflect the level of service provided to a customer. The steady state equilibrium models, derived here, can be used to quickly estimate the safe operating regions of a signalling network, while the transient models provide a more intuitive perspective of the traffic processes that lead to congestion . Furthermore, these models can be used to examine the network performance for different message priority schemes, routing algorithms, overload scenarios and network configurations. The performance of various congestion control mechanisms that incorporate non-linear throttling schemes is also evaluated, together with an examination of the impact of congestion on multiple user parts in a mobile network environment. Message priority schemes are found to offer little or no advantage in a fixed network environment, but in a mobile network they can be used to maintain the network's performance at an optimum level during periods of overload. Network performance is also improved if congestion controls block load-generating traffic at the initial onset of congestion and then gradually restore traffic as the performance improves .Thesis (Ph.D.)-University of Natal, Durban, 2002.
46
"Deadline-ordered burst-based parallel scheduling strategy for IP-over-ATM with QoS support." 2001. http://library.cuhk.edu.hk/record=b5890857.
Full textAbstract:
Siu Chun.Thesis (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