Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 30 of 35
Full-Text Articles in Computer Engineering
Fuzzycast: Media Broadcasting For Multiple Asynchronous Receivers, Marcel Waldvogel, Wei Deng, Ramaprabhu Janakiraman
Fuzzycast: Media Broadcasting For Multiple Asynchronous Receivers, Marcel Waldvogel, Wei Deng, Ramaprabhu Janakiraman
All Computer Science and Engineering Research
When using an on-demand media streaming system on top of a network with Multicast support, it is sometimes more efficient to use broadcast to distribute popular content. There has been a lot of research in broadcasting on-demand content to multiple, asynchronous receivers. In this paper, we propose a family of novel, practical techniques for broadcasting on-demand media, which achieve lowest known server/network bandwidth usage and I/O efficient client buffer management, while retaining the simplicity of a frame-based single channel scheme.
Local Search And Encoding Schemes For Soft Constraint Minimization Problems, Michael P. Moran, Weixiong Zhang
Local Search And Encoding Schemes For Soft Constraint Minimization Problems, Michael P. Moran, Weixiong Zhang
All Computer Science and Engineering Research
Soft constraint minimization problems (SCMPs) contain hard constraints that cannot be violated and soft constraints that may be violated but carry penalties if not satisfied. In this paper, we first extend local search, WalkSAT in particular, to SCMPs and study the existing SAT encoding schemes for SCMPs. We propose a general encoding method called k-encoding. We then investigate the effects of local search neiborhood structures introduced by encoding schemes and analyze the anytime performance of extended WalkSAT using different encoding methods. Our experimental results on various graph coloring problems show that a direct extension of WalkSAT is most effective, and …
Formal Specification And Design Of Mobile Systems, Gruia-Catalin Roman, Christine Julien, Qingfeng Huang
Formal Specification And Design Of Mobile Systems, Gruia-Catalin Roman, Christine Julien, Qingfeng Huang
All Computer Science and Engineering Research
Termination detection, a classical problem in distributed computing, is revisited in the new setting provided by the emerging mobile computing technology. A simple solution tailored for use in ad hoc networks is employed as a vehicle for demonstrating the applicability of formal requirements and design strategies to the new field of mobile computing. The approach is based on well understood techniquest in specification refinement, but the methodology is tailored to mobile applications and helps designers address novel concerns such as the mobility of hosts, transient interactions, and specific coordination constructs. The proof logic and programming notation of Mobile UNITY provide …
Obiwan - An Internet Protocol Router In Reconfigurable Hardware, Florian Braun, Marcel Waldvogel, John Lockwood
Obiwan - An Internet Protocol Router In Reconfigurable Hardware, Florian Braun, Marcel Waldvogel, John Lockwood
All Computer Science and Engineering Research
The ongoing exponential increase of line speed in the Internet and combined with the uncountable requests for increased functionality of network devices presents a major challenge. These demands call for the use of reprogrammable hardware to provide the required flexible high-speed functionaltiy. The Field Programmable Port Extender (FPX) provides such an environment for development of networking components in reprogrammable hardware. We present the high-speed IP routing components in reprogrammable hardware. We present the high-speed IP routing module "OBIWAN" (Optimal Binary search IP lookup for Wide Area Networks) built on top of an IP processing framework.
Phase Transitions And Backbones Of Constraint Minimization Problems, Weixiong Zhang
Phase Transitions And Backbones Of Constraint Minimization Problems, Weixiong Zhang
All Computer Science and Engineering Research
Many real-world problems involve constraints that cannot be all satisfied. The goal toward an overconstrained problem is to find solutions minimizing the total number of constraints violated. We call such a problem constraint minimization problem (CMP). We study the behavior of the phase transitions and backbones of CMP. We first investigate the relationship between the phase transitions of Boolean satisfiability, or precisely 3-SAT (a well-studied NP-complete decision problem), and the phase transitions of MAX 3-SAT (an NP-hard optimization problem). To bridge the gap between the easy-hard-easy phase transitions of 3-SAT, in which solutions of bounded quality, e.g., solutions with at …
Parbit: A Tool To Transform Bitfiles To Implement Partial Reconfiguration Of Field Programmable Gate Arrays (Fpgas), Edson L. Horta, John W. Lockwood
Parbit: A Tool To Transform Bitfiles To Implement Partial Reconfiguration Of Field Programmable Gate Arrays (Fpgas), Edson L. Horta, John W. Lockwood
All Computer Science and Engineering Research
Field Programmable Gate Arrays (FPGAs) can be partially reconfigured to implement Dynamically loadable Hardware Plugin (DHP) modules. A tool called PARBIT has been developed that transforms FPGA configuration bitfiles to enable DHP modules. With this tool it is possible to define a partial reconfigurable area inside the FPGA and download it into a specified region of the FPGA device. One or more DHPs, with different sizes can be implemented using PARBIT.
Network Abstractions For Context-Aware Mobile Computing, Gruia-Catalin Roman, Christine Julien, Qingfeng Huang
Network Abstractions For Context-Aware Mobile Computing, Gruia-Catalin Roman, Christine Julien, Qingfeng Huang
All Computer Science and Engineering Research
Context-Aware computing is characterized by the ability of a software system to continuously adapt its behavior to a changing environment over which it has little or no control. Previous work along these lines presumed a rather narrow definition of context, one that was centered on resources immediately available to the component in question, e.g., communication bandwidth, physical location, etc. This paper explores context-aware computing in the setting of ad hoc networks consisting of numerous mobile hosts that interact with each other opportunistically via transient wireless interconnections. We extend the context to encompass awareness of an entire neighborhood within the ad …
Synthesizable Design Of A Multi-Module Memory Controller, Sarang Dharmapurikar, John W. Lockwood
Synthesizable Design Of A Multi-Module Memory Controller, Sarang Dharmapurikar, John W. Lockwood
All Computer Science and Engineering Research
Random Access Memory (RAM) is a common resources needed by networking hardware modules. Synchronous Dynamic RAM (SDRAM) provides a cost effective solution for such data storage. As the packet processing speeds in the hardware increase memory throughput can be a bottleneck to achieve overall high performance. Typically there are multiple hardware modules which perform different operations on the packet payload and hence all try to access the common packet buffer simultaneously. This gives rise to a need for a memory controller which arbitrates between the memory requests made by different modules and maximizes the memory throughput. This paper discusses the …
Embedding Images In Non-Flat Spaces, Robert Pless
Embedding Images In Non-Flat Spaces, Robert Pless
All Computer Science and Engineering Research
Multi-dimensional scaling is an analysis tool which transforms pairwise distances between points to an embedding of points in space which are consistent with those distances. Two recent techniques in statistical patter recognition, locally linear embedding (LLE) and Isomap, give a mechanism for finding the structure underlying point sets for which comparisons or distances are only meaningful between nearby points. We give a direct method to extend the embedding algorithm to new topologies, finding the optimal embedding of points whose geodesic distance on a surface mathes the given pairwise distance measurements. Surfaces considered include spheres, cylinders, tori, and their higher dimensional …
A Proposal For A Scalable Internet Multicast Architecture, Sherlia Shi
A Proposal For A Scalable Internet Multicast Architecture, Sherlia Shi
All Computer Science and Engineering Research
We propose a new network and system architecture for multicast in the Internet. Our main objectives are to find a cost-effective way to scale to a large number of multicast groups whose members are geographically dispersed, and to enable small and less capable devices to participate in group communications. In order to preserve the efficiency of data distribution gained by multicast, while avoiding the control complexity previously exhibited by IP multicast, we propose the use of an overlay network for multicast services. We construct "virtual" multicast trees, which consist of unicast connections joining multicast servers in the network. These servers …
Aggregated Hierarchical Multicast For Active Networks, Tilman Wolf, Sumi Y. Choi
Aggregated Hierarchical Multicast For Active Networks, Tilman Wolf, Sumi Y. Choi
All Computer Science and Engineering Research
Active Networking is the basis for a range of new and innovative applications that make use of computational resources inside network routers. One such application is Aggregated Hierarchical Multicast, which aims at implementing efficient many-to-many communication. In certain scenarios it is possible to transmit less accurate, aggregated data and thus achieve better scalability. Using Active Networks, this aggregation computation can be done transparently by network routers without end system support. We present how aggregated data streams can be structured in a hierarchical fashion to allow easy access of data at the desired aggregation level. We introduce two application examples to …
Dres: Internet Resource Management Using Deferred Reservations, Samphel Norden
Dres: Internet Resource Management Using Deferred Reservations, Samphel Norden
All Computer Science and Engineering Research
In this proposal, we consider the problem of resource reservation for Integrated Services (IntServ) and Differentiated Services (DiffServ) networks. Current approaches for resource reservation in INtegrated Service Networks adopt an all-or-nothing approach, where partially acquired resources must be released if resources are not available at all routers on the chosen path. Furthermore, under high load, end-systems must retry requests repeatedly leading to inefficient allocation and increased traffic. We propose a new approach called Deferred REServation (DERS) that substantially improves performance (reduces the overall cell rejection probability and increases link utilization) over the all-or-nothing reservation approach. Call admissibility is increased by …
Fast Incremental Crc Updates For Ip Over Atm Networks, Florian Braun, Marcel Waldvogel
Fast Incremental Crc Updates For Ip Over Atm Networks, Florian Braun, Marcel Waldvogel
All Computer Science and Engineering Research
In response to the increasing network speeds, many operations in IP routers and similar devices are being made more efficient. With the advances in other areas of packet processing, the verification and regeneration of cyclic redundancy check (CRC) codes of the data link layer is likely to become a bottleneck in the near future. In this paper, we present a mechanism to defer CRC verification without compromising reliability. This opens the possibility of incremental updates of the CRC. We introduce a new high-speed technique and present efficient implementation, speeding up CRC processing by a factor of 15. Although the paper …
A Distributed Annotation System, Robin Dowell
A Distributed Annotation System, Robin Dowell
All Computer Science and Engineering Research
One goal of any genome project is the elucidation of hte primary sequence of DNA contained within a given species. While the availability ot the primary sequence itself is valuable, it does not reach its full potential until i has been annotated. Generally defined, annotation is descriptive information or commentary added to text, in this case genomic sequence. Without a mechanism for collecting, recording, and disseminating community-based annotation, a valuable source of information is severely diminshed. In this report I outline the design and implementation of a Distributed Annotation System (DAS). DAS allowes sequence annotations to be decentralized among multiple …
Layered Protocol Wrappers For Internet Packet Processing In Reconfigurable Hardware, Florian Braun, John Lockwood, Marcel Waldvogel
Layered Protocol Wrappers For Internet Packet Processing In Reconfigurable Hardware, Florian Braun, John Lockwood, Marcel Waldvogel
All Computer Science and Engineering Research
The ongoing increases of line speed in the Internet backbone combined with the need for increased functionality of network devices presents a major challenge. These demands call for the use of reprogrammable hardware to provide the required flexible, high-speed functionality, at all network layers. The Field Programmable Port Extender (FPX) provides such an environment for development of networking components in reprogrammable hardware. We present a framework to streamline and simplify networking applications that process ATM cells, AAL5 frames, Internet Protocol (IP) packets and UDP datagrams directly in hardware.
Implementation Of An Open Multi-Service Router, Fred Kuhns, John Dehart, Ralph Keller, John Lockwood, Prashanth Papu, Jyoti Parwatikar, Ed Spitznagel, David Richard, David Taylor, Jon Turner, Ken Wong
Implementation Of An Open Multi-Service Router, Fred Kuhns, John Dehart, Ralph Keller, John Lockwood, Prashanth Papu, Jyoti Parwatikar, Ed Spitznagel, David Richard, David Taylor, Jon Turner, Ken Wong
All Computer Science and Engineering Research
This paper describes the design, implementation, and performance of an open, high-performance, dynamically reconfigurable Multi-Service Router (MSR) being developed at Washington University in St. Louis. This router provides an experimentation platform for research on protocols, router software, and hardware design, network management, quality of service and advanced applications. The MSR has been designed to be flexible, without sacrificing performance. It support gigabit links and uses a scalable architecture suitable for supporting hundreds or even thousands of links. The MSR's flexibility makes it an ideal platform for experimental research on dynamically extensible networks that implement higher level functions in direct support …
Routing In Overlay Multicast Networks, Sherlia Y. Shi, Jonathan S. Turner
Routing In Overlay Multicast Networks, Sherlia Y. Shi, Jonathan S. Turner
All Computer Science and Engineering Research
Multicast servises can be provided either as a basic network service or as an application-layer service. Higher level multicast implementations often provide more sophisticated features, and since they don't require network supoprt for multicast, they can provide multicast services, where no network layer support is available. Overlay multicast networks offer an intermediate option, potentially combining the flexibility and advanced features of application layer multicast with the greater efficiency of network layer multicast. Overlay multicast networks play an important role in the Internet. Indeed, since Internet Service Providers have been slow to enable IP multicast in their networks, Internet multicast is …
A Termination Detection Protocol For Use In Mobile Ad Hoc Networks, Gruia-Catalin Roman, Jamie Payton
A Termination Detection Protocol For Use In Mobile Ad Hoc Networks, Gruia-Catalin Roman, Jamie Payton
All Computer Science and Engineering Research
As computing devices become smaller and wireless networking technologies improve, the popularity of mobile computing continues to rise. In today's business world, many consider devices such as cell phones, PDAs, and laptops as essential tools. As these and other devices become increasingly independent of the wired infrastructure, new kinds of applications that assume an ad hoc network infrastructure will need to be deployed. Such a setting poses new challenges for the software developer, e.g., the lack of an established network topology, bandwidth limitations, and frequent disconnections. In this paper, we begin to explore design strategies for developing applications over ad …
Relying On Safe Distance To Ensure Consistent Group Membership In Ad Hoc Networks, Qingfeng Huang, Christine Julien, Gruia-Catalin Roman, Ali Hazemi
Relying On Safe Distance To Ensure Consistent Group Membership In Ad Hoc Networks, Qingfeng Huang, Christine Julien, Gruia-Catalin Roman, Ali Hazemi
All Computer Science and Engineering Research
The design of ad hoc mobile applications often requires the availability of a consistent view of the application state among the participating hosts. Such views are important because they simplify both the programming and verification tasks. Essential to constructing a consitent view is the ability to know what hosts are within proximity of each other, i.e., form a group in support of the particular application. In this paper we propose a protocol that allows hosts within communication range to maintain a consistent view of the group membership despite movement and frequent disconnections. The novel features of this protocol are its …
Scheduling Processing Resources In Programmable Routers, Prashanth Pappu, Tilman Wolf
Scheduling Processing Resources In Programmable Routers, Prashanth Pappu, Tilman Wolf
All Computer Science and Engineering Research
To provide flexibility in deploying new protocols and services, general-purpose processing engines are being placed in the datapath of routers. Such network processors are typically simple RISC multiprocessors that perform forwarding and custom application processing of packets. The inherent unpredictability of execution time of arbitrary instruction code poses a significant challenge in providing QoS guarantees for data flows that compete for such processing resources in the network. However, we show that network processing workloads are highly regular and predictable. Using estimates of execution times of various applications on packets of given lengths, we provide a method for admission control and …
Scalable Ip Lookup For Programmable Routers, David E. Taylor, John W. Lockwood, Todd Sproull, David B. Parlour
Scalable Ip Lookup For Programmable Routers, David E. Taylor, John W. Lockwood, Todd Sproull, David B. Parlour
All Computer Science and Engineering Research
Continuing growth in optical link speeds places increasing demands on the performance of Internet routers, while deployment of embedded and distributed network services imposes new demands for flexibility and programmability. IP adress lookup has become a significant performance bottleneck for the highest performance routers. New commercial products utilize dedicated Content Addressable Memory (CAM) devides to achieve high lookup speeds. This paper describes an efficient, scalable lookup engine design, able to achieve high-performance with the use of a small portion of a reconfigurable logic device and a commodity Random Access Memory (RAM) device. Based on Eatherton's Tree Bitmap algorithm [1] the …
Design Of Wavelength Converting Switches For Optical Burst Switching, Jeyashankher Ramamirtham, Jonathan Turner
Design Of Wavelength Converting Switches For Optical Burst Switching, Jeyashankher Ramamirtham, Jonathan Turner
All Computer Science and Engineering Research
Optical Burst Switching (OBS) is an experimental network technology that enables the construction of very high capacity routers, using optical data paths and electronic control. In this paper, we study two designs for wavelength converting switches that are suitable for use in optical burst switching systems and evaluate their performance. Both designs use tunable lasers to implement wavelength conversion. One is strictly nonblocking design, that also requires optical crossbars. The second substitutes Wavelength Grating Routers (WGR) for the optical crossbars, reducing cost, but introducing some potential for blocking. We show how the routing problem for the WGR-based switches can be …
Efficient Queue Management For Tcp Flows, Anshul Kantawala, Jonathan Turner
Efficient Queue Management For Tcp Flows, Anshul Kantawala, Jonathan Turner
All Computer Science and Engineering Research
Packets in the Internet can experience large queueing delays during busy periods. Backbone routers are generally engineered to have large buffers, in which packets may wait as long as half a second (assuming FIFO service, longer otherwise). During congestion periods, these bufferfs may stay close to full, subjecting packets to long delays, even when the intrinsic latency of the path is relatively small. This paper studies the performance improvements that can be obtained by using more sophisticated packet schedulers, than are typical of Internet routers. The results show that the large buffers found in WAN routers ocntribute only marginally to …
Relationship Between Two Generalized Images For Discrete And Differential Camera Motions, Robert Pless
Relationship Between Two Generalized Images For Discrete And Differential Camera Motions, Robert Pless
All Computer Science and Engineering Research
The recent popularity of catadioptic and multi-camera imaging systems indicates a need to create formal models for general, non-perspective camera geometries. Development of algorithmic tools for interpreting images from a generalized camera model will lead to a better understanding of how to design camera systems for particular tasks. Here we define the corollary to epi-polar constraints for standard cameras - the relationship between two images of a scene taken by generalized cameras from viewpoints related by discrete or differential motions.
Indra: A Distributed Approach To Network Intrusion Detection And Prevention, Qi Zhang, Ramaprabhu Janakiraman
Indra: A Distributed Approach To Network Intrusion Detection And Prevention, Qi Zhang, Ramaprabhu Janakiraman
All Computer Science and Engineering Research
While advances in computer and communications technology have made the network ubiquitous, they ahve also rendered networked systems vulnerable to malicious attacks orchestrated from a distance. These attacks, usually called cracker attacks or intrusions, start with crackers infiltrating a network through a vulnerable host and then going on to launch further attacks. Crackers depend on increasingly sophisticated techniques like using distributed attack sources. On the other hand, software that guards against them remains rooted in traditional centralized techniques, presenting an easily-targetable single point of failure. Scalable, distributed network intrusion prevention software is sorely needed. We propose Indra - a distributed …
Evaluation Of Motion-Jpeg2000 For Video Processing, Wei Yu, Ruibiao Qiu, Jason Fritts
Evaluation Of Motion-Jpeg2000 For Video Processing, Wei Yu, Ruibiao Qiu, Jason Fritts
All Computer Science and Engineering Research
The new ISO/ITU-T standard for still image coding, JPEG2000, has been shown to provide superior coding efficiency to the previous standard, JPEG. Because of the superb performance of JPEG2000, it is reasonable to argue that Motion-JPEG2000, the corresponding moving picture coding standard of JPEG2000, has equally outstanding performance. However, there has not been a sufficient performance evaluation of Motion-JPEG2000. To this end, we have studied the potential of Motion-JPEG2000 for video processing. Our experiments show that Motion-JPEG2000 provides high compression performance, strong error resilience, and good perceptual image quality. Together with a rich set of features inherited from JPEG2000, Motion-JPEG2000 …
Rad Module Infrastructure Of The Field-Programmable Port Extender (Fpx) Version 2.0, David E. Taylor, John W. Lockwood, Naji Naufel
Rad Module Infrastructure Of The Field-Programmable Port Extender (Fpx) Version 2.0, David E. Taylor, John W. Lockwood, Naji Naufel
All Computer Science and Engineering Research
The Field-programmable Port eXtender (FPX) provides dynamic, fast, and flexible mechanisms to process data streams at the ports of the Washington University Gigabit Switch (WUGS-20). In order to facilitate the design and implementation of portable hardware modules for the Reprogrammable Application Device (RAD) on the FPX board, infrastructure components have been developed. These components abstract application module designers from device-specific timing specifications of off-chip memory devices, as well as processing system-level control cells. This document describes the design and internal functionality of the infrastructure components and is intended as a reference for future component revisions and additions. Application module designers …
The Fpx Kcpsm Module: An Embedded, Reconfigurable Active Processing Module For The Field Programmable Port Extender (Fpx), Henry Fu, John W. Lockwood
The Fpx Kcpsm Module: An Embedded, Reconfigurable Active Processing Module For The Field Programmable Port Extender (Fpx), Henry Fu, John W. Lockwood
All Computer Science and Engineering Research
While hardware plugins are well suited for processing data with high throughput, software plugins are well suited for implementing complex control functions. A plugin module has been implemented for the FPX that executes software on an embedded soft-core processor. By including this module in an FPX design, it is possible to implement active networking functions on the FPX using both hardware and software. The KCPSM, an 8-bit microcontroller developed by Xilinx Corp., has been embedded into an FPX module. The module includes circuits to be reprogrammed over the network and to execute new programs between the processing of data packerts. …
Performance Of Deferred Reservations In Data Networks, Samphel Norden, Jonathan Turner
Performance Of Deferred Reservations In Data Networks, Samphel Norden, Jonathan Turner
All Computer Science and Engineering Research
This paper studies the performance of deferred resource reservation in data networks. Conventional resource reservation protocols, such as PNNI and RSVP adopt an all-or-nothing approach, where partially acquired resources must be released if resources are not available at all links on the chosen path. During periods of high network load, this leads users to retry requests repeatedly, adding control traffic at exactly the time when the network's capacity to process that control traffic is exhausted. Deferred REServation (DRES) can significantly improve performance by reducing the overall call rejection probability, allowing more traffic to be carried, using the same resources. Call …
Generalized Rad Module Interface Specification Of The Field-Programmable Port Extender (Fpx) Version 2.0, David E. Taylor, John W. Lockwood, Sarang Dharmapurikar
Generalized Rad Module Interface Specification Of The Field-Programmable Port Extender (Fpx) Version 2.0, David E. Taylor, John W. Lockwood, Sarang Dharmapurikar
All Computer Science and Engineering Research
The Field-programmable Port eXtender (FPX) provides dynamic, fast, and flexible mechanisms to process data streams at the ports of the Washington University Gigabit Switch (WUGS-20). By performing all computations in FPGA hardware, cells and packets can be processed at the full line speed of the transmission interface, currently 2.4 Gbits/sec. In order to design and implement portable hardware modules for the Reprogrammable Application Devide (RAD) on the FPX board, all modules should conform to a standard interface. This standard interface specifies how modules receive and transmit ATM cells of data flows, prevent data loss during reconfiguration, and access off-chip memory. …