206575726
Regular multihop logical topologies for lightwave networks
Several government- and industry-funded prototyping and development activities in WDM optical networks are being conducted at various R&D centers. Optical networks can be deployed on top of an existing physical fiber plant that can provide a transparent all-optical signal path to its upper layer, thereby providing broadband services. For instance, an all-optical layer between the physical and ATM layers in a B-ISDN network will significantly improve both efficiency and flexibility for the provision of broadband services. One attractive feature of optical networks is the ease of its logical reconfigurability, i.e., any desired logical network topology can be embedded on top of any given physical fiber plant, subject to the limitations on the number of available wavelengths and transceivers. The logical topologies can be broadly classified into two categories: arbitrary and regular. Nodal connectivity patterns in regular topologies are very systematic and well defined, which simplifies routing and management operations. However, it is difficult to add an arbitrary number of nodes to a regular topology and still maintain its well-defined structure. Over the past few years, several regular logical topologies have been proposed for optical networks. In this article we provide brief descriptions of these regular logical network topologies and a comparative study of their various performance metrics, e.g., average hop distance (viz. network utilization), routing, fault tolerance, and scalability.
43624883
Algorithms for optimized node arrangements in ShuffleNet based multihop lightwave networks
The unique capabilities of lightwave technology are exploited in order to construct optimized regular multihop networks when the traffic flow among the network nodes is asymmetric. The specific problem addressed is as follows: given that the network nodes must be connected in a regular interconnection pattern and that the node positions in the regular network can be adjusted by properly tuning their (optical) transceivers, what is the best node placement in a given regular topology? In particular, the ShuffleNet-based regular topology is examined. ShuffleNet has the property of producing large connected graphs with small degree and diameter. In order words, it can interconnect a large number of nodes with a small number of transceivers per node such that information from a source can reach its destination in a small number of hops. Since finding the optimal node placement is a computationally hard problem, efficient heuristic algorithms are formulated to design optimized ShuffleNet structures for a given traffic matrix.<<ETX>>
31501132
Optical switch configuration and lightpath assignment in wavelength routing multihop lightwave networks
A wide-area transparent optical network can be constructed by using wavelength routers and switches, each dealing with only a small number of wavelengths. In this work we consider the problem of configuring the wavelength routers based on the observed traffic. Various policies for wavelength routing, and the corresponding assignment of wavelengths along the routes have been studied before, which are based on minimizing congestion, average hop-distance, and call blocking probability or on maximizing carried traffic, and the number of clear channels. However these approaches often lead to scenarios where a significant number of available wavelengths at the input/output ports of the routers cannot be used due to potential wavelength conflict. The wavelength routing and assignment algorithms presented in this paper focus on maximizing the wavelength-utilization at the switching devices which also improve the overall network performance.
17465088
An efficient channel-feedback-based adaptive protocol for scheduling variable-length messages on slotted, high-speed fiber optic LANs/MANs
This paper is based on the continuation-bit approach in conjunction with a probabilistic scheduling strategy called the p/sub i/-persistent protocol. This combination has been proposed as an efficient multiple access protocol for transmitting variable-length messages on slotted, high-speed, fiber-optic, bus-structured local and metropolitan area networks (LANs/MANs). Specifically, the authors extend the previous static model on this approach to the dynamic case so that the protocol can be implemented. A dynamic simulation model of the protocol using the continuation-bit approach has been formulated, and channel feedback information has been used to calibrate the operating parameters in real time. Since the goal was to study the operation of the dynamic protocol with variable-length messages, variable-bit-rate coded (i.e., compressed) video was chosen as the traffic to be carried by the network in the illustrative examples. The simulation model indicates that channel feedback is a good approach for dynamically adjusting the network parameters as the network loading and the message lengths fluctuate. Even at a network utilization of 0.6, it was found that almost all video messages were transmitted from the station buffers before the next video message arrived.<<ETX>>
9356602
A Fast Content-Based Data Distribution Infrastructure
We present Sieve – an infrastructure for fast content-based data distribution to interested users. The ability of Sieve to filter and forward high-bandwidth data streams stems from its distributed pipelined architecture. The complex message filtering task is broken-up into a sequence of light-weight filtering components resulting in high end-to-end throughput. Furthermore, since each component is assigned to a node based on its resource constraints, the queue buildup inside the nodes is minimal resulting in low end-to-end latency. Our experimental results based on real system implementation show that Sieve can sustain a throughput of more than 5000 messages per second for 100000 subscriptions with predicates of 10 attributes.
17614044
Measurement Approaches to Evaluate Performance Optimizations for Wide-Area Wireless Networks
We present measurement approaches to evaluate performance optimizations, employed at different layers of the protocol stack, to enhance application performance over wide-area wireless networks (WWANs). Applications running over WWAN cellular environments (e.g web browsing) are significantly affected by the vagaries of the cellular wireless links. Much of the prior research has focussed on variety of isolated performance optimizations and their measurements over wired and wireless environments. In this paper we introduce experiment-based measurement approaches to benchmark application performance using optimizations performed at individual layers of the protocol stack.
10850100
Low-coordination topologies for redundancy in sensor networks
Tiny, low-cost sensor devices are expected to be failure-prone and hence in many realistic deployment scenarios for sensor networks these nodes are deployed in higher than necessary densities to meet operational goals. In this paper we address the question of how nodes should be managed in such dense sensor deployments so that the network topology formed by the active sensors is able to provide connected-coverage to the entire area of interest and at the same time increase the lifetime of the network. In particular, we propose and study distributed, low-coordination node wakeup schemes to efficiently construct multiple independent (node-disjoint) sensor network topologies to achieve good fault tolerance. We propose and evaluate different distributed, random and pattern-based wakeup policies for sensor nodes to construct connected-covered topologies. Through analysis and simulations we demonstrate that in dense sensor deployment scenarios, these policies can construct near-optimal topologies (within 2.7% of the optimal) with zero coordination between nodes, as long as location information is available at the individual sensor nodes.Based on these observations, we develop and evaluate a few simple distributed, wakeup based topology construction algorithms that can realize similar performance bounds in realistic sensor deployments, with varying node densities. These algorithms differ in terms of the required level of coordination and the use of sensor location information, and generate connected-covered topologies efficiently, with very low message-exchange overhead.
13955721
Improving bandwidth utilization based on deterministic delay bound in connection-oriented networks
Packet scheduling disciplines play an important role in providing quality of service (QoS) guarantees to applications traffic in high speed networks. Several scheduling disciplines have emerged in the literature that are capable of providing guarantees on various QoS parameters, such as packet delay, jitter, loss and throughput, while maintaining fairness among various connections. However, there is a trade-off between the performance and the simplicity of operation and implementation performance of the scheduling schemes. Thus the first-come-first-serve (FCFS) scheduling discipline has remained popular due to its overriding simplicity in spite of its poor capabilities in providing QoS guarantees. In previous work it has been shown that a practical worst case bound can be obtained for a deterministic delay guarantee in networks using the FCFS discipline, by imposing a source rate condition on each connection, that restricts the overall network utilization. In this paper, a modified source rate condition is proposed that can significantly increase the bandwidth utilization, while still maintaining the deterministic delay guarantee.
16504925
Debugging DHCP performance
Dynamic Host Configuration Protocol (DHCP) was defined to facilitate automatic configuration of IP addresses and other network parameters to hosts in a network. Efficiency of DHCP's address management is especially important today in part due to proliferation of mobile devices with transient network access patterns and the consequent increased demand on transient IP addresses in open-access networks. Unfortunately, DHCP's flexible design makes it susceptible to a variety of misconfigurations. The focus of this work is, therefore, to evaluate the performance and vulnerabilities of DHCP in operational networks today. To this end, we developed a tool called DHCP-Watch that facilitates DHCP-related network debugging and enables better capacity planning. We used this tool to perform a first-of-its-kind detailed measurement study of DHCP performance in operational university campus networks. Our measurements revealed various trends of IP address usage. Additionally, we discovered frequent anomalous operations due to network misconfigurations and presence of misbehaving hosts.