To see the other types of publications on this topic, follow the link: Telecommunication – Switching systems.
Dissertations / Theses on the topic 'Telecommunication – Switching systems'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Telecommunication – Switching systems.'
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
Zimmerman, Eric Brady. "Analysis of the thermal behavior of telephone switching cabinets." Diss., Georgia Institute of Technology, 1995. http://hdl.handle.net/1853/17681.
Full text
2
Lau, Siu Lik. "Reliability of optical crossconnect systems /." View abstract or full-text, 2004. http://library.ust.hk/cgi/db/thesis.pl?ELEC%202004%20LAUS.
Full textAbstract:
Thesis (M. Phil.)--Hong Kong University of Science and Technology, 2004.<br>Includes bibliographical references (leaves 73-76). Also available in electronic version. Access restricted to campus users.
3
DeLong, Kenneth Wayne. "Two-photon absorption and color centers: Effects on all-optical switching." Diss., The University of Arizona, 1990. http://hdl.handle.net/10150/185023.
Full textAbstract:
This dissertation explores the effects of two-photon absorption and color center induced absorption on all-optical switching devices. The amount of allowable two-photon absorption was quantified by the parameter T = 2βλ/n₂, where λ is the operating wavelength, β is the two-photon absorption coefficient, and n₂ is the nonlinear refractive index coefficient, the latter two being measured at λ. If the value of T exceeds unity, the operation of all-optical switching devices is in general degraded beyond usable regimes. This result was demonstrated by numerical experiments on systems of equations modelling a nonlinear directional coupler, a prototypical all-optical switching device. The value of T was measured in two fibers, one made of lead silicate glass, and one made of TiO₂-doped silica. We find the value of T to be greater than unity at a wavelength of 1.06 μm in both fibers. Significant color center formation was seen in the lead glass fiber. These color centers were created through two-photon absorption and destroyed through one-photon absorption. Color center induced absorption was seen to mimic two-photon absorption in certain regimes. The nonlinear optical response of semiconductor-doped glasses, an example of a one-photon resonant nonlinearity, was studied. A relaxation time which is dependent on the carrier density was found to be important when modelling the response of these glasses.
4
Ng, Chi-kwong, and 吳志光. "Location management and level switching schemes in multitier mobile communication systems." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2005. http://hub.hku.hk/bib/B30168661.
Full text
5
Meempat, Gopalakrishnan. "Modeling and adaptive resource management in integrated communication networks." Diss., The University of Arizona, 1989. http://hdl.handle.net/10150/184843.
Full textAbstract:
The focus of this dissertation is the development of resource management schemes for integrated networks, with the major contributions being: (i) the development of an optimal adaptive buffer management scheme for the packet-switched subsystem, (ii) the integration of a moveable-boundary hybrid switching scheme with the time assigned speech interpolation technique for implementing a congestion control mechanism for the packet-switched subsystem, and (iii) the development of an adaptive hierarchical scheme for implementing the access control and routing functions within the circuit-switched subsystem. The problem of buffer management at an integrated network node is formulated as a nonlinear programming problem with a convex objective function and an interative solution technique with fast convergence is proposed for a real-time implementation of the buffer management scheme in practical environments. In order to exercise an additional degree of control over the packet-blocking probability at each hybrid-switched link within the network, a new multiplexing scheme based on the integration of the moveable-boundary hybrid switching scheme and the time assigned speech interpolation technique is presented in this dissertation. The tradeoff between the corresponding decrease in the packet blocking probability and the increase in the circuit freezeout fraction is demonstrated by a detailed queueing analysis of the multiplexer. Specific algorithms are also presented in this dissertation for the solution of the access control and routing problems within the circuit-switched subsystem. In particular, an access control scheme is developed by solving an integer programming problem formulated using the policy of complete partitioning of the available bandwidth among the competing user classes. As an alternative to the completely partitioned approach, the problem of traffic routing is considered in a network that supports homogeneous traffic classes based on the policy of complete sharing. Finally, for the general case of networks with heterogeneous traffic classes, a hierarchical scheme is developed for the implementation of the access control and the routing functions at two functional levels, where the access control is implemented by the network supervisor who solves an appropriate linear integer programming problem periodically, and the routing function is handled by the individual nodes of the network on a distributed basis. (Abstract shortened with permission of author.)
6
Da, Rosa Marcelo Zannin. "Optical gain clamping in erbium doped fibre amplifier : investigation in optical burst switching networks." Thesis, Swansea University, 2011. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.678524.
Full text
7
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
8
Yildirim, Recep Ali. "Mmse Based Iterative Turbo Equalization For Antenna Switching Systems." Master's thesis, METU, 2010. http://etd.lib.metu.edu.tr/upload/12612480/index.pdf.
Full textAbstract:
In this thesis, we study the performance of an antenna switching (AS) system in comparison to an Alamouti coded system. We analyze the outage probabilities and propose minimum mean-squared error based iterative equalizers for both systems. We see from the outage probability analysis of both systems that the AS system may achieve the same diversity order of the Alamouti coded scheme contingent on the transmission rate and constellation size. In the proposed receiver, MMSE equalization and channel decoding are jointly carried out in an iterative fashion. We use both hard and soft decision channel decoders in our simulations. It is observed that the Alamouti based scheme performs better when the channel state information is perfect. The Alamouti scheme also performs better than the AS scheme when the channel state information is imperfect in hard decision channel decoder case and a random interleaver is used. On the other hand, if a random interleaver is not used, AS scheme performs remarkably better than the Alamouti scheme in hard decision channel decoder case. In a soft decision channel decoder case, when the channel state information is imperfect, the AS scheme performs approximately a 2 dB better than the Alamouti scheme. Moreover, there is approximately a 3 dB performance gain if a soft decision channel decoder is used instead of hard decision.
9
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
10
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.<br>Master of Science
11
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
12
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
13
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.<br>Applied Science, Faculty of<br>Electrical and Computer Engineering, Department of<br>Graduate
14
Goken, Burcu. "Investigation Of Gmpls Applications In Optical Systems." Master's thesis, METU, 2005. http://etd.lib.metu.edu.tr/upload/2/12606571/index.pdf.
Full textAbstract:
In this study, possible applications of label switching in large area, fully optical
networks are investigated. The objective was to design a label assignment method
by using Generalized Multi-Protocol Label Switching (GMPLS) concept to get an
efficient optical network operation. In order to fulfill this objective, two new
approaches were proposed: a label assignment method and a concatenated label
structure.
Label assignment method was designed to provide an efficient utilization of
resources. Concatenated label structure aimed handling the label in optical
domain. Mainly, the lambda switch capable GMPLS networks were investigated.
In order to verify the performance of label assignment method, a simulator was
developed.
The results of simulation have clearly indicated that the proposed approaches
could be beneficial in an optical network operation.
15
Schweizer, Andreas. "Analysis and optimisation of stable matching in combined input and output queued switches." Western Australian Telecommunications Research Institute, 2009. http://theses.library.uwa.edu.au/adt-WU2009.0078.
Full textAbstract:
Output queues in network switches are known to provide a suitable architecture for scheduling disciplines that need to provide quality of service (QoS) guarantees. However, todays memory technology is incapable of meeting the speed requirements. Combined input and output queued (CIOQ) switches have emerged as one alternative to address the problem of memory speed. When a switch of this architecture uses a stable matching algorithm to transfer packets across the switch fabric, an output queued (OQ) switch can be mimicked exactly with a speedup of only two. The use of a stable matching algorithm typically requires complex and time-consuming calculations to ensure the behaviour of an OQ switch is maintained. Stable matching algorithms are well studied in the area in which they originally appeared. However, little is presently known on how the stable matching algorithm performs in CIOQ switches and how key parameters are affected by switch size, traffic type and traffic load. Knowledge of how these conditions affect performance is essential to judge the practicability of an architecture and to provide useful information on how to design such switches. Until now, CIOQ switches were likely to be dismissed due to the high complexity of the stable matching algorithm when applied to other applications. However, the characteristics of a stable matching algorithm in a CIOQ switch have not been thoroughly analysed. The principal goal of this thesis is to identify the conditions the stable matching algorithm encounters in a CIOQ switch under realistic operational scenarios. This thesis provides accurate mathematical models based on Markov chains to predict the value of key parameters that affect the complexity and runtime of a stable matching algorithm in CIOQ switches. The applicability of the models is then backed up by simulations. The results of the analysis quantify critical operational parameters, such as the size and number of preference lists and runtime complexity. These provide detailed insights into switch behaviour and useful information for switch designs. Major conclusions to be drawn from this analysis include that the average values of the key parameters of the stable matching algorithm are feasibly small and do not strongly correlate with switch size, which is contrary to the behaviour of the stable matching ii algorithm in its original application. Furthermore, although these parameters have wide theoretical ranges, the mean values and standard deviations are found to be small under operational conditions. The results also suggest that the implementation becomes very versatile as the completion time of the stable matching algorithm is not strongly correlated to the network traffic type; that is, the runtime is minimally affected by the nature of the traffic.
16
Zuo, Yiying 1974. "Design, analysis, and implementation of multi-port refraction based electro-optic switches." Thesis, McGill University, 2006. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=103035.
Full textAbstract:
Electro-optic (EO) beam deflectors are voltage-controlled devices widely used for scanning and switching applications. For example, high-speed, low-loss optical switches aimed at future optical networks can be built on EO deflectors. Novel EO deflectors distinguish themselves with a much-improved steering performance, high-speed response and simple fabrication requirements. Patterned ferroelectric crystals such as LiTaO3 are first poled to provide the required prism shaped domain structures. The application of an electrical field across the entire crystal can then be used to drive the trajectory of the beam as it travels through the poled wafer. The electric field induces an index change of opposite magnitude on the adjacent domain regions in the EO device, causing the optical beam to refract at the interfaces.<br>Although rectangular geometry is extensively employed in EO devices, nonrectangular scanners have demonstrated better deflection performance. Two new nonrectangular geometries capable of further enhancing the deflection performance of EO beam scanners, proposed in this dissertation, were constructed. Their parabola and half-horn geometries provide 2-3 degrees of steering, which is 2-3 times greater than the steering provided by rectangular deflectors.<br>EO deflectors based on the parabola and the half-horn geometries, which can provide larger deflection angles, were built. These devices demonstrated a deflection angle of 3.1°, less than 5 dB of insertion loss from fiber to fiber, and -40 dB of crosstalk.<br>Two packaged optical switches using rectangular EO deflectors were demonstrated. By combining these EO deflectors with fiber collimators and high voltage packaging, high speed optical switches were built and characterized. The switch design was based on a 500mum z-cut LiTaO3 single crystal wafer fabricated using the domain inversion method. The 1x2 switch had a maximum deflection angle of 1.22° with an applied voltage of 1.1 kV and the 1x4 switch had a maximum deviation angle of 2.14°, with an applied voltage of 1 kV. The average insertion loss and crosstalk figures were 2.36 dB and -36 dB, respectively. The worst case switching time was 86 ns.
17
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 Salvador<br>Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação<br>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<br>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.<br>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<br>Mestrado<br>Telecomunicações<br>Mestre em Engenharia Elétrica
18
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.
19
Rojanarowan, Jerapong. "MPLS-Based Best-Effort Traffic Engineering." Diss., Georgia Institute of Technology, 2005. http://hdl.handle.net/1853/7496.
Full textAbstract:
MPLS-Based Best-Effort Traffic Engineering
Jerapong Rojanarowan
120 Pages
Directed by Dr. Henry L. Owen
The objective of this research is to develop a multipath traffic engineering framework for best-effort traffic in Multiprotocol Label Switching (MPLS) networks so as to deliver more equal shares of bandwidth to best-effort users as compared to the traditional shortest-path algorithm. The proposed framework is static and the input to the traffic engineering algorithm is restricted to network topology. Performance evaluation of this framework is conducted by simulation using ns-2 network simulator. In a multi-service capable network, some portion of the bandwidth is reserved for guaranteed services and the leftover portion is dedicated to best-effort service. This research examines the problem of traffic engineering for the remaining network bandwidth that is utilized by best-effort traffic where demands are not known a priori. This framework will result in making the limited available best-effort traffic bandwidth more equitably shared by the best-effort flows over a wide range of demands. Traditional traffic engineering research has not examined best-effort traffic.
20
Srikanthan, Sasiharan Sudeshna. "An investigation of matrix switching topologies and algorithms." Thesis, University of Hertfordshire, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.315633.
Full text
21
Ragab, A. H. M. "A high capacity multiprocessor X.25 packet switching node." Thesis, University of Essex, 1985. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.355389.
Full text
22
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. <p><p>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. <p><p>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). <p><p>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.<br>Doctorat en Sciences de l'ingénieur<br>info:eu-repo/semantics/nonPublished
23
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ária<br>O 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.<br>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.
24
Wittner, Otto. "Emergent behavior based implements for distributed network management." Doctoral thesis, Norwegian University of Science and Technology, Department of Telematics, 2003. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-1787.
Full textAbstract:
<p>Network and system management has always been of concern for telecommunication and computer system operators. The need for standardization was recognised already 20 years ago, hence several standards for network management exist today. However, the ever-increasing number of units connected to networks and the ever-increasing number of services being provided results in significant increased complexity of average network environments. This challenges current management systems. In addition to the general increase in complexity the trend among network owners and operators of merging several single service networks into larger, heterogeneous and complex full service networks challenges current management systems even further. The full service networks will require management systems more powerful than what is possible to realize basing systems purely on todays management standards. This thesis presents a distributed stochastic optimization algorithm which enables implementations of highly robust and efficient management tools. These tools may be integrated into management systems and potentially make the systems more powerful and better prepared for management of full service networks.</p><p>Emergent behavior is common in nature and easily observable in colonies of social insects and animals. Even an old oak tree can be viewed as an emergent system with its collection of interacting cells. Characteristic for any emergent system is how the overall behavior of the system emerge from many relatively simple, restricted behaviors interacting, e.g. a thousand ants building a trail, a flock of birds flying south or millions of cells making a tree grow. No centralized control exist, i.e. no single unit is in charge making global decisions. Despite distributed control, high work redundancy and stochastic behavior components, emergent systems tend to be very efficient problem solvers. In fact emergent systems tend to be both efficient, adaptive and robust which are three properties indeed desirable for a network management system. The algorithm presented in this thesis relates to a class of emergent behavior based systems known as swarm intelligence systems, i.e. the algorithm is potentially efficient, adaptive and robust.</p><p>On the contrary to other related swarm intelligence algorithms, the algorithm presented has a thorough formal foundation. This enables a better understanding of the algorithm’s potentials and limitations, and hence enables better adaptation of the algorithm to new problem areas without loss of efficiency, adaptability or robustness. The formal foundations are based on work by Reuven Rubinstein on cross entropy driven optimization. The transition from Ruinstein’s centralized and synchronous algorithm to a distributed and asynchronous algorithm is described, and the distributed algorithm’s ability to solve complex problems (NP-complete) efficiently is demonstrated.</p><p>Four examples of how the distributed algorithm may be applied in a network management context are presented. A system for finding near optimal patterns of primary/backup paths together with a system for finding cyclic protection paths in mesh networks demonstrate the algorithm’s ability to act as a tool helping management system to ensure quality of service. The algorithm’s potential as a management policy implementation mechanism is also demonstrated. The algorithm’s adaptability is shown to enable resolution of policy conflicts in a soft manner causing as little loss as possible. Finally, the algorithm’s ability to find near optimal paths (i.e. sequences) of resources in networks of large scale is demonstrated.</p>
25
Safa, Mohamad. "Sur la planification des reseaux telephoniques avec acheminement adaptatif." Toulouse 3, 1986. http://www.theses.fr/1986TOU30087.
Full textAbstract:
Le but du travail presente a ete de mettre en evidence l'importance de l'adaptation de la structure des reseaux au type de commande envisage (politiques s'adaptant en temps reel aux variations de charge du reseau). Partant d'un modele de type fluide anterieurement developpe, une adaptation permettant de caracteriser l'effet occasionne par l'introduction de politiques de commande temps reel est proposee. Le modele propose est utilise a des fins de planification des reseaux. Un algorithme classique de directions admissibles est adopte pour prendre en compte certaines contraintes de modularite. Plus interessant du point de vue facilite de mise en oeuvre, un algorithme base sur une recherche stochastique dans l'espace discret des structures admissibles est developpe (recuit simule)
26
Ishibashi, Hiroki. "Torus routing in the presence of multicasts." CSUSB ScholarWorks, 1996. https://scholarworks.lib.csusb.edu/etd-project/1251.
Full text
27
Iftikhar, Amjad, Muhammad Aoon Shah, and Fowad Latif. "Multi-Protocol Label Switching To Support Quality of Service Needs." Thesis, Halmstad University, School of Information Science, Computer and Electrical Engineering (IDE), 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:hh:diva-4025.
Full textAbstract:
<p>Multi-Protocol Label Switching (MPLS) is a technique that can be used to improve the performance of a computer communication network. By use of MPLS, data packets can be switched on the basis of labels rather than routed on the basis of destination address. MPLS supports different features like QoS, traffic engineering and VPNs etc.</p><p>This thesis evaluates the working and performance of MPLS and its support for Quality of Service. QoS is required in the network when real time traffic is transported.</p><p>In this thesis it is described, how QoS guarantees are assigned to the IP packets and how MPLS QoS environment differs from the traditional IP routing environment. MPLS QoS works as the IP QoS, but MPLS QoS enhances the capability of network as compared to the IP QoS based network.</p><p>The thesis studies the use of MPLS in an integrated environment with DiffServ QoS model and also implements MPLS QoS in a Lab environment to compare MPLS QoS with IP QoS. Real time traffic faces longer delays in IP QoS based networks. MPLS QoS reduces the delays in real time traffic transmission.</p><p>The study results and the practical implementations show that MPLS QoS provide much better results than simple IP QoS.</p>
28
Maia, Junior Decio. "Desenvolvimento de nos de chaveamento de pacotes opticos para aplicação em redes metropolitanas de acesso." [s.n.], 2005. http://repositorio.unicamp.br/jspui/handle/REPOSIP/261364.
Full textAbstract:
Orientadores: Edson Moschim, Felipe Rudge<br>Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação<br>Made available in DSpace on 2018-08-05T07:30:34Z (GMT). No. of bitstreams: 1
MaiaJunior_Decio_M.pdf: 1427591 bytes, checksum: 104d0be2f7926f963a037d44ed4df46a (MD5)
Previous issue date: 2005<br>Resumo: Um novo sistema para geração, chaveamento e roteamento de pacotes ópticos é descrito, visando aplicação em nós de redes ópticas de próxima geração (NGON). Os pacotes ópticos são compostos por um campo de cabeçalho em freqüência e um campo de carga útil digital de alta capacidade (~Gb/s). Os nós de chaveamento óptico incluem as funcionalidades de bloqueio, roteamento e retirada de pacotes, e são controlados por circuitos eletrônicos lógicos que rapidamente processam a informação contida no cabeçalho dos pacotes ópticos, permitindo baixa latência. O chaveamento é realizado pacote-a-pacote, e o tempo de reconhecimento do cabeçalho e chaveamento dos pacotes ópticos é de alguns micro-segundos (~ms) . Este sistema apresenta arquitetura simples, operação eficiente, e pode ser visto como uma solução atrativa nos aspectos técnicos e econômicos, aplicável a redes metropolitanas de acesso e, demonstra-se totalmente compatível com redes ópticas WDM<br>Abstract: A new system for the generation, switching and routing of optical packets is described, aimed for use in nodes of next-generation optical networks (NGON). The optical packets are composed of an in-band frequency tone header, and a high-capacity transparent digital payload (~Gb/s), occupying separate fields. The optical node switching action includes blocking, routing and drop functions, controlled by electronic logic circuits, performed on a packet-by-packet basis, with only the header information being processed. Total header processing and optical packet switching time is few micro seconds (~ms). This system is designed as a techno-economical solution for metro-access transport, having low latency and low packet loss, being fully compatible with WDM optical networks<br>Mestrado<br>Eletrônica, Microeletrônica e Optoeletrônica<br>Mestre em Engenharia Elétrica
29
"Architectures of new switching systems." 1998. http://library.cuhk.edu.hk/record=b5889524.
Full textAbstract:
by Lam Wan.<br>Thesis submitted in: November 1997.<br>Thesis (M.Phil.)--Chinese University of Hong Kong, 1998.<br>Includes bibliographical references (leaves 96-102).<br>Abstract also in Chinese.<br>Part I<br>Chapter 1 --- Introduction to Integrated Intelligent Personal Communication System --- p.1<br>Chapter 2 --- The Switching Architecture --- p.5<br>Chapter 2.1 --- The Overall Switching Architecture --- p.6<br>Chapter 2.2 --- Switching Module --- p.10<br>Chapter 2.2.1 --- Traffic Routing in Switching Module --- p.11<br>Chapter 2.2.2 --- Structure of Switching Module --- p.15<br>Chapter 2.2.3 --- Wireless Base Interface --- p.16<br>Chapter 2.2.4 --- Trunk Interface --- p.18<br>Chapter 2.2.5 --- Analog Interfaces --- p.18<br>Chapter 2.3 --- Network Intelligence --- p.19<br>Chapter 2.4 --- Wireless Part --- p.21<br>Chapter 2.4.1 --- Call-Setup in IIPCS --- p.24<br>Chapter 2.4.2 --- Handoff --- p.25<br>Chapter 2.4.3 --- Wireless Base --- p.27<br>Chapter 2.5 --- Downstream Wired Extensions --- p.28<br>Chapter 2.6 --- Upstream Wired Part --- p.28<br>Chapter 2.7 --- Voice System --- p.28<br>Chapter 2.8 --- Features of the IIPCS --- p.29<br>Chapter 3 --- Concluding Remarks --- p.33<br>Chapter 3.1 --- Summary --- p.35<br>Chapter 3.2 --- Directions for Further Research --- p.36<br>Part II<br>Chapter 4 --- Introduction to Next-Generation Switch --- p.37<br>Chapter 5 --- Architecture of Next-Generation Switch --- p.41<br>Chapter 5.1 --- Overall Architecture of Next-Generation Switch --- p.42<br>Chapter 5.1.1 --- Interface module --- p.44<br>Chapter 5.1.2 --- Packetizer --- p.46<br>Chapter 5.2 --- Concentration Fabric --- p.50<br>Chapter 5.3 --- Shared-Buffer Memory Switch --- p.53<br>Chapter 6 --- Concentration Networks --- p.56<br>Chapter 6.1 --- Background of Concentration Networks --- p.56<br>Chapter 6.2 --- k-Sorting --- p.63<br>Chapter 6.3 --- Concentrator --- p.72<br>Chapter 6.3.1 --- Nk-to-k Concentrator --- p.73<br>Chapter 6.3.2 --- Match between Circles with Cost Reduction --- p.75<br>Chapter 6.4 --- The Structure of a Molecule --- p.78<br>Chapter 6.5 --- Summary --- p.81<br>Chapter 7 --- Lock-Latch Algorithm --- p.82<br>Chapter 8 --- Performance Evaluation --- p.88<br>Chapter 9 --- Concluding Remarks --- p.93<br>Chapter 9.1 --- LSI Implementation --- p.94<br>Chapter 9.2 --- Summary --- p.95<br>Bibliography
30
"Reconfiguration issues in a quasi-static packet switch." 2003. http://library.cuhk.edu.hk/record=b5891682.
Full textAbstract:
by Man Wai-Hung.<br>Thesis (M.Phil.)--Chinese University of Hong Kong, 2003.<br>Includes bibliographical references (leaves 62-66).<br>Abstracts in English and Chinese.<br>Chapter 1 --- Introduction --- p.1<br>Chapter 1.1 --- General Types of Switch Architecture --- p.2<br>Chapter 1.1.1 --- Input-Buffered Switch --- p.2<br>Chapter 1.1.2 --- Output-Buffered Switch --- p.4<br>Chapter 1.1.3 --- Crossbar-Based Switch --- p.4<br>Chapter 1.1.4 --- Shared Buffer Memory Switch --- p.5<br>Chapter 1.2 --- From Clos Network to Cross-path Switch --- p.6<br>Chapter 1.3 --- Motivation and Organization --- p.12<br>Chapter 2 --- Route Reconfiguration in Clos Network --- p.14<br>Chapter 2.1 --- Connection Matrix in Clos Network --- p.15<br>Chapter 2.2 --- Rearranging Central Modules in Clos Network --- p.18<br>Chapter 2.3 --- Changing the Connection Matrix --- p.20<br>Chapter 2.4 --- One Step Route Reconfiguration --- p.21<br>Chapter 2.5 --- Closing Remarks --- p.25<br>Chapter 3. --- Frame-Based Reconfiguration Scheme in Cross-Path Switch --- p.26<br>Chapter 3.1 --- Route Assignment in Cross-Path Switch --- p.27<br>Chapter 3.1.1 --- Requirement Matrix and Capacity Matrix --- p.27<br>Chapter 3.1.2 --- Allocation Vector --- p.29<br>Chapter 3.2 --- Progress Tracing in Cross-Path Switch --- p.30<br>Chapter 3.3 --- Implementing Frame-Based Reconfiguration --- p.32<br>Chapter 3.3.1 --- Recognizing Receiver Virtual Path --- p.33<br>Chapter 3.3.2 --- Finding Donor Virtual Path --- p.34<br>Chapter 3.4 --- Simulation Results --- p.36<br>Chapter 3.4.1 --- Fixed Requirement Matrix --- p.36<br>Chapter 3.4.2 --- Time-Varying Requirement Matrix --- p.38<br>Chapter 3.5 --- Unfavourable Reconfigurations --- p.39<br>Chapter 3.6 --- Closing Remarks --- p.41<br>Chapter 4. --- Performance and Delay Tradeoff in Frame-Based Reconfiguration Scheme --- p.43<br>Chapter 4.1 --- Service Curve and Cross-Path Switch --- p.44<br>Chapter 4.2 --- Service Curve of Cross-Path Switch under Reconfiguration --- p.45<br>Chapter 4.3 --- Impact of Reconfiguration Algorithms to Maximum Delay Increase --- p.48<br>Chapter 4.4 --- Numerical Example --- p.56<br>Chapter 4.5 --- Closing Remarks --- p.57<br>Chapter 5. --- Conclusions and Future Researches --- p.59<br>Chapter 5.1 --- Suggestions for Future Researches --- p.60<br>Bibliography --- p.62
31
"Providing quality of service guarantees in cross-path packet switch." 2000. http://library.cuhk.edu.hk/record=b6073259.
Full textAbstract:
by Chan Man Chi.<br>"June 2000."<br>Thesis (Ph.D.)--Chinese University of Hong Kong, 2000.<br>Includes bibliographical references (p. 150-[160]).<br>Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web.<br>Mode of access: World Wide Web.<br>Abstracts in English and Chinese.
32
"On construction of 0-1 sorters from 2x2 switches." 2000. http://library.cuhk.edu.hk/record=b5890359.
Full textAbstract:
So Kin Tai.<br>Thesis (M.Phil.)--Chinese University of Hong Kong, 2000.<br>Includes bibliographical references (leaves 65-66).<br>Abstracts in English and Chinese.<br>Chapter Chapter 1 --- Introduction --- p.1<br>Chapter 1.1 --- The 0-1 sorter and concentrator --- p.1<br>Chapter 1.2 --- Review of literature on constructions --- p.3<br>Chapter 1.2.1 --- Odd-even merging network --- p.4<br>Chapter 1.2.2 --- The Fast Knockout algorithm --- p.5<br>Chapter 1.2.3 --- Reverse Banyan network prepended by running sum adder --- p.10<br>Chapter 1.2.4 --- Recursive construction using iterative cells --- p.14<br>Chapter 1.2.5 --- Comparison of construction algorithms --- p.17<br>Chapter Chapter 2 --- Compressor based on baseline-swap network --- p.22<br>Chapter 2.1 --- Bit permutation induced exchange --- p.22<br>Chapter 2.2 --- Compressor --- p.26<br>Chapter 2.3 --- The baseline-swap network --- p.28<br>Chapter 2.4 --- New algorithm for running parity initialization --- p.31<br>Chapter 2.5 --- Input fairness --- p.42<br>Chapter Chapter 3 --- The general architecture of 0-1 sorter --- p.46<br>Chapter 3.1 --- Recursive 2X-construction --- p.46<br>Chapter 3.2 --- Control a 2X-interconnection network as a cyclic 0-1 sorter --- p.50<br>Chapter 3.3 --- Recursive construction of larger 0-1 sorter --- p.56<br>Chapter Chapter 4 --- Epilogue --- p.59<br>Chapter 4.1 --- Directions of further studies --- p.59<br>Chapter 4.1.1 --- Synchronization within the same stage --- p.59<br>Chapter 4.1.2 --- Layout complexity --- p.60<br>Chapter 4.1.3 --- Statistical initialization of running parity --- p.62<br>Chapter 4.2 --- Conclusion --- p.63<br>REFERENCES --- p.65
33
"Routing algorithm for multirate circuit switching in quantized Clos network." 1997. http://library.cuhk.edu.hk/record=b5889340.
Full textAbstract:
by Wai-Hung Kwok.<br>Thesis (M.Phil.)--Chinese University of Hong Kong, 1997.<br>Chapter 1 --- Introduction --- p.1<br>Chapter 2 --- Preliminaries - Routing in Classical Circuit Switching Clos Net- work --- p.9<br>Chapter 2.1 --- Formulation of route assignment as bipartite multigraph coloring problem --- p.10<br>Chapter 2.1.1 --- Definitions --- p.10<br>Chapter 2.1.2 --- Problem formulation --- p.11<br>Chapter 2.2 --- Edge-coloring of bipartite graph --- p.12<br>Chapter 2.3 --- Routing algorithm - Paull's matrix --- p.15<br>Chapter 3 --- Principle of Routing Algorithm --- p.18<br>Chapter 3.1 --- Definitions --- p.18<br>Chapter 3.1.1 --- Bandwidth quantization --- p.18<br>Chapter 3.1.2 --- Connection splitting --- p.20<br>Chapter 3.2 --- Non-blocking conditions --- p.20<br>Chapter 3.2.1 --- Rearrangeably non-blocking condition --- p.21<br>Chapter 3.2.2 --- Strictly non-blocking condition --- p.22<br>Chapter 3.3 --- Formulation of route assignment as weighted bipartite multigraph coloring problem --- p.23<br>Chapter 3.4 --- Edge-coloring of weighted bipartite multigraph with edge splitting --- p.25<br>Chapter 3.4.1 --- Procedures --- p.25<br>Chapter 3.4.2 --- Example --- p.27<br>Chapter 3.4.3 --- Validity of the color rearrangement procedure --- p.29<br>Chapter 4 --- Routing Algorithm --- p.32<br>Chapter 4.1 --- Capacity allocation matrix --- p.32<br>Chapter 4.2 --- Connection setup --- p.34<br>Chapter 4.2.1 --- Non-splitting stage --- p.35<br>Chapter 4.2.2 --- Splitting stage --- p.36<br>Chapter 4.2.3 --- Recursive rearrangement stage --- p.37<br>Chapter 4.3 --- Connection release --- p.40<br>Chapter 4.4 --- Realization of route assignment in packet level --- p.42<br>Chapter 5 --- Performance Studies --- p.45<br>Chapter 5.1 --- External blocking probability --- p.45<br>Chapter 5.1.1 --- Reduced load approximation --- p.46<br>Chapter 5.1.2 --- Comparison of external blocking probabilities --- p.48<br>Chapter 5.2 --- Connection splitting probability --- p.50<br>Chapter 5.3 --- Recursive rearrangement probability --- p.50<br>Chapter 6 --- Conclusions --- p.52
34
"Performance study of multirate circuit switching in quantized clos network." 1998. http://library.cuhk.edu.hk/record=b5889540.
Full textAbstract:
by Vincent Wing-Shing Tse.<br>Thesis submitted in: December 1997.<br>Thesis (M.Phil.)--Chinese University of Hong Kong, 1998.<br>Includes bibliographical references (leaves 62-[64]).<br>Abstract also in Chinese.<br>Chapter 1 --- Introduction --- p.1<br>Chapter 2 --- Principles of Multirate Circuit Switching in Quantized Clos Network --- p.10<br>Chapter 2.1 --- Formulation of Multirate Circuit Switching --- p.11<br>Chapter 2.2 --- Call Level Routing in Quantized Clos Network --- p.12<br>Chapter 2.3 --- Cell Level Routing in Quantized Clos Network --- p.16<br>Chapter 2.3.1 --- Traffic Behavior in ATM Network --- p.17<br>Chapter 2.3.2 --- Time Division Multiplexing in Multirate Circuit Switching and Cell-level Switching in ATM Network --- p.19<br>Chapter 2.3.3 --- Cell Transmission Scheduling --- p.20<br>Chapter 2.3.4 --- Capacity Allocation and Route Assignment at Cell-level --- p.29<br>Chapter 3 --- Performance Evaluation of Different Implementation Schemes --- p.31<br>Chapter 3.1 --- Global Control and Distributed Switching --- p.32<br>Chapter 3.2 --- Implementation Schemes of Quantized Clos Network --- p.33<br>Chapter 3.2.1 --- Classification of Switch Modules --- p.33<br>Chapter 3.2.2 --- Bufferless Switch Modules Construction Scheme --- p.38<br>Chapter 3.2.3 --- Buffered Switch Modules Construction Scheme --- p.42<br>Chapter 3.3 --- Complexity Comparison --- p.44<br>Chapter 3.4 --- Delay Performance of The Two Implementation Schemes --- p.47<br>Chapter 3.4.1 --- Assumption --- p.47<br>Chapter 3.4.2 --- Simulation Result --- p.50<br>Chapter 4 --- Conclusions --- p.59<br>Bibliography --- p.62
35
"Statistical traffic balancing control in path-switching Clos network." 2002. http://library.cuhk.edu.hk/record=b5891213.
Full textAbstract:
An Zhuo.<br>Thesis (M.Phil.)--Chinese University of Hong Kong, 2002.<br>Includes bibliographical references (leaves 62-65).<br>Abstracts in English and Chinese.<br>Acknowledgments --- p.i<br>摘要 --- p.ii<br>Abstract --- p.iii<br>Chapter Chapter 1 --- Introduction --- p.1<br>Chapter 1.1 --- Circuit switching and Packet switching --- p.2<br>Chapter 1.2 --- Virtual paths in high-speed networks --- p.6<br>Chapter 1.3 --- BEF in cross-path switch --- p.8<br>Chapter 1.4 --- Organization --- p.11<br>Chapter Chapter 2 --- Analysis models --- p.12<br>Chapter 2.1 --- Routing schemes in Clos network --- p.12<br>Chapter 2.2 --- Path Switching --- p.15<br>Chapter 2.3 --- Traffic Model of Input Modules --- p.17<br>Chapter 2.4 --- Traffic Model of Output Modules --- p.19<br>Chapter 2.5 --- Summary --- p.23<br>Chapter Chapter 3 --- Throughput Performance of Input Modules in Path Switching --- p.24<br>Chapter 3.1 --- Throughput performance vs. BEF --- p.24<br>Chapter 3.2 --- Throughput performance vs. number of virtual paths --- p.30<br>Chapter 3.2.1 --- Throughput performance vs. integer group size m/k --- p.33<br>Chapter 3.2.2 --- Throughput performance vs. group size 0<R<2 --- p.39<br>Chapter 3.2.3 --- Throughput performance vs. look-ahead scheme window size ω --- p.46<br>Chapter 3.3 --- Summary --- p.48<br>Chapter Chapter 4 --- Traffic Balancing Control in Path Switching --- p.50<br>Chapter 4.1 --- Loss Probability in Output Modules --- p.50<br>Chapter 4.1.1 --- Loss probability vs. number of central modules m --- p.51<br>Chapter 4.1.2 --- Loss probability vs. knockout group size R and cluster size g --- p.52<br>Chapter 4.2 --- Simulation Comparison of look-ahead scheme --- p.53<br>Chapter 4.3 --- Simulation result of throughput vs. BEF --- p.55<br>Chapter 4.4 --- Traffic Balancing Control --- p.55<br>Chapter 4.5 --- Summary --- p.53<br>Chapter Chapter 5 --- Conclusion --- p.60<br>Bibliography --- p.62
36
"Optical switch architectures based on conjugate networks." Thesis, 2007. http://library.cuhk.edu.hk/record=b6074205.
Full textAbstract:
Firstly, for a optical switch that suffers from the intrinsic crosstalk problem when two optical signals cross at the same switch element, active connections must be node-disjoint in the switching network to avoid crosstalk. Applying a sequence of decomposition and merge operations, called crosstalk-free conjugate transformation, on each switch element to tackle this problem, the network resulting from this transformation is called crosstalk-free conjugate network. By using the numbering schemes of networks, we prove that if the route assignments in the original network are link-disjoint, their corresponding ones in the conjugate network would be node-disjoint. Thus, traditional nonblocking switching networks can be transformed into crosstalk-free optical switches in a routine manner.<br>Furthermore, we show that crosstalk-free or wavelength interleaving multicast switches can also be obtained from existing nonblocking multicast switches via the same crosstalk-free or wavelength-interleaving conjugate transformation in a straightforward manner, respectively.<br>On the other hand, high speed and easy integrated arrayed waveguide gratings (AWGs) and tunable wavelength converters (TWCs) are promising optical devices to construct wavelength division multiplexing (WDM) optical switches. In order to practically realize a WDM switch, the core research issue is how to provide wavelength-interleaving connections throughout the entire switch network of these optical devices. In this way, the topological transformation consisting of decomposition and merge operations can convert nonblocking space-division networks into wavelength-interleaving conjugate networks. The principle of this transformation relies on the parallel characters of internal contentions of space switches and wavelength interferences of WDM switches. We show that any nonblocking route assignments in the original space-division network can be mapped into the conjugate network and become wavelength interleaving under this topological transformation.<br>The emerging all optical network (AON) calls for the realization of high speed (user data rates from 10 Mbps to 10 Gbps), high capacity (∼NTbps) transparent optical network. One of the major obstacles of AON is the deployment of high-speed optical switching systems that can switch optical signals at the rate of several terabits per second. In all optical switches constructed by different optical devices, the crosstalk or wavelength interference may happen when any two optical signals cross at a single optical device or when two signals carried by the same wavelength in a single link, respectively. In the past serval decades, the nonblocking electronic switching networks have been widely studied and a mature theory has been erected. In this thesis, we propose an easy-to-implement conjugate transformation applied to the traditional nonblocking switching networks in two opposite manners to tackle these two problems, respectively.<br>Deng Yun.<br>"January 2007."<br>Adviser: Tony Tong Lee.<br>Source: Dissertation Abstracts International, Volume: 68-09, Section: B, page: 6176.<br>Thesis (Ph.D.)--Chinese University of Hong Kong, 2007.<br>Includes bibliographical references (p. 101-108).<br>Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web.<br>Electronic reproduction. [Ann Arbor, MI] : ProQuest Information and Learning, [200-] System requirements: Adobe Acrobat Reader. Available via World Wide Web.<br>Abstract in English and Chinese.<br>School code: 1307.
37
"Implementation considerations of algebraic switching fabrics." 2002. http://library.cuhk.edu.hk/record=b6073472.
Full textAbstract:
by Zhu Jian.<br>"May 2002."<br>Thesis (Ph.D.)--Chinese University of Hong Kong, 2002.<br>Includes bibliographical references (p. 162-170).<br>Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web.<br>Mode of access: World Wide Web.<br>Abstracts in English and Chinese.
38
"Concentrators in large-scale packet switching." 2001. http://library.cuhk.edu.hk/record=b6073341.
Full textAbstract:
Lam Wan.<br>Thesis (Ph.D.)--Chinese University of Hong Kong, 2001.<br>Includes bibliographical references (p. 139-145).<br>Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web.<br>Mode of access: World Wide Web.<br>Abstracts in English and Chinese.
39
"Path switching over multirate Benes network." 2003. http://library.cuhk.edu.hk/record=b5891662.
Full textAbstract:
Mui Sze Wai.<br>Thesis (M.Phil.)--Chinese University of Hong Kong, 2003.<br>Includes bibliographical references (leaves 62-65).<br>Abstracts in English and Chinese.<br>Chapter 1. --- Introduction --- p.1<br>Chapter 1.1 --- Evolution of Multirate Networks --- p.2<br>Chapter 1.2 --- Some Results from Previous Work --- p.2<br>Chapter 1.3 --- Multirate Traffic on Benes Network --- p.5<br>Chapter 1.4 --- Organization --- p.7<br>Chapter 2. --- Background Knowledge on Benes Network and Path Switching --- p.8<br>Chapter 2.1 --- Benes Network --- p.9<br>Chapter 2.1.1 --- Construction of Large Switching Fabrics --- p.9<br>Chapter 2.1.2 --- Routing in Benes Network --- p.11<br>Chapter 2.1.3 --- Performance when Operated as a Large Switch Fabric --- p.13<br>Chapter 2.2 --- Path Switching --- p.14<br>Chapter 2.2.1 --- Basic Concept of Path Switching --- p.14<br>Chapter 2.2.2 --- Capacity Allocation and Route Assignment --- p.15<br>Chapter 3. --- Path Switching over Benes Network --- p.20<br>Chapter 3.1 --- The Model of path-switched Benes Network --- p.21<br>Chapter 3.2 --- Module-to-Module Implementation --- p.21<br>Chapter 3.2.1 --- The First Stage (Input Module) --- p.22<br>Chapter 3.2.2 --- The Middle Stage (Central Module) --- p.23<br>Chapter 3.2.3 --- The Last Stage (Output Module) --- p.24<br>Chapter 3.3 --- Port-to-Port Implementation --- p.24<br>Chapter 3.3.1 --- Uniform Traffic --- p.25<br>Chapter 3.3.2 --- Mult irate Traffic --- p.26<br>Chapter 3.4 --- Closing remarks --- p.29<br>Chapter 4. --- Performance Analysis --- p.31<br>Chapter 4.1 --- Traffic Constraints and Perform- ance Guarantees --- p.32<br>Chapter 4.1.1 --- Arrival Curve and Service Curve --- p.33<br>Chapter 4.1.2 --- Delay Bound and Backlog Bound --- p.36<br>Chapter 4.2 --- Service Guarantees --- p.39<br>Chapter 4.3 --- Deterministic Bounds --- p.42<br>Chapter 4.3.1 --- Delay --- p.42<br>Chapter 4.3.2 --- Backlog at Input Module --- p.44<br>Chapter 4.3.3 --- Backlog at Output Module --- p.47<br>Chapter 5. --- Simulation Results --- p.52<br>Chapter 5.1 --- Uniform Traffic --- p.53<br>Chapter 5.2 --- Multirate Traffic --- p.55<br>Chapter 6. --- Conclusions and Future Research --- p.59<br>Chapter 6.1 --- Suggestions for future research --- p.61<br>Bibliography --- p.62
40
"Switching considerations in storage networks." 2003. http://library.cuhk.edu.hk/record=b5891724.
Full textAbstract:
by Leung Yiu Tong.<br>Thesis (M.Phil.)--Chinese University of Hong Kong, 2003.<br>Includes bibliographical references (leaves 96-98).<br>Abstracts in English and Chinese.<br>Chapter 1. --- Introduction --- p.1<br>Chapter 1.1 --- Motivation --- p.1<br>Chapter 1.2 --- Thesis Organization --- p.3<br>Chapter 2. --- Storage Network Fundamentals --- p.4<br>Chapter 2.1 --- Storage Network Topology --- p.4<br>Chapter 2.1.1 --- Direct Attached Storage (DAS) --- p.5<br>Chapter 2.1.2 --- Network Attached Storage (NAS) --- p.7<br>Chapter 2.1.3 --- Storage Area Network (SAN) --- p.9<br>Chapter 2.1.3.1 --- SAN and the Fibre Channel Protocol --- p.11<br>Chapter 2.1.4 --- Summary on Storage Network Topology --- p.12<br>Chapter 2.2 --- Storage Protocol --- p.15<br>Chapter 2.2.1 --- Fibre Channel --- p.15<br>Chapter 2.2.1.1 --- Fibre Channel over IP (FCIP) --- p.17<br>Chapter 2.2.1.2 --- Internet Fibre Channel Protocol (iFCP) --- p.19<br>Chapter 2.2.2 --- Internet SCSI (iSCSI) --- p.20<br>Chapter 2.2.3 --- InfiniBand --- p.22<br>Chapter 2.2.4 --- Review on Storage Network Protocol --- p.25<br>Chapter 2.3 --- Standard Organization --- p.27<br>Chapter 2.4 --- Summary --- p.28<br>Chapter 3. --- Switching Design for Storage Networks --- p.30<br>Chapter 3.1. --- Shared Bus Design --- p.32<br>Chapter 3.2. --- Time Division Switch --- p.36<br>Chapter 3.3. --- Share Buffer Memory Switch --- p.37<br>Chapter 3.3.1 --- Parallel Memory Array --- p.40<br>Chapter 3.3.2 --- Distributive Storage --- p.43<br>Chapter 3.4. --- Crossbar Switch --- p.45<br>Chapter 3.4.1 --- Arbitrated Crossbar vs. Buffered Crossbar --- p.46<br>Chapter 3.4.1.1 --- Arbitrated Crossbar Switch --- p.47<br>Chapter 3.4.1.2 --- Buffered Crossbar Switch --- p.48<br>Chapter 3.4.2 --- Switch Scheduling --- p.49<br>Chapter 3.4.2.1 --- Bipartite Matching --- p.50<br>Chapter 3.4.2.2 --- Token-based Distributive Scheduling --- p.53<br>Chapter 3.4.2.3 --- Resource Counting using Semaphore --- p.56<br>Chapter 3.5. --- Algebraic Switches --- p.60<br>Chapter 3.5.1 --- Switching by Conditionally Nonblocking Properties --- p.61<br>Chapter 3.5.2 --- Self-Routing Mechanism with Zero-Bit Buffering --- p.64<br>Chapter 3.5.3 --- Multistage Interconnection of Self-routing Concentrators --- p.69<br>Chapter 3.6. --- Summary --- p.73<br>Chapter 4. --- Investigating Switching Issue in Storage Networks --- p.74<br>Chapter 4.1 --- Choosing a Suitable Switch --- p.74<br>Chapter 4.2 --- Quality of Service (QoS) --- p.76<br>Chapter 4.3 --- Multicasting --- p.77<br>Chapter 4.3.1 --- Crossbar Switch --- p.78<br>Chapter 4.3.2 --- Shared-Buffer Memory Switches --- p.80<br>Chapter 4.3.3 --- Algebraic Switch --- p.82<br>Chapter 4.3.4 --- Application on Multicast Transmission --- p.86<br>Chapter 4.4 --- Load Balancing Mechanism --- p.87<br>Chapter 4.5 --- Optimization on Storage Utilization --- p.91<br>Chapter 4.6 --- Summary --- p.93<br>Chapter 5. --- Conclusion and Summary of Original Contributions --- p.94
41
"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.<br>"May 2000."<br>Thesis (Ph.D.)--Chinese University of Hong Kong, 2000.<br>Includes bibliographical references (p. 135-144).<br>Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web.<br>Mode of access: World Wide Web.
42
"All-optical switching and variable delay using nonlinear optical signal processing techniques." 2008. http://library.cuhk.edu.hk/record=b5893658.
Full textAbstract:
Cheng, Lap Kei.<br>Thesis (M.Phil.)--Chinese University of Hong Kong, 2008.<br>Includes bibliographical references.<br>Abstracts in English and Chinese.<br>ABSTRACT --- p.I<br>摘要 --- p.II<br>ACKNOWLEDGEMENTS --- p.V<br>TABLE OF CONTENTS --- p.IV<br>INTRODUCTION --- p.0<br>Chapter 1.1 --- Different ways to achieve all-optical tunable delay --- p.2<br>Chapter 1.1.1 --- Optical buffer realized with optical switching --- p.2<br>Chapter 1.1.2 --- Slow light technique --- p.3<br>Chapter (i) --- Basics of slow light --- p.4<br>Chapter (ii) --- Slow light via electromagnetically induced transparency (EIT) --- p.6<br>Chapter (iii) --- Slow light via coherent population oscillation (CPO) --- p.7<br>Chapter (iv) --- Slow light via optical parametric amplification (OPA) --- p.8<br>Chapter (v) --- Slow light via stimulated Raman and Brillouin scattering --- p.8<br>Chapter 1.1.3 --- Tunable delay using wavelength conversion together with chromatic dispersion --- p.10<br>Chapter 1.1.4 --- Comparison of different schemes for constructing all-optical delay line --- p.11<br>Chapter 1.2 --- Overview of the thesis --- p.12<br>References --- p.14<br>ALL-OPTICAL SWITCHING OF DPSK SIGNAL IN AN SOA USING NONLINEAR POLARIZATION ROTATION --- p.18<br>Chapter 2.1 --- Introduction --- p.19<br>Chapter 2.2 --- Birefringence and nonlinear polarization rotation --- p.20<br>Chapter 2.3 --- Differential-phase-shift keying (DPSK) modulation format --- p.22<br>Chapter 2.4 --- Experimental setup --- p.23<br>Chapter 2.5 --- Experimental results --- p.25<br>Chapter 2.6 --- Conclusion --- p.29<br>References --- p.30<br>WIDEBAND SLOW LIGHT VIA STIMULATED BRILLOUIN SCATTERING IN AN OPTICAL FIBER USING A PHASE-MODULATED PUMP --- p.32<br>Chapter 3.1 --- Introduction --- p.33<br>Chapter 3.2 --- Stimulated Brillouin scattering (SBS) --- p.34<br>Chapter 3.3 --- Slow light via SBS --- p.35<br>Chapter 3.4 --- Experimental setup --- p.37<br>Chapter 3.5 --- Experimental result --- p.39<br>Conclusion --- p.42<br>References --- p.43<br>SIGNAL WAVELENGTH TRANSPARENT SBS SLOW LIGHT USING XGM BASED WAVELENGTH CONVERTER AND BRILLOUIN FIBER LASER --- p.45<br>Chapter 4.1 --- Introduction --- p.46<br>Chapter 4.2 --- Brillouin fiber laser and XGM wavelength converter --- p.47<br>Chapter 4.3 --- Operating principle --- p.50<br>Chapter 4.4 --- Experimental setup and results --- p.51<br>Conclusion --- p.56<br>References --- p.57<br>ALL-OPTICAL TUNABLE DELAY LINE FOR CHANNEL SELECTION IN A 40-GB/S OPTICAL TIME DIVISION MULTIPLEXING SYSTEM --- p.59<br>Chapter 5.1 --- Introduction --- p.60<br>Chapter 5.2 --- Principle of four-wave mixing --- p.61<br>Chapter 5.3 --- Channel selection in an OTDM system --- p.63<br>Chapter 5.4 --- Experimental setup --- p.64<br>Chapter 5.5 --- Experimental results --- p.67<br>Conclusion --- p.70<br>References --- p.71<br>TUNABLE OPTICAL DELAY WITH CSRZ-OOK TO RZ-OOK OPTICAL DATA FORMAT CONVERSION USING FOUR-WAVE MIXING WAVELENGTH CONVERSION AND GROUP VELOCITY DISPERSION --- p.73<br>Chapter 6.1 --- Introduction --- p.74<br>Chapter 6.2 --- Carrier-Suppressed Return-to-Zero --- p.76<br>Chapter 6.3 --- Operating Principle --- p.77<br>Chapter 6.4 --- Experimental setup --- p.79<br>Chapter 6.5 --- Experimental result --- p.81<br>Conclusion --- p.86<br>References --- p.87<br>CONCLUSION --- p.90<br>Chapter 7.1 --- Summary of work --- p.90<br>Chapter 7.2 --- Prospects of future work --- p.92<br>APPENDIX: LIST OF PUBLICATIONS A
43
"Call admission and routing in telecommunication networks." Chinese University of Hong Kong, 1994. http://library.cuhk.edu.hk/record=b5888234.
Full textAbstract:
by Kit-man Chan.<br>Thesis (M.Phil.)--Chinese University of Hong Kong, 1994.<br>Includes bibliographical references (leaves 82-86).<br>Chapter 1 --- Introduction --- p.1<br>Chapter 1.1 --- Overview of Integrated Service Digital Networks --- p.1<br>Chapter 1.2 --- Multirate Loss Networks --- p.5<br>Chapter 1.3 --- Previous Work --- p.7<br>Chapter 1.4 --- Organization --- p.11<br>Chapter 1.5 --- Publications --- p.12<br>Chapter 2 --- Call Admission in Multirate Loss Networks --- p.13<br>Chapter 2.1 --- Introduction --- p.13<br>Chapter 2.2 --- Two Adaptive Routing Rules --- p.15<br>Chapter 2.3 --- Call Admission Policies --- p.17<br>Chapter 2.4 --- Analysis of Call Admission Policies --- p.25<br>Chapter 2.4.1 --- "The CS, LO, GB and the EB Policies" --- p.25<br>Chapter 2.4.2 --- The DP Policy --- p.29<br>Chapter 2.5 --- Performance Comparisons --- p.32<br>Chapter 2.6 --- Concluding Remarks --- p.35<br>Chapter 3 --- Least Congestion Routing in Multirate Loss Networks --- p.41<br>Chapter 3.1 --- Introduction --- p.41<br>Chapter 3.2 --- The M2 and MTB Routings --- p.42<br>Chapter 3.2.1 --- M2 Routing --- p.43<br>Chapter 3.2.2 --- MTB Routing --- p.43<br>Chapter 3.3 --- Bandwidth Sharing Policies and State Aggregation --- p.45<br>Chapter 3.4 --- Analysis of M2 Routing --- p.47<br>Chapter 3.5 --- Analysis of MTB Routing --- p.50<br>Chapter 3.6 --- Numerical Results and Discussions --- p.53<br>Chapter 3.7 --- Concluding Remarks --- p.56<br>Chapter 4 --- The Least Congestion Routing in WDM Lightwave Networks --- p.60<br>Chapter 4.1 --- Introduction --- p.60<br>Chapter 4.2 --- Architecture and Some Design Issues --- p.62<br>Chapter 4.3 --- The Routing Rule --- p.66<br>Chapter 4.4 --- Analysis of the LC Routing Rule --- p.67<br>Chapter 4.4.1 --- Fixed Point Model --- p.67<br>Chapter 4.4.2 --- Without Direct-link Priority --- p.68<br>Chapter 4.4.3 --- With Direct-link Priority --- p.72<br>Chapter 4.5 --- Performance Comparisons --- p.73<br>Chapter 4.6 --- Concluding Remarks --- p.75<br>Chapter 5 --- Conclusions and Future Work --- p.79<br>Chapter 5.1 --- Future Work --- p.80
44
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 .<br>Thesis (Ph.D.)-University of Natal, Durban, 2002.
45
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.<br>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<br>M
46
Su, Xun. "Flow-based dynamic routing in uncertain network environments." Thesis, 2002. http://wwwlib.umi.com/cr/utexas/fullcit?p3110590.
Full text
47
Wang, Xiaolong. "Highly integrated polymer photonic switching and interconnects." Thesis, 2006. http://hdl.handle.net/2152/2983.
Full text
48
"BMSN and SpiderNet as large scale ATM switch interconnection architectures." 1997. http://library.cuhk.edu.hk/record=b5889309.
Full textAbstract:
by Kin-Yu Cheung.<br>Thesis (M.Phil.)--Chinese University of Hong Kong, 1997.<br>Includes bibliographical references (leaves 64-[68]).<br>Chapter 1 --- Introduction --- p.1<br>Chapter 1.1 --- Multistage Interconnection Architectures --- p.2<br>Chapter 1.2 --- Interconnection Topologies --- p.4<br>Chapter 1.3 --- Design of Switch Module-An Example of Multichannel Switch --- p.7<br>Chapter 1.4 --- Organization --- p.8<br>Chapter 1.5 --- Publication --- p.9<br>Chapter 2 --- BMSN and SpiderNet: Two Large Scale ATM Switches --- p.13<br>Chapter 2.1 --- Introduction --- p.13<br>Chapter 2.2 --- Architecture --- p.14<br>Chapter 2.2.1 --- Topology --- p.14<br>Chapter 2.2.2 --- Switch Modules --- p.15<br>Chapter 2.3 --- Routing --- p.17<br>Chapter 2.3.1 --- VP/VC Routing --- p.18<br>Chapter 2.3.2 --- VP/VC Routing Control --- p.22<br>Chapter 2.3.3 --- Cell Routing --- p.23<br>Chapter 2.3.4 --- Alternate Path Routing for Fault Tolerance --- p.24<br>Chapter 2.4 --- SpiderNet --- p.25<br>Chapter 2.5 --- Performance and Discussion --- p.26<br>Chapter 2.5.1 --- BMSN vs SpiderNet --- p.26<br>Chapter 2.5.2 --- Network Capacity --- p.29<br>Chapter 2.6 --- Concluding Remarks --- p.30<br>Chapter 3 --- Multichannel ATM Switching --- p.39<br>Chapter 3.1 --- Introduction --- p.39<br>Chapter 3.2 --- Switch Design --- p.40<br>Chapter 3.3 --- Channel Allocation Algorithms --- p.41<br>Chapter 3.3.1 --- VC-Based String Round Robin (VCB-SRR) Algorithm --- p.41<br>Chapter 3.3.2 --- Implementation of the VCB-SRR Algorithm --- p.43<br>Chapter 3.3.3 --- Channel Group Based Round Robin (CGB-RR) Algorithm --- p.50<br>Chapter 3.3.4 --- Implementation of the CGB-RR Algorithm --- p.51<br>Chapter 3.4 --- Performance and Discussion --- p.53<br>Chapter 3.5 --- Concluding Remarks --- p.57<br>Chapter 4 --- Conclusion --- p.62<br>Bibliography --- p.64
49
Michael, Aron Electrical Engineering & Telecommunications Faculty of Engineering UNSW. "MEMS micro-bridge actuator for potential application in optical switching." 2007. http://handle.unsw.edu.au/1959.4/40666.
Full textAbstract:
In this thesis, the development of a novel electro-thermally actuated bi-stable out-of-plane two way actuated buckled micro-bridge for a potential application in optical switching is presented. The actuator consists of a bridge supported by 'legs' and springs at its four corners. The springs and the bridge are made of a tri-layer structure comprising of 2.5??m thick low-stress PECVD oxide, 1??m thick high-stress PECVD oxide and 2??m thick heavily phosphorus doped silicon. The legs, on the other hand, are 2??m thick single layer heavily phosphorus doped silicon. Both legs and springs provide elastically constrained boundary conditions at the supporting ends, without of which important features of the micro-bridge actuator could not have been achieved. This microbridge actuator is designed, simulated using ANSYS, fabricated and tested. The results from the testing have shown a good agreement with analytical prediction and ANSYS simulation. The actuator demonstrated bi-stability, two-way actuation and 31??m out-of-plane movement between the two-states using low voltage drive. Buckled shape model, design method for bi-stability and thermo-mechanical model are developed and employed in the design of the micro-bridge. These models are compared with Finite Element (FE) based ANSYS simulation and measurements from the fabricated micro-bridge and have shown a good agreement. In order to demonstrate the potential application of this actuator to optical switching, ANSYS simulation studies have been performed on a micro-mirror integrated with the micro-bridge actuator. From these studies, the optimum micro-mirror size that is appropriate for the integration has been obtained. This optimal mirror size ensures the important features of the actuator. Mirror fabrication experiments in (110) wafer have been carried out to find out the appropriate compensation mask size for a given etch depth and the suitable wafer thickness that can be used to fabricate the integrated system.
50
"Study of wide-sense nonblocking switching networks from the approach of upper ideals." 2000. http://library.cuhk.edu.hk/record=b5890381.
Full textAbstract:
by Kwok Siu Yu.<br>Thesis (M.Phil.)--Chinese University of Hong Kong, 2000.<br>Includes bibliographical references (leaves 48-49).<br>Abstracts in English and Chinese.<br>Chapter 1 --- Introduction --- p.1<br>Chapter 1.1 --- Background of switching networks --- p.1<br>Chapter 1.2 --- Nonblocking properties of 3-stage networks --- p.5<br>Chapter 1.3 --- Wide-sense nonblocking networks --- p.10<br>Chapter 1.4 --- Routing algorithms by packing --- p.12<br>Chapter 2 --- The Concept of the Upper Ideals --- p.15<br>Chapter 3 --- "Routing algorithm over the network [6x10, 3x3, 10x6]" --- p.26<br>Chapter 4 --- Simulation Program (SP) --- p.30<br>Chapter 5 --- "Nonexistence of routing algorithm over the network [5x8, 3x3, 8x5]" --- p.35<br>Chapter 6 --- Packing algorithms --- p.42<br>Chapter 7 --- Summary and directions of further study --- p.47