Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Distributed Embedded Systems (2)
- Logic simulation (2)
- Real-Time Middleware (2)
- AHE (1)
- Adaptive and reflective middleware (1)
-
- Adaptive real-time image transmission. (1)
- Algorithms (1)
- Anytime algorithms (1)
- Beat Analysis (1)
- Branch-and-bound (1)
- Branch-and-cut (1)
- Circuit simulation (1)
- Composite structures (1)
- Contrast-enhancement (1)
- Data collection to cloud (1)
- Denial of Service (1)
- Design (1)
- Discrete event simulation (1)
- Distributed real-time and embedded middleware (1)
- Distributed systems (1)
- Event list algorithms (1)
- Event lists (1)
- Execution Security (1)
- Experimentation (1)
- First order logic. (1)
- Generative programming (1)
- Group Scheduling (1)
- Linear programming (1)
- Logic simulation machines (1)
- Logic simulators (1)
- Publication Year
Articles 361 - 390 of 683
Full-Text Articles in Computer Engineering
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.
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 …
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 …
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.
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 …
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 …
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 …
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 …
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. …
Lime: A Middleware For Physical And Logical Mobility, Gian Pietro Picco, Amy L. Murphy, Gruia-Catalin Roman
Lime: A Middleware For Physical And Logical Mobility, Gian Pietro Picco, Amy L. Murphy, Gruia-Catalin Roman
All Computer Science and Engineering Research
LIME is a middleware supporting the development of applications that exhibit physical mobility of hosts, logical mobility of agents, or both. LIME adopts a coordination perspective inspired by work on the Linda model. The context for computation, represented in Linda by a globally accessible, persistent tuple space, is represented in LIME by transient sharing of the tuple spaces carried by each individual mobile unit. Linda tuple spaces are also extended with a notion of location and with the ability to react to a given state. The hypothesis underlying our work is that the resulting model provides a minimalist set of …
A Rate-Based End-To-End Multicast Congestion Control Protocol, Sherlia Shi, Marcel Waldvogel
A Rate-Based End-To-End Multicast Congestion Control Protocol, Sherlia Shi, Marcel Waldvogel
All Computer Science and Engineering Research
Current reliable multicast protocols do not have scalable congestion control mechanisms and this deficiency leads to concerns that multicast deployment may endanger stability of the network. In this paper, we present a sender-based approach for multicast congestion control targeted towards reliable bulk data transfer. We assume that there are a few bottleneck links in a large scale multicast group at any time period and these bottlenecks persist long enough to be identified and adapted to. Our work focus on dynamically identifying the worst congested path in the multicast tree and obtaining TCP-friendly throughput on this selected path. We device novel …
On Maintaining Group Membership Data In Ad Hoc Networks, Gruia-Catalin Roman, Qingfeng Huang, Ali Hazemi
On Maintaining Group Membership Data In Ad Hoc Networks, Gruia-Catalin Roman, Qingfeng Huang, 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. Essential to constructing a consistent 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 an algorithm 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 algorithm are its reliance on location information and a conservative notion of logical connectivity that creates …
Data Archiving With The Srb*, Jinghua Zhou
Data Archiving With The Srb*, Jinghua Zhou
All Computer Science and Engineering Research
We use the SRB (Storage Request Broker) middleware to design and implement a storage archival system which will be used to archive Neuroscience data. As part of the design process, we developed and used an experimenter's workbench to measure SRB performance. These experiments improved our understanding of both the functionality and the performance of the SRB. This technical report describes the scripts in the experimenter's workbench, the archiving scripts, and performance measurements.
The Design And Performance Of Meta-Programming Mechanisms For Object Request Broker Middleware, Nanbor Wang, Kirthika Parameswaran, Douglass Schmidt
The Design And Performance Of Meta-Programming Mechanisms For Object Request Broker Middleware, Nanbor Wang, Kirthika Parameswaran, Douglass Schmidt
All Computer Science and Engineering Research
Distributed object computing (DOC) middleware shields developers from many tedious and error-prone aspects of programming distribued applications. Without proper support from the middleware, however, it can be hard to evolve distributed applications after they are deployed. Therefore, DOC middleware should support meta-programming mechanisms, such as smart proxies and interceptors, that improve the adaptability of distributed applications by allowing their behavior to be modified without drastically changing existing software. This paper presents three contributions to the study of metaprogramming mechanisms for DOC middleware. First, it illustrates, compares, and contrasts several meta-programming mechanisms from an application developer's perspective. Second, it outlines the …
Synthesizer, A Pattern Language For Designing Digital Modular Synthesis Software, Thomas V. Judkins, Christopher D. Gill
Synthesizer, A Pattern Language For Designing Digital Modular Synthesis Software, Thomas V. Judkins, Christopher D. Gill
All Computer Science and Engineering Research
Synthesizer is a pattern language for designing digital synthesizers using modular synthesis in software to generate sound. Software developed according to this pattern language emulates the abilities of an analog synthesizer. Modular synthesis is one of the oldest sound synthesis techniques. It was used in the earliest analog synthesizers, like the Moog [1] and ARP [2]. These machines introduced the oscillator-filter-amplifier paradigm, where sound generated by an oscillator is passed through a series of filters and amplifers before being sent to a speaker. These first machines had physical modules through which electrical signals were passed. These modules can be emulated …
Programming Active Networks Using Active Pipes, Ralph Keller, Jeyashankher Ramamirtham, Tilman Wolf, Bernhard Plattner
Programming Active Networks Using Active Pipes, Ralph Keller, Jeyashankher Ramamirtham, Tilman Wolf, Bernhard Plattner
All Computer Science and Engineering Research
Active networks allow customized processing of data traffic within the network which can be used by applications to improve the quality of their sessions. To simplify development of active applications in a heterogeneous environment, we propose active network pipes as a programming abstraction to specify transmission and processing requirements. We describe a routing algorithm that maps application session requirements onto network resources and determines an optimal route through the network transiting all required processing sites. Additionally, we propose a network software architecture to implement the functionality required to support active pipes.
Design Tradeoffs For Embedded Network Processors, Tilman Wolf, Mark Franklin, Edward W. Spitznagel
Design Tradeoffs For Embedded Network Processors, Tilman Wolf, Mark Franklin, Edward W. Spitznagel
All Computer Science and Engineering Research
Demands for flexible processing has moved general-purpose processing into the data path of networks. With the development of System-On-a-Chip technology, it is possible to put several processors with memory and I/O components on a single ASIC. We present a model of such a system with a simple performance metric and show how the number of processors and cache sizes can be optimized for a given workload. Based on a telecommunications benchmark we show the results of such an optimization and discuss how specialied hardware and appropriate scheduling can further improve system performance.
Profile-Based Routing: A New Framework For Mpls Traffic Engineering, Subhash Suri, Marcel Waldvogel, Priyank Ramesh Warkhede
Profile-Based Routing: A New Framework For Mpls Traffic Engineering, Subhash Suri, Marcel Waldvogel, Priyank Ramesh Warkhede
All Computer Science and Engineering Research
We present a new algorithm and framework for dynamic routing of bandwidth guaranteed flows. The problem is motivated by the need to dynamically set up bandwidth guaranteed paths in carrier and ISP networks. Traditional routing algorithms such as minimum hop routing or widest path routing do not take advantage of any knowledge about the traffic distribution or ingress-egress pairs, and therefore can often lead to severe network underutilization. Our work is inspired by the recently proposed "minimum interference routing" algorithm (MIRA) of Kodialam and Lakshman, but it improves on their approach in several ways. Our main idea is to use …
Almi: An Application Level Multicast Infrastructure, Dimitrios Pendarakis, Sherlia Shi, Dinesh Verma, Marcel Waldvogel
Almi: An Application Level Multicast Infrastructure, Dimitrios Pendarakis, Sherlia Shi, Dinesh Verma, Marcel Waldvogel
All Computer Science and Engineering Research
The IP multicast model allows scalable and efficient multi-party communication, particularly for groups of large size. However, deployment of IP multicast requires substantial infrastructure modifications and is hampered by a host of unresolved open problems such as reliability, flow and congestion control, security and access control. Motivated by these problems, we have designed and implemented ALMI, an application level group communication middleware, which does not rely on network infrastructure support and thus, allows accelerated deployment and simplified configuration at the cost of a relatively small increase in traffic load. ALMI is tailored toward support of multicast groups of relatively small …
Parallel Fpga Programming Over Backplane Chassis, John Lockwood, Tom Mclaughlin, Tom Chaney, Yuhua Chen, Fred Rosenberger, Alex Chandra, Jon Turner
Parallel Fpga Programming Over Backplane Chassis, John Lockwood, Tom Mclaughlin, Tom Chaney, Yuhua Chen, Fred Rosenberger, Alex Chandra, Jon Turner
All Computer Science and Engineering Research
For systems with a large number of FPGAs, where a design is instantiated across multiple FPGAs in a chassis, an efficient mechanism of programming the FPGA devices is needed. The mechanism described herein allows multiple FPGAs to be programmed across a backplane. Only a single configuration PROM is required to store the configuration for the multiple instances of the design. When the system boots, all FPGAs are programmed in parallel. This design is applicable to any system which contains a multiple board system which has instances of identical FPGA implementations distributed across the boards. Signal integrity of signals is considered.
Codeweave: Exploring Fine-Grained Mobility Of Code, Cecilia Mascolo, Gian Pietro Picco, Gruia-Catalin Roman
Codeweave: Exploring Fine-Grained Mobility Of Code, Cecilia Mascolo, Gian Pietro Picco, Gruia-Catalin Roman
All Computer Science and Engineering Research
This paper explores the range of constructs and issues facing the designer of mobile code systems which allow for the unit of mobility to be finer-grained than that of execution. Mobile UNITY, a notation and proof logic for mobile computing, provides for this research a clean abstract setting, i.e., unconstrained by compilation and performance considerations traditionally associated with programming language design. Within the context of Mobile UNITY, we take the extreme view that every line of code and every variable declaration is potentially mobile, i.e., it may be duplicated and/or moved from one program contxt to another on the same …
Configuring Sessions In Programmable Networks, Sumi Choi, Jonathan Turner, Tilman Wolf
Configuring Sessions In Programmable Networks, Sumi Choi, Jonathan Turner, Tilman Wolf
All Computer Science and Engineering Research
The provision of advanced computational services within networks is rapidly becoming both feasible and economical. We present a general approach to the problem of configuring application sessions that require intermediate processing by showing how the session configuration problem can be transformed to a conventional shortest path problem. We show, through a series of examples, that the method can be applied to a wide variety of different situations.
Plugin Management For Active Network, Sumi Y. Choi
Plugin Management For Active Network, Sumi Y. Choi
All Computer Science and Engineering Research
The purpose of this document is to present the overview of tte plugin management architecture and the description of the software developed for the scalable, high performance active network node project in Washington University, St. Louis. The plugin management is a user space daemon program that runs at the code(plugin) server and at the active network component of a router or a switch port processor. The running programs cooperate to load plugins from the code server to the active network component. This software is intended to be used among multiple platforms.
Hello, World: A Simple Application For The Field Programmable Port Extender (Fpx), John Lockwood, David Lim
Hello, World: A Simple Application For The Field Programmable Port Extender (Fpx), John Lockwood, David Lim
All Computer Science and Engineering Research
The FPX provides simple and fast mechanisms to process cells or packets. By performing all computations in FPGA hardware, cells and packets can be processing at the full line speed of the card [currently 2.4 Gbits/sec]. A sample application, called 'Hello World' has been developed that illustrates how easily an application can be implemented on the FPX. This application uses the FPGA hardware to search for a string on a particular flow and selectively replace contents of the payload. The resulting circuit operates at 119 MHz on a Xilinx XCV 1000E-FG680-7, and occupies less than 1% of the available gates …
Coordination And Mobility, Gruia-Catalin Roman, Amy L. Murphy, Gian Pietro Picco
Coordination And Mobility, Gruia-Catalin Roman, Amy L. Murphy, Gian Pietro Picco
All Computer Science and Engineering Research
Mobility entails the study of systems in which components change location, in a voluntary or involuntary manner, and move across a space that may be defined to be either logical or physical. Coordination is concerned with what happens when two or more components come in contact with each other. In this paper we put forth a working definition of coordinatoin, we construct argumetns that demonstrate that coordination is central to understanding mobility, we explore the intellectual richness of the notion of coordination, and we consider the practical implications of coordination-centered system design strategies. We develop these ideas in two steps. …
Recognition And Verification Of Design Patterns, Michael P. Plezbert, Ron K. Cytron
Recognition And Verification Of Design Patterns, Michael P. Plezbert, Ron K. Cytron
All Computer Science and Engineering Research
In this paper we consider the automatic discovery of design (programming) patterns. While patterns have surfaced as an effective mechanism for authoring and understanding compelx software, popular languages lack facilities for direct specification of patterns or verification of pattern usage in program specifications. Static analysis for patterns is provably undecidable; we focus on discovery and verification of patterns by analyzing dynamic sequences of method calls on object. We show a proof-of-concept of our approach by presenting the results of analyzing a Java program for Iterator patterns.
Revenue Equivalence Of Leveled Commitment Contracts, Tuomas Sandholm, Yunhong Zhou
Revenue Equivalence Of Leveled Commitment Contracts, Tuomas Sandholm, Yunhong Zhou
All Computer Science and Engineering Research
In automated negotiation systems consisting of self-interested agents, contracts have traditionally been binding. Leveled commitment contracts - i.e. contracts where each party can decommit by paying a predetermined penalty - were recently shown to improve expected social welfare even if agents decommit insincerely in Nash equilibrium. Such contracts differ based on whether agents have to declare their decommitting decisions sequentially or simultaneously, and whether or not agents have to pay the penalties if both decommit. For a given contract, these protocols lead to different decommitting thresholds and probabilities. However, this paper shows that, surprisingly, each protocol leads to the same …
The Design And Performance Of A Pluggable Protocols Framework For Object Request Broker Middleware, Fred Kuhns, Carlos O'Ryan, Douglas C. Schmidt, Jeff Parsons
The Design And Performance Of A Pluggable Protocols Framework For Object Request Broker Middleware, Fred Kuhns, Carlos O'Ryan, Douglas C. Schmidt, Jeff Parsons
All Computer Science and Engineering Research
To be an effective platform for performance-sensitive real-time and embedded applications, off-the-shelf OO middleware like CORBA, DCOM, and Java RMI must preserve communication-layer quality of service (QoS) properties to applications end-to-end. However, conventional OO middleware interoperability protocols, such as CORBA's GIOP/IIOP or DCOM's MS-RPC, are not well suited for applications that cannot tolerate the message footprint size, latency, and jitter associated with general-purpose messaging and transport protocols. It is essential, therefore, to develop standard plugable protocols frameworks that allow custom messaging and transport protocols to be configured flexibly and used transparently by applications. This paper provides three contributions to research …
Constructing Speculative Demand Functions In Equilibrium Markets, Tuomas Sandholm, Fredrik Ygge
Constructing Speculative Demand Functions In Equilibrium Markets, Tuomas Sandholm, Fredrik Ygge
All Computer Science and Engineering Research
In computational markets utilizing algorithms that establish a general equilibrium, competitive behavior is usually assumed: each agent makes its demand (supply) decisions so as to maximize its utility (profit) assuming that it has no impact on market prices. However, there is a potential gain from strategic behavior via speculating about others because an agent does affect the market prices, which affect the supply/demand decisions of others, which again affect the market prices that the agent faces. Determining the optimal strategy when the speculator has perfect knowledge about the other agents is a well known problem which has been studied in …
Reliable Communication For Highly Mobile Agents, Amy L. Murphy, Gian Pietro Picco
Reliable Communication For Highly Mobile Agents, Amy L. Murphy, Gian Pietro Picco
All Computer Science and Engineering Research
The provision of a reliable communication infrastructure for mobile agents is still an open research issue. The challenge to reliability we address in this work does not come from the possibility of faults, but rather from the mere presence of mobility, which slightly complicates the problem of ensuring the delivery of information even in a fault-free network. For instance, the asynchronous nature of message passing and agent migration may cause situations where messages forever chase a mobile agent that moves frequently from one host to another. Current solutions rely on conventional technologies that either do not provide a solution for …