Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Physical Sciences and Mathematics (698)
- Computer Sciences (697)
- Electrical and Computer Engineering (15)
- Computer and Systems Architecture (10)
- Electrical and Electronics (8)
-
- Hardware Systems (4)
- Digital Communications and Networking (3)
- Other Computer Engineering (3)
- Other Electrical and Computer Engineering (3)
- Robotics (3)
- Signal Processing (2)
- VLSI and Circuits, Embedded and Hardware Systems (2)
- Artificial Intelligence and Robotics (1)
- Biochemical and Biomolecular Engineering (1)
- Biomedical Engineering and Bioengineering (1)
- Chemical Engineering (1)
- Civil and Environmental Engineering (1)
- Controls and Control Theory (1)
- Digital Circuits (1)
- Environmental Engineering (1)
- Numerical Analysis and Scientific Computing (1)
- Optics (1)
- Physics (1)
- Software Engineering (1)
- Systems Architecture (1)
- Systems and Communications (1)
- Theory and Algorithms (1)
- Keyword
-
- FPGA (4)
- Machine learning (3)
- ADAPT (2)
- Algorithms (2)
- Distributed Embedded Systems (2)
-
- Logic simulation (2)
- OpenCL (2)
- Optimization (2)
- Polarization (2)
- Real-Time Middleware (2)
- AHE (1)
- AI (1)
- ASIC (1)
- Adaptive and reflective middleware (1)
- Adaptive denoiser (1)
- Adaptive real-time image transmission. (1)
- Adversarial Attacks (1)
- Adversarial Machine Learning (1)
- Adversarial Robustness (1)
- Aerosol size distribution (1)
- Analog Sensor (1)
- Anytime algorithms (1)
- Application-Specific Integrated Circuits (1)
- Artificial Intelligence Secure Framework;Distributed 5G Testbed;Hybrid Deep Reinforcement Learning (HDRL);Internet of Medical Things (IoMT);Internet of Things (IoT);LEMDA (1)
- Artificial Neural Network (1)
- Authentication (1)
- Automaton (1)
- Autonomous System (1)
- Autonomy (1)
- Beat Analysis (1)
- Publication Year
- Publication
- Publication Type
Articles 421 - 450 of 733
Full-Text Articles in Computer Engineering
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 …
A Proposal For A High-Performance Active Hardware Architecture, Tilman Wolf
A Proposal For A High-Performance Active Hardware Architecture, Tilman Wolf
All Computer Science and Engineering Research
Current research in Active Networking is focused on developing software architectures and defining funtionality of Execution Environments. While active network systems show superior functionality compared to traditional networks, they only operate at substantially lower link speeds. To increase the acceptance of Active Network in environments where link speeds of several Gb/s are common, we propose a hardware architecture that performs high-speed packet handling while providing the same flexibility as a common software system. The design exploits the independence between data streams for parallel processing. To measure the impact of different design decisions on the performance of the system, we also …
Multiway Range Trees: Scalable Ip Lookup With Fast Updates, Subhash Suri, George Varghese, Piryank Ramesh Warkhede
Multiway Range Trees: Scalable Ip Lookup With Fast Updates, Subhash Suri, George Varghese, Piryank Ramesh Warkhede
All Computer Science and Engineering Research
Internet routers forward packets based on the destination address of a packet. A packet's address is matched against the destination prefixes stored in the router's forwarding table, and the packet is sent to the output interface determined by the longest matching prefix. While some existing schemes work well for IPv4 addresses, we believe that none of the current schemes scales well to IPv6, especially when fast updates are required. As the Internet evolves into a global communication medium, requiring multiple addresses per user, the switch to longer addresses (e.g. IPv6) seems inevitable despite temporary measures such as network addres translation …
Assembly And Analysis Of Extended Human Genomic Contig Regions, Eric C. Rouchka, David J. States
Assembly And Analysis Of Extended Human Genomic Contig Regions, Eric C. Rouchka, David J. States
All Computer Science and Engineering Research
The Human Genome Project (HGP) has led to the deposit of human genomic sequence in the form of sequenced clones into various databases such as the DNA Data Bank of Japan (DDBJ) (Tateno and Gojobori, 1997), the European Molecular Biology Laboratory (EMBL) Nucleotide Sequence Database (Stoesser, et. al., 1999), and GenBank (Benson, et. al., 1998). Many of these sequenced clones occur in regions where sequencing has taken place either within the same sequencing center or other centers throughout the world. The assembly of extended segments of genomic sequence by looking at overlapping end segments is desired and is currently availabel …
Anmac: A Novel Architectural Framework For Network Management And Control Using Active Networks, Samphel Norden
Anmac: A Novel Architectural Framework For Network Management And Control Using Active Networks, Samphel Norden
All Computer Science and Engineering Research
In this paper, we propose a new framework called Active Network Management and Control (ANMAC) for the management and control of high speed networks. The software architecture in ANMAC allows routers to execute dynamically loadable kernel plug-in modules which perform diagnostic functions for network management. ANMAC uses mobile probe packets to perform efficient resource reservation (using our novel reservation scheme), facilitate feedback-based congestion control, and to provide "distributed debugging" of complex anomalous network behavior. ANMAC also provides security measures against IP spoofing, and other security attacks. The network manager has the flexibility to install custom scripts in routers for tracking …
Optimal Flow Aggregation, Subhash Suri, Tuomas Sandholm, Priyank Warkhede
Optimal Flow Aggregation, Subhash Suri, Tuomas Sandholm, Priyank Warkhede
All Computer Science and Engineering Research
Current IP routers are stateless: they forward individual packets based on the destination address contained in the packet header, but maintain no information about the application or flow to which a packet belongs. This stateless service model works well for best effort datagram delivery, but is grossly inadequate for applications that require quality of service guarantees, such as audio, video, or IP telephony. Maintaining state for each flow is expensive because the number of concurrent flows at a router can be in the hundreds of thousands. Thus, stateful solutions such as Intserv (integrated services) have not been adopted for their …
Emediator: A Next Generation Electronic Commerce Server, Tuomas Sandholm
Emediator: A Next Generation Electronic Commerce Server, Tuomas Sandholm
All Computer Science and Engineering Research
This paper presents eMediator, a next generation electronic commerce server that demonstrates some ways in which AI, algorithmic support, and game theoretic incentive engineering can jointly improve the efficiency of ecommerce. First, its configurable auction house includes a variety of generalized combinatorial auctions, price setting mechanism, novel bid types, mobile agents, and user support for choosing an auction type. Second, its leveled commitment contract optimizer determines the optimal contract price and decommitting penalties for a variety of leveled commitment contracting protocols, taking into account that rational agents will decommit insincerely in taking into account that rational agents will decommit insincerely …
A Fine-Grained Model For Code Mobility, Cecilia Mascolo, Gian Pietro Picco, Gruia-Catalin Roman
A Fine-Grained Model For Code Mobility, Cecilia Mascolo, Gian Pietro Picco, Gruia-Catalin Roman
All Computer Science and Engineering Research
In this paper, we take the extreme view that every line of code is potentially mobile, i.e., may be duplicated and/or moved from one program context to another on the same host or across the network. Our motivation is to gain a better understanding of the range of constructs and issues facing the designer of a mobile code system, in a setting that is abstract and unconstrained by compilation and performance considerations traditionally associated with programming language design. Incidental to our study is an evaluatoin of the expressive power of Mobile UNITY, a notation and proof logic for mobile computing.
Pattern Matching Techniques And Their Applications To Computational Molecular Biology - A Review, Eric C. Rouchka
Pattern Matching Techniques And Their Applications To Computational Molecular Biology - A Review, Eric C. Rouchka
All Computer Science and Engineering Research
Pattern matching techniques have been useful in solving many problems associated with computer science, including data compression (Chrochemore and Lecroq, 1996), data encryption (RSA Laboratories, 1993), and computer vision (Grimson and Huttenlocher, 1990). In recent years, developments in molecular biology have led to large scale sequencing of genomic DNA. Since this data is being produced in such rapid fasion, tools to analyze DNA segments are desired. The goal here is to discuss various techniques and tools for solving various pattern matching questions in computational biology, including optimal sequence alignment, multiple sequence alignment, and buidling models to describe sequence families using …
A Rapid Development Of Dependable Applications In Ad Hoc Mobility, Amy L. Murphy
A Rapid Development Of Dependable Applications In Ad Hoc Mobility, Amy L. Murphy
All Computer Science and Engineering Research
Advances in wireless communication and network computing technologies make possible new kinds of applications involving transient interactions among physical components that move across a wide range of spaces, from the confines of a room to the airspace across an ocean, and require no fixed networking infrastructure to communicate with one another. Such components may come together to form ad hoc networks for the purpose of exchanging information or in order to engage in cooperative task-oriented behaviors. Ad hoc networks are assembled, reshaped and taken apart as components move in and out of communication range; all interactions are transient; computations become …
Terabit Burst Switching Progress Report (12/98-6-99), Jonathan S. Turner
Terabit Burst Switching Progress Report (12/98-6-99), Jonathan S. Turner
All Computer Science and Engineering Research
This report summarizes progress on Washington University's Terabit Burst Switching Project, supported by DARPA and Rome Air Force Laboratory. This project seeks to demonstrate the feasibility of Burst Switching, a new data communication service which can more effectively exploit the large bandwidths becoming available in WDM transmission systems, than conventional communication technologies like ATM and IP-based packet switching. Burst switching systems dynamically assign data bursts to channels in optical data links, using routing information carried in parallel control channels. The project will lead to the construction of a demonstration switch with throughput exceeding 200 Gb/s and scalable to over 10 …