"The Internet has assumed the role of the underlying communication network for applications such as file transfer, electronic mail, Web browsing and multimedia streaming. Multimedia streaming, in particular, is growing with the growth in power and connectivity of today's computers. These Internet applications have a variety of network service requirements and traffic characteristics, which presents new challenges to the single best-effort service of today's Internet. TCP, the de facto Internet transport protocol, has been successful in satisfying the needs of traditional Internet applications, but fails to satisfy the increasingly popular delay sensitive multimedia applications. Streaming applications often use UDP without a proper congestion avoidance mechanisms, threatening the well-being of the Internet. This dissertation presents an IP router traffic management mechanism, referred to as Crimson, that can be seamlessly deployed in the current Internet to protect well-behaving traffic from misbehaving traffic and support Quality of Service (QoS) requirements of delay sensitive multimedia applications as well as traditional Internet applications. In addition, as a means to enhance Internet support for multimedia streaming, this dissertation report presents design and evaluation of a TCP-Friendly and streaming-friendly transport protocol called the Multimedia Transport Protocol (MTP). Through a simulation study this report shows the Crimson network efficiently handles network congestion and minimizes queuing delay while providing affordable fairness protection from misbehaving flows over a wide range of traffic conditions. In addition, our results show that MTP offers streaming performance comparable to that provided by UDP, while doing so under a TCP-Friendly rate."

Ce travail de thèse s’est tout d’abord attaché à comprendre comment la prise en compte du temps de téléchargement, autrement dit, de la latence, lors de la mise en cache ou de la transmission de données pouvait contribuer aux performances du téléchargement dans les réseaux de caches dont ICN. Nous y introduisons un mécanisme distribué novateur qui décide de l’opportunité de conserver un objet en considérant que plus il a été long à télécharger plus intéressant il semble de le soumettre au cache sous-jacent. Nous montrons que ce nouveau mécanisme surpasse en de nombreux points l’état de l’art, que ce soit du point de vue de la réduction du temps moyen de téléchargement à partir de caches LRU, et de son écart-type (jusqu’à −60% ), que de celui de la vitesse de convergence vers ceux-ci. Dans une seconde phase, nous avons optimisé conjointement les fonctions de mises en cache et de distribution multi-chemin de requêtes de contenus. Troisièmement, nous avons étudié l’équité vis-à-vis des contenus au sein des réseaux de caches et plus particulièrement, d’ICN. Il en ressort que seule suffit une allocation équitable de la bande passante entre les contenus pour que l’équité d’ICN soit complète. Notre dernière contribution vise à aider au passage à l’échelle d’ICN dans contexte où deviennent réalités l’Internet des Objets et son espace de nommage illimité. Nous avons proposé une approche nouvelle au routage dans les réseaux centrés sur l’information, nommée AFFORD, qui combine apprentissage automatique et diffusion aléatoire. / This thesis investigates how making content caching and forwarding latency-aware can improve data delivery performance in Information-Centric Networks (ICN). We introduce a new mechanism that leverages retrieval time observations to decide whether to store an object in a network cache, based on the expected delivery time improvement. We demonstrate that our distributed latency-aware caching mechanism, LAC+, outperforms state of the art proposals and results in a reduction of the content mean delivery time and standard deviation of LRU caches by up to 60%, along with a fast convergence to these figures. In a second phase, we conjointly optimize the caching function and the multipath request forwarding strategies. To this purpose, we introduce the mixed forwarding strategy LB-Perf, directing the most popular content towards the same next hops to foster egress caches convergence, while load-balancing the others. Third, we address ICN fairness to contents. We show that traditional ICN caching, which favors the most popular objects, does not prevent the network from being globally fair, content-wise. The incidence of our findings comforts the ICN community momentum to improve LFU cache management policy and its approximations. We demonstrate that in-network caching leads to content-wise fair network capacity sharing as long as bandwidth sharing is content-wise fair. Finally, we contribute to the research effort aiming to help ICN Forwarding Information Base scale when confronted to the huge IoT era’s namespace.We propose AFFORD, a novel view on routing in named-data networking that combines machine learning and stochastic forwarding.

As traditional TV-broadcasters utilize the Internet to transport video streams, they often employ third party distribution networks to ensure that the Quality of Service of the packet stream remain high. In the last step of such a distribution network, a playout scheduler will schedule the packets so that their intervals are as close as possible to the intervals with which they were initially sent by the source. This is done with the aim to minimize the amount of packet delay variation experienced by the final destination. Due to the source and distribution network not always being synchronized to the same reference clock, reconstructing the packet intervals back into the initial values is subject to the issue of clock skew; the clocks run at different frequencies. In the presence of clock skew, each packet interval will be reconstructed with a slight error, which will accumulate throughout the packet stream. This thesis evaluates how clock frequency ratio estimators can be implemented as part of the playout scheduler, allowing it to better reconstruct the packet intervals in the face of clock skew. Two clock frequency ratio estimators presented in the literature are implemented as a part of playout schedulers, and their use in the context of a video distribution network is evaluated and compared to other playout schedulers. All in all, four of the considered playout schedulers employ clock frequency ratio estimation, and four do not. The playout schedulers are tested on a test bed consisting of two unsynchronized computers, physically separated into a source and a destination connected via Ethernet, to ensure the presence of clock skew. The source generates a video stream, which is sent to the destination. The destination is responsible for packet interval reconstruction and data collection, that allows for comparison of the eight playout schedulers. Each playout scheduler is evaluated under three different network scenarios, each network scenario with increasing amounts of packet delay variation added to the packet stream. The results show that the Cumulative Ratio Scaling with Warm-up scheduler, which employs a clock frequency ratio estimator based on accumulating inter-packet times, performs well under all three network scenarios. The behaviour of the playout scheduler is predictable and the frequency ratio estimate seems to converge towards the true clock frequency ratio as more packets arrive at the playout scheduler. While this playout scheduler is not perfect, its behaviour shows promise in being extended. / När traditionella TV-bolag sänder från avlägsna platser skickas ofta videoströmmen till huvudanläggningen via Internet. För att säkerställa att paketströmmen levereras till huvudanläggningen med hög kvalitet används ofta distributionsnätverk som tillhandahålls av en tredje part. Det sista steget i ett sådant distributionsnätverk utgörs av en utspelningsschemaläggare som schemalägger paketen så att de skickas ut med intervall så lika som möjligt de intervall paketen ursprungligen skickades med, en så kallad återkonstruktion av paketintervallen. Detta görs för att minimera mängden fördröjningsvariation som upplevs av den slutgiltiga destinationen. På grund av att källan och distributionsnätverket inte alltid är synkroniserade till samma referensklocka kommer återkonstruktionen av paketintervallen påverkas av klockskevning; klockorna i källan och det sista steget i distributionsnätverket går i olika takt. Klockskevningen innebär att varje paketintervall återskapas med ett litet fel – ett fel som ackumuleras över tid. Denna uppsats utvärderar hur klockfrekvensratiouppskattare kan användas i en utspelningsschemaläggare, och huruvida uppskattaren kan bidra till att bättre återkonstruera paketintervallen. Två uppskattare som presenterats i tidigare forskning implementeras i utspelningsschemaläggare, och dess användbarhet utvärderas och jämförs inom kontexten för videodistributionsnätverk. Fyra av de utvärderade utspelningsschemaläggarna använder sig av uppskattare och fyra gör det inte. Utspelningsschemaläggarna testas på en testbädd bestående av två osynkroniserade datorer, sammankopplade via Ethernet, för att säkerställa förekomsten av klockskevning. Källan skickar en videoström till destinationen, som i sig ansvarar för återkonstruktion av paketintervallen samt insamling av den data som möjliggör jämförelser mellan de åtta utspelningsschemaläggarna. Varje utspelningsschemaläggare testas under tre olika nätverksscenarion, där varje nätverksscenario utsätter paketströmmen för olika grader av fördröjningsvariation. Resultaten visar att en av utspelningsschemaläggarna, som använder en uppskattare där paketintervall ackumuleras över tid, presterar bra under alla tre nätverksscenarion. Schemaläggaren beter sig förutsägbart, och uppskattningen av klockfrekvensration verkar konvergera till den sanna klockfrekvensration i takt med att allt fler paket inkluderas i beräkningen. Utspelningsschemaläggaren är inte perfekt, men uppvisar lovande beteende för framtida förbättringar.

With a new United States Army initiative to exploit commercially developed information technology, there is a heightened interest in using Internet protocols over the military's geosynchronous satellite links. TCP is the dominant Internet protocol used for reliable data exchange, but its own design limits performance when used over long delay network links such as satellites. Initially this research set out to compare TCP with another proposed protocol, the Satellite Transport Protocol (STP). However through a series of tests, we found that STP does not fulfill its claims of increased throughput over TCP and uncovered a flaw in STP's founding research. In addition, this thesis proposes and demonstrates novel performance enhancing techniques that significantly improve transport protocol throughput.

No description available.

The master’s thesis focuses on the virtual local computer network for laboratory usage. It aims to propose and realize proper network connection in order to monitor expected data flow. Thanks to the network analysers (software ClearSight and hardware NetTool Series II) it plans to pursue in detail the used transmission protocols of TCP/IP layers. The most decisive feature happens to be the right choice of appropriate network components and their precise configuration. Consequently, the thesis formulates a proposal of a laboratory task for the needs of students, which is also closely related to the actual problems. The assignment of the task will serve the teachers as a test pattern for measurement. The results elaborated in the form of the model protocol should enable later comparison of the recorded data. Another part of the diploma thesis is the working-out of well arranged manuals for the network analysers involved.