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...

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...

This paper contributes to debates around the political potential of social media by examining Occupy Wall Street and activist’s use of Facebook. Drawing on concepts rooted in cybernetics and anarchist political theory, the paper argues that the shift in Occupy Wall Street from being a physical protest camp in late 2011 to an online movement in 2012 coincided with a shift in social media activit...

Even though tree-based reliable multicast protocols are known to be most scalable for one-to-many sessions, there is still an open question whether these protocols are also scalable for many-to-many sessions. In this paper, we analyze and compare two promising multicast protocols the receiver-initiated protocol with NACK suppression and the tree-based protocol using a new spatial loss model. Th...

An Automatic Language Translation System’s quality depends mainly on that of two components: the Alignment approach and the Translation Model. In this paper, we will present an alignment approach that covers one-to-one, one-to-many, many-to-one, many-to-many alignment, whose output is used by a translation model based on Genetic Algorithm. The Translation Model searches for the decomposition of...

One of the challenges, of designing a negotiation agent, is to provide a unified framework. This allows heterogeneous agents to interact, despite their underlying architecture differences. In this paper, we presented a unified framework for e-commerce negotiation agent. The unified framework supports not only one-to-one and one-to-many negotiation, but also many-to-many negotiation. In supporti...

Automating negotiations in markets where multiple buyers and sellers operate is a scientific challenge of extraordinary importance. One-to-one negotiations are classically studied as bilateral bargaining problems, while one-to-many and many-to-many negotiations are studied as auctioning problems. This paper aims at bridging together these two approaches, analyzing agents’ strategic behavior in ...

Theories of inter-organisational co-ordination propose that information processing capabilities (structure, process and technology) must be aligned with information processing needs (environmental, partnership and task uncertainty), and that the fit between both is a strong determinant of performance. Electronic marketplaces dominate new developments in electronic commerce. While traditional mo...