The value of authentication protocols which minimise (or even eliminate) the need for stored state in addressing DoS attacks is well-established — the seminal paper of Aura and Nikander [1] is of particular importance in this context. However, although there is now a substantial literature on this topic, it would seem that many aspects of stateless security protocols remain to be explored. In t...

The memory resources required by network simulations can grow quadratically with size of the simulated network. In simulations that use routing tables at each node to perform perhop packet forwarding, the storage required for the routing tables is O(N), where N is the number of simulated network nodes in the topology. Additionally, the CPU time required in the simulation environment to compute ...

The conceptual separation between computation and coordination in distributed computing systems motivates the use of peculiar entities commonly called connectors, whose task is managing the interaction among distributed components. Different kinds of connectors exist in the literature, at different levels of abstraction. We focus on a basic algebra of connectors which is expressive enough to mo...

This document describes a mechanism that enables the Transport Layer Security (TLS) server to resume sessions and avoid keeping per-client session state. The TLS server encapsulates the session state into a ticket and forwards it to the client. The client can subsequently resume a session using the obtained ticket. Salowey, et al. Standards Track [Page 1] RFC 4507 Stateless TLS Session Resumpti...

This article is to show a successful experience on a two-year software reuse project of Software Engineering Lab. (SEL) in Taiwan. In this research, attention is strictly focused on the interrelationships among key components that link between business processes, information applications, and information technology infrastructure. This choice is based on software reusable component design of di...

Abstract — End-to-end throughput guarantee is an important service semantics that network providers would like to offer to their customers. A network provider can offer such service semantics by deploying a network where each router employs a fair packet scheduling algorithm. Unfortunately, these scheduling algorithms require every router to maintain per-flow state and perform perpacket flow cl...

Internet Drafts are draft documents valid for a maximum of six months. Internet Drafts may be updated, replaced, or obsoleted by other documents at any time. It is not appropriate to use Internet Drafts as reference material or to cite them other than as a "working draft" or "work in progress." To learn the current status of any Internet Draft, please check the 1id-abstracts.txt listing contain...

We consider qualitative and quantitative model-checking problems for probabilistic pushdown automata (pPDA) and various temporal logics. We prove that the qualitative and quantitative model-checking problem for ω-regular properties and pPDA is in 2-EXPSPACE and 3-EXPTIME, respectively. We also prove that model-checking the qualitative fragment of the logic PECTL∗ for pPDA is in 2-EXPSPACE, and ...