Distiribuirani Trezor Podataka
(Distributed Data Vault)
-
names and affiliation –
Application Development on Heterogeneous Sensor/Actuator NetworksError!
Bookmark
not
defined.
names and affiliation – ................................................................................................................... 1
1 Project Summary ........................................................................... Error! Bookmark not defined.
2 Project Description ......................................................................................................................... 3
2.1
Innovative claims for the proposed research .......................................................................... 3
2.2
Introduction and Technical Background ................................................................................. 4
2.2.1
Sensor Networks ............................................................................................................. 4
2.2.2
Formal Models for Embedded design ............................................................................. 5
2.2.3
Background on Markov Networks for Optimization Problems ...................................... 5
2.3
Proposed Research .................................................................................................................. 5
2.3.1
SAN architecture ............................................................................................................ 5
2.3.2
Component-based embedded overlay networks (ovo bas nije najbolje!!!!!) .................. 6
2.3.3
Probabilistic Reasoning for SAN Quality-of-Service ..................................................... 7
2.4
References .............................................................................................................................. 7
1 Sustina projekta (project summary)
Siroko prihvacanje Interneta dovelo je do globalizacije u mnogim sferama ljudskih aktivnosti.
During the last few years sensor networks have attracted a significant research attention. Although
several experimental networks have been implemented, no commercialized system has been reported yet,
which indicates that there is a need for more research and development efforts to bridge the gap. A
sensor/actuator 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. The
challenge in such a setting is that the collaboration between local nodes is in the environment of a selforganizing network, which is non-deterministic by the nature, while the system’s behavior is expected to be
deterministic. Two levels of abstraction exist in the SAN including: the network level and the application
level. At the network level, the SAN architecture and SAN connection to the existing network
infrastructure are the most important issues. At the application level, the SAN can be approximated by a
distributed control network model where some of the dominate issues are: fulfilling system’s response time
constraints, deadlock free functioning of a system in the given environment, robustness and fault-tolerance,
availability of application development tools, etc. However, the network and application levels are
interdependent with respect to overall system performance. Thus, application development on the SAN is
much more complex then in the case of sensor-only networks.
Predlozeni projekat fokusira istrazivanja na analizu postojecih tehnologija potrebnih za DDV,
primenu tih tehnologija u realnom sistemu, i na razvoj novih resenja koja trenutno ne postoje na trzistu a
neophodna su za implementaciju DDVa.
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
2)
3)
4)
5)
6)
7)
katastrofe samo deo fizickih uredjaja biva unisten I to oni uredjaji koji su locirani u
pogodjenoj oblasti.
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
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.
DDV koristi enkripciju za garantovanje tajnosti I bezbednosti podataka.
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)
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 sensoronly 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-onChip, 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 meta-
description 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
sensor and actuator nodes capable of wireless communication and significant computation [37]. Each of the
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,
office, vehicle in large metropolis areas, etc. [36][2], as well as in military applications [39]. Reported
results and developed prototypes from several undergoing research projects are encouraging [35][36].
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
far, information dissemination [36][37] and target positioning [3] were dominant applications for sensor
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
applications, etc.) during the last few years [43][44][45]. The mobile ad-hoc networks are somewhat similar
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
provide services to each other as well as to human users, like it is envisioned in [54]. The Sensor/Actuator
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
users [49]. In a SAN, the collaboration between local nodes, both sensors and actuators, is necessary in
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
heterogeneous devices ranging from ultra-tiny ultra-low-cost massively deployed passive ID tags [55],
through small low-rate short-range RF sensors [56][57],
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 [19].
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 [20]. 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
overlay network [6][10].
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
been investigated in [26], but in the more restricted case of hardware design for System-on-Chips. Now, we
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.
[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.
[3] Chris Savarese, Jan M. Rabaey, Jan Beutel, "Locationing in Distributed Ad-Hoc Wireless Sensor
Networks," ICASSP 2001.
[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].
[5] Suet-Fei Li, Marlene Wan, Jan Rabaey, "Configuration Code Generation and Optimization for LowEnergy Reconfigurable DSPs", Proceedings of SIPS99 [PDF].
[6] 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
[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
[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)
[10] David G. Andersen, Hari Balakrishnan, M. Frans Kaashoek, Robert Morris, "Resilient Overlay
Networks", 18th Symposium on Operating Systems Principles(SOSP’01), Banff, Canada, October
2001.
[11] John Heidemann, Fabio Silva, Chalermek Intanagonwiwat, Ramesh Govindan, Deborah Estrin,
Deepak Ganesan, "Building Efficient Wireless Sensor Networks with Low-Level Naming", 18th
Symposium on Operating Systems Principles (SOSP’01), Banff, Canada, October 2001.
[12] 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.
[13] 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.
[14] 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.
[15] 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.
[16] 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.
[17] 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.
[18] 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.
[19] 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
[20] 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.
[21] Alberto Sangiovanni-Vincentelli, Marco Sgroi, Luciano Lavagno. Formal Models for
Communication-based Design. Proceedings of CONCUR '00, August, 2000
[22] 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.
[23] 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.
[24] 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.
[25] 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.
[26] 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.
[27] 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
[28] Wei Ye, John Heidemann and Deborah Estrin, "An energy-efficient MAC protocol for wireless
sensor
networks",
To
appear
in
IEEE
Infocom
2002.
http://www.isi.edu/~weiye/pub/smac_report.pdf
[29] 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
[30] 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.
[31] 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.
[32] 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
[33] 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.
[34] 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.
[35] 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
[36] 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.
[37] 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.
[38] 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 SolidState Circuits Conference, San Francisco, CA, February 3-7, 2002.
[39] 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.
[40] 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
[41] 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.
[42] 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.
[43] 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.
[44] 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.
[45] C.R. Lin and M. Gerla, Real-time support in multihop wireless networks, ACM/Baltzer Wireless
Networks, vol. 5, no. 2, 1999.
[46] 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.
[47] Andreas Savvides, Chih-Chien Han, Mani Srivastava, "Dynamic Fine-Grained Localization in AdHoc Networks of Sensors", Proceedings of the ACM SIGMOBILE 7th Annual International
Conference on Mobile Computing and Networking, Rome, Italy, July 2001.
[48] Mani Srivastava, Richard Muntz, Miodrag Potkonjak, "Smart Kindergarten: Sensor-based Wireless
Networks for Smart Developmental Problem-solving Environments", Proceedings of the ACM
[49]
[50]
[51]
[52]
[53]
[54]
[55]
[56]
[57]
SIGMOBILE 7th Annual International Conference on Mobile Computing and Networking, Rome,
Italy, July 2001.
Paul Castro, Patrick Chiu, Richard Muntz, "A Probabilistic Location Service for Wireless Network
Environments", Proceedings of Ubicomp 2001.
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.
Paul Castro and Richard Muntz, "Managing Context for Smart Spaces", IEEE Personal
Communications, October 2000.
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
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
Mark Weiser, "The Computer for the Twenty-First Century," Scientific American, pp. 94-10,
September 1991
Auto-ID Center, http://www.autoidcenter.org
Jason Hill, Robert Szewczyk, Alec Woo, Seth Hollar, David Culler, Kristofer Pister.System
architecture directions for network sensors. ASPLOS 2000.
TinyOS project, http://tinyos.millennium.berkeley.edu
2.4.2 Next Generation Networks References
[58] Building
High-speed
Exchange
Points,
Cisco
White
Paper,
http://www.cisco.com/warp/public/750/aii/research.html
[59] Agere Systems, The Challenge for Next Generation Network Processors, White Paper,
http://www.agere.com/enterprise_metro_access/network_processors.html
[60] Intel
IXP2400
Network
Processor,
White
Paper,
http://developer.intel.com/design/network/white_paper.htm
[61] Intel Corporation, Intel Microengine C Compiler Language Support, Reference Manual, March 2002.
[62] Sanjeev Kumar, Kai Li. Dynamic Memory Management for Programmable Devices. To appear in
International Symposium of Memory Management, 2002
[63] 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.
[64] 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
[65] Sanjeev Kumar, Yitzhak Mandelbaum, Xiang Yu, Kai Li. ESP: A Language for Programmable
Devices. Programming Language Design and Implementation, 2001.
[66] 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.
[67] 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.
[68] Greg Eisenhauer and Lynn K. Daley, Fast Heterogeneous Binary Data Interchange, Proceedings of
the 9th Heterogeneous Computing Workshop (HCW 2000), pgs 90-101. .ps .pdf
[69] Raj Krishnamurthy, Karsten Schwan, Richard West and Marcel Rosu, A Network Co-processorBased Approach to Scalable Media Streaming in Servers. International Conference on Parallel
Processing, 2000.
[70] Patrick Widener, Greg Eisenhauer, and Karsten Schwan, “Open Metadata Formats: Efficient XMLBased 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]
[71] Christian Poellabauer, Karsten Schwan, Greg Eisenhauer, Jiantao Kong, “KECho - Event
Communication for Distributed Kernel Services”, Trends in Network and Pervasive Computing,
[72]
[73]
[74]
[75]
[76]
[77]
[78]
[79]
[80]
[81]
[82]
[83]
[84]
[85]
[86]
[87]
[88]
[89]
[90]
[91]
[92]
[93]
[94]
[95]
International Conference on Architecture of Computing Systems (ARCS'02), Springer Verlag,
Lecture
Notes
in
Computer
Science,
2002,
pp.83-100
PostScript [212K] | PDF Format [48K]
K.L. Calvert, "Architectural framework for active networks, version 1.0", University of Kentucky,
July 1999.
AN Node OS Working Group, "NodeOS interface specification", Edited by Larry Peterson (January
2002).
AN Composable Services Working Group, Ellen Zegura, editor, "Composable Services for Active
Networks", May 1998.
AN Management Working Group, Management of Active Networks,.
S. Murphy, Ed., "Security Architecture Draft", Technical report, AN Security Working Group, 2000.
IpInfusion, Integrating Control-Plane and Data-Plane Software Components, Technical paper.
NP Forum, CSIX-L1 (Network Processor/Traffic Manager connectivity to Switch Fabrics).
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.
Ming Zhang, Randy Wang, Larry Peterson, Arvind Krishnamurthy, “Probabilistic Packet
Scheduling: Achieving Proportional Share Bandwidth Allocation for TCP Flows”,INFOCOM 2002
(June 2002).
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
Steven Low, Larry Peterson, Limin Wang, “Understanding TCP Vegas: A Duality Model ”,Journal
of the ACM, 49(2):207-235, March 2002
Scott Karlin and Larry Peterson, “Maximum Packet Rates for Full-Duplex Ethernet ”,Princeton
University Technical Report TR--645--02, (February 2002).
Scott Karlin and Larry Peterson, “VERA: An Extensible Router Architecture ”, Computer Networks,
Volume 38, Issue 3, Pages 277-293, (2002).
Tammo Spalink, Scott Karlin, Larry Peterson, Yitzchak Gottlieb, “Building a Robust SoftwareBased 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.
Xiaohu Qie, Andy Bavier, Larry Peterson, Scott Karlin, “Scheduling Computations on a SoftwareBased Router”, Proceedings of SIMETRICS 2001 (June 2001). An earlier version of this paper
appeared as Princeton University Technical Report TR-615-00 (November 2000).
Björn Knutsson and Larry Peterson, “Transparent Proxy Signalling ”, Journal of Communication
Networks, March, 2001.
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.
A. Bavier and L. Peterson., “The Power of Virtual Time for Multimedia Scheduling”, Proceedings of
the 10th NOSSDAV Workshop (June 2000).
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.
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.
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.
Ibrahim Matta and Azer Bestavros. QoS Controllers for the Internet. In Proceedings of the NSF
Workshop on Information Technology, Cairo, Egypt, March 2000.
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]
A. Cohen and S. Rangarajan, “A Programming Interface for Supporting IP Traffic Processing”, In
Proc. First International Working Conference on Active Networks, June 1999.
[96] Performance enhancing proxies Intended to Mitigate Link-Related Degradations. RFC 3135.
http://www.faqs.org/rfcs/rfc3135.html
[97] 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
[98] C. Pu, K. Schwan, J. Walpole, “Infosphere Project: System Support for Information Flow
Applications”, ACM SIGMOD Record, Volume 30, Number 1, (March 2001).
[99] 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.
[100] Tilman Wolf and Jonathan Turner, Design Issues for High Performance Active Routers, IEEE
Journal on Selected Areas of Communications, March 2001.
[101] 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.
[102] Lili Qiu, Yin Zhang, and S. Keshav, "On Individual and Aggregate TCP Performance", Cornell CS
Technical Report, May 1999.
[103] SNIA Storage Networking Industry Association, IP Storage forum – iSCSI subgroup, “iSCSI for
Storage Networking”, White paper, http://www.snia.org/.
[104] 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.
[105] 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.
[106] Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, Scott Shenker, "A Scalable ContentAddressable Network", Proc. ACM SIGCOMM 2001
[107] Florin Baboescu, George Varghese, "Scalable Packet Classification", Proc. ACM SIGCOMM 2001
[108] 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.
[109] 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
[110] White Paper on Application Programming Interfaces for Networks, http://www.ieee-pin.org/pinatm/docs/pinwp5.pdf
[111] Huan Liu, "A Trace Driven Study of Packet Level Parallelism", Proc. International Conference on
Communications (ICC), New York, NY, 2002 [PDF(66k)]
[112] 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.,
[113] 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
[114] Peter J. McCann Satish Chandra, “Packet Types: Abstract Specification of Network Protocol
Messages”, ACM SIGCOMM 2000.
[115] 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.
[116] Satish Chandra, Patrice Godefroid, and Chris Palm, “Software Model Checking in Practice: An
Industrial Case Study”, International Conference on Software Engineering (ICSE), May 2002.
[117] S. Chandra and P. J. McCann.”Packet Types”. In Second Workshop on Compiler Support for Systems
Software (WCSSS), May 1999.
[118] 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.
[119] 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.
[120] 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.
[121] 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
[122] 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.
[123] 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.
[124] 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.
[125] 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.
[126] 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
[127] Naaman, Mor; Garcia-Molina, Hector; Paepcke, Andreas. “Evaluation of Delivery Techniques for
Dynamic Web Content (Extended Version)”, Technical Report, June 2002.
[128] Sriram Raghavan and Hector Garcia-Molina. “Representing Web Graphs”, Technical Report, June
2002.
[129] Vinod Anupam, Juliana Freire, Bharat Kumar and Daniel Lieuwen, “Automating Web Navigation
with the WebVCR (pdf version) (ps-gz version) ”, WWW9, 2000.
[130] 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.
[131] Kostas Magoutis, Salimah Addetia, Alexandra Fedorova, Margo I. Seltzer, Jeffrey S. Chase, Drew
Gallatin, Richard Kisley, Rajiv Wickremesinghe, and Eran Gabber.”Structure and performance of the
Direct Access File System”. In USENIX Technical Conference, 2002.
[132]