In this paper we deal with the problem of designing virtual path layouts in ATM networks with given hop-count and minimum load, for which we prove a lower bound with respect to networks with arbitrary topology. The result is then applied to derive a tight lower bound for the one-to-many communication pattern in networks with arbitrary topology, and for the many-to-many communication pattern in ...

Negotiation is a process in which two or more parties with different criteria, constraints, and preferences, jointly reach an agreement on the terms of a transaction. Many current automated negotiation systems support one-to-one negotiation. One-to-many negotiation has been mostly automated using various kinds of auction mechanisms, which have a number of limitations such as the lack of the abi...

This paper considers group strategy-proofness in many-to-many two-sided matching problems. We first show that the Blocking Lemma holds for a many-to-many matching model under quota-saturability condition and max-min preference criterion that is stranger than substitutability of preferences. This result extends the Blocking Lemma for one-to-one matching and for many-to-one matching to many-to-ma...

In this paper, we propose several deadlock-free protocols for implementing the generalized alternative construct, where a process non-deterministically chooses between sending or receiving among various synchronous channels. We consider general many-to-many channels and examine in detail the special case of fan (many-toone and one-to-many) channels, which are common and can be implemented much ...

The paper presents some models involving a pair of actors that aim at bartering the goods from two privately owned pools of heterogeneous goods. In the models we discuss in the paper the barter can occur only once and can involve either a single good or a basket of goods from each actor/player. In the paper we examine both the basic symmetric model (one-to-one barter) as well as some other vers...

Any Source Multicast (ASM) called Internet Standard Multicast (ISM) and its extension, Specific Source Multicast (SSM), are two known multicast technologies for delivering a data flow to a great number of customers over IP networks without cumulative bandwidth consumption. ASM technology is suitable for the many-to-many delivering model such as videoconferencing, where more sources are sending ...

A many-to-many k-disjoint path cover (k-DPC for short) of a graph G joining the pairwise disjoint vertex sets S and T , each of size k, is a collection of k vertex-disjoint paths between S and T , which altogether cover every vertex of G. This is classified as paired, if each vertex of S must be joined to a specific vertex of T , or unpaired, if there is no such constraint. In this paper, we de...

Usually, load distribution schemes for replicated servers are based on a many-to-one mapping between client and server, meaning that while a server may serve many clients, a client has a single specific server which it queries at any point in time. In some cases, however, it is desirable that the number of accesses of a client may be distributed over multiple servers, thus yielding a many-to-ma...

this paper discusses the number of scholars and their scientific interests in the reign of bu-veyhid. buveyhid the most important iranian-shi ‘it dynasties appeared in the early era of islam. they were so powerful that the abbasid caliphs had to obey them. according to their shi ‘it religion, they practiced the idea of democracy and all sects were free in their reign. according to the survey mo...

We study the problem of computing batched shortest paths in road networks efficiently. Our focus is on computing paths from a single source to multiple targets (one-to-many queries). We perform a comprehensive experimental comparison of several approaches, including new ones. We conclude that a new extension of PHAST (a recent one-to-all algorithm), called RPHAST, has the best performance in mo...