In this paper we introduce a new algorithm for computing near optimal schedules for task graph problems. In contrast to conventional approaches for solving those scheduling proble...
We consider the filter decomposition problem in supporting coarse-grained pipelined parallelism. This form of parallelism is suitable for data-driven applications in scenarios wh...
In this paper, we propose a new protocol called Shared Tree Streaming (or STS in short) protocol that is designed for interactive multimedia streaming applications. STS is a decen...
Thilmee M. Baduge, Akihito Hiromori, Hirozumi Yama...
Due to the utilization of location information, geographic ad hoc routing presents superiority in scalability compared with traditional topology-based routing in mobile ad hoc net...
Sybil attack is a harmful threat to sensor networks, in which a malicious node illegally forges an unbounded number of identities to defeat redundancy mechanisms. Digital certifi...
Qinghua Zhang, Pan Wang, Douglas S. Reeves, Peng N...
We have built a router testbed that is connected to the Deter/Emist experimental infrastructure. Our goal is to create a semi-realistic testbed to conduct BGP experiments, measure...
Ke Zhang, Soon Tee Teoh, Shih-Ming Tseng, Rattapon...
Capacity estimation is an important part of covert channel analysis. It measures the severity of a covert channel by estimating the maximum information rate attainable over it. Tr...
An ad hoc or sensor network that is employed for security sensitive applications is expected to tolerate a certain quantity of maliciously behaving nodes. Algorithms must be desig...
Publish/subscribe is emerging as an appropriate communication paradigm for large-scale, widely-distributed systems. In this paper, we describe our work on integrating active datab...