Sexy Gossip Exotic Taste

Gossip-based protocols for group communication have attractive scalability and reliability properties. The probabilistic gossip schemes studied so far typically assume that each group member has full knowledge of the global membership and chooses gossip targets uniformly at random. The requirement of global knowledge impairs their applicability to very large-scale groups. 

GOSSIP BASED RELIABLE MULTICAST PROTOCOL

The essential requirement in MANET is now group communication or multicasting since it is used in applications such as network news dissemination, collaborative computing, disaster relief operation, sensor network, military services. In this type of application reliability  plays an important role. Designing a reliable multicast protocol in MANET is challenging task due to the dynamic topology, limited bandwidth, constraints of node capability, and frequent disconnections in MANET. 

In this paper, we propose a scheme called Congestion Control Anonymous Gossip(CCAG) to improve the reliable packet delivery of multicast routing protocols and decrease the variation in the number of packets received by the different nodes. It also consider the issues of reliability, low end to end delay, control overhead and packet delivery in mobile ad-hoc networks. The propose scheme works in two phases. In the first phase any suitable  protocol is used to multicast the message to the group, while in second phase, the gossip protocol tries to recover lost messages.

An adhoc network is a dynamically reconfigurable wireless network without any fixed infrastructure. Such type of network have several resource constraints like bandwidth, battery power, and demands like latency and other types of QoS, reliability and security etc. This type of network is specifically useful in situations like military and disaster relief operation etc. In such an application multicast is a natural requirement. The transmission of packets to a group of zero or more hosts identified by a single destination address is called multicasting . Large number of multicast protocols are available in adhoc network like MAODV , ODMRP , MCEDAR  etc. but this protocol does not provide reliability guarantees due to

1.        ..Mobility and congestion.
2.        ..Transient partition.
3.        ..Maintenance of multicast structure.

In a wired network the basic technique used for recovering the lost messages are

1.        ..Flooding
2.        ..Gossip

In flooding any node that receives the packet retransmits to its entire neighbor hence routing messages are propagated unnecessary and hence congestion in the network increases.

The Graph Sampling Problem

·         We focus on sampling peer properties , such as number of neighbors (degree), access link bandwidth, session time, # files

·         Sampling peer properties has two steps:

o   Discovering and selecting peers (or samples)

o   Measuring the desired properties of selected peers

·         Selecting peers uniformly at random is hard –  there are two sources of bias [Stutzbach:IMC06]

–        Topological: high-degree peers are more likely to be selected

–        Temporal: short-lived peers are more likely to be selected

·         Random walks are a promising approach to sampling

 – The resulting bias is precisely known

 – Samples can be collected in parallel by multiple walkers.

Expressing these ideas in more technical terms, a gossip protocol is one that satisfies the following conditions:

• ·         The core of the protocol involves periodic, pairwise, inter-process interactions
• ·         The information exchanged during these interactions is of (small) bounded size
• ·      When agents interact, the state of one or both changes in a way that reflects the state of the other. For example, if A pings B just to measure the round-trip time for messages from A to B and back, it isn’t a gossip interaction.
• ·         Reliable communication is not assumed
• ·         The frequency of the interactions is low compared to typical message latencies, so that the protocol costs are negligible
• ·         There is some form of randomness in the peer selection. Peer selection might occur within the full node set, or might be performed in a smaller set of neighbors.

Suppose that we want to find the object that most closely matches some search pattern, within a network of unknown size, but where the computers are linked to one-another and where each machine is running a small agent program that implements a gossip protocol.

• To start the search, a user would ask the local agent to begin to gossip about the search string. (We're assuming that agents either start with a known list of peers, or retrieve this information from some kind of a shared web site.)
• Periodically, at some rate (let's say ten times per second, for simplicity), each agent picks some other agent at random, and gossips with it. Search strings known to A will now also be known to B, and vice versa. In the next "round" of gossip A and B will pick additional random peers, maybe C and D. This round-by-round doubling phenomenon makes the protocol very robust, even if some messages get lost, or some of the selected peers are the same or already know about the search string.
• On receipt of a search string for the first time, each agent checks its local machine for matching documents.
• Agents also gossip about the best match, to date. Thus, if A gossips with B, after the interaction, A will know of the best matches known to B, and vice versa. Best matches will "spread" through the network.

If the messages might get large (for example, if many searches are active all at the same time), a size limit should be introduced. Also, searches should "age out" of the network.

It should be easy to see that within logarithmic time in the size of the network (the number of agents), any new search string will have reached all agents. Within an additional delay of the same approximate length, every agent will learn where the best match can be found. In particular, the agent that started the search will have found the best match.

For example, in a network with 25,000 machines, we can find the best match after about 30 rounds of gossip: 15 to spread the search string and 15 more to discover the best match. A gossip exchange could occur as often as once every tenth of a second without imposing undue load, hence this form of network search could search a big data center in about 3 seconds.

Gossip protocols can be used to propagate information in a manner rather similar to the way that a viral infection spreads in a biological population. Indeed, the mathematics of epidemics are often used to model the mathematics of gossip communication. The term epidemic algorithm is sometimes employed when describing a software system in which this kind of gossip-based information propagation is employed.

 Receptionist and Front office are The Most Required to Do Gossip

A receptionist is an employee taking an office/administrative support position. The work is usually performed in a waiting area such as a lobby or front office desk of an organization or business. The title "receptionist" is attributed to the person who is employed by an organization to receive or greet any visitors, patients, or clients and answer telephone calls. The term Front Desk is used in many hotels for an administrative department where a receptionist's duties also may include room reservations and assignment, guest registration, cashier work, credit checks, key control as well as mail and message service. Such receptionists are often called front desk clerks. A receptionist covers a huge amount of areas of work to assist the business they work for, including setting appointments, filing, record keeping, and many of other office tasks all for the sake of keeping things moving.

The Front office or reception is an area where visitors arrive and first encounter a staff at a place of business. Front office staff will deal with whatever question the visitor has, and put them in contact with a relevant person at the company. Broadly speaking, the front office includes roles that affect the right side (revenues) of trading statement of the business. The term front office is in contrast to the term "back office" which refers to a company's operations, personnel, accounting, payroll and financial departments which do not interact directly with customers.

The front office receives information about the customers and will then pass this on to the relevant department within the company. The front office can also contact the marketing and/or sales department should the customers have questions. The company needs to give training to the front office manager as this position will come in contact with customers the most.

The most common work for the front office staff will be to get in touch with customers and help out internally in the office. Staff working at the front office can also deal with simple tasks, such as printing and typing tasks and sorting emails. Although front office staff might only need to perform tasks such as answering the phone, using the printer and fax machine, training is still needed on these tasks.

Front office is related to a service delivery system, where employees engage with customers. It uses the parameter of labor intensity to figure out the distinctive characteristics of a service.