Comparative Performance of Green Pipe, Green Hose and Green Hose-Rectangle Models in Power Efficient Network

@article{Das2018ComparativePO,
  title={Comparative Performance of Green Pipe, Green Hose and Green Hose-Rectangle Models in Power Efficient Network},
  author={Bimal Chandra Das and Eiji Oki and Masakazu Muramatsu},
  journal={2018 IEEE International Workshop Technical Committee on Communications Quality and Reliability (CQR)},
  year={2018},
  pages={1-6}
}
  • B. Das, E. Oki, M. Muramatsu
  • Published 1 May 2018
  • Computer Science
  • 2018 IEEE International Workshop Technical Committee on Communications Quality and Reliability (CQR)
In this paper, a green and robust optimization model is proposed to the problem of minimizing network power consumption which can deal with uncertainty in traffic demands. The green pipe model achieves the first position in terms of minimizing network power consumption if we know the exact traffic demand. However, in reality, traffic demands fluctuate due to various situation. The hose model, which is formulated from the total outgoing/incoming amount of traffic from/to each node can allows… 
1 Citations

Figures and Tables from this paper

Conic Programming Approach to Reduce Congestion Ratio in Communications Network

TLDR
The robust optimization model is introduced in the form of second-order cone programming (SOCP) problem which is tractable by optimization software and can deal with fluctuation in the traffic demands all over the network.

References

SHOWING 1-10 OF 16 REFERENCES

A Green and Robust Optimization Strategy for Energy Saving Against Traffic Uncertainty

TLDR
Simulation results show that green HLT, while being robust to traffic uncertainty, achieves power efficiency comparable to the models where the knowledge of the traffic information is required.

Performance comparisons of optimal routing by pipe, hose, and intermediate models

TLDR
The introduction of a duality theorem turns the problem of optimal routing extended from the pipe model to the intermediate model into an LP formulation that can be easily solved.

Performance of Optimal Routing by Pipe, Hose, and Intermediate Models

TLDR
The introduction of a duality theorem turns the optimal-routing formulation extended from the pipe model to the intermediate model into an LP formulation that can be easily solved.

Load-Balanced IP Routing Scheme Based on Shortest Paths in Hose Model

  • E. OkiA. Iwaki
  • Computer Science
    IEEE Transactions on Communications
  • 2010
TLDR
Numerical results show that the proposed scheme dramatically reduces the network congestion ratio compared to the classical shortest path routing scheme and it provides performance close to that provided by the sophisticated traffic-engineering scheme of Multi-Protocol Label Switching (MPLS)-TE.

On bandwidth efficiency of the hose resource management model in virtual private networks

  • Alpár JüttnerI. SzabóÁron Szentesi
  • Computer Science
    IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428)
  • 2003
TLDR
A detailed comparison of the bandwidth needs of the two models assuming a range of network sizes and network topologies is presented and the calculation of a lower bound for the hose based realization is presented.

Optimal Link Weights for IP-Based Networks Supporting Hose-Model VPNs

  • Jian ChuC. Lea
  • Computer Science
    IEEE/ACM Transactions on Networking
  • 2009
TLDR
This paper presents a mixed-integer programming formulation to compute the optimal link weights that can maximize the ingress and egress VPN traffic admissible to a hop-by-hop routing network and presents a heuristic algorithm for solving the link weight searching problem for large networks.

Energy-aware routing: A reality check

TLDR
It is shown that depending on the topology and traffic matrices, the optimal energy savings can be modest, partly limiting the interest for green routing approaches for some scenarios and also showing that in the considered environment, green routing has no effect on the main network performances such as maximum link utilization.

Explicit routing algorithms for Internet traffic engineering

  • Yufei WangZheng Wang
  • Computer Science
    Proceedings Eight International Conference on Computer Communications and Networks (Cat. No.99EX370)
  • 1999
TLDR
This paper considers explicit routing algorithms for Internet traffic engineering and shows that the bifurcation case is NP-hard, and four heuristic schemes are proposed, the most sophisticated one being based on re-routing of split demands in the optimal solution of the bIfurcation cases.

Algorithms for provisioning virtual private networks in the hose model

TLDR
Novel algorithms for provisioning VPNs in the hose model are developed and it is shown that the VPN trees constructed by the proposed algorithms dramatically reduce bandwidth requirements compared to scenarios in which Steiner trees are employed to connect VPN endpoints.

Optimal Link Weights for Maximizing QoS Traffic

  • Jian ChuC. Lea
  • Computer Science
    2007 IEEE International Conference on Communications
  • 2007
TLDR
This paper presents a mixed-integer programming formulation to compute the optimal link weights that can maximize the ingress and egress QoS traffic admissible to a hop-by-hop routing network and presents a heuristic search algorithm to find the optimal weights.