Learn More
It is essential to evaluate the performance of newly developed distributed software and network protocols. Network emulation enables reproducible evaluation of unmodified real implementations. Software built for distributed systems, such as a large scale peer-to-peer system, requires evaluation scenarios with thousands of communicating nodes. Two approaches(More)
—Performance analysis and functionality testing are major parts of developing distributed software systems. Since the number of communicating software instances heavily influences the behavior of distributed applications and communication protocols, evaluation scenarios have to consider a large number of nodes. Network emulation provides an infrastructure(More)
Network emulation is an efficient method for evaluating distributed applications and communication protocols by combining the benefits of real world experiments and network simulation. The process of network emulation involves the execution of connected instances of the software under test (called virtual nodes) in a controlled environment. In previous(More)
Network emulation is an efficient method for evaluating distributed applications and communication protocols by combining the benefits of real world experiments and network simulation. The process of network emulation involves execution of thousands of connected virtual nodes running the software under test in a controlled environment. Along with the(More)
Adaptation in Pervasive Computing normally focuses on services or on application behaviour, but the consideration of lower level algorithms in this process can lead to significant performance increase. To perform adaptation of algorithms the concept of context normally used in Pervasive Computing has to be extended. Based on the same context, group(More)
  • Mohammed Ali Safari, Broňa Brejová, +32 authors Therese Biedl Waterloo
  • 2005
Students were asked to take lecture notes in L A T E X, which I then compiled and edited for this document. The topic of graph algorithms is so unbelievably big that it is entirely hopeless to want to hold just one course about them. Even focusing on advanced graph algorithms (whatever " advanced " may mean) doesn't help, because there is still too many(More)