Arc-consistency algorithms are widely used to simplify Constraint Satisfaction Problems. The new notion of a double-support check is presented to improve the average performance of arc-consistency algorithms. The improvement is that, where possible, consistencychecks are used to find supports for two values, one value in the domain of each variable, which were previously known to be unsupported...

This paper describes an improved, IEEE conforming oating-point addition algorithm. This algorithm has only one addition step involving the signi cand in the worst-case path, hence o ering a considerable speed advantage over the existing algorithms, which typically require two to three addition steps.

In recent years, multi-channel multi-radio Wireless Mesh network has become one of the most important technologies in the evolution of next-generation networks. Its multi-hop, selforganization, self-healing and simple deployment is an effective way to solve the bottleneck problem of last mile. In this paper, we propose a new routing metric called WAEED, deployed in JCWAEED protocol, a joint cha...

Scheduling for a directed acyclic graph (DAG) on networked embedded systems is to maximize concurrency and minimize inter-processor communication for minimum end-to-end worst-case response time (WCRT). Time accuracy and synchronization are critical for scheduling on heterogeneous networked embedded systems, where computing and networking are both heterogeneous and deeply jointed. Most algorithm...

We address the problem of providing quality-of-service (QoS) guarantees in a multiple hop packet/cell switched environment while providing high link utilization in the presence of bursty traffic. A scheme based on bandwidth and buffer reservations at the Virtual Path level is proposed for ATNI networks. This approach enables us to provide accurate end-to-end QoS guarantees while achieving high ...

Real-time traffic communication has Quality of Service (QoS) requirements such as end-to-end bandwidth and delay guarantees. We propose a novel frame-based QoS Scheduler, the frame-counter scheduler, for connection oriented packet switching networks. The frame-counter scheduler significantly reduces the end-to-end delay bound and buffer requirements provided by other frame-based schedulers. A f...

0140-3664/$ see front matter 2009 Elsevier B.V. A doi:10.1016/j.comcom.2009.02.014 * Corresponding author. Tel.: +1 805 403 0469. E-mail addresses: [email protected] (K.A. Har (C. Holman), [email protected] (L. Deek), almeroth@ As mobile and wireless technologies become more pervasive in our society, people begin to depend on network connectivity, regardless of their location. Their mobility, ...

In this paper, we investigate the problem of providing worst-case end-to-end delay guarantee to a token bucket constrained flow traversing a series of N packet schedulers. We consider a network of routers that support the Guaranteed Service class of the IETF Integrated Services (IntServ) Working Group; this service class is proposed to provide Quality of Service (QoS) in the Internet. Under thi...