Effective Bandwidth Utilisation in Multihoming Networks
Gautam Barua2006 1st International Conference on Communication Systems Software & Middleware
Sign up for access to the world's latest research
checkGet notified about relevant papers
checkSave papers to use in your research
checkJoin the discussion with peers
checkTrack your impact
Abstract
In order to bridge the speed disparity at the LAN-WAN interface, enterprises install a number of policy-based devices to enforce administrative policies over the WAN access. The conventional techniques of bandwidth management concentrate only on the outgoing traffic from the local network. Regulating the outgoing traffic is easy given that the user has full control over it. However, controlling the incoming traffic is difficult since the user has no control on the traffic sent by an Internet agent. This paper proposes a simple load balancing approach to optimize the use of WAN links in a multihomed environment. By distributing the user traffic among the various WAN links we try to optimize the utilization of incoming bandwidth on the access links thereby giving an indirect measure to control the incoming traffic. We deploy a prototype implementation of our approach on a campus network with high incoming traffic, to evaluate the performance benefits. Using a large collection of network traces, we find that even with a subnet-level of load balancing there can be significant increase in performance. The proposed load balancing approach can be used as a first step toward controlling the incoming traffic, before other actual bandwidth management techniques are applied.
Related papers
Network Traffic Management using Dynamic Bandwidth on Demand
Traffic Analysis and measurement in large networks is very challenging task for network managers. Bandwidth plays a vital role during network traffic analysis and management. Bandwidth allocation becomes a critical issue for effective network management. Bandwidth on demand concept gradually evolved while addressing the need of network managers for monitoring on-demand traffic. Use of efficient bandwidth allocation algorithm significantly improves network performance by assuring availability of network to all users. In this paper, we propose an optimized algorithm using the concept " rating of web pages " , which is based on users' past accessibility. This algorithm assigns a minimum guaranteed bandwidth to each connected user, instead of equally dividing the total available bandwidth among the users. Finally, based on rating of web pages, any excess bandwidth is distributed dynamically among existing users. This significantly improves the average utilization of available bandwidth.
Capacity Management for Internet Traffic
Lecture Notes in Computer Science, 2000
We describe methods to guarantee a certain level of service for Internet traffic by reserving capacity along fixed logical paths. The amount of needed capacity is calculated by using a trade-off between connection rejection probability and the utilization of the capacity. This can be used in the process of dimensioning capacity on a long term basis. Two dynamic allocation methods are proposed, which periodically reallocates capacity according to measured traffic loads. Call admission control is used and automatic connection retrials are studied. Each method is designed for a particular scenario. In the first one, a LAN reserves capacity to get a certain transmission speed for every connection. Capacity is paid for according to how much of it that is reserved. The second one considers an aggregated traffic generated by users having limited transmission speed in their connection to the Internet (e.g. modem-and mobileusers) and the operator of the network manages the capacity. The Internet traffic is modeled as Web page fetches from the World Wide Web.
Policy-based traffic management in home area networks
Proceedings of the 6th International Conference on Frontiers of Information Technology - FIT '09, 2009
Traffic management in home area network (HAN) is different from the traditional traffic management in access and core networks. Traditionally network traffic works in best effort fashion and the HAN services are usually accommodated on the basis of first-in first-out rule. However quality can deteriorate when high number of users is connected to the HAN. Moreover the bursty traffic can also impact the quality by chocking the network traffic and blocking the network resources for all other traffic. Traffic management rules can be employed in HAN to prioritise different types of traffic according to user requirements. Dynamic configuration of network resources and services is multifaceted process, which requires many skills and knowledge. Policy-based Traffic Management (PBTM) can play a significant role in managing home networks and configuring the services dynamically according to HAN user requirements. This paper presents a testbed model for HAN to simplify traffic management process based on the principles of policy-based network management.
Policy Refinement for Traffic Management in Home Area Networks: Problem Statement
2009
Traditional home area network (HAN) equipment is usually unmanaged and network traffic is served in best effort fashion. This type of unmanaged network sometimes causes quality-of-service issues in the HAN, for example loss of quality in streamed video or audio content. Traffic management rules using policies to prioritise certain types of traffic according to user requirements and to assign bandwidth limits to other traffic types. However very little work has been done yet addressing the specification of these requirements, how they would be communicated to the gateway device using policies, and how the policies would be refined into device level configurations to effectively implement the user requirements. In this paper we briefly discuss this as a research problem, placing it within the context of the research goals and an initial research methodology in the area of policy refinement for policy-based traffic management in home area networks (HANs).
A Survey: Bandwidth Management in an IP Based Network
this paper presented a survey analysis subjected on network bandwidth management from published papers referred in IEEE Explorer database in three years from 2009 to 2011. Network Bandwidth Management is discussed in today's issues for computer engineering applications and systems. Detailed comparison is presented between published papers to look further in the IP based network critical research area for network bandwidth management. Important information such as the network focus area, a few modeling in the IP Based Network and filtering or scheduling used in the network applications layer is presented. Many researches on bandwidth management have been done in the broad network area but fewer are done in IP Based network specifically at the applications network layer. A few researches has contributed new scheme or enhanced modeling but still the issue of bandwidth management still arise at the applications network layer. This survey is taken as a basic research towards implementations of network bandwidth management technique, new framework model and scheduling scheme or algorithm in an IP Based network which will focus in a control bandwidth mechanism in prioritizing the network traffic the applications layer.
Design and implementation of network management with two-layer fairness approach in campus network environment
International Journal of Internet Protocol Technology, 2008
Accelerated growth in Internet bandwidth and Internet users have been increased network management complexity. This issue is more pronounced in campus networks as the scale of such networks has increased dramatically. This work proposes a layer-based network bandwidth management framework that significantly decreases the implementation complexity, achieves fair bandwidth allocation and resolves the problem of stolen IP addresses. Simulation results demonstrate that the proposed framework achieves fair bandwidth usage in the subnet and backbone. By the way, we also realise the system with embedded platform to reveal the algorithm and performance.
Effect of Network Policies on Internet Traffic Engineering
Innovative Applications of Information Technology for the Developing World - Proceedings of the 3rd Asian Applied Computing Conference, 2007
An important objective of Internet traffic Engineering is to facilitate reliable network operations by providing proper QoS to different services through mechanisms which will enhance network integrity and achieve network survivability. Current Internet architecture is distributed in nature, interconnected by Internet Service Providers (ISPs), where a central goal of each service provider is to enhance emergent properties of their own network by providing better service qualities with strong emphasis on economic considerations. Hence, service providers aim at getting the best result based upon economic considerations and governed by their network wide policies. In this paper we present a scheme in which Autonomous System (AS) relationships are central to any policy decision imposed by individual ISPs. Based on these policy relationships, we propose a framework which is expected to match the need for better QoS, uniform Internet wide service management and contribute efficiently towards traffic engineering. This paper presents an integrated approach to traffic engineering, routing and policy mechanisms for better management of QoS over the Internet.
A Novel Scheme for Effective Number of Users in Intranet Congestion Control
An end-to-end congestion control, the current Internet suffers from two maladies: Congestion collapse from undelivered packets, and unfair allocations of bandwidth between competing traffic flows. The first malady — congestion collapse from undelivered packets. The second malady—unfair bandwidth allocation to competing network flows. Adaptive applications (e.g., TCP-based applications) that respond to congestion by rapidly reducing their transmission rates are likely to receive unfairly small bandwidth allocations when competing with unsympathetic applications. The Internet protocols themselves can commence unfairness. The TCP algorithm, for illustration, intrinsically causes every TCP flow to accept a bandwidth that is inversely proportional to its round-trip time. Hence, TCP connections with short round-trip times may receive unfairly large allocations of network bandwidth when compared to connections with longer round-trip times. In this paper, enhanced congestion control mechanism for packet retransmission is used to rectify collapse in network.
Impact of differentiated service billing on the quality of service of an IP network
2010 2nd International Conference on Computer Technology and Development, 2010
There is an exponential rise in awareness, reliance and usage of the Internet protocol (IP) network. The advent of multimedia applications on the IP network, such as, voice over IP, streaming audio and video, etc, has contributed immensely to the congestion on the broadband network. The increase in the number of users who rely on peer to peer (P2P) protocols to allow transfer of very large files and applications has also added to the congestion experienced by users of the IP network. Quality of service (QoS), bandwidth management or IP service control are all general terms given to a broad range of techniques employed to control and shape traffic on this network. Some works tried to control the IP traffic by introducing billing; however, most billing techniques in literature did not seriously consider the overall QoS of the network. In this work we present a new billing scheme termed differentiated service billing (DSB), which controlled congestion by checking user behavior with respect to type of application used on the network. It thus improves the overall QoS perceived by users of 'relevant' applications. The DSB is an improved variant of usage billing. It effectively checks the usage of bandwidth intensive applications, especially for a campus network. Our results clearly showed an improved network link performance when this billing scheme was compared with the traditional flat billing and usage billing schemes. I.
FlowQoS: Per-Flow Quality of Service for Broadband Access Networks
In broadband access networks, one application may compete for the bandwidth of other applications, thus degrading overall performance. One solution to this problem is to allocate bandwidth to competing flows based on the application type at the gateway of the home network. Unfortunately, applicationbased quality of service (QoS) on a home network gateway faces significant constraints, as commodity home routers are not typically powerful enough to perform application classification, and many home users are not savvy enough to configure QoS parameters. This paper describes FlowQoS, an SDN-based approach for application-based bandwidth allocation where users can allocate upstream and downstream bandwidths for different applications at a high level, offloading application identification to an SDN controller that dynamically installs traffic shaping rules for application flows. FlowQoS has two modules: a flow classifier and an SDNbased rate limiter. We design a custom DNS-based classifier to identify different applications that run over common web ports; a second classifier performs lightweight packet inspection to classify non-HTTP traffic flows. We implement FlowQoS on OpenWrt and demonstrate that it can improve the performance of both adaptive video streaming and VoIP in the presence of active competing traffic.
Related papers
Policy-based traffic management in home area networks: an elementary testbed model
2009
Traffic management in home area network (HAN) is different from the traditional traffic management in access and core networks. Traditionally network traffic works in best effort fashion and the HAN services are usually accommodated on the basis of first-in first-out rule. However quality can deteriorate when high number of users is connected to the HAN. Moreover the bursty traffic can also impact the quality by chocking the network traffic and blocking the network resources for all other traffic. Traffic management rules can be employed in HAN to prioritise different types of traffic according to user requirements. Dynamic configuration of network resources and services is multifaceted process, which requires many skills and knowledge. Policy-based Traffic Management (PBTM) can play a significant role in managing home networks and configuring the services dynamically according to HAN user requirements. This paper presents a testbed model for HAN to simplify traffic management process based on the principles of policy-based network management.
A New Adaptive Throughput Policing Algorithm On Campus IP-Based Network Internet Traffic
This paper presents the development of a new scheme called Adaptive Throughput Policy (ATP) algorithm to control internet inbound throughput utilization in an IP-based network by considering traffic flows and their processing times. Real live inbound internet traffics collected from a Campus Network with Committed Access Rate (CAR) of 16 Mbps bandwidth allocations to internal users are analyzed. New mathematical model with identified parameters are derived and policies are simulated using Token Bucket theory control mechanism. Three main policies conditions called P1 which is controlled on 5% under threshold, P2 which is controlled on threshold rate and P3 which is controlled beyond 10% threshold are defined as filtered condition. ATP simulation evaluated throughput performance on the real live internet traffic. Result present achievement in throughput performance which includes Bucket Capacity, Bandwidth Saving and Processing Time for daily and weekly traffics. The findings show that ATP algorithm resulted in higher bandwidth saving and faster traffic process time in particular during under threshold (P1). Burst throughput are managed to control according to identified implement policies in the development system.
A New Adaptive Throughput Policing and Shaping Algorithm on Campus Ip-Based Network
this paper presents the development of a new scheme called Adaptive Throughput Policing and Shaping (ATPS) algorithm to control internet inbound throughput and burst flow in a Campus IP-based network. Real live throughput collected from a Campus Network with Committed Access Rate (CAR) of 16 Mbps bandwidth speed are simulated and analyzed. New mathematical model with identified parameters on ATPS is derived. Adaptive throughput policies with burst shaping are simulated using Token Bucket theory control mechanism with 16 Mbps threshold policy. Three main adaptive policy conditions called P1, P2 and P3 which is controlled on 110%, 100% and 50% threshold rate are defined as filtered condition. Burst throughputs are shaped into next free bucket capacity for the next flow time. The throughputs are continuously shaped if the next bucket is full until free buckets are available. This new ATPS algorithm is numerically evaluated and analyzed on traffic performance which controlled the bandwidth and burst throughput. Performance results present reduced bucket capacity, reduced bandwidth rate in throughput transfer, no burst throughput and no byte loss in conforming traffic transferred in a network compared to previous implemented ATP algorithm, which held burst throughput and byte loss in the system.
On unified quality of service resource allocation scheme with fair and scalable traffic management for multiclass Internet services
IET Communications, 2011
This study concerns the problem of controlling multiclass (elastic, inelastic and unresponsive) Internet traffic without sacrificing quality of service (QoS) by adopting a unified 'resource allocation and traffic management' approach. The aim is to minimise the need for relying on dedicated QoS traffic control mechanisms in order to avoid spiralling complicatedness that, in practice, leads to 'robust yet fragile' Internet. In order to address this challenge, the authors first introduce an end-to-end nonconvex network utility maximisation-based resource allocation algorithm to guarantee enhanced QoS to elastic and inelastic flows. Then, a pricing-based fair and scalable traffic management scheme, called Purge, is introduced to protect transmission control protocol-friendly traffic from unfairness attacks by unresponsive flows. Finally, the main contribution of this work, the unified algorithm, is developed by adapting Purge to complement link-control of the proposed resource allocation algorithm to enable it to enforce fairness while maintaining a scalable network core. The unified approach thus delivers QoS guarantees for multiclass traffic.
A novel approach for resource allocation in broadband access networks
2010
The paper presents a new approach for Bandwidth control in Broadband Access Networks, especially Digital Subscriber Line (DSL) and Cable Internet (DOCSIS) users. The basic idea is to have a broadband line to the server receiving all the incoming bandwidth. The approach is to have bandwidth division among various VLANs in a network connected via a switch to a centralized server. This approach can be implemented either in an institution where the amount of bandwidth to each department falling under one VLAN can be allocated proportional to the usage and requirements or in an industry where bandwidth needs to be allocated to various divisions. The concept of giving bandwidth according to the VLAN has been made to enhance security and ensuring that the traffic of one VLAN reaches that particular VLAN only. The basic idea is to have a broadband line to the server receiving all the incoming bandwidth. The server then queue the packets according to the VLAN id .The VLAN id of some department having paid for higher bandwidth or having more importance will be given higher priority at the server. All packets belonging to a particular VLAN will be queued in the same queue. The VLAN having higher precedence will have more of its packets sent than the other queues to ensure that the VLAN which was allocated higher bandwidth will receive that bandwidth. The idea is to have VLANs spread across multiple switch yet providing the proportionate bandwidth to each VLAN and also provide mobility to each member of VLAN. Some end users who are of interdisciplinary departments will be members of two or more VLANs.
TOWARDS THE DESIGN OF AN OPTIMAL NETWORK BANDWIDTH ALLOCATION ALGORITHM
Bandwidth is the primary driver of the network speed. It defines the overall connection capacity of any network. Higher bandwidth promotes better network performance; resulting in improved quality of service (QoS).Unavailability of internet connectivity due to low bandwidth is always a frustrating experience for users of the network in any organisation. It is not always the case that the bandwidth allocated to an organisation is inadequate but rather the problem sometimes rest with the internal distribution of the available bandwidth. This paper highlights the problems encountered by users as a result of low bandwidth. We explore the possible causes from a local distribution point of view, as well as discuss the existing systems or approaches to bandwidth allocation. As a conclusion to this work we propose a simple but optimized bandwidth allocation algorithm to assist institutions and organisations to optimally manage their allocated bandwidth. In this paper we consider University of Venda as the case study though the proposed algorithm can be applicable to any institution or organisation faced with similar challenges.
Resource Allocation Methodology for Internet Heterogeneous Traffic
Nigerian Journal of Technology, 2004
The mode of operation of internet can lead to congestion which, in turn, leads to degradation in the quality of service (QoS). Congestion can be seen as overflow in the input and/or output buffers of switches at a node. Research issue relating to internet services is determining the optimum network resources - in terms of transmission link bandwidth and buffer capacity in switches - that are required for heterogeneous internet traffic which guarantees a given QoS, even under high network loading conditions. This paper, therefore, presents a method for determining the optimum internet resources required for heterogeneous (data and voice only) traffic services to guarantee given QoS requirements
Promoting the use of end-to-end congestion control in the Internet
IEEE/ACM Transactions on Networking (TON), 1999
This paper considers the potentially negative impacts of an increasing deployment of non-congestion-controlled best-effort traffic on the Internet. 1 These negative impacts range from extreme unfairness against competing TCP traffic to the potential for congestion collapse. To promote the inclusion of end-to-end congestion control in the design of future protocols using best-effort traffic, we argue that router mechanisms are needed to identify and restrict the bandwidth of selected highbandwidth best-effort flows in times of congestion. The paper discusses several general approaches for identifying those flows suitable for bandwidth regulation. These approaches are to identify a high-bandwidth flow in times of congestion as unresponsive, "not TCP-friendly", or simply using disproportionate bandwidth. A flow that is not "TCP-friendly" is one whose long-term arrival rate exceeds that of any conformant TCP in the same circumstances. An unresponsive flow is one failing to reduce its offered load at a router in response to an increased packet drop rate, and a disproportionate-bandwidth flow is one that uses considerably more bandwidth than other flows in a time of congestion.
Traffic management and resource allocation in small wired/wireless networks
Proceedings of the 5th international conference on Emerging networking experiments and technologies - CoNEXT '09, 2009
We consider the problem of traffic management in small networks with both wireless and wired devices, connected to the Internet through a single gateway. Examples of such networks are small office networks or residential networks, where typically traffic management is limited to flow prioritization through port-based filtering. We propose a practical resource allocation framework that provides simple mechanisms to applications and users to enable traffic management functionality currently not present due to the distributed nature of the system and various technology or protocol limitations. To allow for control irrespective of whether traffic flows cross wireless, wired or even broadband links, the proposed framework jointly optimizes rate allocations across wireless and wired devices in a weighted fair manner. Additionally, we propose a model for estimating the achievable capacity regions in wireless networks. This model is used by the controller to achieve a specific rate allocation. We evaluate a decentralized, host-based implementation of the proposed framework. The controller is incrementally deployable by not requiring modifications to existing network protocols and equipment or the wireless MAC. Using analytical methods and experimental results with realistic traffic, we show that our controller is stable with fast convergence for both UDP and TCP traffic, achieves weighted fairness, and mitigates scheduling inefficiencies of the existing hardware.
A new protocol for bandwidth regulation of real-time traffic classes in internetworks
1995
A novel bandwidth regulation mechanism is proposed which improves the ability of a packet-switching network to cope with multiple real-time and non-real-time trafic classes. The mechanism achieves regulation of link bandwidth ut two levels. At the j r s t level, bandwidth is dynamically regulated between different trafic classes. The concept of 'inter-class regulation' is introduced which enforces that the bandwidth .left unused by a trafic class is divided among trafic classes with high bandwidth demands. A t the second level, bandwidth regulation is enforced on end-to-end trafic streams, socalled flows, such that flows from the same class with identical routes have the same throughput constraints. This concept is referred to as 'intra-class regulation'. A simple distributed protocol is presented that achieves intra-class and inter-class regulation in a general internetwork. The effectiveness of the protocol is demonstrated b y simulation experiments.
This document is currently being converted. Please check back in a few minutes.