Orientador : Helio Waldman / Tese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação / Made available in DSpace on 2018-08-04T03:23:02Z (GMT). No. of bitstreams: 1 AlmeidaJunior_RaulCamelodeAndrade_D.pdf: 6394727 bytes, checksum: 56d1667ed2e31b23492071088dcf7edf (MD5) Previous issue date: 2004 / Resumo: A combinação da comutação óptica de pacotes com a multiplexação por divisão de comprimento de onda (WDM) surge como um cenário promissor para as redes ópticas futuras. Um dos requisitos de projeto dessas redes é procurar minimizar a perda de pacotes quando há contendas pelos mesmos recursos. Uma alternativa é a utilização de armazenadores de pacotes ópticos, que fazem uso do domínio temporal para a resolução de contenção. Este trabalho propõe uma modelagem analítica para o desempenho desses dispositivos em redes ópticas assíncronas comutadas por pacote. Devido à inexistência de RAMs ópticas, os armazenadores de pacotes ópticos têm sido atualmente configurados por um conjunto de linhas de atraso capaz de prover um número finito de atrasos fixos. Considerando tal peculiaridade, uma contribuição adicional deste trabalho é a proposição e modelagem de duas políticas capazes de prover diferenciação de serviço em armazenadores de pacotes ópticos. Por fim, objetivando realizar um estudo comparativo entre três possíveis domínios de resolução de contenção, também são abordados os domínios espacial e do comprimento de onda, além da combinação entre eles e entre os domínios temporal e do comprimento de onda / Abstract: The combination of optical packet switching with wavelength division multiplexing (WDM) has emerged as a promising framework for future optical networks. One of the design requirements of these networks is to minimize the packet loss when there are contentions for the same resources. One possibility is to use optical buffers, which exploit the time domain for contention resolution. This work proposes an analytical modeling for the performance of such devices in asynchronous optical packet-switched networks. Due to the non-existence of optical RAMs, optical buffers have been designed using delay line banks that can provide a finite number of fixed delays. Considering such peculiarity, an additional contribution of this work is the proposal and modeling of two policies that can provide service differentiation in optical buffers. Lastly, in order to make a comparative study among three possible contention resolution domains, the space and wavelength domains are also analyzed, as well as their combinations and the combination between the time and wavelength domains / Doutorado / Telecomunicações e Telemática / Doutor em Engenharia Elétrica

M.Ing. / The Internet is evolving into a global communication infrastructure that is expected to support an overabundance of new applications such as IP telephony, interactive TV, and e-commerce. The existing best effort service is no longer sufficient. It is not enough to provide differentiated services and to meet QoS requirements of these different traffic types. As a result, there is an urgent need to provide more services that are powerful such as guaranteed services, flow protection etc, merged in one IP network, referred to as Integrated Services Packet-Switching Network (ISPN) in this thesis. To provide these services, QoS aware network architectures are required to implement the services. This dissertation presents a survey on two network architectures: Fair Queuing (FQ) and Scalable Core (SCORE), which attempt to provide QoS solutions in ISPN. We theoretically analyse scheduling as an important element in providing QoS in these architectures. The important thread in scheduling is performance and implementation complexity. SCORE based scheduling have less implementation complexity but cannot exactly match the high performance of FQ solutions, which suffer implementation complexity. The contribution of this work is a feedback protocol that minimises congestion in SCORE scheduling scheme called Core stateless fair queuing (CSFQ). The flow rates are adjusted by sending rate signal to a transmitting node from a receiving node, to adjust ill-behaved flow rate during congestion to a fair share rate of receiving node. We use CSFQ based theoretical analysis and simulations to demonstrate the performance of the feedback protocol.

No description available.

No description available.

A system composed of unreliable components can experience different levels of performance as its configuration changes due to failures and repairs. One approach used to measure overall system performance is to weight the level of performance measured for each system state by the probability that the system is in that state and then sum across all system states. Many performance measures have a transient behavior following a change in the state of the system. Because of the difficulty associated with transient analysis, the system is often assumed to be in steady state when measuring the performance for each system state. When this approach is used to analyze packet-switched communication networks, which consist of highly reliable high-speed links and switching nodes, it is argued that the steady-state assumption is justified on the basis of the large difference in rates of traffic-related events, such as call completions and packet transmissions, compared to component-related events, such as failures and repairs. To investigate the validity of this assumption, we define lower bounds for the length of the transient phase fol1owing link failures and repairs. For both cases, we obtain a distribution for the length of the lower bound. The transient phase is significant when its length exceeds a given fraction of the time until the next change in network state. Using the distributions for these lengths, we derive an expression for the probability that the transient phase is significant in terms of the amount of traffic on the link and the ratio of the rates for traffic-related events and network state changes. These results show that the difference in rates between traffic-related events and component related events is not enough by itself to justify the steady-state assumption. The amount of traffic carried on the link and the size of the network must also be considered. These results indicate some situations where the steady-state assumption is inappropriate. We also obtain sufficient conditions for transient-phase significance following link failures. Although these results do not indicate when it is safe to use the steady-state assumption, they provide a measure of the risk associated with using it. / Ph. D.

This research investigates the implementation and performance of packet video transfer over local area networks. A network architecture is defined for packet video such that most of the processing is performed by the higher layers of the Open Systems Interconnection (OSI) reference model, while the lower layers provide real-time services. Implementation methods are discussed for coding schemes, including data compression, the network interface unit, and the underlying local area network (LAN), Ethernet or the Fiber Distributed Data Interface (FDDI). Performance evaluation is presented using simulation results and analyses for different video sources, implementation models, and LAN s. The simulation experiments are performed for systems where video images are retrieved from databases at one or more servers and delivered over the local area network. / Master of Science

No description available.

This work develops an exact logical operation model to predict the performance of the all-optical shared-memory architecture (OSMA) class of packet switches and provides a means to obtain a reasonable approximation of OSMA switch performance within certain types of networks, including the Banyan family. All-optical packet switches have the potential to far exceed the bandwidth capability of their current electronic counterparts. However, all-optical switching technology is currently not mature. Consequently, all-optical switch fabrics and buffers are more constrained in size and can cost several orders of magnitude more than those of electronic switches. The use of shared-memory buffers and/or links with multiple parallel channels (channel grouping) have been suggested as ways to maximize switch performance with buffers of limited size. However, analysis of shared-memory switches is far more difficult than for other commonly used buffering strategies. Obtaining packet loss performance by simulation is often not a viable alternative to modeling if low loss rates or large networks are encountered. Published models of electronic shared-memory packet switches (ESMP) have primarily involved approximate models to allow analysis of switches with a large number of ports and/or buffer cells. Because most ESMP models become inaccurate for small switches, and OSMA switches, unlike ESMP switches, do not buffer packets unless contention occurs, existing ESMP models cannot be applied to OSMA switches. Previous models of OSMA switches were confined to isolated (non-networked), symmetric OSMA switches using channel grouping under random traffic. This work is far more general in that it also encompasses OSMA switches that (1) are subjected to bursty traffic and/or with input links that have arbitrary occupancy probability distributions, (2) are interconnected to form a network and (3) are asymmetric.

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.

<p>Routers are probably the most important component of a NoC, as the performance of the whole network is driven by the routers’ performance. Cost for the whole network in terms of area will also be minimised if the router design is kept small. A new application specific processor architecture for implementing NoC routers is proposed in this master thesis, which will be called µNP (Micro-Network Processor). The aim is to offer a solution in which there is a trade-off between the high performance of routers implemented in hardware and the high level of flexibility that could be achieved by loading a software that routed packets into a GPP. Therefore, a study including the design of a hardware based router and a GPP based router has been conducted. In this project the first version of the µNP has been designed and a complete instruction set, along with some sample programs, is also proposed. The results show that, in the best case for all implementation options, µNP was 7.5 times slower than the hardware based router. It has also behaved more than 100 times faster than the GPP based router, keeping almost the same degree of flexibility for routing purposes within NoC.</p>