A Transponder for Gigabit Ethernet over WDM

WDM networks are increasingly gaining popularity as the backbone networks all over the world. In WDM network planning, electronic equipments like ADMs contribute heavily towards the capital expenditure of the network (Each ADM costs $50,000-$200,000). In WDM rings, determining minimum number of ADMs is NP-Hard. All the previous works have focused on Wavelength Assignment problem by keeping the routing fixed. In this paper, we suggest an integrated topology independent procedure called M3AWI (Minimum Average Minimum Weight Minimum Intersection). M3AWI is used to solve problems on four different types of routing namely, clockwise routing, Anti-clockwise routing, shortest-path routing, and hybrid routing. Our experimental results show that the combined Routing and Wavelength assignment (RWA) algorithms on an average save around 10% of the ADMs.We have also shown that the distribution of lightpaths is an important parameter to the service providers for selecting a routing policy.

Cluster computing imposes heavy demands on the communication network. Gigabit Ethernet technology can provide the required bandwidth to meet these demands. However, it has also shifted the communication bottleneck from network media to protocol processing. In this paper, we present an overview of Gigabit Ethernet technology and study the end-to-end Gigabit Ethernet communication bandwidth and latency. Performance graphs are collected using Net Pipe which clearly show the performance characteristics of TCP/IP over Gigabit Ethernet. These indicate the impact of a number of factors such as processor speeds, network adaptors, versions of the Linux Kernel and device drivers, and TCP/IP tuning on the performance of Gigabit Ethernet between two Pentium 11/350 PCs. Among the important conclusions are the marked superiority of the 2.1.121 and later development kernels and 2.2x production kernels of Linux and that the ability to increase the MTU beyond the Ethernet standard of 1500 could significantly enhance the throughput attainable.

Deployment of Gigabit Ethernets in metropolitan areas creates new opportunities to save costs by converging data and telephone services. The primary question of our study is whether emerging metropolitan networks can meet the QoS requirements necessary to connect GSM and UMTS base stations. These requirements on delay, jitter, and loss are significantly more stringent than the ones for VoIP and have to be met at the presence of bursty cross traffic. Therefore, we have probed ETH's campus network which spans the metropolitan area of Zurich with traffic comparable to encapsulated E1 traffic from base stations and have measured perceived QoS. Our findings show that the campus network generally meets the QoS requirements. However, the perceived QoS degrades with increasing network utilization.To further investigate the impact of the configuration of Ethernet switches on perceived QoS, we have conducted a simulation study. The results show that the perceived QoS is better when switch buffers are limited to small sizes of 1 MB compared to setups where the number of frames in the buffer is limited. From these results we infer that metropolitan Gigabit Ethernets are well suited for connecting GSM and UMTS base stations.

Optical Lattice-Type Add–Drop Multiplexing Filters and Their Use in WDM Networks

Grooming of multicast sessions in metropolitan WDM ring networks

This paper reports recent work on gigabit Ethernet interconnection communication traffic analysis. We proposed and demonstrated the system concept of gigabit Ethernet communication. 1.25Gbps, 10Gpbs and 40Gpbs gigabit Ethernet interconnection networks are considered for computer communications. Various switching structures, such as crossbar, double crossbar (Dcrossbar), Modified Dilated Benes (MDB), General MDB (GMDB), Benes, Dilated Benes (Dbenes), Tree architecture, Simplified tree (Stree), Extended baseline network (Ebaseline) are analyzed for searching the optimal performance of gigabit Ethernet communication. The numerical results for computation information transferring can be applied to search a best strategy for gigabit Ethernet communication networks interconnections.

With the advent of Gigabit Ethernet network technology, a new contender for the next-generation cluster interconnect is on the horizon. We benchmark Gigabit Ethernet and compare it to other cluster interconnects, namely Fast Ethernet, Myrinet and Scalable Coherent Interface. For a meaningful comparison, benchmark experiments are carried out at two levels: TCP/IP networking and MPI parallel programming. Using high-end PCs (Pentium III 450 MHz) and standard system software (Linux and MPICH), our results show that with Gigabit Ethernet, end-to-end throughputs of up to 44 MBytes per second can be achieved. A change from Fast Ethernet to Gigabit Ethernet resulted in performance gains of up to a factor of 5.05 for ftp, up to a factor of 3.10 for MPI point-to-point communication and up to a factor of 2.58 for some NAS parallel benchmarks, depending on communication granularity and message size. Further performance gains seem to require improved protocol processing and node hardware (memory bandwidth, file system, PCI bus).

The laser behavior of reflective semiconductor optical amplifier self-seeded sources is investigated. 2.5-Gb/s transmission is realized with optical cavities of 10, 26, 100, and 125 km for access and metropolitan networks, realizing the longest amplified self-seeded external cavity laser. Moreover, Gigabit Ethernet, common public radio interface, and 2.5-Gb/s transmissions are experimented using amplified self-seeded reflective semiconductor optical amplifier wavelength division multiplexing passive optical networks systems. A field trial setup is exploited to test the system performance in terms of reach and optical budget.

Performance of 1 and 10 Gigabit Ethernet cards with server quality motherboards

We address the multicast issue in a wide area WDM network in which a source broadcasts its message to some sites in the network. This problem can be formalized as the following optimal multicast tree problem. Given a directed graph G = (V, E) with a source s and a set S of nodes, assume that every node in S (⊂ V) is reachable from s. Associated with every link e ∈ E, there is a set Λ(e) of available wavelengths on it, |V| = n and |E| = m, find a multicast tree rooted at s including all the nodes in S with minimizing the cost of the tree, in terms of the sum of the cost of wavelength conversion at nodes and the cost of using wavelengths on links in the tree. That is, not only do we need to find a directed tree rooted at s, but also do we need to assign a specific wavelength Λ ∈ Λ(e) to every tree edge e and to set the switches at every node in the tree. Since this problem is NP-complete, it is unlikely that there is a polynomial algorithm to find an exact solution for it. Instead, we first present an approximation algorithm for the problem which runs in time O(k2n + km +kn log(kn) + (kn)1/e|S|), and delivers a solution within O(|S|e) of the optimal, for any fixed 0 > e ≤ 1. We then present a distributed version of the proposed algorithm. The communication and time complexities of the distributed algorithm are O(km) and O(kn) respectively, and the solution delivered is |S| times of the optimal, where k is the number of wavelengths in the network. Finally, we conduct some experiments to verify the applicability of the proposed algorithms. The experimental results matches our algorithmic claims.

Time synchronization is a critical feature for many scientific facilities and industrial infrastructures. The required performance is progressively increasing everyday, for instance, few tens of nanoseconds for Fifth Generation (5G) networks or sub-nanosecond accuracy on next family of particle accelerators and astrophysics telescopes. Due to this exigent accuracy, many applications require specific timing dedicated networks, increasing the system cost and complexity. Under this context, the new IEEE 1588-2019 High Accuracy (HA) default profile is intensively based on White Rabbit (WR) which can provide sub-nanosecond accurate synchronization for Ethernet networks. However, current WR solutions have not been designed to work properly with high data bandwidth delivery services even in 1 Gigabit Ethernet (GbE) links. On this contribution, the authors propose a new architecture design that enables WR and, consequently, the IEEE 1588-2019 HA profile to be deployed over 10 GbE links solving the already identified data bandwidth problem. Furthermore, this work addresses different experiments needed to characterize the system performance in terms of time synchronization and data transfer. As final result, this contribution presents for the first time in the literature a new WR system which allows high bandwidth data exchange in 10 GbE networks while providing sub-nanosecond accuracy synchronization. The proposed solution maintains the time synchronization performance of existing WR 1 GbE devices with significant advantages in terms of latency and data bandwidth, enabling its deployment in applications that integrate data and synchronization information in the same network.

This paper presents a performance study of a nonrigid registration algorithm for investigating lung disease on clusters. Our algorithm combines two conventional acceleration techniques in order to achieve fast registration: a data-parallel processing technique for accelerating the registration procedure; and a precomputation technique for reducing the computational complexity. We perform some experiments on three clusters with different CPU and network performance in order to make clear what kinds of acceleration techniques and computing environments provide higher performance. The results show that a cluster with Gigabit Ethernet (GbE) network is the most cost effective solution that reduces registration time from ten hours to ten minutes with a linear speedup.

: This report documents the installation, acceptance testing, vendor interactions, and final system acceptance for production usage of a dedicated high performance computing project investment that was installed at the U.S. Army Research Laboratory facilities on the Aberdeen Proving Ground in MD. The uniqueness of this system lies in the use of the low latency 10 GigE (gigabit Ethernet) network fabric, many-core AMD Opteron central processing units (CPUs), Nvidia Fermi graphics processing unties (GPUs), and a mixture of CPU-only and CPU/GPU nodes. The final accepted production system is stable and capable of nearly 1 PetaFLOPS (1012 floating-point operations per second) of single precision performance.

Compliance with the end-to-end latency of tasks and flows is a safety-relevant constraint in real-time systems. Especially when tasks and flows are interconnected by data dependencies in so-called Cause-Effect Chains, the adherence to end-to-end restrictions becomes even more complex. In our previous work, we proposed the incremental algorithm ITANS, which presents a solution for the joint scheduling of tasks and flows organized in Cause-Effect-Chains in communication networks applying the IEEE 802.1Qbv Time-Aware Shaper. In this work, we extend the approach to communication networks using the scheduling method Strict Priority (SP). The determination of the worst-case transmission time (WCTT) of flows is an essential part of ITANS. To derive the WCTT of flows in SP-based networks, we use the mathematical framework Network Calculus (NC) combining existing analyses to derive the least pessimistic delay guarantees for network flows. The evaluations show that the extension of ITANS can achieve a high success rate and a low runtime on average in systems with Gigabit Ethernet and communication networks that use SP.

The real potential of broadband wireless networks lies with mobility. A hot debate is centered on building metropolitan area networks using WiMAX technology based on the IEEE 802.16 standards. Good mobility management schemes enable it to become the disruptive solution that fulfills the promises of ubiquitous computing with broadband access everywhere that was left unsatisftable with the Wi-Fi and 3G cellular solutions. The wide area coverage and co-existence of multiple wireless access technologies pose a challenge to mobility in the metropolitan network. Complications arise from the hierarchical structure of the network and the seamless handoff requirement to maintain steady streaming media coverage without interruption. It also stems from the lack of cellular type infrastructure to support fast moving users. We study the issues associated with providing mobility in a wireless metropolitan network. We propose a mobility management scheme based on the integration of hierarchical micro-mobility, fast handoff and vertical handoff It is demonstrated that this scheme can perform well under traffic loads. The network is subjected to an application that provides public health informatics services to the metropolitan area. These experimental results can provide suggestion on how to construct the next generation wireless networks.