The use of permutations in data compression is an aspect that is worthy of further exploration. The work that has been done in video compression based on permutations was primarily oriented towards lossless algorithms. The study of previous algorithms has led to a new algorithm that could be either lossless or lossy, for which the amount of compression and the quality of the output can be controlled. The lossless version of our algorithm performs close to lossy versions of H.264 and it improves on them for the majority of the videos that we analyzed. Our algorithm could be used in situations where there is a need for lossless compression and the video sequences are part of a single scene, e.g., medical videos, where loss of information could be risky or expensive. Some results on permutations, which may be of independent interest, arose in developing this algorithm. We report on these as well. / by Amalya Mihnea. / Thesis (Ph.D.)--Florida Atlantic University, 2011. / Includes bibliography. / Electronic reproduction. Boca Raton, Fla., 2011. Mode of access: World Wide Web.

Objetivos generales: - Investigar los aspectos vinculados a la obtención de servicios de streaming, el modelado de redes de datos y la caracterización del tráfico allí cursado. - Determinar un mecanismo que permita establecer un orden entre los nodos que brindan un determinado servicio o recurso deseado en una red "best effort" como es Internet Objetivos específicos: - Armar una taxonomía de los servicios que se pueden brindar en redes IP. - Analizar diferentes formas de modelizar redes de datos, de manera tal que resulte lo más fiel posible a la realidad de una red como Internet, en cuanto a topología, velocidad de enlaces, agregación y caracterización del tráfico, congestión, etc. - Diagramar y ejecutar simulaciones, en un modelo de red, que permitan cuantificar parámetros de comunicación (bandwidth, delay, jitter, packet loss) en diferentes tipos de servicios que se pueden brindar en dicha red. - Establecer un criterio que permita ordenar los nodos que ofrecen el servicio deseado considerando los resultados de las simulaciones abordadas.

El presente trabajo pretende analizar las distintas alternativas que ofrece el mercado y analizar los accesos a las redes. A esto se asocian diversos productos y tecnologías, y los estándares no están aun definidos en un mercado que es extremadamente difícil de entender. Esta confusión lleva a ideas confusas, mucha gente toma pedazos de información que oyen y forman juicios incorrectos de qué pueden hacer los productos y qué amenazas tratan realmente.

In der heutigen, digitalisierten Gesellschaft ist es für Internet Service Provider (ISP) zunehmend wichtig, den ansteigenden Anforderungen ihrer Endnutzer gerecht zu werden. Eine Möglichkeit diese Herausforderung zu adressieren ist es, die vorhandene Netzwerkinfrastruktur durch den Einsatz von Traffic Engineering Technologien möglichst effizient zu betreiben. Segment Routing (SR) bietet eine elegante Möglichkeit Traffic Engineering einzusetzen ohne viel Overhead zu erzeugen. Obwohl es bereits verschiedene Ansätze zum SR Traffic Engineering gibt, verbleiben die meisten dieser Arbeiten auf einer sehr theoretischen Ebene und versäumen es, praktische Anforderungen und Nebenbedingungen zu erkennen und miteinzubeziehen. Diese Dissertation schließt die Lücke zwischen Theorie und Praxis, indem die spezifischen Anforderungen eines Tier 1 ISPs identifiziert werden, neue Optimierungsmodelle kreiert werden, welche ebendiese Nebenbedingungen erfüllen, und, schlussendlich, eine detaillierte Evaluation mittels realer Messdaten von selbigem ISP durchgeführt wird. Die Optimierungsmodelle berücksichtigen praktisch relevante Anforderungen wie die Minimierung der Anzahl der verwendeten SR Tunnel und SR Label, die proaktive Minimierung von Überlast in einer Vielzahl verschiedener Fehlerszenarien und weitere. Es wird darüber hinaus gezeigt, dass SR Optimierungen größtenteils unabhängig von der zugrundeliegenden Linkmetrikkonfiguration funktioniert und dass SR das Potential aufweist, Routingkonfigurationen zu erzeugen, die für längere Zeitabschnitte stabil bleiben.

>Magister Scientiae - MSc / This thesis validates that packet aggregation is a viable technique to increase call ca-pacity for Voice over Internet Protocol over wireless mesh networks. Wireless mesh networks are attractive ways to provide voice services to rural communities. Due to the ad-hoc routing nature of mesh networks, packet loss and delay can reduce voice quality.Even on non-mesh networks, voice quality is reduced by high overhead, associated with the transmission of multiple small packets. Packet aggregation techniques are proven to increase VoIP performance and thus can be deployed in wireless mesh networks. Kernel level packet aggregation was initially implemented and tested on a small mesh network of PCs running Linux, and standard baseline vs. aggregation tests were conducted with a realistic voice tra c pro le in hop-to-hop mode. Modi cations of the kernel were then transferred to either end of a nine node 'mesh potato' network and those tests were conducted with only the end nodes modi ed to perform aggregation duties. Packet ag- gregation increased call capacity expectedly, while quality of service was maintained in both instances, and hop-to-hop aggregation outperformed the end-to-end con guration. However, implementing hop-to-hop in a scalable fashion is prohibitive, due to the extensive kernel level debugging that must be done to achieve the call capacity increase.Therefore, end-to-end call capacity increase is an acceptable compromise for eventual scalable deployment of voice over wireless mesh networks.

A substantial increase in the number of internet users and the traffic volume bring new challenges for network router design. The current routers need to support higher link data rates and large number of line cards to accommodate the growth of the internet traffic, which necessitate an increase in physical space, power and memory use. Packet forwarding, which is one of the major tasks of a router, has been a performance bottleneck in internet infrastructure. In general, most of the packet forwarding algorithms are implemented in software. However, hardware based solutions has also been popular in recent years because of their high throughput performance. Besides throughput, memory efficiency, incremental/dynamic updates and power consumption are the basic performance challenges for packet forwarding architectures. Hardware-based packet forwarding engines for network routers can be categorized into two groups that are ternary content addressable memory (TCAM) based and dynamic/static random access memory (DRAM/SRAM) based solutions. TCAM-based architectures are simple and hence popular solutions for today&rsquo / s routers. However, they are expensive, power-hungry, and oer little adaptability to new addressing and routing protocols. On the other hand, SRAM has higher density, lower power consumption, and higher speed. The common data structure used in SRAM-based solutions for performing longest prefix matching (LPM) is some type of a tree. In these solutions, multiple memory accesses are required to find the longest matched prefix. Therefore, parallel and pipelining techniques are used to improve the throughput. This thesis studies TCAM and SRAM based parallel and pipelined architectures for high performance packet forwarding. We proposed to use a memory efficient disjoint prefix set algorithm on TCAM based parallel IP packet forwarding engine to improve its performance. As a fundamental contribution of this thesis, we designed an SRAM based parallel, intersecting and variable length multi-pipeline array structure (SAFIL) for trie-based internet protocol (IP) lookup. We also proposed a novel dual port SRAM based high throughput IP lookup engine (SAFILD) which is built upon SAFIL. As an alternative to traditional binary trie, we proposed a memory efficient data structure called compact clustered trie (CCT) for IP lookup. Furthermore, we developed a novel combined length-infix pipelined search (CLIPS) architecture for high performance IPv4/v6 lookup on FPGA. Finally, we designed a memory efficient clustered hierarchical search structure (CHSS) for packet classification. A linear pipelined SRAM-based architecture for CHSS which is implemented on FPGA is also proposed.

No description available.

No description available.

No description available.