No description available.

Nowadays in mobile and wireless networks environment, Mobile IP is the preferred standard in supporting IP mobility among several standards. However, several problems still need to be solved. One of them is the triangle routing problem. Although drafts have been proposed by the IETF (Internet Engineering Task Force) for solving this problem, the proposed solution can not be achieved unless the draft of the Mobile IP route optimization method becomes a typical standard of the Mobile IP. In this paper, we present an extended routing agent architecture to solve this problem. The Middle Mobility Agent (MMA) in the proposed architecture can intercept datagrams earlier and determine to tunnel the incoming packet or not than the MH¡¦s original home agent. This architecture can solve the triangle routing problem by reducing packet¡¦s routing length. An analytical model and a simulation environment were set up to evaluate and measure the packet¡¦s routing length and delay time of proposed architecture. The evaluation and simulation results demonstrate that the proposed method can reduce the routing length, delay time and solve the triangle routing problem.

In this thesis, we focus on the design of the fault-tolerant routing algorithm for the (n, k)-star graph. We apply the idea of collecting the limited global information used for routing on the n-star graph to the (n, k)-star graph. First, we build the probabilistic safety vector (PSV) with modified cycle patterns. Then, our routing algorithm decides the fault-free routing path with the help of PSV. In order to improve the routing performance with more faulty nodes, we dynamically assign the threshold for our routing algorithm. The performance is judged by the average length of routing paths. Compared with distance first search and safety level, we get the best performance in the simulations.

The objective of this thesis is to develop circuit-aware interconnect technology optimization for network-on-chip based many-core architectures. The dimensions of global interconnects in many-core chips are optimized for maximum bandwidth density and minimum delay taking into account network-on-chip router latency and size effects of copper. The optimal dimensions thus obtained are used to characterize different network-on-chip topologies based on wiring area utilization, maximum core-to-core channel width, aggregate chip bandwidth and worse case latency. Finally, the advantages of many-core many-tier chips are evaluated for different network-on-chip topologies. Area occupied by a router within a core is shown to be the bottleneck to achieve higher performance in network-on-chip based architectures.

<p>Arbetet tar upp BGP-multihoming för mindre organisationer. Den jämför ett kommersiell alternativ mot open source-alternativ. Detta är för att se vad som krävs en av open source-lösning för ge konkurrens på routermarknaden, samt besparingar för organisationer som ska använda denna lösning.Praktiska och teoretiska jämförelser görs där Cisco-lösningar jämförs med OpenBGPD. Datan utifrån dessa tester används för att svara på problemfrågan. Sammanfattningsvis har open source produkter en fördel hårdvarumässigt på grund av lägre kostnader medan kommersiella har stora fördelar då de förlitar sig på nyare standarder.</p>

<p>Technology has reached a point where it has become feasible to develop unmanned aerial vehicles (UAVs), that is aircraft without a human pilot on board. Given that future UAVs can be autonomous and cheap, applications of swarming UAVs are possible. In this thesis we have studied a reconnaissance application using swarming UAVs and how these UAVs can communicate the reconnaissance data. To guide the UAVs in their reconnaissance mission we have proposed a pheromone based mobility model that in a distributed manner guides the UAVs to areas not recently visited. Each UAV has a local pheromone map that it updates based on its reconnaissance scans. The information in the local map is regularly shared with a UAV’s neighbors. Evaluations have shown that the pheromone logic is very good at guiding the UAVs in their cooperative reconnaissance mission in a distributed manner.</p><p>Analyzing the connectivity of the UAVs we found that they were heavily partitioned which meant that contemporaneous communication paths generally were not possible to establish. This means that traditional mobile ad hoc network (MANET) routing protocols like AODV, DSR and GPSR will generally fail. By using node mobility and the store-carry-forward principle of delay-tolerant routing the transfer of messages between nodes is still possible. In this thesis we propose location aware routing for delay-tolerant networks (LAROD). LAROD is a beacon-less geographical routing protocol for intermittently connected mobile ad hoc networks. Using static destinations we have shown by a comparative study that LAROD has almost as good delivery rate as an epidemic routing scheme, but at a substantially lower overhead.</p> / Report code: LiU-Tek-Lic-2008:14

Während sich der Chemnitzer Linux-Tag über die vergangenen fünf Jahre mit jedem Mal in der Zahl der Aussteller, Helfer und Gäste steigerte, wuchs auch in jedem Jahr das Tagungsnetzwerk. Den Informatikern wird häufig nachgesagt, daß sie wenig dokumentieren würden. Dieses Vorurteil traf auch für das Netzwerk der vergangenen Chemnitzer Linux-Tage zu. Unter anderem, um diesem Mißstand abzuhelfen, haben wir uns bemüht, möglichst detailliert Informationen über Konzept, eingesetzte Technologieen und konkrete Konfiguration des Tagungsnetzwerks des Chemnitzer Linux-Tags 2004 zusammenzutragen.

Das Chemnitzer StudentenNetz (CSN) verwaltet ein mittelgroßes Netzwerk in den Wohnheimen des Studentenwerkes Chemnitz-Zwickau. Mitarbeitern und Interessenten erhalten einen Überblick und Einblick in die vorhandene Netzstruktur und die Konfiguration der verwendeten Technik. Es wird auch auf mögliche Szenarien für zukünftige Entwicklungen eingegangen.

Diese Diplomarbeit beschreibt eine Software zur dreidimensionalen Visualisierung der Vorgänge in Computernetzwerken. Dabei werden die Protokolle TCP, UDP, IP, ARP und Ethernet grafisch veranschaulicht. Das Programm stellt außerdem Routing und NAT (Network Address Translation) dar. Zusätzlich gibt es drei von der Software erstellte Videos (je 2 - 15 MB).

Im Rahmen dieser Studienarbeit soll die Bedeutung klassenbasierter Anschlüsse im Chemnitzer Studenten Netz untersucht und Tools bereitgestellt werden, welche eine weitgehend automatisierte Anlage/Verwaltung solcher Netzklassen ermöglichen.