In this paper we develop a new data structure for implementing heaps (priority queues). Our structure, Fibonacci heaps (abbreviated F-heaps), extends the binomial queues proposed by Vuillemin and studied further by Brown. F-heaps support arbitrary deletion from an n-item heap in qlogn) amortized

Abstract — Disruption-tolerant networks (DTNs) attempt to route network messages via intermittently connected nodes. Routing in such environments is difficult because peers have little information about the state of the partitioned network and transfer opportunities between peers are of limited

General-purpose operating systems provide inadequate support for resource management in large-scale servers. Applications lack sufficient control over scheduling and management of machine resources, which makes it difficult to enforce priority policies, and to provide robust and controlled service

Whe origin of the RSVP protocol can be traced back to 1991, when a team of network researchers, including myself, started playing with a number of packet scheduling algorithms on the DARTNET (DARPA Testbed NETwork), a network testbed made of open source, workstation-based routers. Because

of the interaction of genetics and environment in family processes; transitions and linkages between the family and other major settings influencing development, such as hospitals, day care, peer groups, school, social networks, the world of work (both for parents and children), and neighborhoods and communities

We introduce a new method, called Priority Encoding Transmission, for sending messages over lossy packet-based networks. When a message is to be transmitted, the user specifies a priority value for each part of the message. Based on the priorities, the system encodes the message into packets

We propose a priority-pricing scheme for zonal access to the electric power grid that is uniform across all buses in a zone. The Independent System Operator (ISO) charges bulk power traders a per unit ex ante transmission access fee. The zonal access fee serves as an access insurance premium

Over 50 years of cross-disciplinary research suggests we have higher trust in those who are seen as a) knowledgeable, b) similar to ourselves and c) honest/transparent. Doctors are trusted with our medical care because they are perceived to: be competent, share our concerns, and tell us what they think. Politicians tend to be distrusted for the opposite reasons. However, we know much less about 'marginal trust', i.e. how trust is built or lost as a result of new information. Many policy makers already know that public trust in them is low. What they now want to know is how to improve this situation. Greater understanding of marginal trust is critical for such change. In its exploration of marginal trust, the current paper draws on four fundamental psychological processes and related empirical evidence. First, in line with a general negativity bias, people tend to trust bad news more than good. Second, in line with the desire for cognitive consistency, people tend to trust news that is congruent with their prior

So far, research on mobile ad hoc networks has been focused primarily on routing issues. Security, on the other hand, has been given a lower priority. This paper provides an overview of security problems for mobile ad hoc networks, distinguishing the threats on basic mechanisms and on security

pluridisciplinaire HAL, est destinée au dépôt et a ̀ la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés. Fault tolerant on-board networks with priorities