Autonomic traffic engineering for network robustness

Tizghadam, Ali; Leon-Garcia, Alberto

doi:10.1109/jsac.2010.100105

Cited by 103 publications

(75 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Tizghadam and Leon-Garcia [15] provided a theoretical basis for the design of the algorithm to calculate the metric, network criticality, to determine the robustness of the network. In this paper, the application was developed using this as a theoretical base [15].…”

Section: Algorithm Designmentioning

confidence: 99%

“…In [15], the authors showed that if the weight increases, the goodness of that link increases. The factors increasing the goodness of the link such as available bandwidth are called as "beneficial QoS parameters" and those that decrease the goodness of the link are called the "detrimental QoS parameters" such as packet loss or length of the link.…”

Section: Weight Assignmentmentioning

confidence: 99%

“…Tizghadam and Leon-Garcia [15] thus defined node criticality for a weighted network simply as the random-walk betweenness of that node over the weight of the node.…”

Section: Network Criticalitymentioning

confidence: 99%

“…The authors [15] derived an expression for node betweenness by making a matrix $ that would describe for destination d. The probability of entering k at q th step is $ . The authors treated d as a fixed point and the matrices are written under this assumption.…”

Section: Network Criticalitymentioning

confidence: 99%

“…According to Tizghadam and Leon-Garcia [15], the equation for an optimal weight set W*, and using the concept of optimisation from [18] [19]…”

Section: Optimization Of Network Criticalitymentioning

confidence: 99%

See 4 more Smart Citations

Application to Determine Optimized Path for Network Robustness

Kaushik¹

2018

Computer Science &Amp; Information Technology

View full text Add to dashboard Cite

show abstract

Section: Algorithm Designmentioning

confidence: 99%

Section: Weight Assignmentmentioning

confidence: 99%

“…Tizghadam and Leon-Garcia [15] thus defined node criticality for a weighted network simply as the random-walk betweenness of that node over the weight of the node.…”

Section: Network Criticalitymentioning

confidence: 99%

Section: Network Criticalitymentioning

confidence: 99%

“…According to Tizghadam and Leon-Garcia [15], the equation for an optimal weight set W*, and using the concept of optimisation from [18] [19]…”

Section: Optimization Of Network Criticalitymentioning

confidence: 99%

See 3 more Smart Citations

Application to Determine Optimized Path for Network Robustness

Kaushik¹

2018

Computer Science &Amp; Information Technology

View full text Add to dashboard Cite

show abstract

Virtual network construction with K‐shortest path algorithm and optimization problems for robust physical networks

Urayama

Tachibana

2015

Int J Communication

View full text Add to dashboard Cite

In network virtualization, it has been considered that virtual networks are constructed over a physical network where conventional data transmission services have been utilized. Here, virtual networks have to be constructed while keeping qualities of the conventional services. In this paper, we propose a new virtual network construction in order to construct many virtual networks while keeping the robustness of a physical network by using network resources effectively. The proposed method consists of three processes: K-shortest path algorithm and Prim's minimum spanning tree algorithm, path splitting, and path migration. In the proposed method, at first, multiple topologies are designed by using the K-shortest path algorithm and the Prim's MST algorithm according to the user's request. After the topology design is completed, an admission control with network robustness of the physical network is performed. Then, if one of the designed topologies can satisfy the construction conditions, a virtual network is constructed and provided with the user. Otherwise, the path splitting and path migration are performed. Here, the path splitting is utilized to design another topology of a virtual network and path migration is used to change the topologies of the virtual networks that have already been constructed. These processes are formulated as optimization problems and those are processed by solving the optimization problems. In numerical examples, we show that our proposed method can construct a higher number of virtual networks while keeping the robustness of a physical network by comparing with the conventional method where only the Kou-Markowsky-Berman algorithm is used. Int. J. Commun. Syst. 2017; 30: e2958 1 of 21 Y. URAYAMA AND T. TACHIBANA flow table that describes each action for each data packet. Data packets can be forwarded to a corresponding virtual network according to the flow table in the OpenFlow controller.Here, the amount of available network resources is limited in the physical network, and hence, each virtual network has to be constructed so that the network resources are utilized efficiently. Some methods for designing the topology of a virtual network and allocating the network resources to the virtual network have been proposed in the literatures.In [10], in order to construct a virtual network simply over a large physical network, a topology of the virtual network is designed by combining two or more small star topologies. Yu et al. [11] has proposed a construction method of a virtual network with path splitting and path migration.In this method, a service provider obtains the revenue from a user after a virtual network was constructed. In order to maximize the revenue, virtual networks are constructed over a physical network by using the path splitting and path migration.In particular, by using the path migration, the topologies of constructed virtual networks are redesigned periodically. In [12], an architecture called DaVinci has been proposed so that network resources can be allocated to each ...

show abstract

CCRA: channel criticality based resource allocation in cognitive radio networks

Kumar

Minz

2015

Int J Communication

View full text Add to dashboard Cite

In cognitive radio networks, signal to interference plus noise ratio (SINR) is a quantity that is used to analyze the bounds of the capacity of a channel. This is the reason for SINR being one of the important parameters toward evaluating the performance of spectrum sharing in every network. To maximize the channel utilization in any network, the SINR of a channel should be considered to be within a threshold. This also leads to lesser power consumption, and the quality of service for the licensed users is maintained. Further, reduced SINR leads to an improvement in the quality of communication in the network. In this paper, a graph theoretic measure for the efficient utilization of channels in cognitive radio networks has been proposed and is named as channel criticality based resource allocation (CCRA). Using the SINR as the weight of the graph, a novel concept of channel criticality has also been introduced in this work. The proposed CCRA technique has also been compared with the existing interference aware channel assignment (IACA) technique in terms of the channel utilization. Through simulations, the CCRA has been observed to outperform the IACA scheme. The average channel utilization of the proposed CCRA was observed to have increased by 8%, when the secondary users were introduced in the network as compared with the IACA technique. Copyright Int. J. Commun. Syst. 2017; 30: e3012 V. KUMAR AND S. MINZThe betweenness of the link k for the source and destination pair .a; b/ is given by of 12 6

show abstract

Autonomic traffic engineering for network robustness

Cited by 103 publications

References 20 publications

Application to Determine Optimized Path for Network Robustness

Application to Determine Optimized Path for Network Robustness

Virtual network construction with K‐shortest path algorithm and optimization problems for robust physical networks

CCRA: channel criticality based resource allocation in cognitive radio networks

Contact Info

Product

Resources

About