An adaptive link assignment algorithm for dynamically changing topologies

Noakes, Michael D.; Cain, J. Bibb; Adams, S. L.; Althouse, Edwin L.

doi:10.1109/milcom.1988.13464

Cited by 13 publications

(12 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…"An adaptive link assignment algorithm for distributed optimization of dynamically changing network topologies..." and related routing algorithm are investigated by [20] and [21], respectively. [22] discusses dynamic hierarchical networks employing adaptive behaviour for variable demands and [23] proposes activation and deactivation of links in response to charged traffic conditions uses an analytical approach.…”

Section: Related Workmentioning

confidence: 99%

Heuristics for dynamic topologies to reduce power consumption of networks

Aldraho

Kist

2010

2010 Australasian Telecommunication Networks and Applications Conference

View full text Add to dashboard Cite

Energy consumption of communication networks is an important contributor to the ICT sector's greenhouse gas emission footprint. This research project focuses on power consumption reduction of communication networks by dynamically adapting network configuration to traffic demands. This is promising as networks are often under utilised over long periods. In the context of this work, dynamic topologies refers to a method of changing network links and nodes according to traffic loads. In this paper preliminary results are introduced and two simple heuristics are investigated: the Lightest Node First and the Least Loaded Node algorithms. Both generate reduced topologies for given traffic loads with smaller energy footprints than unmodified networks. Initial numerical results are presented for a small sample network of eight nodes with a large set of traffic demands. Depending on overall network utilisation, the algorithms are able to reduce the average network power consumption by up to 50% for this sample network.

show abstract

Section: Related Workmentioning

confidence: 99%

Heuristics for dynamic topologies to reduce power consumption of networks

Aldraho

Kist

2010

2010 Australasian Telecommunication Networks and Applications Conference

View full text Add to dashboard Cite

show abstract

“…The design of contact plans has still received little attention, as it is typically assumed that all potential contacts between DTN nodes can belong to the contact plan; in other words, that the contact plan equals the contact topology. Early works [14,15] have focused on contact plans that can enhance the network connectivity for a given topology state, without taking into account the time-evolving nature of the contact topology which enables the transport of data through multiple states. With the advent of DTNs, the design of contact plans that consider time-evolving topologies became much relevant as traffic data can traverse different topology states.…”

Section: Introductionmentioning

confidence: 99%

Routing-aware fair contact plan design for predictable delay tolerant networks

Fraire

Finochietto

2015

Ad Hoc Networks

View full text Add to dashboard Cite

“…Therefore, an appropriate LAS should minimize the average node‐to‐node distance of network topology with all the CTs of each satellite to establish ISLs. However, the LAS of previous works did not consider minimizing the average node‐to‐node distance and assigning all the CTs for each satellite simultaneously . For example, many satellite networks assume simple regular network topologies with all CTs being active, such as Manhattan Street Network (MSN) topology ; however, they may not work well on average node‐to‐node distance.…”

Section: Introductionmentioning

confidence: 99%

Perfect match model-based link assignment to design topology for satellite constellation system

Liu

Guo

Deng

et al. 2015

Int. J. Satell. Commun. Network.

View full text Add to dashboard Cite

In satellite constellation network, the satellites visible from one satellite are more than communication terminals (CTs) equipped. Each inter-satellite link (ISL) would occupy one CT on each of two satellites connected by this ISL. Therefore, a fundamental problem considering link assignment is how to assign limited CTs for each satellite to establish ISLs with its visible satellites. Link assignment scheme based on perfect match model (LAS-PMM) is proposed to make full use of huge bandwidth provided by CT. In LAS-PMM, the problem of assigning all the CTs of each satellite to establish ISLs is modeled as a perfect matching problem, where a perfect matching is searched over a mixed complete bipartite graph. Simulation results show that LAS-PMM is better than the regular and greedy LASs, in terms of CT utilization and average node-to-node distance.

show abstract

An adaptive link assignment algorithm for dynamically changing topologies

Cited by 13 publications

References 4 publications

Heuristics for dynamic topologies to reduce power consumption of networks

Heuristics for dynamic topologies to reduce power consumption of networks

Routing-aware fair contact plan design for predictable delay tolerant networks

Perfect match model-based link assignment to design topology for satellite constellation system

Contact Info

Product

Resources

About