# New approach to vertex connectivity could maximize networks' bandwidth

##### Dec 23, 2013 by Helen Knight

Computer scientists are constantly searching for ways to squeeze ever more bandwidth from communications networks.

Now a new approach to understanding a basic concept in graph theory, known as "vertex connectivity," could ultimately lead to communications protocols—the rules that govern how digital messages are exchanged—that coax as much bandwidth as possible from networks.

Graph theory plays a central role in mathematics and computer science, and is used to describe the relationship between different objects. Each graph consists of a number of nodes, or vertices, which represent the objects, and connecting lines between them, known as edges, which signify the relationships between them. A communications network, for example, can be represented as a graph with each node in the network being one vertex, and a connection between two nodes depicted as an edge.

One of the fundamental concepts within graph theory is connectivity, which has two variants: edge connectivity and vertex connectivity. These are numbers that determine how many lines or nodes would have to be removed from a given graph to disconnect it. The lower the edge-connectivity or vertex-connectivity number of a graph, therefore, the easier it is to disconnect, or break apart.

In this way both concepts show how robust a network is against failure, and how much flow can pass through it—whether the flow of information in a , traffic flow in a transportation system, or fluid flow in hydraulics.

Reducing edge connectivity's edge

However, while a great deal of research has been carried out in mathematics to solve problems associated with edge connectivity, there has been relatively little success in answering questions about vertex connectivity.

But at the ACM-SIAM Symposium on Discrete Algorithms in Portland, Ore., in January, Mohsen Ghaffari, a graduate student in the Computer Science and Artificial Intelligence Laboratory at MIT, will present a new technique for addressing vertex-connectivity problems.

"This could ultimately help us understand how to build more robust and faster networks," says Ghaffari, who developed the new approach alongside Keren Censor-Hillel at the Technion and Fabian Kuhn at the University of Freiburg.

In the 1960s, mathematicians William Tutte and Crispin Nash-Williams separately developed theories about structures called edge-disjoint spanning trees, which now serve as one of the key technical tools in many problems about edge connectivity.

A spanning tree is a subgraph—or a graph-within-a-graph—in which all of the nodes are connected by the smallest number of edges. A set of spanning trees within a graph are called "edge-disjoint" if they do not share any of these connecting lines.

If a network contains three edge-disjoint spanning trees, for example, information can flow in parallel along each of these trees at the same time, meaning three times more bandwidth than would be possible in a graph containing just one tree. The higher the number of edge-disjoint spanning trees, the larger the information flow, Ghaffari says. "The results of Tutte and Nash-Williams show that each graph contains almost as many spanning trees as its edge connectivity," he says.

Now the team has created an analogous theory about vertex connectivity. They did this by breaking down the graph into separated groups of nodes, known as connected dominating sets. In , a group of nodes is called a connected dominating set if all of the vertices within it are connected to one another, and any other node within the graph is adjacent to at least one of those inside the group.

In this way, information can be disseminated among the nodes of the set, and then passed to any other node in the network.

So, in a similar way to Tutte and Nash-Williams' results for edge connectivity, "each graph contains almost as many vertex-disjoint connected dominating sets as its vertex connectivity," Ghaffari says.

"So if you think of an application like broadcasting information through a network, we can now decompose the network into many groups, each being one connected dominating set," he says. "Each of these groups is then going to be responsible for broadcasting some set of the messages, and all groups work in parallel to broadcast all the messages fast—almost as fast as possible."

The team has now developed an algorithm that can carefully decompose a network into many connected dominating sets. In this way, it can structure so-called wireless ad hoc networks, in which individual nodes route data by passing it from one to the next to ensure the best possible speed of information flow. "We want to be able to spread as much information as possible per unit of time, to create faster and faster networks," Ghaffari says. "And when a graph has a better vertex connectivity, it allows a larger flow [of ]," he adds.

Applications in assessing robustness

The researchers can also use their new approach to analyze the robustness of a network against random failures. "These new techniques also allow us to analyze whether a is likely to remain connected when its fail randomly with some given probability," Ghaffari says. "Reliability against random edge failures is well understood, but we knew much less about that against node failures," he adds.

Explore further: Machine learning branches out

## Related Stories

#### Machine learning branches out

Nov 14, 2013

Much artificial-intelligence research is concerned with finding statistical correlations between variables: What combinations of visible features indicate the presence of a particular object in a digital ...

#### More-efficient computation: Finding local solutions to overwhelmingly complex problems

Mar 31, 2011

At a time when the Internet puts an untold amount of information at anyone’s fingertips, and automated scientific experiments churn out data faster than researchers can keep up with it, and communications ...

#### Short algorithm, long-range consequences

Mar 01, 2013

In the last decade, theoretical computer science has seen remarkable progress on the problem of solving graph Laplacians—the esoteric name for a calculation with hordes of familiar applications in scheduling, image processing, ...

#### Explained: Graphs

Dec 17, 2012

When most people hear the word "graph," an image springs to mind: a pair of perpendicular lines overlaid with a line, a curve, or bars of different heights.

#### Enhancing the efficiency of complex computations

Nov 29, 2013

Planning a trip from Berlin to Hamburg, simulating air flows around a new passenger airplane, or friendships on Facebook – many computer applications model relationships between objects by graphs (networks) ...

Feb 21, 2012

Understanding the spread of infectious diseases in populations is the key to controlling them. If we were facing a flu pandemic, how could we measure where the greatest spreading risk comes from? This information ...

## Recommended for you

#### UT Dallas professor to develop framework to protect computers' cores

Apr 18, 2014

UT Dallas cybersecurity expert Dr. Zhiqiang Lin has received funding from the U.S. Air Force to develop a defense framework that burrows deep into a computer system to protect its core.

#### Researcher finds hidden efficiencies in computer architecture

Apr 18, 2014

The computer is one of the most complex machines ever devised and most of us only ever interact with its simplest features. For each keystroke and web-click, thousands of instructions must be communicated ...

#### Scientists apply new graph programming method for evolving exascale applications

Apr 18, 2014

(Phys.org) —Hiding the complexities that underpin exascale system operations from application developers is a critical challenge facing teams designing next-generation supercomputers. One way that computer ...

Apr 17, 2014

(Phys.org) —Google engineers working on software to automatically read home and business addresses off photographs taken by Street View vehicles, have created a product so good that not only can it be used ...

#### Preventing AI from developing anti-social and potentially harmful behaviour

Apr 17, 2014

Next time you play a computer at chess, think about the implications if you beat it. It could be a very sore loser!

#### Researcher seeks to lessen failures in computerized visual recognition programs

Apr 17, 2014

Computer programs that use facial or image recognition systems—be it security cameras or applications that search databases for everything from photographs of wanted criminals to images of bears – are like any other technological ...

## More news stories

#### Ex-Apple chief plans mobile phone for India

Former Apple chief executive John Sculley, whose marketing skills helped bring the personal computer to desktops worldwide, says he plans to launch a mobile phone in India to exploit its still largely untapped ...

#### Airbnb rental site raises \$450 mn

Online lodging listings website Airbnb inked a \$450 million funding deal with investors led by TPG, a source close to the matter said Friday.

#### Health care site flagged in Heartbleed review

People with accounts on the enrollment website for President Barack Obama's signature health care law are being told to change their passwords following an administration-wide review of the government's vulnerability to the ...

#### A homemade solar lamp for developing countries

(Phys.org) —The solar lamp developed by the start-up LEDsafari is a more effective, safer, and less expensive form of illumination than the traditional oil lamp currently used by more than one billion people ...

#### Tiny power plants hold promise for nuclear energy (Update)

Small underground nuclear power plants that could be cheaper to build than their behemoth counterparts may herald the future for an energy industry under intense scrutiny since the Fukushima disaster, the ...

#### NASA's space station Robonaut finally getting legs

Robonaut, the first out-of-this-world humanoid, is finally getting its space legs. For three years, Robonaut has had to manage from the waist up. This new pair of legs means the experimental robot—now stuck ...

#### Free the seed: OSSI nurtures growing plants without patent barriers

(Phys.org) —Members of the Open Source Seed Initiative this week held a rally and seed giveaway event. The group is concerned over restricting access to seeds through patents. They are stirring up public ...

#### Filipino tests negative for Middle East virus

A Filipino nurse who tested positive for the Middle East virus has been found free of infection in a subsequent examination after he returned home, Philippine health officials said Saturday.

#### Egypt archaeologists find ancient writer's tomb

Egypt's minister of antiquities says a team of Spanish archaeologists has discovered two tombs in the southern part of the country, one of them belonging to a writer and containing a trove of artifacts including reed pens ...

#### Philippines boosts MERS monitoring after UAE nurse scare

The Philippines said Saturday it was stepping up its defences against the deadly MERS virus, with the large numbers of Filipino workers in the Middle East seen as potential carriers.