Search

Global routing performance and saving energy are critical for Internet applications. Internet service providers use the internal Border Gateway Protocol for the distribution of external routes within the autonomous system. The balance between the trade-off relationship of energy efficiency and quality-of-service is necessary for autonomous systems in green networking. Past studies have shown that energy saving schemes exacerbate quality-of-service. However, the optimum use of resources balances the trade-off between energy efficiency and quality-of-service. Therefore, we propose a Green BGP model that balances the trade-off between energy efficiency and quality-of-service by optimizing the internal Border Gateway Protocol path selection policy. Border Gateway Protocol routers select a path considering the quality-of-service attributes and energy efficiency of the path within the autonomous system. The proposed model is compared with related techniques, and the results confirm the advantages of the Green BGP model that improves energy efficiency and maintains quality-of-service. [ABSTRACT FROM AUTHOR]

Abstract: In the internet environment, the Diversity-path-aware Border Gateway Protocol (D-BGP) increases path diversity by advertising multiple paths. In case of a route failure, D-BGP, selects the most disjoint alternative path, but does not consider its quality moreover because update messages are propagated both for the best path and for alternate paths, D-BGP has messaging. To overcome these limitations, we propose a robust BGP protocol that increases fault tolerance and reduces update message overhead. After establishing shortest paths using D-BGP, our protocol selects an alternate path based on link availability of the link and bandwidth. It utilizes Path Exploration Damping (PED) to delay update messages of alternate paths with worst-case scenario. Simulation results justify that our proposed BGP is failure free and performs better than D-BGP. [Copyright &y& Elsevier]

• We developed a Delay-based Adaptive Congestion Control TCP variant (DACC). • DACC has an initialization method that obtains an optimal initial value for the congestion window. • It has a queueing-delay variation-based scheme that contemplates the contribution of all contention traffic flows. • It has improved performance in goodput, throughput, file transfer time, and fairness. Delay-based congestion control policies of the Transmission Control Protocol (TCP) mainly use the Round-Trip-Time (RTT) and bottleneck queue size to detect congestion. However, these policies identify congestion by only taking into account the contribution of their own data flow. Thus, the congestion identification in these policies fails to be completely accurate. Moreover, these policies experience many packet losses resulting in retransmissions, which can further reduce channel utilization. This article proposes a queuing delay variation-based adaptive congestion control TCP variant, called Delay-based Adaptive Congestion Control (DACC), that considers the presence of background flows. DACC quickly adapts to the current network conditions and adjusts the transmission rate accordingly. The simulation results exemplify the significance of DACC as it yields better outcomes in terms of goodput, Packet Loss Ratio (PLR), inter-protocol fairness, intra-protocol fairness, and fast file transfers. [Display omitted] [ABSTRACT FROM AUTHOR]