1.3 InfoField Globus
InfoField: Infrastructure for Global Wave Propagation of Information
- Milorad Tosic –
Background on Markov Networks for Optimization Problems ...................................... 6
Component-based embedded overlay networks (ovo bas nije najbolje!!!!!) .................. 8
1 Project Summary
Global adoption of Internet has resulted in recent dramatic melting of computer and communication industries into a single emerging market. The main imperative of the new market is a synergy of communication and computation capable of delivering new value-added services and products. Sole bandwidth as well as pure computational power has saturated current market needs. Current Internet computing infrastructure doesn’t utilize potential of the synergy: There are powerful computation servers, usually implemented by System Area Networks (SAN) or computer clusters in Internet Data Centers
(IDCs), large number of light clients accessing servers for services, and scalable communication infrastructure providing information transfer between clients and servers. In spite of several new approaches (such as Active Networks and Peer-to-Peer computing), the Internet infrastructure remains highly unbalanced – tiny part of the whole Internet, so called “Core Internet”, is accountable for most of the available communication bandwidth and computational power while rest of the Internet, where most of the users are, is left underutilized. As a reflection, IDCs and backbone communications benefit from largescale economics, while edge network is struggling to survive economic pressure. In the same time, enterprise applications become dominant revenue generator (e.g. Microsoft’s shift in strategic focus towards enterprise applications, followed by more traditional players like IBM, HP, Oracle, etc.). New fluid technology infrastructure is needed to facilitate forthcoming requirements of applications driven by actual
human and businesses needs instead of current technology-driven applications in order to evolve the unity of communication and computation.
This proposal addresses the challenge by introduction of the novel global system architecture where communication and computation are unified in a way that provide universal and scalable infrastructure for easy development of new value-added services, resources, and products. There is an analogy between how communication and computation are integrated into InfoFiled with a way that magnetic and electric waves are integrated in the electro-magnetic field: InfoField is a medium for wave propagation of information where communication and computation are just different appearances of the same phenomena .
The InfoFiled proposal is innovation-intensive while tightly focused on practical application demands.
InfoField is an umbrella project that brings into life this vision. The project focuses on It is based on the following technologies:
1.
Theoretical InfoField foundations: a.
Formal models for InfoFiled computation, b.
InfoField algorithms (e.g. belief propagation, linear algebra, etc.) c.
InfoField meta-programming, including component, resource, service, and computation modeling as well as structure modeling (such as database schemas, languages, data formats, communication protocols, etc.)
2.
Information technologies for InfoField: a.
Automatic code generation, b.
Secure InfoField protocols, c.
InfoField component composition language d.
Development tools for ad-hoc applications in InfoField, e.
Information broadcast by wave propagation.
3.
InfoField application drivers: a.
InfoField Storage - Distributed Data Vault and Unlimited Distributed Memory Pool, b.
InfoField Globus c.
Market Analyst, d.
InfoVision (multimedia dissemination in InfoField)
Predlozeni projekat fokusira istrazivanja na analizu postojecih tehnologija potrebnih za InfoField, primenu tih tehnologija u realnom sistemu, i na razvoj novih resenja koja trenutno ne postoje na trzistu a neophodna su za implementaciju InfoField.
1.1 Distributed Data Vault
Kljucne karakteristike DDVa su: 1) Veoma dug (prakticno beskonacan) srednji zivot podataka (npr.
1000 godina), 2) Otpornost na fizicke katastrofe (kao sto su npr. zemljotresi, ratovi, poplave, I druga razaranja velikih razmera), 3) Sigurnost i tajnost podataka, kao i celog sistema, 4) Konkurentna cena po jedinici kolicine podataka, i 5) Trasparetnost DDVa prema aplikaciji (npr. postojece baze podataka mogu bez ikakave intervencije u aplikaciji da pocnu da koriste DDV).
Pristup koji se ovde predlaze za implementaciju DDVa je originalan, inventivan, I efikasan, I zasniva se na sledecim resenjima:
1) Fizicki uredjaji za pamcenje podataka su locirani nezavisno jedni od drugih, medjusobno su povezani mrezom, I mogu biti rastrkani na velikom prostoru. Na ovaj nacin, u slucaju katastrofe samo deo fizickih uredjaja biva unisten I to oni uredjaji koji su locirani u pogodjenoj oblasti.
2)
3)
DDV vrsi multipliciranje podataka I koristi na taj nacin uvedenu redundancu za postizanje garantovanog stepena otpornosti na katastrofe (npr. moze da se garantuje ocuvanje podataka do slucaja kad je 60% fizikih uredjaja unisteno),
DDV moze da koristi javni Internet za komunikaciju. Na ovaj nacin bez velikih ulaganja u
4) komunikacionu infrastrukturu moze da se obezbedi velika disperzija fizickih uredjaja.
DDV moze da koristi specijalizovane komunikacione linije. Koriscenje javnog Interneta ili specijalizovane linije je transparentno za aplikaciju. Sluzbe koje vec poseduju I koriste specijalizovane linkove, kao sto su posta, vojska, velike banke, velike kompanije, I drzavne ustanove, mogu efikasno da ih koriste za DDV.
5) DDV koristi enkripciju za garantovanje tajnosti I bezbednosti podataka.
6)
7)
Aplikacija, npr baza podataka i/ili web server, nije svesna postojanja DDVa, odnosno DDV se instalira na aplikacioni racunar kao jos jedan hard-disk,
Kao fizicke jedinice za pamcenje podataka, DDV koristi mrezne diskove i/ili CD citace/pisace i/ili DVD citace/pisace, i/ili nove uredjaje koji ce se eventualno pojaviti u buducnosti. Da li resenja koja trenutno postoje na trzistu mreznih uredjaja za pamcenje podataka mogu da zadovolje potrebe DDVa ili ne je otvoreno pitanje na koje predlozeno istrazivanje treba da da odgovor. Nase ocekivanje je da postojeca resenja ne mogu da zadovolje zahteve DDVa, I da ce biti potrebno razviti novo resenje za povezivanje ovakvih uredjaja na mrezu. U prvom redu, misli se na enkripciju I u isto vreme na zahtev za velikim brzinama prenosa.
8)
1.2 Unlimited Distributed Memory Pool
One application of the UDMP that we argue is very promising is using UDMP distributed memory services to implement TCP retransmission buffers with a goal to manage more efficiently network
provided scalable, flexible, and low-cost networks. On the flip side, the same argument prevents the network to take more active role in providing better services. Consequently, current Internet relies upon sophisticated TCP buffer control mechanisms for globally efficient End-to-End retransmission and congestion avoidance mechanisms.
Our idea is to use UDMP distributed memory services to loose operation constraints for the TCP mechanisms while obeying End-to-End principle by implementing TCP buffers in the distributed fashion.
The TCP buffers in our implementation are able to migrate close to the congestion point, retransmit from the point immediately next to the point where the packet was dropped because of the congestion, and in this way isolate congestion effects. In other words, the request for communication resource (bandwidth on a link in the network), resulting in the congestion, is transparently transformed into the request for UDMP distributed memory resource. We anticipate great commercial potential of the solution.
The most important distinguishing feature of the proposed solution is obeying the End-to-End principle. Although some proxy-based solutions may offer the same performance improvements
[118][139], the questionable End-to-End characteristics of the solutions prevent them to be widely
deployed and commercially accepted.
So, the main challenges in the research will be assuring End-to-End principle, providing seamless integration of legacy applications into the developed framework, accurate measurements of performance gains, and adoption of the “design-for-economics” approach to deal with the existing as well as created
1.3 InfoField Globus
One of the services that InfoFiled Storage provides is called Uninformed Low-Level Storage Service
(ULLS). The ULLS is similar to the basic storage service provided in the spread spectrum storage systems
[372][373], except that encryption of the basic data blocks is not required.
As a consequence, first open research goal is to design an efficient mechanism for authentication of
data blocks that may replace encryption-based authentication used in Mnemosyne [373]. We plan to
explore two approaches: First, we
The focus of the proposed research will be on a novel methodology for Sensor/Actuator Network application development. Some unique features of this methodology include: 1) It handles the time critical
events and actions, 2) The network is intelligent and capable of assigning a level of global importance to
the individual local events and actions, 3) Suitability to various hardware/operating system platforms such as Linux, Java, and Real-Time Operating Systems running on powerful microprocessors (ARM for
example), scaling down to tiny microcontrollers with or without OS, etc. 4) Suitability to various wireless
links, such as low-bandwidth links, broadband links, etc. 5) Facilitates a design optimizations at both
network and application level, 6) Considers correctness of the network with respect to given specification,
and, 7) Performance of the Sensor/Actuator Network is at least as good as the performance of the sensor- only network.
The proposed methodology is component-based, representing application running on a SAN as a set of concurrent components with well-defined interfaces. It is also communication-oriented, in a sense that communication actions in the system are extracted as components as well. Each component may provide services to some other components in the system, as defined by its interface. For example, database component embedded into sensor node may provide persistency service to the main application component running on the same node; Ethernet link component may provide broadband network connectivity service; etc. Also, at the SAN level, temperature sensor node may provide current temperature reading service to a display node, etc. This generic and formal model will support time critical events and actions by annotating component interface with Quality-of-Service (QoS) attributes such that client component may require certain level of service quality from the server component. One example is medium-access control (MAC) protocol in the SAN where some nodes have long messages to send (like sounds and videos recorded by microphones and cameras in a conference room), but some other nodes have short but time critical messages to send (like motion detectors outside the room reporting that somebody is coming into the room so that some of microphones and cameras can re-focus to record introduction of the newcomer; or simply, smoke detectors alarming possible fire). In this case, MAC protocol will provide as good as it can service to each client, but all components in the SAN will cooperate to make an intelligent decision about the best global strategy based on requested and provided QoS. The strategy for making intelligent global decisions will use iterative algorithms and Markov net model applied to the space of QoS attributes defined in component interfaces specifying nodes in the SAN. The same model will be used for components within single node to support heterogeneous implementation platforms and design methodologies (System-on-
Chip, microprocessor-based boards, ASIC, different OSs, etc).
The primary objective of this research is to develop the aforementioned methodology and an efficient method of embedding QoS into a component interface. We will also study languages suitable for metadescription of component interfaces and explore optimization opportunities in the SAN environment. A second objective is to develop a set of algorithms for collaborative, intelligent decision making, suitable for implementation under constraints that exist in the SAN environment (low-power consumption, ad-hoc nature of the network, etc.). For this purpose, we will use Markov networks and iterative algorithms (for example, message passing algorithm). A third objective of this work is to combine the expertise in communications, coding theory, and computer science at the University of Arizona, and to enhance the educational infrastructure by integrating the research results and relevant background material into existing and new engineering courses.
2 Project Description
2.1 Innovative claims for the proposed research
The primary abstraction in traditional networking application development paradigms (including
Internet, wired LAN/WAN networking, wireless networks, mobile networks, mobile ad-hoc networks, etc.) is layering as a powerful information hiding tool for dealing with high system complexity. Due to rigid resource and operational constraints (extremely low-power consumption requirements, large number of small devices in a system, long system’s life-time, specific communication and activity patterns, and nonattained self-organizing operation), development of embedded networks algorithms suitable for the sensor/actuator network applications can’t be adequately supported by the traditional approaches. To achieve necessary level of efficiency and optimality, concurrency at all levels in the system (starting from the lowest transistor level, through hardware on-chip and on-board architectures, up to operating system, networking architecture and application software levels) must not only be visible but extensively used in the system level design process in an efficient way. Instead of layering, scalability, reactive execution, event-based communication, component-based design, and formal methods must be harnessed to manage complexity in design of such systems. Complexity of the application development process grows with the latest advances in the SAN technology: Traditionally, the sensor network applications have primarily considered information dissemination and location tracking. Introduction of actuators as well as promising low-power high-bandwidth radio links (such as Ultra-Wide Band radios) promote SAN as the most attractive platform for applications like streaming multimedia, security applications, intelligent spaces, etc.
All these new attractive applications require infrastructure that supports applications with certain level of
QoS, particularly real-time guaranties.
We will develop a methodology that facilitates control and streaming SAN applications by providing intelligent and adaptable QoS-aware application development infrastructure in a form of set of inherent algorithm building blocks. It will: 1) scale down to extremely low-bit rate communication channels
(<1Kb/s), 2) scale up to large numbers of SAN nodes, 3) efficiently operate in high-bit rate communication environment (up to 300Mb/s), 4) obey rigid power consumption constraints, 5) transparently facilitate modularity in every phase of the system design, and 6) make intelligent self-configuration decisions.
The cornerstone of designing optimal SAN is to facilitate different concurrency models that fit the best to the parallelism inherent in the application. To address difficulties in programming such systems, interfaces of constituting components must be well defined and described in a formal way. The formal interface description, that may be transparently applied at all system levels, provides means for building a system that is aware of it’s own function. In this way, the system is able to optimize communication and computation according to instant state of the global function. In addition, if provided with appropriate intelligence, the system can predict functional requirements and proactively reallocate available system resources. A meta-description of component interface addresses the difficulties of specifying specific parts of the system behavior that should be considered as inputs into self-adaptation decision-making process.
For example, activity within a SAN node can be approximated by a set of possible event-firing traces, and used as an input for resource reallocation process. The challenge is to identify minimal set of system events sufficient for good decision-making, and component meta-description helps to address it. Additionally, the component meta-description facilitates formal methodologies such as verification, model checking, and automatic optimization, that are very desirable in self-administrating systems like SAN.
Markov net model is used as a foundation for developing self-adaptation algorithms. The problem specification that leverages application of Markov net model in this case is: Given a set of event traces, that represent recent system behavior history, and a set of features specifying required system behavior in the next future (e.g. QoS), find a minimal set of events and possible mapping from the set to a set of system
(configuration parameter, parameter value) pairs such that there is a high probability that the specified behavior features will be satisfied on the set of traces, defined over the found minimal set of events, under the condition that found set of (configuration parameter, parameter value) pairs is satisfied. Different algorithms for solving the problem are possible, particularly if external constraints are introduced, like, low algorithm complexity, low power consumption, maximal distance between communication nodes, etc.
A test-bed, based on existing of-the-shelf products, will be used to test developed algorithms.
2.2 Introduction and Technical Background
It is predicted that in the near future advances in processor, memory, wireless communication technology and Micro ElectroMechanical Systems (MEMS) will enable small, low-cost and low-power
nodes operates in its locality: sensors can measure the temperature, light intensity, humidity, noise level, etc. while actuators can influence mechanical features within the environment, like: position, rotation, velocity, flow, etc. It is envisioned that application of the sensor/actuator networks (SAN) may revolutionize the way we live and work, particularly in environments like: disaster area, factory floor,
During last several years research in sensor networks has been mainly focused on solving fundamental operational problems, like building test-beds for experiments, designing small low-power hardware devices, developing routing algorithms with extremely low power consumption requirements, facilitating scalability up to huge number of sensors, etc. It is anticipated that these advances will continue, and even be accelerated with new technology developments, particularly new achievements in radio technology that offer tremendous throughput rates within very low power budget. As a consequence, sensor networks become very powerful with respect to both computation and communication potential, moving focus of research attention towards finding ways to utilize the potential in new powerful applications. So
networks. Without any doubt, these applications are of high importance, particularly in military and disaster area emergency services. However, for mass adoption they could hardly be a “killer-app”. In summary, technology infrastructure for sensor networks is available and ready to support applications that would be
massively adopted. These emerging applications assume collaboration between local nodes and ability to provide real-time services. One hypothetical example of such an application could be “music kiosk”: network of small self-sustain boxes, conveniently located allover a town serving as a virtual music market for people walking on the streets or driving their cars.
Fortunately, there has been a great deal of research activity in the area of ad-hoc networks focused on advanced application development (such as, mobile collaboration, real-time multimedia, QoS intensive
to sensor/actuator networks due to existence of power consumption awareness, network self-configuration, mobility, and wireless communication. Although the research in ad-hoc networks can be used as a foundation for research of similar problems in sensor/actuator networks, there is a different deployment scenario, different application context, different hardware/software platforms, and much severe power consumption constraints in the latter case. Therefore, in order to achieve massively adopted applications for sensor/actuator networks, new theoretical developments as well as new software tools facilitating application development are required.
2.2.1 Sensor Networks
A sensor network assumes a large number of sensor nodes spread in a wide area, measuring a variety of parameters (such as temperature, light intensity, humidity, flow intensity, etc.) in the node’s locality. The network is self-organizing, thus exploiting synergism of local information to support applications of a global nature that individual nodes would not be able to do individually. These micro-nodes are not as reliable as their expensive macro-level counterparts, but their small size, low cost, wireless connection, low power consumption, and an ad-hoc network organization can enable a large number of network nodes to collaborate in applications featuring high quality and fault tolerance. Such applications relate to the broad area that is usually referred to as Ubiquitous Computing, Smart Spaces, Ad-hoc Networks, Mobile
Collaboration, Intelligent Classroom, or Pervasive Computing. However, all these computational concepts are oriented towards human users communicating and accessing information anywhere anytime using wireless multimedia PDA-like devices. Applications of sensor networks are more general assuming communication and computational infrastructure embedded into communicating physical objects that
Network (SAN) combine remote sensing with remote actuation, and connects the physical world to the existing high-speed network via gateway type nodes that may be mobile themselves. For example, locationaware applications can utilize radio signals from multiple sensors to provide location information to mobile
order to execute pre-specified actions.
Introducing actuator nodes in the sensor network not only emphasizes the importance of the known issues present in the traditional sensor-only network, but also opens a new set of problems that must be solved in order to exploit efficiently the increased system capabilities.
2.2.2 Formal Models for Embedded design
2.2.3 Background on Markov Networks for Optimization Problems
2.3 Proposed Research
We envision sensor/actuator networks applied to a variety of physical environments, like factory floors, large buildings, conference rooms, data-center rooms, kinder gardens, offices, etc. The SANs will provide different services to multiple applications, like location service, collaboration, identification, information acquisition, communication service, etc. Hence, the SAN will consist of a large number of
2.3.1 Formalna specifikacija komunikacionih protokola
Komunikacioni protokoli su softversko/hardverski sistemi koji se koriste za prenos podataka izmedju dva nezavisna racunarska uredjaja preko komunikacionog kanala koji spaja ta dva uredjaja. Projekcija
komunikacionag protokola na najcesce primenjivani model sistemskog softvera se moze ilustrovati na sledeci nacin:
Aplikacioni sloj -> sistemski sloj (kernel OSa) -> fizicki kanal -> sistemski sloj -> Aplikacioni sloj
Ukoliko se komunikacija izmedju krajnjih uredjaja odvija preko posrednickih uredjaja (rautera, sviceva, proksija, itd.), onda prikazani lanac postaje slozeniji I ne mora da periodicno ponavlja prikazanu sekvencu.
2.3.2 SAN architecture
A functional constellation of the distributed sensor/actuator network (SAN) consists of a number of functional nodes (FN) and functional communication channels (FCC). The functional nodes are: heterogeneous sensing nodes (SN), function specific actuator nodes (AN), network gateway nodes (GN), and mobile user nodes (UN). Each node in the network is assumed to be autonomous. A physical deployment of the functional nodes allows any combination of the functional nodes to be deployed within a single physical device node (PDN). Also, there are two types of functional communication channels: internal communication channel (ICC) and external communication channel (ECC). The ICC connects two or more peers within the same SAN while the ECC connects a single SAN node to some parent network
(for example Internet). The abstract communication channels may be deployed on heterogeneous physical communication channels (PCC), including custom radio link, WirelessLAN (IEEE 802.11), Bluetooth, wired Ethernet, satellite link, different links for cell phone communications, to name a few. Note that FCC is considered for deployment as an overlay network and PCC may be defined on different communication protocol layers of the underlying link. The Physical Sensor/Actuator Network (PSAN) is a deployment of a
SAN if for each FN and FCC from SAN there is corresponding PDN and PCC from PSAN representing it’s deployment.
Each PDN in SAN has at least one private communication channel and there is at least one PDN in
SAN with external communication channel. For example, a PDN hosting SN and/or AN has at least one
PCC, either ICC or ECC, but may have multiple connections of different type. The PDN hosting GN must have at least two PCCs that may be of different type.
We are focused on an application development framework that is an optimal trade-off between several conflicting requirements. So, we define design space for our framework by the following premises:
1.
The framework must efficiently handle diversity of candidate hardware platforms, operating systems, programming languages, and physical communication channels. Market conditions and technology development dictate simultaneous deployment of multiple solutions in a single SAN, so that open system approach is much more realistic then custom designed system regardless of the eventually better performance in specific narrow application domains.
2.
The last several years have witnessed growing research efforts invested in sensor networks. It is reasonable to expect competing technologies at all levels of the system architecture to emerge soon. All these alternatives must be available to an application and supported by the application development framework. This makes the development of the framework an extremely complex task. Traditionally, the design complexity issue is approached by the principle of hiding, such as layering in a design of communication protocol stacks. However, while layering is efficient in reducing design complexity, it generates sub-optimal designs that may be acceptable at traditional networks but may not in resource constrained SANs.
3.
SAN is expected to consist of different physical communication links available to the nodes, but a significant number of links will be wireless. Also, large-scale sensor networks are expected to have a huge number of nodes . As a consequence, low power consumption is a must. Having in mind that a radio communication link consumes a significant portion of available energy, the minimization of amount of data transferred over radio links becomes a very important optimization criterion.
4.
SAN has a very specific application space. Most of the nodes in SAN are silent most of the time except for some, probably short, periods of time when SAN is expected to respond to the changes in its environment. We consider this wake-up and response time as the very important feature of the SAN. While the SAN is silent, the most important concern is low power consumption since periods of silence may be long. However, while SAN is in active mode, it must obey real-time constraints dictated by a running application. Trade-off between constraints imposed by the application and overall system life-time is crucial.
5.
Deployment environment of the SAN can only be loosely approximated with a test-bed, because of unpredictable behavior in a target environment such as disaster areas, inaccessible terrains, etc.
As a consequence, the verification gets much more advantages over the testing in SANs than in traditional designs.
2.3.3 Component-based embedded overlay networks (ovo bas nije najbolje!!!!!)
For optimization of the amount of transferred data (as the main driver for power consumption), we will adopt a generic principle based on meta-description and apply it on different layers. The idea to apply meta description on communication protocol layer is simple but effective: In a network where nodes infrequently change running application it is more efficient to provide “knowledge” about currently actual protocol to the involved nodes then to transfer information about current protocol state within each message. For example, let us consider a system with smoke detector, temperature sensor and valve actuator.
Smoke detector and temperature sensor communicate measured values to actuator as a single byte. If both sensors and actuator has been “pre-educated” with this knowledge, then single-byte message is sufficient.
Let us now introduce light sensor into the network, and let us assume that this sensor communicate measured value to the actuator in two-byte format. The light sensor and the actuator are now supplied with corresponding “knowledge”, and they are able to communicate. But, due to different data formats, actuator needs some information about data source to be embedded into message. Consequently, “knowledge” about one-byte protocol must be updated in the sense to provide this information. Hence, some collaboration at the meta level is done first, protocols in involved nodes are correspondingly updated, and after that system continues to communicate with optimal amount of data transferred. Otherwise, if there is no meta
“knowledge” in the system (what, to the best of our knowledge, is the case in all existing systems), some form of “generic” protocol, that is able to support all possible variants of communication, must be adopted.
An optimized “generic” protocol is described in [23].
Each component consists of component interface and component body, where the interface defines interaction between the component and it’s environment while the body implements component’s behavior.
The meta-description based approach to communication design follows modern system design principles stressing communication-based design as a major success factor for component-based system
design [24]. It is a powerful implementation and design tool transparent with respect to model of
computation and adopted concurrency models. As a consequence, the same design approach can be applied on different levels of abstraction in the system under design.
The high level of abstraction supported by the approach leads towards implementation in a form of an
2.3.4 Probabilistic Reasoning for SAN Quality-of-Service
Our basic idea is about how to optimally and instantly adopt SAN to current environment state. In order to achieve adaptation, we introduce Quality-of-Service (QoS) into SAN. To the best of our knowledge, this is the first time that QoS is considered in the context of SAN (ovo bi trebalo da se jos vise proveri!!!!!!!!!!). We assign QoS labels to (sub)set of objects of type Event existing in SAN (ovde treba jos malo da razmislim, ali umesto Event, treba da stoji “that is an instance of meta-type”, sa ciljem da QoS moze da se asocira ne samo Eventu nego I svim ostalim tipovima koji postoje u sistemu, kao sto su
Method, Attribute, itd. Zadrzacu se na Event da bi ideja mogla lakes da se objasni). Resources available in the SAN are parameterized and formally described. Furthermore, the parameterization and formal description are applied on each individual transaction in real-time. For example, all SAN nodes in a radius around selected node, may be considered to have a single shared bus for communication. The parameters of such an bus may be: bandwidth, current network topology, etc. Transaction parameters may be maximal/minimal length of the message, level of applied encryption, strength of applied Error Correction
Code, priority that the transaction has on the bus, etc. So, we extend MAC layer in SAN such that it is capable of carrying QoS information and allow each node to make local decisions. Similar approach has
have the following problem:
2.4 References
2.4.1 Sensor Networks References
[1] S.S.Pradhan and K.Ramachendran,
“Distributed source coding using syndromes (DISCUS): Design and construction” , Proc. IEEE Data Compression Conference (DCC) , Snowbird, UT, USA, 29-31
March 1999. [001] [001]
[2] Lizhi Charlie Zhong, Rahul Shah, Chunlong Guo, Jan Rabaey, " An Ultra-Low Power and Distributed
Access Protocol for Broadband Wireless Sensor Networks ," IEEE Broadband Wireless Summit , Las
Vegas, N.V., May 2001. [002]
[3] Chris Savarese, Jan M. Rabaey, Jan Beutel, " Locationing in Distributed Ad-Hoc Wireless Sensor
Networks ," ICASSP 2001 . [003]
[4] Hui Zhang, Vandana Prabhu, Varghese George, Marlene Wan, Martin Benes, Arthur Abnous, "A 1V
Heterogeneous Reconfigurable Processor IC for Baseband Wirelss Applications", Proceedings of
ISSCC2000 [PDF] . [004]
[5] Alex C. Snoeren, Kenneth Conley, and David K. Gifford , "Mesh-Based Content Routing using
XML" ,
18th ACM Symposium on Operating Systems Principles (SOSP’01)
, Banff, Canada, October
2001 [005]
[6] Alex C. Snoeren , Hari Balakrishnan , and M. Frans Kaashoek ., Reconsidering Internet Mobility , Proc. of the 8th Workshop on Hot Topics in Operating Systems (HotOS-VIII), May 2001 [392]
[7] Luca Benini and Giovanni De Micheli, “Networks on Chips: A New SoC Paradigm”, IEEE
Computer , January 2002, pp.70-78.
[8] Pierre Guerrier and Alain Greiner, “A generic architecture for on-chip packet-switched interconnections”, DATE 2000 , pp.250, conference link [007]
[9] William J. Dally, and Brian Towles, "Route Packets, Not Wires: On-Chip Interconnection
Networks," in Proceedings of the 38th Design Automation Conference , Las Vegas, NV, June 2001.
(Invited paper) [008]
[10] David G. Andersen, Hari Balakrishnan, M. Frans Kaashoek, Robert Morris, " Resilient Overlay
Networks ", 18 th Symposium on Operating Systems Principles(SOSP’01), Banff, Canada, October
2001. [009]
[11] David G. Andersen , Hari Balakrishnan , M. Frans Kaashoek , Robert Morris . “The Case for Resilient
Overlay Networks”, Proc. of the 8th Annual Workshop on Hot Topics in Operating Systems (HotOS-
VIII), May 2001 [374]
[12] John Heidemann, Fabio Silva, Chalermek Intanagonwiwat, Ramesh Govindan, Deborah Estrin,
Deepak Ganesan, " Building Efficient Wireless Sensor Networks with Low-Level Naming ", 18
Symposium on Operating Systems Principles (SOSP’01), Banff, Canada, October 2001. [010] th
[13] M. Bhardwaj, T. Garnett and A. Chandrakasan," Upper Bounds on the Lifetime of Sensor Networks ",
IEEE International Conference on Communications (ICC'2001) , Helsinki, Finland, June 2001. [011]
[14] William Adjie-Winoto, Elliot Schwartz, Hari Balakrishnan, Jeremy Lilley, The design and implementation of an intentional naming system , Proc. 17th ACM SOSP , Kiawah Island, SC, Dec.
1999. [012]
[15] Wendi Heinzelman, Anantha Chandrakasan, and Hari Balakrishnan, Energy-Efficient
Communication Protocols for Wireless Microsensor Networks , Proc. Hawaaian Int'l Conf. on
Systems Science , January 2000. [013]
[16] Jae-Hwan Chang and Leandros Tassiulas,
“Energy Conserving Routing in Wireless Ad-hoc
Networks”, INFOCOM, 22-31, 2000 [426]
[17] W.R. Heinzelman, J. Kulik and H. Balakrishnan, “Adaptive protocols for information dissemination in wireless sensor networks”, Proc. MOBICOM, 1999, Seattle, 174-185. [424]
[18] Philippe Bonnet, J. E. Gehrke, and Praveen Seshadri. Towards Sensor Database Systems . In
Proceedings of the Second International Conference on Mobile Data Management . Hong Kong,
January 2001. [014]
[19] Philippe Bonnet, J. E. Gehrke, and Praveen Seshadri. Querying the Physical World . IEEE Personal
Communications , Vol. 7, No. 5, October 2000, pages 10-15. Special Issue on Smart Spaces and
Environments. [015]
[20] M. Ahmed, G. Pottie, Information theory of wireless sensor networks: the n-helper gaussian case .
2000 IEEE International Symposium on Information Theory , Sorrento, Italy, 25-30 June 2000; p.
436. [016]
[21] Dynamic Declarative Network Configuration, Project description, Distributed Systems Group, MIT
Lincoln Laboratory, http://dss.ll.mit.edu/dss.web/SensIT.html
[22] K. Sohrabi, J. Gao, V. Ailawadhi, G.J. Pottie, Protocols for self-organization of a wireless sensor network.
IEEE Personal Communications , vol. 7, no. 5, pp. 16-27, Oct. 2000. [017]
[23] Ignacio Solis, Katia Obraczka and Julio Marcos, FLIP: A Flexible Protocol for Efficient
Communication Between Heterogenous Devices , Tech. Report 00-737, USC Computer Science
Department [018]
[24] K. Keutzer, S. Malik, A. R. Newton, J. Rabaey and A. Sangiovanni-Vincentelli .System Level
Design: Orthogonolization of Concerns and Platform-Based Design.
IEEE Transactions on
Computer-Aided Design of IntegratedCircuits and Systems , 19(12), December 2000. [019]
[25] Wei Qin,Subramanian Rajagopalan,Manish Vachharajani,Hangsheng Wang,Xinping Zhu,David
August,Kurt Keutzer,Sharad Malik,Li-Shiuan Peh . Design Tools for Application Specific Embedded
Processors.
EMSOFT '02, October, 2002. [384]
[26] Li-Shiuan Peh and William J. Dally , "A Delay Model and Speculative Architecture for Pipelined
Routers." , In Proceedings of the 7th International Symposium on High-Performance Computer
Architecture, Jan. 22-24, 2001, Monterrey, Mexico, pp. 255-266. (Best Student Paper Award) [432]
[27] George Hadjiyiannis, Silvina Hanono, Srinivas Devadas, “ISDL: An Instruction Set Description
Language for Retargetability ” , Design Automation Conference, 1997, pp. 299-302 [397]
[28] Vojin Zivojnovic, Stefan Pees, Heinrich Meyr,
“LISA Machine Description Language and Generic
Machine Model for HW/SW Co-Design ” , In W. Burleson, K. Konstantinides, and T. Meng, editors,
VLSI Signal Processing IX, 1996. [398]
[29] Alberto Sangiovanni-Vincentelli, Marco Sgroi, Luciano Lavagno . Formal Models for
Communication-based Design.
Proceedings of CONCUR '00 , August, 2000 [020]
[30] E. A. de Kock, G. Essink, W. J. M. Smits, P. van der Wolf, J.-Y. Brunel, W. M. Kruijtzer, P.
Lieverse, K. A. Vissers, YAPI: Application Modeling for Signal Processing Systems , Proceedings of the Design Automation Conference, Los Angeles, CA June 2000. [021]
[31] J-Y. Brunel, W. M. Kruijtzer, H. J. H. N. Kenter, F. Pétrot, L. Pasquier, E. A. de Kock, W. J. M.
Smits, COSY Communication IP's , Proceedings of the Design Automation Conference, Los Angeles,
CA June 2000. [022]
[32] Pai H. Chou, Gaetano Borriello, Synthesis and Optimization of Coordination Controllers for
Distributed Embedded Systems , Proceedings of the Design Automation Conference, Los Angeles,
CA June 2000. [023]
[33] J. da Silva Jr., M. Sgroi, F. De Bernardinis, S.F Li, A. Sangiovanni-Vincentelli and J.
Rabaey .Wireless Protocols Design: Challenges and Opportunities.
Proceedings of the 8th IEEE
International Workshop on Hardware/Software Codesign , S.Diego, CA, USA, May 2000., May,
2000. [024]
[34] Kanishka Lahiri, Anand Raghunathan, Ganesh Lakshminarayana, Sujit Dey, Communication
Architecture Tuners: A Methodology for the Design of High-Performance Communication
Architectures for System-on-Chips , DAC 2000, Los Angeles, California, p. 513. [025]
[35] K. Lahiri, A. Raghunathan, and S. Dey, "Fast Performance Analysis of Bus-based SOC
Integration/Communication Architectures" , IEEE/ACM International Conference on Computer-
Aided Design , November 1999 [026]
[36] Alec Woo and David Culler, "A Transmission Control Scheme for Media Access in Sensor
Networks", Proceedings of the ACM/IEEE International Conference on Mobile Computing and
Networking , Mobicom 2001, Rome, Italy. http://tinyos.millennium.berkeley.edu/papers/mobicom.pdf
[027]
[37]
Wei Ye, John Heidemann and Deborah Estrin, "An energy-efficient MAC protocol for wireless sensor networks", To appear http://www.isi.edu/~weiye/pub/smac_report.pdf
[028] in IEEE Infocom 2002.
[38] Katayoun Sohrabi and Gregory J. Pottie, "Performance of a novel self-organization protocol for wireless ad hoc sensor networks", Proceedings of the IEEE 50th Vehicular Technology Conference,
1999, pp.1222-1226 [029]
[39] Kui Wu and Janelle Harm, "QoS Support in Mobile Ad Hoc Networks," Crossing Boundaries- the
GSA Journal of University of Alberta , Vol. 1, No. 1, Nov. 2001, pp.92- 106.
[ps file] [Related Link]
[385]
[40] Luca de Alfaro and Thomas Henzinger, Interface Automata , Proceedings of the Ninth Annual
Symposium on Foundations of Software Engineering (FSE), ACM Press, 2001, pp. 109-120. [030]
[41] Edward A. Lee and Yuhong Xiong, System-Level Types for Component-Based Design , First
Workshop on Embedded Software, EMSOFT2001, Lake Tahoe, CA, USA, Oct. 8-10, 2001. [031]
[42] Kedar N. Swadi and Andrew W. Appel, Typed Machine Language and its Semantics , preliminary version of July 2001. [032]
[43] John Davis II, Christopher Hylands, Bart Kienhuis, Edward A. Lee, Jie Liu, Xiaojun Liu, Lukito
Muliadi, Steve Neuendorffer, Jeff Tsay, Brian Vogel, and Yuhong Xiong ,
Heterogeneous
Concurrent Modeling and Design in Java
, Memorandum UCB/ERL M01/12 , EECS,
University of California, Berkeley, CA USA 94720 March 15, 2001 [033]
[44] Jeremy Elson and Deborah Estrin, Random, Ephemeral Transaction Identifiers in Dynamic Sensor
Networks ,To appear in the Proceedings of the 21st International Conference on Distributed
Computing Systems (ICDCS-21) April 16-19, 2001, Phoenix, Arizona, USA. [034]
[45] Jeremy Elson and Deborah Estrin, Time Synchronization for Wireless Sensor Networks , To appear in the Proceedings of the 2001 International Parallel and Distributed Processing Symposium
(IPDPS), Workshop on Parallel and Distributed Computing Issues in Wireless Networks and Mobile
Computing, April 2001, San Francisco, CA, USA. [035]
[46] J. M. Kahn, R. H. Katz and K. S. J. Pister, " Next Century Challenges: Mobile Networking for "Smart
Dust" , Proceedings of the fifth annual ACM/IEEE international conference on Mobile computing and networking, August 15 - 19, 1999, Seattle, WA, USA [036]
[47] Deborah Estrin, Ramesh Govindan, John Heidemann, and Satish Kumar, Next Century Challenges:
Scalable Coordination in Sensor Networks.
, In Proceedings of the ACM/IEEE International
Conference on Mobile Computing and Networking , pp. 263-270. Seattle, Washington, USA, ACM.
August, 1999. [037]
[48] Mike Esler, Jeffrey Hightower, Tom Anderson, and Gaetano Borriello, "Next Century Challenges:
Data-Centric Networking for Invisible Computing - The Portolano Project at the University of
Washington," in Proceedings of Mobicom 1999 , (Seattle, WA), pp. 256-262, ACM, 1999. ( pdf , bib )
[038]
[49] Chalermek Intanagonwiwat, Ramesh Govindan and Deborah Estrin, Directed diffusion: A scalable and robust communication paradigm for sensor networks , In Proceedings of the Sixth Annual
International Conference on Mobile Computing and Networking (MobiCOM '00) , August 2000,
Boston, Massachussetts. [039]
[50] J. Rabaey, J. Ammer, T. Karalar, S. Li, B. Otis, M. Sheets, T. Tuan, " PicoRadios for Wireless Sensor
Networks: The Next Challenge in Ultra-Low-Power Design" , Proceedings of the International Solid-
State Circuits Conference , San Francisco, CA, February 3-7, 2002. [040]
[51] G. Stitt, F. Vahid, T. Givargis, R. Lysecky, A First-step Towards an Architecture Tuning
Methodology for Low Power , Compilers, Architectures, and Synthesis for Embedded Systems
(CASES'00), pp. 187-192, November 2000 [388]
[52] L. Zhong, J. Rabaey, C. Guo and R. Shah, " Data Link Layer Design for Wireless Sensor Networks ",
Proceedings of IEEE MILCOM 2001, Washington D.C., October 28-31, 2001. [041]
[53] J.L. da Silva Jr., J. Shamberger, M.J. Ammer, C. Guo, S. Li, R. Shah, T. Tuan, M. Sheets, J.M.
Rabaey, B. Nikolic, A. Sangiovanni-Vincentelli, P. Wright, " Design Methodology for PicoRadio
Networks ," DATE 2001 [042]
[54] Suet-Fei Li, Roy Sutton, Jan Rabaey, " Low Power Operating System for Heterogeneous Wireless
Communication Systems ," PACT 01 Conference, Barcelona, Spain September 8-12, 2001. [043]
[55] M. Burnside, D. Clarke, A. Maywah, T. Mills, S. Devadas, and R. Rivest, "Proxy-Based Security
Protocols in Networked Mobile Devices" , to appear in the Symposium on Applied Computing
(SAC'02) , March 2002. [044]
[56] Bianchi, G. and A.T. Campbell, "A Programmable MAC Framework for Utility-based Adaptive
Quality of Service Support", IEEE Journal of Selected Areas in Communications (JSAC) , Special
Issue on Intelligent Techniques in High Speed Networks, Vol. 18, No. 2, pp. 244-256, February
2000. [045]
[57] Gomez, J. and A.T. Campbell, "Havana: Supporting Application and Channel Dependent QOS in
Wireless Networks", ACM Journal on Wireless Networks (WINET) , to be published, 2002. [046]
[58] C.R. Lin and M. Gerla, Real-time support in multihop wireless networks , ACM/Baltzer Wireless
Networks, vol. 5, no. 2, 1999. [047]
[59] S.-J. Lee, W. Su, and M. Gerla, “On-Demand Multicast Routing Protocol in Multihop Wireless
Mobile Networks”,
ACM/Kluwer Mobile Networks and Applications, 2000.
[427]
[60] Deborah Estrin, Lewis Girod, Greg Pottie, Mani Srivastava, Instrumenting the world with wireless sensor networks , In Proceedings of the International Conference on Acoustics, Speech and Signal
Processing (ICASSP 2001) , Salt Lake City, Utah, May 2001 [428]
[61] Lewis Girod, Vladimir Bychkovskiy, Jeremy Elson, and Deborah Estrin, Locating tiny sensors in time and space: A case study [Also in PDF format ], To appear in the proceedings of ICCD 2002
(invited paper) [430]
[62] X. Hong, M. Gerla, T. Kwon, P. Estabrook, G. Pei, and R. Bagrodia, The Mars Sensor Network:
Efficient, Energy Aware Communications , Proceedings of IEEE MILCOM 2001, McLean, VA, Oct.
2001. [048]
[63] Andreas Savvides, Chih-Chien Han, Mani Srivastava, "Dynamic Fine-Grained Localization in Ad-
Hoc Networks of Sensors" , Proceedings of the ACM SIGMOBILE 7th Annual International
Conference on Mobile Computing and Networking , Rome, Italy, July 2001. [049]
[64] Mani Srivastava, Richard Muntz, Miodrag Potkonjak, "Smart Kindergarten: Sensor-based Wireless
Networks for Smart Developmental Problem-solving Environments" , Proceedings of the ACM
SIGMOBILE 7th Annual International Conference on Mobile Computing and Networking , Rome,
Italy, July 2001. [050]
[65] Paul Castro, Patrick Chiu, Richard Muntz, "A Probabilistic Location Service for Wireless Network
Environments" , Proceedings of Ubicomp 2001. [051]
[66] Paul Castro, Richard Muntz, "An Adaptive Approach to Indexing Pervasive Data" , Proceedings of the International Workshop on Data Engineering for Wireless and Mobile Access , May 2001. [052]
[67] Paul Castro and Richard Muntz, "Managing Context Data for Smart Spaces" , IEEE Personal
Communications , October 2000. [053]
[68] Adrian Perrig, Robert Szewczyk, Victor Wen, David Culler, J. D. Tygar, “SPINS: Security Protocols for Sensor Networks”,
Proceedings of Seventh Annual International Conference on Mobile
Computing and Networks MOBICOM 2001 , July 2001. [057]
[69] Xiao, H, KG Seah, A Lo and KC Chua, ' A Flexible Quality of Service Model for Mobile Ad Hoc
Networks '. In the proceedings of IEEE Vehicular Technology Conference, 15-18 May 2000, Tokyo,
Japan, pp445-449. [059]
[70] Samir Goel and Tomasz Imielinski, Prediction-based Monitoring in Sensor Networks: Taking
Lessons from MPEG. ACM Computer Communication Review, Vol. 31, No. 5, October, 2001. To appear [054]
[71] Tomasz Imielinski and Samir Goel, DataSpace - querying and monitoring deeply networked collections in physical space , IEEE Personal Communications Magazine, Special Issue on
"Networking the Physical World" , October 2000 [055]
[72] Mark Weiser, " The Computer for the Twenty-First Century ," Scientific American, pp. 94-10,
September 1991 [056]
[73] Auto-ID Center, http://www.autoidcenter.org
[74] Jason Hill, Robert Szewczyk, Alec Woo, Seth Hollar, David Culler, Kristofer Pister .System architecture directions for network sensors.
ASPLOS 2000 . [058]
[75] TinyOS project, http://webs.cs.berkeley.edu/tos/
2.4.2 Next Generation Networks References
[76] Building High-speed Exchange Points, http://www.cisco.com/warp/public/750/aii/research.html
[060]
Cisco White Paper,
[77] Agere Systems, The Challenge for Next Generation Network Processors, White Paper, http://www.agere.com/enterprise_metro_access/network_processors.html
[061]
[78] Agere Systems, The Case for a Classification Language, White Paper, http://www.agere.com/enterprise_metro_access/network_processors.html
[062]
[79] Intel IXP2400 Network Processor, White Paper, http://developer.intel.com/design/network/white_paper.htm
[063]
[80] Intel Corporation, Intel Microengine C Compiler Language Support, Reference Manual , March 2002.
[064]
[81] Dufey, J.-P., Jost, B., Neufeld, N., “Use of Netowrk Processors for Data Multiplexing and Data
Merging”,
RT2001, [409]
[82] Madhu Sudanan Seshadri, John Bent, Tevfik Kosar " Network processors: Guiding design through analysis", http ://www.cs.wisc.edu/~johnbent/Projects/net_proc.pdf
, November 2001 [410]
[83] Tilman Wolf, Mark Franklin, “Commbenc - A Telecommunication Benchmark for Network
Processors”, IEEE International Symposium on Performance Analysis of Systems and Software in
Austin, TX, April 2000. [411]
[84] James Allen, Brian Bass, Claude Basso, Rick Boivie, Jean Calvignac, Gordon Davis, Laurent
Frelechoux, Marco Heddes, Andreas Herkersdorf, Andreas Kind, Joe Logan, Mohammad Peyravian,
Mark Rinaldi, Ravi Sabhikhi, Michael Siegel, and Marcel Waldvogel : PowerNP Network
Processor Hardware, Software and Applications , IBM Journal of Research and Development ,
25(6), pp. 545-546, April 1, 2002. [065]
[85] Florian Braun , John Lockwood , and Marcel Waldvogel : Protocol Wrappers for Layered Network
Packet Processing in Reconfigurable Networks , IEEE Micro , Volume 22, Number 1, pp. 66-74,
January/February 2002. [066]
[86] L. Thiele, S. Chakraborty, M. Gries, S. Künzli: Design Space Exploration of Network Processor
Architectures , First Workshop on Network Processors at the 8th International Symposium on
High-Performance Computer Architecture (HPCA8), Cambridge MA, USA, Feb. 2002 ps:
TCG02a.ps.gz
(640kB), pdf: TCG02a.pdf
(600kB) [067]
[87] S. Chakraborty, T. Erlebach, S. Künzli, L. Thiele: Schedulability of Event-Driven Code Blocks in
Real-Time Embedded Systems , 39th Design Automation Conference (DAC 2002), New Orleans LA,
USA, June 2002 ps: CEKT02a.ps.gz
(620kB), pdf: CEKT02a.pdf
(220kB) [068]
[88] L. Thiele, S. Chakraborty, M. Gries, A. Maxiaguine, J. Greutert: Embedded Software in Network
Processors - Models and Algorithms , First Workshop on Embedded Software (EMSOFT), Lake
Tahoe CA, USA, Lecture Notes in Computer Science 2211, Springer-Verlag, pages 416 - 434, Oct.
2001 ps: TCG01a.ps
(1.5MB), pdf: TCG01a.pdf
(310kB) [069]
[89] Sanjeev Kumar, Kai Li . Dynamic Memory Management for Programmable Devices.
To appear in
International Symposium of Memory Management, 2002 [070]
[90] Sanjeev Kumar .ESP: A Language for Programmable Devices.
Ph.D. Thesis, Department of
Computer Science, Princeton University, Jan 2002. Available as Princeton University Technical
Report TR-646-02.
[071]
[91] Sanjeev Kumar, Kai Li. Performance Impact of Using ESP to Implement VMMC Firmware . To
Appear in Workshop on Novel Uses of System Area Networks (SAN-1), 2002 [072]
[92] Sanjeev Kumar, Yitzhak Mandelbaum, Xiang Yu, Kai Li. ESP: A Language for Programmable
Devices . Programming Language Design and Implementation, 2001. [073]
[93] Greg Eisenhauer, Fabián E. Bustamante and Karsten Schwan, "Native Data Representation: An
Efficient Wire Format for High Performance Computing" , Tech. Report GIT-CC-01-18, College of
Computing, Georgia Institute of Technology, 2001. [074]
[94] Fabián E. Bustamante, Greg Eisenhauer, Karsten Schwan, and Patrick Widener. "Efficient Wire
Formats for High Performance Computing".
Proc. of Supercomputing 2000 (SC 2000) , Dallas,
Texas, November 4-10, 2000. [075]
[95] Greg Eisenhauer and Lynn K. Daley, Fast Heterogeneous Binary Data Interchange, Proceedings of the 9th Heterogeneous Computing Workshop (HCW 2000), pgs 90-101. .ps
[076]
[96] Raj Krishnamurthy, Karsten Schwan, Richard West and Marcel Rosu, A Network Co-processor-
Based Approach to Scalable Media Streaming in Servers .
International Conference on Parallel
Processing, 2000 .
[077]
[97] Raj Krishnamurthy, Sudhakar Yalamanchili, Karsten Schwan and Richard West, "Architecture and
Hardware for Scheduling Gigabit Packet Streams" , to appear in Proceedings of the IEEE Symposium on High Performance Interconnects (Hot Interconnects 10), August 2002 [078]
[98] Patrick Widener, Greg Eisenhauer, and Karsten Schwan, “Open Metadata Formats: Efficient XML-
Based Communication for High Performance Computing”, Proceedings of High Performance
Distributed Computing (HPDC 10) , San Francisco, California, August 7-9, 2001. PostScript [147K] |
PDF Format [73K] [079]
[99] Christian Poellabauer, Karsten Schwan, Greg Eisenhauer, Jiantao Kong, “KECho - Event
Communication for Distributed Kernel Services”, Trends in Network and Pervasive Computing,
International Conference on Architecture of Computing Systems (ARCS'02), Springer Verlag,
Lecture Notes in Computer
PostScript [212K] | PDF Format [48K] [080]
Science, 2002, pp.83-100
[100] K.L. Calvert, "Architectural framework for active networks, version 1.0" , University of Kentucky,
July 1999. [081]
[101] AN Node OS Working Group, "NodeOS interface specification" , Edited by Larry Peterson (January
2002). [082]
[102] AN Composable Services Working Group, Ellen Zegura, editor, "Composable Services for Active
Networks" , May 1998. [083]
[103] AN Management Working Group, Management of Active Networks ,. [084]
[104] S. Murphy, Ed., "Security Architecture Draft" , Technical report, AN Security Working Group, 2000.
[085]
[105] IpInfusion, Integrating Control-Plane and Data-Plane Software Components , Technical paper. [086]
[106] NP Forum, CSIX-L1 (Network Processor/Traffic Manager connectivity to Switch Fabrics) . [087]
[107] Larry Peterson , Yitzchak Gottlieb , Mike Hibler , Patrick Tullmann , Jay Lepreau , Stephen Schwab,
Hrishikesh Dandekar, Andrew Purtell, and John Hartman , “ An OS Interface for Active Routers ”,
IEEE Journal on Selected Areas in Communications , 19(3):473–487, March 2001. [088]
[108] Ming Zhang , Randy Wang , Larry Peterson , Arvind Krishnamurthy ,
“Probabilistic Packet
Scheduling: Achieving Proportional Share Bandwidth Allocation for TCP Flows”, INFOCOM 2002
(June 2002). [089]
[109] Yitzchak Gottlieb and Larry Peterson , “A Comparative Study of Extensible Routers”, To appear in
2002 IEEE Open Architectures and Network Programming Proceedings (IEEE OPENARCH 2002) ,
June 2002 [090]
[110] Nadia Shalaby, Larry Peterson, Andy Bavier, Yitzchak Gottlieb, Scott Karlin, Aki Nakao, Xiaohu
Qie, Tammo Spalink, Mike Wawrzoniak. “Extensible Routers for Active Networks”.
DARPA Active
Networks Conference and Exposition '02 (May 2002). [371]
[111] Larry Peterson, Tom Anderson, David Culler, and Timothy Roscoe .”A Blueprint for Introducing
Disruptive Technology into the Internet”.
Intel Berkeley Research TR-02-008 (July 2002). [372]
[112] Xiaohu Qie, Ruoming Pang and Larry Peterson. “Defensive Programming: Using an Annotation
Toolkit to Build Dos-Resistant Software”.
Princeton University TR 658-02 (July 2002). [373]
[113] Steven Low , Larry Peterson , Limin Wang , “Understanding TCP Vegas: A Duality Model ”,Journal of the ACM , 49(2):207-235, March 2002 [091]
[114] Scott Karlin and Larry Peterson , “Maximum Packet Rates for Full-Duplex Ethernet ”, Princeton
University Technical Report TR--645--02, (February 2002). [092]
[115] Scott Karlin and Larry Peterson , “VERA: An Extensible Router Architecture ”, Computer Networks ,
Volume 38, Issue 3, Pages 277-293, (2002). [093]
[116] Tammo Spalink , Scott Karlin , Larry Peterson , Yitzchak Gottlieb , “Building a Robust Software-
Based Router Using Network Processors”, In Proceedings of the 18th ACM Symposium on Operating
Systems Principles (SOSP'01) . pages 216--229, Chateau Lake Louise, Banff, Alberta, Canada,
October 2001. [094]
[117] Xiaohu Qie , Andy Bavier , Larry Peterson , Scott Karlin , “Scheduling Computations on a Software-
Based Router”,
Proceedings of SIMETRICS 2001 (June 2001). An earlier version of this paper appeared as Princeton University Technical Report TR-615-00 (November 2000). [095]
[118] Björn Knutsson and Larry Peterson , “Transparent Proxy Signalling ”, Journal of Communication
Networks , March, 2001. [096]
[119] John H. Hartman , Larry L. Peterson , Andy Bavier , Peter Bigot, Patrick Bridges, Brady Montz, Rob
Piltz, Todd Proebsting , and Oliver Spatscheck, “Experiences Building a Communications-Oriented
JavaOS ”, Software—Practice & Experience , 30(10):1107–1126, August 2000. [097]
[120] A. Bavier and L. Peterson., “The Power of Virtual Time for Multimedia Scheduling”, Proceedings of the 10th NOSSDAV Workshop (June 2000). [098]
[121] Oliver Spatscheck, Jørgen S. Hansen , John H. Hartman , and Larry L. Peterson, “Optimizing TCP
Forwarder Performance”, IEEE/ACM Transactions on Networking 8(2):146–157, April 2000. [099]
[122] J. S. Hansen , “I/O Buffer Management for Shared Storage Devices in SCI-based Clusters of
Workstations ”,
SCI Europe 2001 , October 2001. (this is an extended, revised version of the paper above, i.e., "Flexible Network Attached Storage using Remote DMA") [413]
[123] J. S. Hansen and R. Lachaize , “Using Idle Disks in a Cluster as a High-Performance Storage
System”, IEEE International Conference on Cluster Computing , September 2002. [414]
[124] Emmanuel Cecchet. Whoops! : a Clustered Web Cache for DSM Systems using Memory Mapped
Networks. IEEE International Workshop on Web Caching Systems In Proceedings of ICDCS'02 ,
Vienna (Austria), July 2002 . [415]
[125] Emmanuel Cecchet. Memory Mapped Networks: a new deal for Distributed Shared Memories ? The
SciFS experience.
In Proceedings of IEEE International Conference on Cluster Computing (Cluster
2002) , Chicago, IL, (USA), September 2002 [416]
[126] Jean-Philippe Fassino, Jean-Bernard Stefani, Julia Lawall and Gilles Muller. THINK: A Software
Framework for Component-based Operating System Kernels.
In Proceedings of Usenix Annual
Technical Conference , Monterey (USA), June 10th-15th, 2002 [417]
[127] Vivien Quéma, Luc Bellissard and Philippe Laumay. Application-Driven Customization of Message-
Oriented Middleware for Consumer Devices.
In Proceedings of the Workshop on Software
Infrastructures for Component-Based Applications on Consumer Devices, in association with
EDOC'02 , Lausanne (Switzerland), September, 2002 [419]
[128] Christophe Rippert and Jean-Bernard Stefani. THINK: A Secure Distributed Systems Architecture.
In Proceedings of the 10th ACM SIGOPS European Workshop (extended abstract), St Emilion
(France), September 22nd-25th, 2002 [420]
[129] A. Forin, G. Hunt, L. Li, and Y. M. Wang, " High-Performance Distributed Objects over System
Area Networks ," in Proc. 3rd USENIX Windows NT Symp.
, pp. 21-30, July 1999 [421]
[130] Qixiang Sun, Daniel R. Simon, Yi-Min Wang, Wilf Russell, Venkata N. Padmanabhan, and Lili Qiu,
" Statistical Identification of Encrypted Web Browsing Traffic ," in Proc. IEEE Symposium on
Security & Privacy (the Oakland conference) , May 2002 [422]
[131] Chi-Chao Chang and Thorsten von Eicken, A Software Architecture for Zero-Copy RPC in Java,
Department of Computer Science, Cornell University. Technical Report 98-1708 [423]
[132] Jeff Chase, Andrew Gallatin, and Ken Yocum, “End-System Optimizations for High-Speed TCP”,
To appear in IEEE Communications , special issue on high-speed TCP. June 2000 [100]
[133] Khaled Harfoush, Azer Bestavros, and John Byers. PeriScope: An Active Measurement API . In
Proceedings of PAM'2002: The IEEE Passive and Active Measurement Workshop , March 2002.
[101]
[134] Azer Bestavros, John Byers, and Khaled Harfoush. Inference and Labeling of Metric-Induced
Network Topologies . In Proceedings of Infocom'02: The IEEE International Conference on
Computer Communication , June 2002. [102]
[135] Ibrahim Matta and Azer Bestavros. QoS Controllers for the Internet . In Proceedings of the NSF
Workshop on Information Technology , Cairo, Egypt, March 2000. [103]
[136] Lili Qiu, Yin Zhang, and Srinivasan Keshav. On Individual and Aggregate TCP Performance.
Proceedings of 7th International Conference on Network Protocols (ICNP'99), Toronto, Canada,
1999.[ gzipped PS ] [104]
[137] A. Cohen and S. Rangarajan, “A Programming Interface for Supporting IP Traffic Processing”, In
Proc. First International Working Conference on Active Networks , June 1999. [105]
[138] Performance enhancing proxies Intended to Mitigate Link-Related Degradations. RFC 3135. http://www.faqs.org/rfcs/rfc3135.html
[106]
[139] S. Ardon, P. Gunningberg, Y. Ismailov, B. Landfeldt, M. Portmann, A. Seneviratne and B. Thai,
“Mobile Aware server Architecture: A Distributed Proxy Architecture for Content Adaptation",
INET2001, Stockholm, Sweden, 2001. abstract - postscript [107]
[140] M. Gries: Algorithm-Architecture Trade-offs in Network Processor Design, Ph.D. thesis, Computer
Engineering and Networks Laboratory (TIK), TIK-Schriftenreihe No. 41, ETH Zurich Diss. No.
14191, 2001 Shaker Verlag , Aachen, Germany, ISBN 3-8265-9044-9 , examination date: May 21,
2001 ps: gries.ps.gz
(840kB), pdf: gries.pdf
(1.5MB), pdf with marks and links: gries_hyper.pdf
(1.7MB); Abstract [108]
[141] C. Pu, K. Schwan, J. Walpole, “Infosphere Project: System Support for Information Flow
Applications”, ACM SIGMOD Record, Volume 30, Number 1, (March 2001) .
[109]
[142] John W. Byers, Jeffrey Considine, Michael Mitzenmacher and Stanislav Rost., “Informed Content
Delivery Across Adaptive Overlay Networks”,
To appear in Proceedings of ACM SIGCOMM '02,
August 2002. A preliminary version appears as BUCS Technical Report 2002-007 . [110]
[143] Tilman Wolf and Jonathan Turner , Design Issues for High Performance Active Routers , IEEE
Journal on Selected Areas of Communications , March 2001. [111]
[144] A. Cohen, S. Rangarajan, "A Programming Interface for Supporting IP Traffic Processing,"
Proceedings of the First International Working Conference on Active Networks , Bell Laboratories,
June 1999. [112]
[145] Lili Qiu, Yin Zhang, and S. Keshav, "On Individual and Aggregate TCP Performance" , Cornell CS
Technical Report, May 1999. [113]
[146] SNIA Storage Networking Industry Association, IP Storage forum – iSCSI subgroup, “iSCSI for
Storage Networking” , White paper, http://www.snia.org/ . [114]
[147] Hakim Weatherspoon and John Kubiatowicz., "Erasure Coding vs. Replication: A Quantitative
Comparison", Appears in Proceedings of the First International Workshop on Peer-to-Peer Systems
(IPTPS 2002) , March 2002. [115]
[148] Ion Stoica
,
Robert Morris
,
David Karger
,
M. Frans Kaashoek
,
Hari Balakrishnan
,
"Chord: A
Scalable Peer-to-peer Lookup Service for Internet Applications" , In the Proceedings of the ACM
SIGCOMM '01 Conference , San Diego, California, August 2001.
[116]
[149] David D. Clark, John Wroclawski, Karen R. Sollins (MIT LCS), Robert Braden (USC), “Tussle in
Cyberspace: Defining Tomorrow’s Internet.”, Proc. ACM SIGCOMM 2002 [117]
[150] Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, Scott Shenker, "A Scalable Content-
Addressable Network" , Proc. ACM SIGCOMM 2001 [118]
[151] Micah Beck, Terry Moore and James S. Plank, "An End-to-End Approach to Globally Scalable
Network Storage" Proc. ACM SIGCOMM 2002 [119]
[152] Edith Cohen, Scott Shenker, “Replication Strategies in Unstructured Peer-to-Peer Networks”, Proc.
ACM SIGCOMM 2002 [120]
[153] Suman Banerjee, Bobby Bhattacharjee and Christopher Kommareddy, “Scalable Application Layer
Multicast”, ACM SIGCOMM 2002 [121]
[154] A. Keromytis,, V. Misra and D. Rubenstein, “SOS: Secure Overlay Services”, ACM SIGCOMM
2002 [122]
[155] Florin Baboescu, George Varghese, "Scalable Packet Classification" , Proc. ACM SIGCOMM 2001
[123]
[156] W. J. Bolosky, J. R. Douceur, D. Ely, M. Theimer; "Feasibility of a Serverless Distributed File
System Deployed on an Existing Set of Desktop PCs" , Proceedings of the international conference on Measurement and modeling of computer systems, 2000 , SIGMETRICS 2000 , pp. 34-43. [124]
[157] Kenneth L. Calvert, James Griffioen, Su Wen, “Lightweight Network Support for Scalable End-to-
End Services”, Proc. ACM SIGCOMM 2002 [125]
[158] Sundar Iyer, Rui Zhang, Nick McKeown, “Network Topology Generators: Degree-Based vs.
Structural”, Proc. ACM SIGCOMM 2002 [126]
[159] Christian Estan, George Varghese, “New Directions in Traffic Measurement and Accounting”, Proc.
ACM SIGCOMM 2002 [127]
[160] David Ely, Stefan Savage, and David Wetherall, “Alpine: A User-Level Infrastructure for Network
Protocol Development”, [PDF-Full text] [128]
[161] Bill Janssen, Henrik Frystyk Nielsen, Mike Spreitzer, “HTTP-ng Architectural Model”, W3C
Working Draft 10 July 1998, http://www.w3.org/Protocols/HTTP-NG/1998/08/draft-frystyk-httpngarch-00.txt
[129]
[162] White Paper on Application Programming Interfaces for Networks, http://www.ieee-pin.org/pinatm/docs/pinwp5.pdf
[130]
[163] Huan Liu, "A Trace Driven Study of Packet Level Parallelism", Proc. International Conference on
Communications (ICC), New York, NY, 2002 [ PDF(66k) ] [131]
[164]
Dawson R. Engler, “ vcode: a retargetable, extensible, very fast dynamic code generation system
,”
Appeared in SIGPLAN Conference on Programming Language Design and Implementation (PLDI
'96), Philadelphia, PA, May 1996.
, [132]
[165] Dawson Engler, Benjamin Chelf, Andy Chou, and Seth Hallem, “Checking System Rules Using
System-Specific, Programmer-Written Compiler Extensions ”, OSDI 2000 [378]
[166] Sean O'Malley, Todd Proebsting , and Allen Brady Montz, “USC: A Universal Stub Compiler”, In
Proceedings of the Conference on Communications Architectures, Protocols and Applications
(SIGCOMM '94 Annual Technical Conference) , pages 295–306, London, UK, August 1994 [133]
[167] Christopher W. Fraser , T. Proebsting . “Finite-state code generation”, PLDI'99 :270-280. PDF
(90KB). [134]
[168] Jens Wagner, Rainer Leupers,
“C Compiler Design for a Network Processor”,
IEEE TCAD , vol. 20, no. 11, Nov 2001 [135]
[169] Suet-Fei Li, Marlene Wan, Jan Rabaey, "Configuration Code Generation and Optimization for Low-
Energy Reconfigurable DSPs", Proceedings of SIPS99 [PDF] . [136]
[170] Sean Dorward and Sean Quinlan, “Robust Data Compression of Network Packets ”, Data
Compression Conference, 2000 [137]
[171] Jeff Tsay, Christopher Hylands and Edward Lee, " A Code Generation Framework for Java
Component-Based Designs ," CASES '00 , November 17-19, 2000, San Jose, CA. [138]
[172] Peter J. McCann Satish Chandra,
“Packet Types: Abstract Specification of Network Protocol
Messages”, ACM SIGCOMM 2000. [139]
[173] Karthik Bhargavan, Satish Chandra, Peter McCann and Carl A. Gunter, “What Packets May Come:
Automata for Network Monitoring”, ACM Symposium on Principles of Programming Languages
(POPL), Jan 2001. [140]
[174] S. Chandra and P. J. McCann .”Packet Types”.
In Second Workshop on Compiler Support for Systems
Software (WCSSS) , May 1999. [141]
[175] Karthikeyan Bhargavan and Carl A. Gunter. “Network event recognition for packet-mode surveillance.”
Submitted for publication, 2002 . BibTeX entry Download PS.
Download PDF.
[142]
[176] Fulvio Risso, Loris Degioanni, “An Architecture for High Performance Network Analysis” , to appear in the Proceedings of the 6 th IEEE Symposium on Computers and Communications (ISCC
2001) , Hammamet, Tunisia, July 2001. [143]
[177] Satish Chandra, Patrice Godefroid, and Chris Palm, “Software Model Checking in Practice: An
Industrial Case Study”, International Conference on Software Engineering (ICSE) , May 2002. [144]
[178] Patrice Godefroid, Model Checking for Programming Languages using VeriSoft Proceedings of the
24th ACM Symposium on Principles of Programming Languages , pages 174-186, Paris, January
1997. [145]
[179] Michael Benedikt, Juliana Freire, Patrice Godefroid, VeriWeb: Automatically Testing Dynamic Web
Sites , Proceedings of WWW'2002 (11th International World Wide Web Conference) , Honolulu, May
2002. [146]
[180] Patrice Godefroid, Sarfraz Khurshid, Exploring Very Large State Spaces Using Genetic Algorithms
Proceedings of TACAS'2002 (Tools and Algorithms for the Construction and Analysis of Systems ),
Grenoble, April 2002. [147]
[181] Zhou, D., Chen, Y., Eisenhauer, G., and Schwan, K., “Active Brokers and Their Runtime
Deployment in the ECho/JECho Distributed Event Systems”, accepted by the Third Annual
International Workshop on Active Middleware Services , 2001 [148]
[182] S. Merugu, S. Bhattacharjee, E. Zegura and K. Calvert, “Bowman: A Node OS for Active
Networks”, Proceedings of IEEE Infocom 2000, Tel Aviv, Israel, March 2000. [149]
[183] Jonathan T. Moore, Michael Hicks, and Scott Nettles. `` Practical Programmable Packets .'' In
Proceedings of the 20th Annual Joint Conference of the IEEE Computer and Communications
Societies (INFOCOM'01) , April 2001. [150]
[184] Trevor Jim, Greg Morrisett, Dan Grossman, Michael Hicks, James Cheney, and Yanling Wang,
“
Cyclone: A Safe Dialect of C
”,
USENIX Annual Technical Conference, Monterey, CA , June 2002.
To appear. [151]
[185] Dan Grossman, Greg Morrisett, Trevor Jim, Michael Hicks, Yanling Wang, and James Cheney,
“ Region-based Memory Management in Cyclone ”, ACM Conference on Programming Language
Design and Implementation , Berlin, Germany, June, 2002. To appear. [152]
[186] Melnik, Sergey; Garcia-Molina, Hector; Rahm, Erhard. “Similarity Flooding: A Versatile Graph
Matching Algorithm and its Application to Schema Matching”, Proc. 18th ICDE Conf ., 2002 [153]
[187] Rajiv Wickremesinghe, Jeffrey S. Chase, and Jeffrey S. Vitter .”Distributed computing with loadmanaged active storage”.
In IEEE International Symposium on High Performance Distributed
Computing (HPDC-11) , July 2002. [154]
[188] Jerry Gao, Eugene Zhu, Simon Shim, "Tracking SOftware Components" , Journal of Object-Oriented
Programming , October/November 2001, pp.13-22 [155]
[189] Annette Bunker and Ganesh Gopalakrishnan. Formal Specification of the Virtual Component
Interface Standard in the Unified Modeling Language . Technical Report UUCS-01-007,
University of Utah, June 2001. ([ BIB ], [ ABS ], [ PS ], [ PDF ]) [386]
[190] Annette Bunker, Sally A. McKee, and Ganesh Gopalakrishnan. An Overview of Formal Hardware
Specification Languages . Grace Hopper Celebration of Women in Computing, October 2002, to appear. ([ BIB ], [ ABS ], [ PS ], [ PDF ]) [387]
[191] Shashi Phoha, “Mobile Robotic Networks”, in ARL review 2001 , [156]
[192] S. Phoha, E. Peluso, and R. Brooks, "A Constructivist Theory of Distributed Intelligent Control of
Complex Dynamic Systems." DARPA JFACC Symposium on Advances in Enterprise Control. San
Diego, CA. November 1999
[193] Wills, L., Sander, S., Kannan, S., Kahn, A., Prasad, J.V.R., and Schrage, D." An Open Control
Platform for Reconfigurable, Distributed, Hierarchical Control Systems, " Proceedings of the Digital
Avionics Systems Conference, Philadelphia, PA, October 2000
.
[158]
[194] Ch'ng Shi Baw, R.D. Chamberlain, and M.A. Franklin, " Design of an Interconnection Network
Using VLSI Photonics and Free-Space Optical Technologies ." In Proc. of the 6th Int'l Conf. on
Parallel Interconnects, October 1999, pp. 52-61. [159]
[195] Eddie Kohler , Massimiliano Poletto , and David R. Montgomery, “Evolving software with an application-specific language.
” ( abstract , PDF , PS ), In the Workshop Record of WCSSS '99: The 2nd
ACM SIGPLAN Workshop on Compiler Support for Systems Software , Atlanta, Georgia, May 1999, pages 94-102. [160]
[196] A. R. Schmidt , F. Waas , M. L. Kersten , D. Florescu , M. J. Carey , I. Manolescu , R. Busse . Why and
How to Benchmark XML Databases . ACM SIGMOD Record, 3(30) September 2001. [161]
[197] Hartmut Liefke , Dan Suciu, “ XMill: an Efficient Compressor for XML Data ”, Proceedings of
ACM SIGMOD International Conference on Management of Data (2000), [.ps] .bib
[162]
[198] P.Basu, W.Ke, T.D.C.Little, “A Novel Approach for Execution of Distributed Tasks on Mobile Ad
Hoc Networks” - BU MCL Technical Report TR-07222001 , July 2001.
Postscript version (gzipped) [163]
[199] Hideaki Okamura and Yutaka Ishikawa, "Object Location Control Using Meta-level Programming" ,
Proceedings of the 8th European Conference on Object-Oriented Programming (ECOOP'94),
Springer-Verlag LNCS 821, Jul. 1994. [164]
[200] M. Astley , D. Sturman , and G. Agha , "Customizable Middleware for Modular Distributed Software" ,
To Appear Communications of the ACM.
[165]
[201] Jilles van Gurp, Jan Bosch, On the Implementation of Finite State Machines , Proceedings of the
IASTED 3rd International Conference on Software Engineering and Applications , July 1999. [166]
[202] Eberbach E., Challenges Facing Computer Science in the 21st Century , in: (ed.J.C.Misra) Applicable
Mathematics: Its Perspectives and Challenges, Narosa Publishing House, New Delhi, Mumbai,
Calcutta, ISBN 81-7319-406-8, Part VII: Challenges in Mathematical Sciences, Chapter 57,
2001, 565-573. [167]
[203] Roel Wuyts, “Synchronising Changes to Design and Implementation using a Declarative Meta -
Programming Language”, In International Workshop on (Constraint) Logic Programming for
Software Engineering, dec, 2001. online pdf file [168]
[204] Roel Wuyts and Stéphane Ducasse, “Non - Functional Requirements in a Component Model for
Embedded Systems”, In International Workshop on Specification and Verification of Component -
Based Systems , 2001. online pdf file [169]
[205] Nathanael Schärli, Franz Achermann and Oscar Nierstrasz, “Meta-level Language Bridging, ” 2002, submitted for publication. PDF [170]
[206] Gregor Kiczales, John Lamping, Anurag Mendhekar, Chris Maeda, Cristina Videira Lopes, Jean-
Marc Loingtier, John Irwin, "Aspect-Oriented Programming" . In proceedings of the European
Conference on Object-Oriented Programming (ECOOP), Finland. Springer-Verlag LNCS 1241.
June 1997. [171]
[207] Kendall, E. A., "Aspect-oriented Programming in AspectJ," Evolve 2000 , Sydney, March, 2000.
[172]
[208] Partha S. Roop, A. Sowmya, A Formal Approach to Component Based Development of Embedded
Systems , Technical Report UNSW-CSE-TR-0004, May 2000. [173]
[209] B. Tekinerdogan. A Meta-Model for composition techniques in object-oriented software development . ECOOP '96, Composability issues in object-oriented software development workshop,
Linz, Austria, 1996. [174]
[210] H.A. de Jong ; P.A. Olivier , “Generation of abstract programming interfaces from syntax definitions”,
Technical Report 2002, SEN-R0212, ISSN 1386-369X [270]
[211]
L. Duchien, G. Florin, R. Gómez, L. Seinturier.
The Wave Algorithms as a Self-Stabilizing Control
Structure . Research Report CNAM-CEDRIC 96-14. September 1996. 16 pages.
[212] R. Poli. Evolution of Graph-Like Programs with Parallel Distributed Genetic Programming, In E
Goodman, Ed. Proceedings of Seventh International Conference on Genetic Algorithms , Michigan
State University, pp. 346-353, East Lansing, USA, July 1997. Morgan Kaufmann.
Compressed
PostScript [176]
[213] Dan Bouvier, “RapidIO  : An Embedded System Component Network Architecture”, RapidIO
Technical Working Group.
[214] RapidIO Trade Association: “RapidIO Interconnect Specification”, Rev 1.2 2001, http://www.rapidio.org/specs [399]
[215] RapidIO Trade Association: “RapidIO Serial Physical Layer Specification”, Rev 1.2
2001, http://www.rapidio.org/specs [400]
[216] RapidIO Trade Association: “RapidIO Interconnect GSM Logical Specification”, Rev 1.2
2001, http://www.rapidio.org/specs [401]
[217] RapidIO Trade Association: “RapidIO Documentation Overview”, Rev 1.2
2001, http://www.rapidio.org/specs [402]
[218] RapidIO Trade Association: “RapidIO System and Device Inter-operability Specification”, Rev 1.2
2001, http://www.rapidio.org/specs [403]
[219] RapidIO Trade Association: “RapidIO Technical White Paper”, Rev 2 2001, http://www.rapidio.org/specs [404]
[220] L.A. Rowe, W.T. Ooi, and P. Pletcher, “ INDIVA: Distributed Streaming Media Equipment and
Control Middleware ”, Submitted for publication , April 2002. [178]
[221] Suchitra Raman and Steven McCanne , “A Model, Analysis, and Protocol Framework for Soft Statebased Communication”, Proceedings of ACM SIGCOMM '99, Cambridge, MA, September 1999.
Best Student Paper Award. Available as gzip'd Postscript (156 KB) [179]
[222] Suchitra Raman and Steven McCanne , Scalable Data Naming for Application Level Framing in
Reliable Multicast. , In Proceedings of ACM Multimedia '98 , Bristol, UK, September 1998.
[223]
Radia J. Perlman and Suchitra Raman, “
Techniques for Making IP Multicast Simple and Scalable
”,
In Networked Group Communication, 270-285, 1999 [425]
[224] A.D.Gordon, A. Jeffrey. Authenticity by typing for security protocols In 14th IEEE Computer
Security Foundations Workshop (CSFW 2001) , pages 145-159, Cape Breton, June 11-13, 2001. IEEE
Computer Society. An extended version of this paper appears as Technical Report MSR-TR-2001-
49 , Microsoft Research, May 2001 [180]
[225] M. Tomassini, “Parallel and Distributed Evolutionary Algorithms: A Review“, In Evolutionary
Algorithms in Engineering and Computer Science, J. Wiley and Sons, Chichester, 1999, K. Miettinen,
M. Mäkelä, P. Neittaanmäki and J. Periaux (editors), 113-133, 1999.
[181]
[226] M.I.A. Stoelinga Fun with FireWire: Experiences with Verifying the IEEE1394 Root Contention
Protocol. Formal Aspects of Computer science , 2002. BibTeX reference. A shorter version appreared in the Proceedings of the International Workshop on Application of Formal Methods to the
IEEE 1394 Standard . BibTeX [182]
[227] H. Ossher and P. Tarr. " Multi-Dimensional Separation of Concerns and The Hyperspace Approach ."
In Proceedings of the Symposium on Software Architectures and Component Technology: The State of the Art in Software Development.
Kluwer, 2000. (To appear.) [183]
[228] Erik Ernst. Syntax Based Modularization: Invasive or Not?
. Accepted at the workshop "Advanced
Separation of Concerns" at OOPSLA 2000. BibTeX , Postscript , Postscript/gzip . [184]
[229] Robert Grimm, Janet Davis, Eric Lemar, Adam MacBeth, Steven Swanson, Tom Anderson, Brian
Bershad, Gaetano Borriello, Steven Gribble, and David Wetherall. Programming for pervasive computing environments (PDF, 345 KB). Submitted for publication. [185]
[230] Gutierrez-Nolasco Sebastian and Venkatasubramanian Nalini , “ A Composable Reflective
Communication Framework ,” Proceedings of the IFIP/ACM Workshop on Reflective Middleware
(RM2000), April 2000.[ ps ] [ pdf ] [186]
[231] Th. Bäck and H.-P. Schwefel: Evolutionary Computation: An Overview (108k) Proceedings of the
Third IEEE Conference on Evolutionary Computation 1996, pp. 20-29, IEEE Press, Piscataway NJ,
1996. [187]
[232] E. Biagioni, R. Harper, P. Lee. “A Network Protocol Stack in Standard ML” Accepted for publication by the Journal of Higher-Order and Symbolic Computation , Kluwer, Vol. 14, N. 4
(December 2001). http://www.ics.hawaii.edu/~esb/prof/pub/foxfinal.ps [188]
[233] Dannenberg, ``Aura as a Platform for Distributed Sensing and Control, '' in Symposium on Sensing and Input for Media-Centric Systems (SIMS 02) , Santa Barbara: University of California Santa
Barbara Center for Research in Electronic Art Technology, (2002), pp. 49-57. [189]
[234] Sagar Chaki, Sriram K. Rajamani, Jakob Rehof, “Types as Models: Model Checking Message
Passing Programs,” The 29th Annual ACM SIGPLAN-SIGACT Symposium on Principles of
Programming Languages (POPL) 2002 , ( ps ps.gz
pdf MSR-TR ). [190]
[235] Evan Speight, Hazim Abdel-Shafi, and John K. Bennett. WSDLite: A Lightweight Alternative to
Windows Sockets Direct Path . In Proceedings of the 4 th Usenix Windows Systems Symposium .
Seattle, WA, August 2000. [191]
[236] Brad Adelberg, “NoDoSE A tool for Semi-Automatically Extracting Structured and Semistructured
Data from Text Documents”, http://citeseer.nj.nec.com/adelberg98nodose.html
[192]
[237] Bernstein, P.A. A. Y. Halevy, R.A. Pottinger, "A Vision for Management of Complex Models,"
SIGMOD Record, December 2000, PDF, 109KB [193]
[238] Bernstein, P.A., A.Y. Levy, R.A. Pottinger, "A Vision for Management of Complex Models,"
Microsoft Research Technical Report MSR-TR-2000-53, June 2000, PDF, 179KB [194]
[239] Melnik, Sergey; Garcia-Molina, Hector; Rahm, Erhard
.”Similarity Flooding: A Versatile Graph
Matching Algorithm and its Application to Schema Matching”, Proc. 18th ICDE Conf., 2002 [195]
[240] Service Portfolio Overview for Data Backbone Carriers: A Paper in the Backbone Network and
Business Solutions Series by Alcatel , White Paper, March 15, 2002 [196]
[241] Bernard Aboba, et. al. “Securing Block Storage Protocols over IP”, draft-ietf-ips-security-14.txt
,
24/07/2002 [197]
[242] Garth A. Gibson, David F. Nagle*, Khalil Amiri*, Fay W. Chang, Eugene M. Feinberg*, Howard
Gobioff, Chen Lee, Berend Ozceri*, Erik Riedel*, David Rochberg, Jim Zelenka, “File Server
Scaling with Network-Attached Secure Disks”, Proceedings of the ACM International Conference on
Measurement and Modeling of Computer Systems (Sigmetrics '97), Seattle, Washington, June 15-18,
1997.
[198]
[243] Kostas Magoutis, Salimah Addetia, Alexandra Fedorova, Margo I. Seltzer, Jeffrey S. Chase, Andrew
J. Gallatin, Richard Kisley, Rajiv G. Wickremesinghe, Eran Gabber, "Structure and Performance of the Direct Access File System" ( pdf) , to appear at the USENIX Annual Technical Conference,
Monterey, CA, June 9-14, 2002. [199]
[244] Wee Teck Ng, Hao Sun, Bruce Hillyer, Elizabeth Shriver, Eran Gabber and Banu Ozden, "Obtaining
High Performance for Storage Outsourcing", Proceedings of the Conference on File and Storage
Technologies (FAST 2002), Monterey, California, January 28-29, 2002, pp. 145-158.
The paper [144KB] . [200]
[245] G.A. Gibson, D.P. Nagle, et al. "A Cost-Effective, High-Bandwidth Storage Architecture,"
Proceedings of the 8th Conference on Architectural Support for Programming Languages and
Operating Systems, October 1998. [201]
[246] Sean Quinlan and Sean Dorward, “Venti: a new approach to archival storage”, First USENIX conference on File and Storage Technologies, 2002. [202]
[247] Crespo, A.; Garcia-Molina, H.
”Archival Storage for Digital Libraries”,
Third ACM Conference on
Digital Libraries. Pittsburgh, PA, USA, June 23-26, 1998 [203]
[248] Kevin Fu , M. Frans Kaashoek , and David Mazières ., “Fast and secure distributed read-only file system ”, In ACM Transactions on Computer Systems 20 (1), February 2002, pages 1-24.
( BibTeX entry ) (A version appeared in Proceedings of the 4th Symposium on Operating Systems
Design and Implementation.) [204]
[249] Athicha Muthitacharoen, Benjie Chen , and David Mazières . “A Low-bandwidth Network File
System”, In Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP '01) ,
Chateau Lake Louise, Banff, Canada, October 2001, pages 174-187. [205]
[250] David Mazières and Dennis Shasha, “Building secure file systems out of Byzantine storage ”, In
Proceedings of the Twenty-First ACM Symposium on Principles of Distributed Computing (PODC
2002) , July 2002. (The full version is available as NYU computer science department technical report TR2002-826, May 2002.) [206]
[251] Frank Dabek , M. Frans Kaashoek , David Karger , Robert Morris , and Ion Stoica ., “Wide-area cooperative storage with CFS.”, In Proceedings of the 18th ACM Symposium on Operating Systems
Principles (SOSP '01) , Chateau Lake Louise, Banff, Canada, October 2001. [207]
[252]
David Mazières
.,
“A toolkit for user-level file systems.”,
In Proceedings of the 2001 USENIX
Technical Conference . June, 2001. [208]
[253] David Mazières, “Self-certifying file system”, PhD thesis, MIT, May 2000. [209]
[254] David Mazières , Michael Kaminsky , M. Frans Kaashoek , and Emmett Witchel., “Separating key management from file system security. ”, In Proceedings of the 17th ACM Symposium on Operating
Systems Principles (SOSP '99) , Kiawah Island, South Carolina, December 1999. [210]
[255] David Mazières and M. Frans Kaashoek ., “Escaping the evils of centralized control with selfcertifying pathnames”, In Proceedings of the 8th ACM SIGOPS European workshop: Support for composing distributed applications , Sintra, Portugal, September 1998. [211]
[256] Jeffrey K. Hollingsworth, and Ethan L. Miller, “Using Content-Derived Names for Configuration
Management ”, 1997 ACM Symposium on Software Reusibility (Boston, MA - May 1997) [212]
[257] D.I. Kang, R. Gerber, L. Golubchik, J. K. Hollingsworth, and M. Saksena, “A Software Synthesis
Tool for Distributed Embedded System Design ”,
Languages Compilers Tools for Embeded Systems
(LCTES) (Atlanta, GA - May 1999, pp. 87-95) [213]
[258] Douglas S. Santry, Michael J. Feeley, Norman C. Hutchinson, Alistair C. Veitch, Ross W. Carton, and Jacob Ofir. “Deciding When to Forget in the Elephant File System. ”, In Proceedings of 17th
ACM Symposium on Operating Systems Principles , December 1999.
[214]
[259] Yvonne Coady, Joon Suan Ong, and Michael J. Feeley, “, Using Embedded Network Processors to
Implement Global Memory Mangement in a Workstation Cluster. ”, In Proceedings of the IEEE
Symposium on High Performance Distributed Computing , August 1999.
[215]
[260] Douglas S. Santry, Michael J. Feeley, Norman C. Hutchinson, Alistair C. Veitch., “Elephant:
The File System that Never Forgets.”, In Proceedings of the IEEE Workshop on Hot Topics in Operating Systems (HOTOS) , March 1999. (Best Student Paper) [216]
[261] John D. Strunk, Garth R. Goodson, Michael L. Scheinholtz, Craig A.N. Soules, and Gregory R.
Ganger., “Self-Securing Storage: Protecting Data in Compromised Systems”, the Proceedings of the
2000 OSDI Conference , October 2000. [217]
[262] Christopher R. Lumb, Jiri Schindler, Gregory R. Ganger., “Freeblock Scheduling Outside of Disk
Firmware”, To appear, Conference on File and Storage Technologies (FAST) January 28-30, 2002.
Monterey, CA.
[218]
[263] Mehmet Bakkaloglu, Jay J. Wylie, Chenxi Wang, Gregory R. Ganger., “On Correlated Failures in
Survivable Storage Systems”,
CMU SCS Technical Report CMU-CS- 02-129. May 2002. [219]
[264] Jiri Schindler, John Linwood Griffin, Christopher R. Lumb, Gregory R. Ganger., “Track-aligned
Extents: Matching Access Patterns to Disk Drive Characteristics”, To appear, Conference on File and Storage Technologies (FAST) January 28-30, 2002. Monterey, CA.
[220]
[265] Gregory R. Ganger., “Blurring the Line Between OSes and Storage Devices”, CMU SCS Technical
Report CMU-CS-01-166, December 2001. [221]
[266] Jay J. Wylie, Mehmet Bakkaloglu, Vijay Pandurangan, Michael W. Bigrigg, Semih Oguz, Ken Tew,
Cory Williams, Gregory R. Ganger, Pradeep K. Khosla., “Selecting the Right Data Distribution
Scheme for a Survivable Storage System”, CMU SCS Technical Report CMU-CS-01-120, May
2001. [222]
[267] Gregory R. Ganger and David F. Nagle., “Better Security via Smarter Devices”, Appears in HotOS-
VIII (IEEE Workshop on Hot Topics in Operating Systems) , May 2001. [223]
[268] Gregory R. Ganger., “Position Summary: Authentication Confidences”, Appears in HotOS-VIII
(IEEE Workshop on Hot Topics in Operating Systems ), May 2001. [224]
[269] Garth A. Gibson and Rodney Van Meter, “Network Attached Storage Architecture”,
COMMUNICATIONS OF THE ACM, Vol.43, No.11, November 2000.
[225]
[270] Kirsten Hildrum John Kubiatowicz Satish Rao Ben Y. Zhao , “Distributed Object Location in a
Dynamic Network”, Fourteenth ACM Symposium on Parallel Algorithms and Architectures (SPAA
2002) [226]
[271] Offload Sockets Framework and Sockets Direct Protocol (SDP) Architectural Specification,
Software Architecture Specification, h ttp://infiniband.sourceforge.net/NW/SDP/docs.htm
[227]
[272] Offload Sockets Framework and Socket Direct Protocol (SDP) High Level Design, High Level
Design Document, h ttp://infiniband.sourceforge.net/NW/SDP/docs.htm
[228]
[273] Craig Ulmer, Chris Wood, and Sudhakar Yalamanchili, Active SANs: Integrating Computation and
Communication . in Proceedings of Workshop on Novel Uses of System Area Networks ( SAN-1 )
(Held in conjunction with HPCA-8 ), Cambridge, MA, February 2, 2002. [229]
[274] Kostas Magoutis, The Optimistic Direct Access File System: Design and Network Interface Support . in Proceedings of Workshop on Novel Uses of System Area Networks ( SAN-1 ) (Held in conjunction with HPCA-8 ), Cambridge, MA, February 2, 2002. [230]
[275] Fugui Wang and Prasant Mohapatra, “Using Differentiated Services to Support Internet Telephony ”,
Computer Communications , Dec., 2001. [231]
[276] W. Allcock, I. Foster, S. Tuecke, A. Chervenak, C. Kesselman. “Protocols and Services for
Distributed Data-Intensive Science”, ACAT2000 Proceedings , pp. 161-163, 2000. [232]
[277] Mark Heinrich and Evan Speight. Active Memory Clusters: Efficient Multiprocessing on Next-
Generation Servers.
Cornell Computer Systems Lab Technical Report CSL-TR-2001-1014 , August
2001. [233]
[278] Scott Atchley , Stephen Soltesz , James S. Plank , Micah Beck , and Terry Moore .
“Fault-Tolerance in the Network Storage Stack'”, IEEE Workshop on Fault-Tolerant Parallel and Distributed Systems ,
Ft. Lauderdale, FL, April, 2002. [234]
[279] James S. Plank, Micah Beck and Terry Moore, ``Logistical Networking Research and the Network
Storage Stack,'' USENIX FAST 2002, Conference on File and Storage Technologies , work in progress report, January, 2002. [235]
[280] James S. Plank, ``A Tutorial on Reed-Solomon Coding for Fault-Tolerance in RAID-like Systems'' ,
Software -- Practice & Experience, 27(9) , September, 1997, pp. 995-1012. [236]
[281] Alessandro Bassi, Micah Beck, Graham Fagg, Terry Moore, James S. Plank, Martin Swany, and
Rich Wolski, ``The Internet Backplane Protocol: A Study in Resource Sharing,'' International
Symposium on Cluster Computing and the Grid , Berlin, Germany, May, 2002. [237]
[282] Daniel Jackson, “Alloy: A Lightweight Object Modelling Notation”, July 2000 [238]
[283] Joe Hall, Jason Hartline, Anna Karlin, Jared Saia and John Wilkes, "On Algorithms for Efficient
Data Migration", Symposium on Discrete Algorithms 2001 . ( ps , pdf ). [239]
[284] Eric Anderson, Joe Hall, Jason Hartline, Michael Hobbes, Anna Karlin, Jared Saia, Ram
Swaminathan and John Wilkes. "An Experimental Study of Data Migration Algorithms". Workshop on Algorithm Engineering 2001 . ( ps , pdf ). ( Java Code used for the experiments in this paper.) [240]
[285] John Wilkes, Patrick Goldsack, G. (John) Janakiraman, Lance Russell, Sharad Singhal, and Andrew
Thomas. eOS - the dawn of the resource economy [PDF 86KB, PostScript 408KB]. HP
Laboratories technical report (May 2001). A one page version [PDF 97KB, PostScript 96KB] also appears as a position summary in the proceedings of the 8th Workshop on Hot Topics in Operating
Systems ( HotOS-VIII , 20-23 May 2001, Schloss Elmau, Germany), (C) Copyright 2001 IEEE. [241]
[286] Jared Saia, "Data Migration with Edge Capacities and Machine Speeds" In submission. ( ps , pdf ).
[242]
[287] Martin Odersky and Christoph Zenger. Nested Types , In Proceedings FOOL8 , Workshop on
Foundations of Object-Oriented Languages, January 2001.
[243]
[288] Galen Hunt
and Doug Brubacher.
Detours: Binary Interception of Win32 Functions
. Proceedings of the
[244]
3rd USENIX Windows NT Symposium , pp. 135-143. Seattle, WA, July 1999. USENIX.
[289] Ramaprabhu Janakiraman , Marcel Waldvogel , and Lihao Xu : Fuzzycast: Efficient Video-on-
Demand over Multicast , Proceedings of IEEE Infocom 2002 , New York, NY, USA, June 2002.
[245]
[290] http://www.interop.com/lv2002/education/storage.php
[291] Ruibiao Qiu, Fred Kuhns, Jerome R. Cox Jr., and Craig Horn. “ Adaptation Layer Translator (ALX)
Design and Application ,”,Washington University, Department of Computer Science Technical
Report, WUCS-02-11, 3/2002. [247]
[292] James Larus and Michael Parkes, Using Cohort Scheduling to Enhance Server Performance , To appear: Usenix Annual Technical Conference, June 2002 ( postscript ) [248]
[293] Glenn Ammons, Ras Bodik, James Larus, Mining Specifications , POPL '02, January 2002.
(postscript) [249]
[294] Tierney, B., W. Johnston, H. Herzog, G. Hoo, G. Jin, J. Lee, System Issues in Implementing High
Speed Distributed Parallel Storage Systems , Proceedings of the USENIX Symposium on High
Speed Networking, Aug. 1994, LBL-35775. [250]
[295] Tierney, B., W. Johnston, T. Chen, H. Herzog, G. Hoo, G. Jin, J. Lee, Distributed Parallel Data
Storage Systems: A Scalable Approach to High Speed Image Servers , Proceedings of the ACM
Multimedia, October 1994, LBL-35408. [251]
[296] D. Gunter, B. Tierney, K. Jackson, J. Lee, M. Stoufer, " Dynamic Monitoring of High-Performance
Distributed Applications" , Proceedings of the 11th IEEE Symposium on High Performance
Distributed Computing, HPDC-11 , July 2002, LBNL-49698. [252]
[297] J. Lee, D. Gunter, M. Stoufer, B. Tierney, " Monitoring Data Archives for Grid Environments" ,
Proceeding of IEEE Supercomputing 2002 Conference, Nov. 2002, LBNL-50216. [253]
[298] B.Tierney, " TCP tuning Guide for Distributed Applications on Wide Area Networks ", Usenix ;login
Journal, Feb, 2001, p33. LBNL-45261. [254]
[299] Jonathan T. Moore. `` Safe and Efficient Active Packets .'' Technical Report MS-CIS-99-24,
Department of Computer and Information Science, University of Pennsylvania, October 1999. [301]
[300] M. Mauve, J. Widmer, and H. Hartenstein .A survey on position-based routing in mobile ad hoc networks.
IEEE Network Magazine, 15(6):30--39, November 2001. [306]
[301] Ben Y. Zhao , Yitao Duan, Ling Huang, Anthony D. Joseph , John Kubiatowicz , “Brocade: Landmark
Routing on Overlay Networks”, First International Workshop on Peer-to-Peer Systems (IPTPS
2002) [308]
[302] David E. Taylor, Jonathan S. Turner, John W. Lockwood, Dynamic Hardware Plugins (DHP):
Exploiting Reconfigurable Hardware for High-Performance Programmable Routers , IEEE
OPENARCH 2001: 4th IEEE Conference on Open Architectures and Network Programming,
Anchorage, AK, 4/01.
[309]
[303] Paulin, P.G.; Karim, F.; Bromley, P., “Network processors: a perspective on market requirements, processor architectures and embedded S/W tools ,” Design, Automation and Test in Europe, 2001.
Conference and Exhibition 2001. Proceedings , 2001 Page(s): 420 -427 [310]
[304] A. T. Campbell, H. G. De Meer, M. E. Kounavis, K. Miki, J. Vicente, and D. Villela, "A Survey of
Programmable Networks", ACM SIGCOMM Computer Communications Review , Vol. 29, No 2, pg.
7-23, April 1999.
[311]
[305] A. T. Campbell, S. Chou, M. E. Kounavis, V. D. Stachtos and J. Vicente "NetBind: A Binding Tool for Constructing Data Paths in Network Processor-based Routers", Fifth International Conference on
Open Architectures and Network Programming (OPENARCH' 02) , New York, NY, June 2002. [312]
[306] M. E. Kounavis, A. T. Campbell, S. Chou, F. Modoux, J. Vicente, and H. Zhang, "The Genesis
Kernel: A Programming System for Spawning Network Architectures", IEEE Journal on Selected
Areas in Communications (JSAC) , Special Issue on Active and Programmable Networks, Vol. 19,
No. 3, pp. 49-73, March, 2001. [ pdf ][ ps.gz
] [412]
[307] A. T. Campbell, S. Chou, M. E. Kounavis, V. D. Stachtos and J. Vicente, "The Genesis Kernel: A
Programming System for Spawning Network Architectures", Source Code Distribution 1.0
, Comet
Group Software Release , to be announced, 2002.
[308] Eddie Kohler, Robert Morris, Benjie Chen, John Jannotti, and M. Frans Kaashoek, “The Click modular router”, In ACM Transactions on Computer Systems 18(3), August 2000, pages 263-297.
[313]
[309] Eddie Kohler, Robert Morris, and Massimiliano Poletto,
“Modular components for network address translation”, Click project technical report, December 2000.
[375]
[310] Benjie Chen and Robert Morris, “Flexible Control of Parallelism in a Multiprocessor PC Router”, In the Proceedings of the 2001 USENIX Annual Technical Conference (USENIX '01) , Boston,
Massachusetts, June 2001.
[314]
[311] Piyush Shivam, Pete Wyckoff, Dhabaleswar Panda,
“EMP: Zero-copy OS-bypass NIC-driven Gigabit Ethernet
Message Passing ”, SC2001 [377]
[312] David Lie, Andy Chou, Dawson Engler and David Dill. A Simple Method for Extracting Models from Protocol Code . To appear in the Proceedings of the 28th International Symposium on
Computer Architecture (ISCA 2001). July, 2001. [379]
[313] Cisco White Paper, Positioning MPLS , 2002 [316]
[314] William Stallings, Multiprotocol Label Switching (MPLS) , The Internet Protocol Journal ( IPJ )
September, 2001 [317]
[315] Henning F. Harmuth, Application of Walsh Functions in Communications, IEEE Spectrum,
November 1969 [318]
[316] http://www.teja.com/ (software for network processors)
[317] Sailesh Kumar, Raja Venkatesh, Joji Philip, and Sunil Shukla, Comms Design, Implementing
Parallel Packet Buffering: Part I , Paxonet Communications
[318] EZchip, Challenges in Designing 40-Gigabit Network Processors , White Paper [319]
[319] EZchip, 7-Layer Packet Processing: A Performance Analysis , White Paper [320]
[320] Intel® WAN/LAN Access Switch Example Design for the Intel® IXP1200 Network Processor
Application Note , [321]
[321] Genssler, Thomas and Benedikt Schulz. " Tool-supported Component Evolution ". In: " Workshop
Reader of the 13th ECOOP ". Lecture Notes in Computer Science , 1999. [343]
[322] M. Aksit, J. Bosch, W. v.d. Sterren and L. Bergmans,
“Real-Time Specification Inheritance
Anomalies and Real-Time Filters”, ECOOP '94, LNCS 821, Springer Verlag, pp. 386-407, July
1994. [344]
[323] Scott Wilson, Tim Landgrave, “Interprocess Communication Standards and Microsoft's Common
Language Infrastructure”,
Vobix Corporation, 2001 [407]
[324] Erik Meijer and John Gough, “ A Technical Overview of the Commmon Language Infrastructure ”,
[408]
[325] William Gropp and Ewing Lusk, “PVM and MPI Are Completely Different”, Invited paper for the journal Future Generation Computing Systems , http://www-unix.mcs.anl.gov/mpi/papers/archive/
[439]
2.4.3 The Raw Processor & reconfigurable computing
[326] The Raw Processor - A Scalable 32-bit Fabric for Embedded and General Purpose Computing, by Michael Bedford Taylor, Jason Kim, Jason Miller, Fae Ghodrat, Ben Greenwald, Paul Johnson,
Walter Lee, Albert Ma, Nathan Shnidman, Volker Strumpen, David Wentzlaff, Matt Frank, Saman
Amarasinghe, and Anant Agarwal
Presented by Michael Bedford Taylor at Hotchips XIII . Palo Alto, California. August 21, 2001. ( pdf , powerpoint with rough transcript ) [347]
[327] The Raw Architecture: Signal Processing on a Scalable Composable Computation Fabric by David Wentzlaff, Michael Bedford Taylor, Jason Kim, Jason Miller, Fae Ghodrat, Ben
Greenwald, Paul Johnson, Walter Lee, Albert Ma, Nathan Shnidman, Henry Hoffmann, Arvind
Saraf, Volker Strumpen, Matt Frank, Saman Amarasinghe, and Anant Agarwal
Presented by David Wentzlaff at High Performance Embedded Computing Workshop 2001 ( ppt , pdf )
[348]
[328] Raw Computation, ( HTML ) by Anant Agarwal. Scientific American , August 1999
[329] Baring it all to Software: Raw Machines , ( pdf , postscript , compressed postscript ) by Elliot Waingold, Michael Taylor, Devabhaktuni Srikrishna, Vivek Sarkar, Walter Lee, Victor Lee,
Jang Kim, Matthew Frank, Peter Finch, Rajeev Barua, Jonathan Babb, Saman Amarasinghe, and
Anant Agarwal. IEEE Computer , September 1997, pp. 86-93 [349]
[330] Scalar Operand Networks: On-chip Interconnect for ILP in Partitioned Architectures ,
( pdf ) by Michael Bedford Taylor, Walter Lee, Saman Amarasinghe, and Anant Agarwal.
MIT/LCS Technical Report LCS-TR-859, July 2002 [350]
[331] The Raw Microprocessor: A Computational Fabric for Software Circuits and General Purpose
Programs , ( pdf) , by Michael Bedford Taylor, Jason Kim, Jason Miller, David Wentzlaff,
Fae Ghodrat, Ben Greenwald, Henry Hoffman, Jae-Wook Lee, Paul Johnson, Walter Lee,
Albert Ma, Arvind Saraf, Mark Seneski, Nathan Shnidman, Volker Strumpen
Matt Frank, Saman Amarasinghe and Anant Agarwal. IEEE Micro , Mar/Apr 2002 [351]
[332] Space-Time Scheduling of Instruction-Level Parallelism on a Raw Machine ,
( pdf , postscript , compressed postscript ) by Walter Lee, Rajeev Barua, Matthew Frank, Devabhaktuni
Srikrishna, Jonathan Babb, Vivek Sarkar, and Saman Amarasinghe. Proceedings of the Eighth
International Conference on Architectural Support for Programming Languages and Operating
Systems (ASPLOS-VIII) , San Jose, CA, October 4-7, 1998 [352]
[333] The Raw Processor Specification (LATEST) , ( pdf ) by Michael Bedford Taylor. Comprehensive specification for the Raw processor , Cambridge, MA, Continously Updated 2002 [353]
[334] How to build scalable on-chip ILP networks for a decentralized architecture
( pdf ) by Michael Taylor, Walter Lee, Matt Frank, Saman Amarasinghe, and Anant Agarwal.
MIT/LCS Technical Memo MIT-LCS-TM-628. Submitted to ASPLOS-2000, April 2000 [354]
[335] Compiler Support for Scalable and Efficient Memory Systems , ( pdf , postscript , compressed postscript ) by Rajeev Barua, Walter Lee, Saman Amarasinghe, Anant Agarwal. IEEE Transactions on Computers , Nov 2001 [355]
[336] Maps: A Compiler-Managed memory system for Software-Exposed Architectures , ( pdf , postscript , compressed postscript ) by Rajeev Barua. PhD Thesis. MIT Laboratory for Computer
Science. Jan 2000 [356]
[337] Design Decisions in the Implementation of a Raw Architecture Workstation , ( pdf ) by Michael
Bedford Taylor. MS Thesis , Cambridge, MA, September, 1999 [357]
[338] Hot Pages: Software Caching for Raw Microprocessors , ( pdf , postscript , compressed postscript ) by Csaba Andras Moritz, Matthew Frank, Walter Lee,and Saman Amarasinghe MIT/LCS Technical
Memo LCS-TM-599 , August, 1999 [358]
[339] Maps: A Compiler-Managed Memory System for Raw Machines , ( pdf , postscript , compressed postscript ) by Rajeev Barua, Walter Lee, Saman Amarasinghe, and Anant Agarwal.
Proceedings of the Twenty-Sixth International Symposium on Computer Architecture (ISCA-26) ,
Atlanta, GA, June, 1999 [359]
[340] Parallelizing Applications into Silicon , ( pdf , postscript , compressed postscript ) by Jonathan Babb,
Martin Rinard, Andras Moritz, Walter Lee, Matthew Frank, Rajeev Barua, and Saman Amarasinghe.
Proceedings of the IEEE Workshop on FPGAs for Custom Computing Machines '99 (FCCM '99) ,
Napa Valley, CA, April 1999 [360]
[341] Memory Bank Disambiguation using Modulo Unrolling for Raw Machines , ( pdf , postscript , compressed postscript ) by Rajeev Barua, Walter Lee, Saman Amarasinghe, and Anant Agarwal.
Proceedings of the Fifth International Conference on High Performance Computing , Chennai, India,
December 17-20, 1998 [361]
[342] SUDS: Primitive Mechanisms for Memory Dependence Speculation , ( pdf , postscript , compressed postscript ) by Matthew Frank, C. Andras Moritz, Benjamin Greenwald, Saman Amarasinghe, and
Anant Agarwal. MIT/LCS Technical Memo LCS-TM-591 , January 6, 1999 [362]
[343] Exploring Performance-Cost Optimal Designs for Raw Microprocessors , ( pdf , postscript , compressed postscript ) by C Andras Moritz, Donald Yeung, and Anant Agarwal. Proceedings of the
International IEEE Symposium on Field-Programmable Custom Computing Machines, FCCM98 ,
April, 1998 [363]
[344] The Raw Compiler Project , ( pdf , postscript , compressed postscript ) by Anant Agarwal, Saman
Amarasinghe, Rajeev Barua, Matthew Frank, Walter Lee, Vivek Sarkar, Devabhaktuni Srikrishna, and Michael Taylor. Proceedings of the Second SUIF Compiler Workshop , Stanford, CA, August 21-
23, 1997 [364]
[345] The RAW Benchmark Suite: Computation Structures for General Purpose Computing , ( pdf , postscript , compressed postscript ) by Jonathan Babb, Matthew Frank, Victor Lee, Elliot Waingold,
Rajeev Barua, Michael Taylor, Jang Kim, Srikrishna Devabhaktuni, and Anant Agarwal.
This paper appears in IEEE Symposium on Field-Programmable Custom Computing Machines , Napa
Valley, CA, April 1997 [365]
[346] Baring it all to Software: The Raw Machine , ( pdf , postscript , compressed postscript ) by Elliot
Waingold, Michael Taylor, Vivek Sarkar, Walter Lee, Victor Lee, Jang Kim, Matthew Frank, Peter
Finch, Srikrishna Devabhaktuni, Rajeev Barua, Jonathan Babb, Saman Amarasinghe, and Anant
Agarwal. MIT/LCS Technical Report TR-709 , March 1997 [366]
[347] Solving graph problems with dynamic computation structures , ( pdf , postscript , compressed postscript ) by Jonathan Babb, Matthew Frank, and Anant Agarwal. This paper appears in SPIE
Photonics East: Reconfigurable Technology for Rapid Product Development & Computing , Boston,
MA, November 1996 [367]
[348] Ron Enderle, Modular Computing: The Next Generation of Personal Computing , White paper,
Transmeta, http://www.transmeta.com/about/press/white_papers.html
[380]
[349] Ron Enderle, Emerging Classes of Mobile Personal Computers , White paper, Transmeta, http://www.transmeta.com/about/press/white_papers.html
[381]
[350] Alexander Klaiber, The Technology Behind Crusoe Processors, White paper, Transmeta, http://www.transmeta.com/about/press/white_papers.html
[382]
2.4.4 Component Deployment - LNCS 2370
[351] Anne-Françoise Le Meur, Charles Consel, and Benoît Escrig, “ An Environment for Building
Customizable Software Components ”, IFIP/ACM Working Conference, CD 2002, Berlin,
Germany, June 20-21, 2002. Proceedings [322]
[352] Nicolas Le Sommer and Frédéric Guidec, “ A Contract-Based Approach of Resource-Constrained
Software Deployment
”, IFIP/ACM Working Conference, CD 2002, Berlin, Germany, June 20-21,
2002. Proceedings [323]
[353] Marija Mikic-Rakic and Nenad Medvidovic, “ Architecture-Level Support for Software
Component Deployment in Resource Constrained Environments ”, IFIP/ACM Working
Conference, CD 2002, Berlin, Germany, June 20-21, 2002. Proceedings [324]
[354] Susan Eisenbach, Chris Sadler, and Shakil Shaikh, “ Evolution of Distributed Java Programs ”,
IFIP/ACM Working Conference, CD 2002, Berlin, Germany, June 20-21, 2002. Proceedings [325]
[355] Matthew J. Rutherford, Kenneth Anderson, Antonio Carzaniga, Dennis Heimbigner, and Alexander
L. Wolf, “
Reconfiguration in the Enterprise JavaBean Component Model
”, IFIP/ACM Working
Conference, CD 2002, Berlin, Germany, June 20-21, 2002. Proceedings [326]
[356] Chen, Xuejun; Simons, Martin: A Component Framework for Dynamic Reconfiguration of
Distributed Systems.
In: Proceeding of the First International IFIP/ACM Working Conference on
Component Deployment (CD 2002), Berlin, Germany, June 20-21, 2002. Proceedings [327]
[357] Nils P. Sudmann and Dag Johansen, “ Software Deployment Using Mobile Agents ”, IFIP/ACM
Working Conference, CD 2002, Berlin, Germany, June 20-21, 2002. Proceedings [328]
[358] Scott A. Hissam, Gabriel A. Moreno, Judith A. Stafford, and Kurt C. Wallnau, “ Packaging
Predictable Assembly
”, IFIP/ACM Working Conference, CD 2002, Berlin, Germany, June 20-21,
2002. Proceedings [329]
[359] Pascal Costanza, “ Dynamic Replacement of Active Objects in the Gilgul Programming
Language ”, IFIP/ACM Working Conference, CD 2002, Berlin, Germany, June 20-21, 2002.
Proceedings [330]
[360] Uwe Aßmann, “ Beyond Generic Component Parameters ”, IFIP/ACM Working Conference, CD
2002, Berlin, Germany, June 20-21, 2002. Proceedings [331]
[361] Günter Kniesel and Michael Austermann, “ CC4J - Code Coverage for Java ”, IFIP/ACM Working
Conference, CD 2002, Berlin, Germany, June 20-21, 2002. Proceedings [332]
[362] Welf Löwe and Markus Noga, “ Scenario-Based Connector Optimization ”, IFIP/ACM Working
Conference, CD 2002, Berlin, Germany, June 20-21, 2002. Proceedings [333]
[363] Andrea Bracciali, Antonio Brogi, and Carlos Canal, “ Adapting Components with Mismatching
Behaviours ”, IFIP/ACM Working Conference, CD 2002, Berlin, Germany, June 20-21, 2002.
Proceedings [334]
[364] Oscar Nierstrasz, Gabriela Arévalo, Stéphane Ducasse, Roel Wuyts, Andrew P. Black, Peter O.
Müller, Christian Zeidler, Thomas Genssler, and Reinier van den Born. “ A Component Model for
Field Devices
”, IFIP/ACM Working Conference, CD 2002, Berlin, Germany, June 20-21, 2002.
Proceedings [335]
[365] Duangdao Wichadakul and Klara Nahrstedt, “ A Translation System for Enabling Flexible and
Efficient Deployment of QoS-Aware Applications in Ubiquitous Environments ”, IFIP/ACM
Working Conference, CD 2002, Berlin, Germany, June 20-21, 2002. Proceedings [336]
[366] Vania Marangozova and Daniel Hagimont, “ An Infrastructure for CORBA Component
Replication ”, IFIP/ACM Working Conference, CD 2002, Berlin, Germany, June 20-21, 2002.
Proceedings [337]
[367] Iman Poernomo, Ralf Reussner, and Heinz Schmidt, “ Architectures of Enterprise Systems:
Modelling Transactional Contexts ”, IFIP/ACM Working Conference, CD 2002, Berlin, Germany,
June 20-21, 2002. Proceedings [338]
[368] Gregor von Laszewski, Eric Blau, Michael Bletzinger, Jarek Gawor, Peter Lane, Stuart Martin, and
Michael Russell, “ Software, Component, and Service Deployment in Computational Grids
”,
IFIP/ACM Working Conference, CD 2002, Berlin, Germany, June 20-21, 2002. Proceedings [339]
[369] Pascal Rapicault, Jean-Paul Rigault, and Luc Bourlier, “ Model, Notation, and Tools for
Verification of Protocol-Based Components Assembly
”, IFIP/ACM Working Conference, CD
2002, Berlin, Germany, June 20-21, 2002. Proceedings [340]
2.4.5 Peer-to-Peer Steganographic Storage Systems
[370] M. O. Rabin, Efficient dispersal of information for security, load balancing, and fault tolerance, J.
ACM 38, 335-348 (1989).
[371] M. Luby, M. Mitzenmacher, A. Shokrollahi, D. Spielman and V. Stemann " Efficient Erasure Codes, "
IEEE Trans. on Information Theory 47(2), 569-584, Feb. 2001. (Journal version of the STOC '97 paper). [255]
[372] Hand, Steven. Roscoe, Timothy., " Spread Spectrum Storage with Mnemosyne ," IRB-TR-02-
005, Jun. 18, 2002 (pdf) 122796 bytes [256]
[373] Roscoe, Timothy. Hand, Steven, "Transaction-based Charging in Mnemosyne: a Peer-to-Peer
Steganographic Storage System," IRB-TR-02-004, May. 30, 2002 (pdf) 352434 bytes [257]
[374] Zheng Zhang; Qiao Lian, “Reperasure: Replication Protocol using Erasure-code”, MSR-TR-2002-59,
June 2002 [258]
[375] Sam Joseph, NeuroGrid: Semantically Routing Queries in Peer-to-Peer Networks , International
Workshop on Peer-to-Peer Computing, Pisa, Italy, 2002 [259]
[376] St. Manegold ; P.A. Boncz ; M.L. Kersten , “Generic database cost models for hierarchical memory systems”, Technical Report 2002, INS-R0203, ISSN 1386-3681 [273]
[377] Magdalena Balazinska , Hari Balakrishnan , and David Karger , INS/Twine: A Scalable Peer-to-Peer
Architecture for Intentional Resource Discovery , Pervasive 2002 - International Conference on
Pervasive Computing , Zurich, Switzerland, August 2002. [389]
[378] David Liben-Nowell , Hari Balakrishnan , and David Karger , Analysis of the Evolution of Peer-to-
Peer Systems , ACM Conf. on Principles of Distributed Computing (PODC) , Monterey, CA, July
2002. [390]
[379] David Liben-Nowell, Hari Balakrishnan, and David Karger, Observations on the Dynamic Evolution of Peer-to-Peer Networks , 1st Workshop on P2P Systems and Technologies, Cambridge, MA, March
2002. (Position paper.) [391]
[380] Sylvia Ratnasamy, Deborah Estrin, Ramesh Govindan, Brad Karp, Scott Shenker, Li Yin, Fang Yu,
Data-centric storage in Sensornets , To appear in the First Workshop on Sensor Networks and
Applications (WSNA), October 2002, Atlanta, GA [429]
2.4.6 Interaction-based computing
[381] Dina Goldin, David Keil Interaction, Evolution, and Intelligence Proc. of CEC'01 , Korea, May 2001
[261]
[382] Dina Goldin, David Keil, Peter Wegner A Historical Perspective of Interactive Computing , in progress [262]
[383] Peter Wegner, Dina Goldin Computation Beyond Turing Machines accepted to Communications of the ACM , 2002 [263]
[384] Dina Goldin, Scott Smolka, Peter Wegner Turing Machines, Transition Systems, and Interaction 8th
Int'l Workshop on Expressiveness in Concurrency, Aarlborg, Denmark, August 2001 [264]
[385] Peter Wagner, Interactive Foundations of Computing, Final Draft , Theoretical Computer Science,
[386]
February 1998 [265]
2.4.7 Calculus and Theoretic Computing Science
[387] R. Milner, J. Parrow and D. Walker, A Calculus of Mobile Processes Pt.1
, ECS-LFCS-89-85 , This report was published in Information and Computation 100 (1) pp.1-40, Sept 1992. [266]
[388] R. Milner, J. Parrow and D. Walker, A Calculus of Mobile Processes Pt.2
, ECS-LFCS-89-86 , This report was published in Information and Computation 100 (1) pp.41-77, Sept 1992. [267]
[389] Communicating and Mobile Systems: the -Calculus , (by Robin Milner). Cambridge University
Press, May 1999.
[390] Frits W. Vaandrager, Expressiveness results for process algebras , Technical Report CS-R9301, ISSN
0169-118X, 1993 [268]
[391] B. Jacobs, Coalgebras in Specification and Verification for Object-Oriented Languages. In:
Newsletter 3 of the Dutch Association for Theoretical Computer Science ( NVTI ), 1999, p.15-27.
[ copy ] [269]
[392] B. Jacobs and J.J.M.M. Rutten A Tutorial on (Co)Algebras and (Co)Induction. Bulletin of EATCS
Vol. 62, 1997, pp. 222--259. [ Full Paper (in compressed PostScript) ] [307]
[393] Eberbach E., $-Calculus Bounded Rationality = Process Algebra + Anytime Algorithms , in:
(ed.J.C.Misra) Applicable Mathematics: Its Perspectives and Challenges, Narosa Publishing House,
New Delhi, Mumbai, Calcutta, ISBN 81-7319-406-8, Part III: Computing Sciences and Information
Technology, Chapter 22, 2001, 213-220. [341]
[394] Jean-Guy Schneider and Markus Lumpe,
“A Metamodel for Concurrent, Object-based
Programming,” Proceedings of Langages et Modèles à Objets '00 , Christophe Dony and Houari A.
Sahraoui (Eds.), Hermes, Mont Saint-Hilaire, Québec, January 2000, pp. 149—165. abstract PDF
[395] F. Germain, Marc Lacoste and Jean-Bernard Stefani. An Abstract Machine for a Higher-Order
Distributed Process Calculus.
In Proceedings of the EATCS Workshop on Foundations of Wide Area
Network Computing , Malaga (Spain), July 2002 [418]
2.4.8 Cryptography
[396] Kenneth J. Giuliani, Guang Gong, “Generating Large Instances of the Gong-Harn Cryptosystem ”,
Technical Report CORR 2002-01. [277]
[397] Minindra Agrawal, Neeraj Kayal, Nitin Saxena, “PRIME is in P”, private communication, 2002
[271]
[398] Palash Sarkar & Subhamoy Maitra, “Low Cost Hardware Architecture for Secure Stream
Cipher”, Technical Report CORR 2001-40, [370]
2.4.9 Asynchronous circuits & systems
[399] V. Vakilotojar and P. A. Beerel, Hiding Memory Elements in Induced Hierarchical Verification of
Speed-Independent Circuits , IWLS-98, June 1998. Also presented in SRC TECHCON'98 , Sept. 98.
[278]
[400] RIGAUD J.-B., QUARTANA J., FESQUET L., RENAUDIN M., “High-Level Modeling and Design of Asynchronous Arbiters for On-Chip Communication Systems” , TIMA-RR--02/03-3—FR, 2002
[279]
[401] K. Y. Yun , K. W. James, R. H. Fairlie-Cuninghame, S. Chakraborty, and R. L. Cruz, " A self-timed real-time sorting network ," to appear in IEEE Transactions on VLSI Systems , Mar. 2000.
[ In Postscript (gzip'ed) ] [280]
[402] Michael Thaddeus Niemier and Peter M. Kogge. Exploring and Exploiting Wire-Level Pipelining in
Emerging Technologies Appeared in the 2001 International Symposium on Computer Architecture.
[300]
[403] M. Becker, “ Asymmetric Arbiter with Fast Signal Path ”, US Patent #6,188,249, 13 February 2001
[404] C.E. Molnar, I.W. Jones, I.E. Sutherland, “ Observing Arbiter ”,US Patent #6,072,805, 6 June 2000
2.4.10 Belief propagation algorithms
[405] Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation,
Pedro Larrañaga,
José A. Lozano (ed), 2001, Kluwer Academic Publishers
[406] Andrew Goldberg, Jason D. Hartline, "Competitiveness via Consensus", MSR-TR-2002-73 . [ps]
[pdf] [281]
[407] David Karger and Nathan Srebro, Learning Markov Networks: Maximum Bounded Tree-width
Graphs , In Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms , January 2001.
[PDF] [383]
[408] David R. Karger, Maria Minkoff, “Building Steiner Trees with Incomplete Global Knowledge”, appeared in FOCS'00, Paper (ps 10 pages). Slides (ps 26 pages) from the conference talk [406]
[409] Yedidia, J.S.; Freeman, W.T.; Weiss, Y., "Understanding Belief Propagation and Its
Generalizations", International Joint Conference on Artificial Intelligence (IJCAI) , Distinguished
Presentations, August 2001 ( IJCAI 2001 ). TR 2001-22 [431]
[410] B. Levine, R. R. Taylor, H. Schmit, "Implementation of Near Shannon Limit Error-Correcting Codes using Reconfigurable Hardware", in IEEE Symposium on Field Programmable Custom Computing
Machines (FCCM), pp. 217-226, April 2000. [PDF] [433]
[411] Frank R. Kschischang, Brendan J. Frey, Hans-Andrea Loeliger, “Factor Graphs and the Sum-Product
Algorithm” , Submitted to IEEE Transactions on Information Theory , July, 1998. This is the updated version of October 17, 2000, which will appear in the Transactions in 2001 [434]
[412] Daniel A. Spielman., “Linear-time encodable and decodable error-correcting codes”, Appeared in
IEEE Transactions on Information Theory, 1996, Vol 42, No 6, pp. 1723-1732. An extended abstract appeared in the Proceedings of the 27th Annual ACM Symposium on the Theory of Computing . [435]
[413] R. McEliece, D. MacKay, and J.-F. Cheng, " Turbo decoding as an instance of Pearl's belief propagation algorithm ," IEEE Journal Selected Areas in Commun. , vol. 16 2, pp. 140-152, Feb.
1998. [436]
[414] E. Yeo, P. Pakzad, B. Nikolic, V. Anantharam, “High Throughput Low-Density Parity-Check
Decoder Architectures” Proceedings IEEE Global Conference on Communications, Globecom’01,
San Antonio, TX, November 25-29, 2001, pp. 3019-3024. [437]
[415] Michael Sipser and Daniel A. Spielman., “Expander Codes”, Appeared in IEEE Transactions on
Information Theory, 1996, Vol 42, No 6, pp. 1710-1722. An extended abstract appeared in the
Proceedings of the 35th Annual IEEE Conference on Foundations of Computer Science , 1994, pp.
566-576 [438]
[416] Gallager, R. G., Low Density Parity Check Codes, Monograph, M.I.T. Press, 1963.
Postscript version [439]
[417] Gallager, R. G., "Low Density Parity Check Codes", Transactions of the IRE, Pr ofessional Group on Information Theory, Vol. IT-8, January 1962, pp. 2l-28
[418]
2.4.11 Schema-based programming applications
[419] Li Xu and D.W. Embley, “Direct and Indirect Matches for Schema Elements”, submitted . ( 202K
) [282]
[420]
S.W. Liddle, D.W. Embley, D.T. Scott, and S.H. Yau, “Extracting Data Behind Web Forms” submitted . ( 245K .pdf
) [283]
[421] I.M.E. Filha, A.S. da Silva, A.H.F. Laender, and D.W. Embley, “Representing and Querying
Semistructured Web Data Using Nested Tables with Structural Variants”, to appear . ( 210meg .pdf
)
[284]
[422] S.W. Liddle, D.M. Campbell, and C. Crawford, “Automatically Extracting Structure and Data from
Business Reports”, CIKM'99 Proceedings ( 186K .pdf
, 385K .ps
) [285]
[423] Bernstein, P.A. and E. Rahm, "Data Warehouse Scenarios for Model Management," ER2000, LNCS
1920, Springer-Verlag, pp. 1-15 (PDF, 374KB) See also my ER2000 keynote presentation ( slides ).
[286]
[424] Rahm, E.
, and P. A. Bernstein, "On Matching Schemas Automatically," VLDB Journal 10, 4 (Dec.
2001) , ( PDF, 192KB ). The original publication is available on LINK at http://link.springer.de
. [287]
[425] Madhavan, J.
, P. A. Bernstein, and E. Rahm, "Generic Schema Matching Using Cupid," Proc. VLDB
'01 . ( PDF, 140KB ) Extended version: MSR-TR-2001-17 . [288]
[426] F.-M. Nack ; H.L. Hardman , “Towards a syntax for multimedia semantics”, Technical Report 2002,
INS-R0204, ISSN 1386-3681 [274]
[427] Michael Corning, Postcard From the Future: An Introduction to Intentional Schema-Based
Programming , Wrox Professional Web Developer Conference, November 2000, Amsterdam, NL
[369]
[428] Kurt Cagle, “Schema Tricks and Tips”, Wrox Professional Web Developer Conference, November
2000, Amsterdam, NL
[429] SyncML: Data Synchronization and Device Management, www.syncml.org
[430] Michael Corning, “Schema-based Programming”, http://terracogito.redmond.wa.us/blueprints.htm
[431] Michael Corning, “Scalable XML on the Middle Tier”, http://terracogito.redmond.wa.us/blueprints.htm
[432] Michael Corning, “Polymorphic XML”, http://terracogito.redmond.wa.us/blueprints.htm
[433] Michael Corning, Sample files http://terracogito.redmond.wa.us/blueprints.htm
[393] for Schema-based programming,
[434] Andrew Layman, XML Syntax Recommendation for Serializing Graphs of Data , W3C December 2,
1998. [394]
[435] Adam Bosworth, Andrew Layman, Michael Rys, Serializing Graphs of Data in XML , [395]
[436] Andrew Layman, Element-Normal Form for Serializing Graphs of Data in XML [396]
2.4.12 Graph-based applications
[437] K. Randall, R. Stata, R. Wickremesinghe, and J. Wiener. “The link database: Fast access to graphs of the web.” Technical Report 175, Compaq Systems Research Center, 2001. [289]
[438] I.A. van Langevelde ,
“A compact file format for labeled transition systems”,
Technical Report 2001,
SEN-R0102, ISSN 1386-369X [276]
[439] Bamshad Mobasher , Eui-Hong (Sam) Han, George Karypis, and Vipin Kumar, “Hypergraph Based
Clustering in High-Dimensional Data Sets: A Summary of Results”, IEEE Bulletin of the
Technical Committee on Data Engineering , Vol. 21, No. 1, March 1998 [302]
[440] Bamshad Mobasher , E. Han, G. Karypis, and V. Kumar, “Clustering Based on Association Rule
Hypergraphs”, in Proccedings of SIGMOD’97 Workshop on Research Issues in Data Mining and
Knowledge Discovery (DMKD’97) , May 1997. [303]
[441] Bamshad Mobasher , E. Han, G. Karypis, and V. Kumar,
“Clustering in a High-Dimensional Space
Using Hypergraph Models ”, Technical Report, Department of Computer Science, Univeresity of
Minnesota, 1998 [304]
[442] Umit V. Catalyurek, Cevdet Aykanat, “A Hypergraph-Partitioning Approach for Coarse-Grain
Decomposition ”, SC2001 [376]
[443] David Karger and Nathan Srebro, Learning Markov Networks: Maximum Bounded Tree-width
Graphs , In Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms , January 2001.
2.4.13 XML Protocol
[444] XML Protocol Abstract Model, W3C, July 2001, http://www.w3.org/TR/xmlp-am/
[445] XML Protocol Usage Scenarios, W3C, December 2001, http://www.w3.org/TR/xmlp-scenarios/
[446] Simple Object Access Protocol (SOAP) 1.1
, W3C, May 2000
2.4.14 Web applications
[447] P. Mohapatra and H. Chen, "WebGraph: A Framework for Managing and Improving Performance of
Dynamic Web Content," To appear in the Special Issue of Proxy Servers in the IEEE Journal of
Selected Areas in Communications, 2002. [290]
[448] K. Kant and P. Mohapatra, "Current Research Trends in Internet Servers," Special issue of
Performance Evaluation Review, September, 2001. [291]
[449] U. Vallamsetty, K. Kant, and P. Mohapatra, "Characterization of E-Commerce Server Workload," To appear in a Special Issue of the Electronic Commerce Research Journal.
[450] F. Wang and P. Mohapatra, "An Efficient Bandwidth Management Scheme for Real-Time Internet
Application", International Symposium on Intelligent Multimedia, Video and Speech Processing,
2001.
[451] U. Vallamsetty, K. Kant, and P. Mohapatra, "Characterization of E-Commerce Traffic," International
Workshop on Advanced Issues of E-Commerce and Web-based Information Systems, 2002. [292]
[452] K. Kant and P. Mohapatra, " Scalable Internet Servers: Issues and Challenges , Special issue of
Performance Evaluation Review, September, 2000. [293]
[453] Naaman, Mor; Garcia-Molina, Hector; Paepcke, Andreas. “Evaluation of Delivery Techniques for
Dynamic Web Content (Extended Version)”,
Technical Report, June 2002. [294]
[454] Sriram Raghavan and Hector Garcia-Molina. “Representing Web Graphs”, Technical Report, June
2002. [295]
[455] Vinod Anupam, Juliana Freire, Bharat Kumar and Daniel Lieuwen, “ Automating Web Navigation with the WebVCR (pdf version) (ps-gz version) ”, WWW9, 2000. [296]
[456] Raghavan, Sriram; Garcia-Molina, Hector .”Crawling the Hidden Web”, Proceedings of the 27 th
VLDB Conference, Roma, Italy, 2001 [297]
[457] V. Cardellini, M. Colajanni, P. S. Yu, ``Dynamic load balancing on Web-server systems'', IEEE
Internet Computing , Vol. 3, No. 3, pp. 28-39, May-June 1999. [298]
[458] V. Cardellini, E. Casalicchio, M. Colajanni, M. Mambelli, ``Enhancing a Web-server cluster with
Quality of Service mechanisms'' , Proc. of 21st IEEE Int'l Performance, Computing, and
Communications Conf. (IPCCC) , Phoenix, AZ, pp. 205-212, April 2002. [299]
[459] J.R. van Ossenbruggen ; H.L. Hardman , “Smart style on the semantic web”, Technical Report 2002,
INS-R0201, ISSN 1386-3681 [272]
[460] J.R. van Ossenbruggen ; H.L. Hardman ; L.W. Rutledge ,
“Hypermedia and the semantic web: A research agenda”, Technical Report 2001, INS-R0105, ISSN 1386-3681 [275]
[461] Bamshad Mobasher , J. Collins, W. Ketter, and M. Gini, “A Multi-Agent Negotiation Testbed for
Contracting Tasks with Temporal and Precedence Constraints”.
In International Journal of
Electronic Commerce , to appear in 2002. [305]
[462] Theilmann, W.; Rothermel, K.: Dynamic Maps of the Internet.
In: Proceedings of the 19th Annual
Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2000) [315]
[463] Cedric Yau, “Creating Peer-to-Peer Middleware from Web Services Technologies”, Intel Developer
UPDATE Magazine , September 2001 [345]
[464] Brus R. Schatz, “The Interspace: Concept Navigation Across Distributed Communities”, IEEE
Computer, January 2002 [346]
[465] JUIL OH and JU-WOOK JANG, “OVERHEAD REDUCTION IN THE NETWORK
COMMUNICATION FOR WEB COMPUTING”, International Journal of High Speed Computing ,
Vol. 11, No. 2 (2000) 93-109
[466] Vassil Roussev, Prasun Dewan, Vibhor Jain, “Composable Collaboration Infrastructures Based on
Programming Patterns”, CSCW 2000 . [368]
[467] Roussev, V., Dewan, P., Koorakula, N., Sellappa, S.,
“Integrating XML and Object-based
Programming for Distributed Collaboration”, in Proceedings of WET ICE 2000 [405]
