In this paper we study the bandwidth provisioning problem for a service overlay network which buys bandwidth from the underlying network domains to provide end-to-end value-added QoS sensitive services such as VolP an...
详细信息
ISBN:
(纸本)0819446475
In this paper we study the bandwidth provisioning problem for a service overlay network which buys bandwidth from the underlying network domains to provide end-to-end value-added QoS sensitive services such as VolP and Video-on-Demand. A key problem in the SON deployment is the problem of bandwidth provisioning, which is critical to the cost recovery in deploying and operating value-added services over the SON. In this paper, we mathematically formulate the bandwidth provisioning problem, taking into account various factors such as SLA, service QoS, traffic demand distributions, and bandwidth costs. Analytical models and approximate solutions are developed for long-term static bandwidth provisioning. Numerical studies are also performed to illustrate the properties of the proposed solution and demonstrate the effect of traffic demand distributions and bandwidth costs on the bandwidth provisioning of a SON.
The potential use of networks for real-time high-performance control and automation is enormous and appealing. Replacing a widely used proportional-integral (PI) controller by a new networked controller for networked ...
详细信息
The potential use of networks for real-time high-performance control and automation is enormous and appealing. Replacing a widely used proportional-integral (PI) controller by a new networked controller for networked control capability can be costly and time-consuming. This paper proposes a methodology based on gain scheduling with respect to real-time iptraffic conditions to enhance the existing PI controller so it can be used over ipnetworks with a general network protocol like Ethernet. This paper first describes the gain scheduling approach based on constant network delays using a rational function approach. The formulation is extended to random ip network round-trip time (RTT) delays by using the generalized exponential distribution model. Simulation results show that the PI controller with gain scheduling provides significantly better networked control system performance.
With the transformation of the Internet into a commercial infrastructure, the ability to provide differentiated services to users with widely varying requirements is rapidly becoming as important as meeting the massiv...
详细信息
With the transformation of the Internet into a commercial infrastructure, the ability to provide differentiated services to users with widely varying requirements is rapidly becoming as important as meeting the massive increases in bandwidth demand. Hence, while deploying routers, switches, and transmission systems of ever increasing capacity, Internet service providers would also like to provide customer-specific differentiated services using the same shared network infrastructure;In this article, we describe router architectures that can support the two trends of rising bandwidth demand and rising demand for differentiated services. We focus on router mechanisms that can support differentiated services at a level not contemplated in proposals currently under consideration due to concern regarding their implementability at high speeds. We consider the types of differentiated services that service providers may want to offer and then discuss the mechanisms needed in routers to support them. We describe plausible implementations of these mechanisms (the scalability and performance of which have been demonstrated by implementation in a prototype system) and argue that it is technologically possible to considerably raise the level of differentiated services which service providers can offer their customers, and that it is not necessary to restrict differentiated services to rudimentary offerings even in very-high-speed networks.
The Internet consists of about 13,000 Autonomous Systems (AS's) that exchange routing information using the Border Gateway Protocol (BGP). The operators of each AS must have control over the flow of traffic throug...
详细信息
ISBN:
(纸本)0819446475
The Internet consists of about 13,000 Autonomous Systems (AS's) that exchange routing information using the Border Gateway Protocol (BGP). The operators of each AS must have control over the flow of traffic through their network and between neighboring AS's. However, BGP is a complicated, policy-based protocol that does not include any direct support for traffic engineering. In previous work, we have demonstrated that network operators can adapt the flow of traffic in an efficient and predictable fashion through careful adjustments to the BGP policies running on their edge routers.' Nevertheless, many details of the BGP protocol and decision process make predicting the effects of these policy changes difficult. In this paper, we describe a tool that predicts traffic flow at network exit points based on the network topology, the import policy associated with each BGP session, and the routing advertisements received from neighboring AS's. We present a linear-time algorithm that computes a network-wide view of the best BGP routes for each destination prefix given a static snapshot of the network state, without simulating the complex details of BGP message passing. We describe how to construct this snapshot using the BGP routing tables and router configuration files available from operational routers. We verify the accuracy of our algorithm by applying our tool to routing and configuration data from AT&T's commercial ip network. Our route prediction techniques help support the operation of large ip backbone networks, where interdomain routing is an important aspect of traffic engineering.
Data Center networks (DCN), a core infrastructure of cloud computing, place heavy demands on efficient storage and management of massive data. The data storage scheme, which decides how to assign data to nodes for sto...
详细信息
Data Center networks (DCN), a core infrastructure of cloud computing, place heavy demands on efficient storage and management of massive data. The data storage scheme, which decides how to assign data to nodes for storage, has a significant impact on the performance of the data center. However, most of the existing solutions focus on where to store the data (i.e., the selection of storage node) but have not considered how to store them (i.e., the traffic management such as routing and transmission rate adjustment). By leveraging the Information-Centric networks (ICN) architecture, this paper tackles the data storage and traffic management issue in Information-Centric Data Center networks (ICDCN) based on Reinforcement Learning (RL) method, since RL has been developed as a promising solution to address dynamic network issues. We present a global optimization of joint traffic management and data storage and then solve it by the distributed multi-agent Q-learning. In ICDCN, the data is routed based on the data's name, which achieves better routing scalability by decoupling the data and its physical location. Compared with ip's stateless forwarding plane, the stateful forwarding information maintained at every node supports adaptively routing and hop-by-hop trafficcontrol by using the Q-learning method. We evaluate our proposal on an NS-3-based simulator, and the results show that the proposed scheme can effectively reduce transmission time and increase throughput while achieving load-balanced among servers.
ISP's are facing the challenge of offering improved Quality of Service (QoS). No longer is best effort delivery with no service guarantee acceptable for many applications. iptraffic requires a degree of engineeri...
详细信息
ISBN:
(纸本)0769511864
ISP's are facing the challenge of offering improved Quality of Service (QoS). No longer is best effort delivery with no service guarantee acceptable for many applications. iptraffic requires a degree of engineering into service classes (Differentiated Services) as well as a break from traditional layer 3-based routing. Although access to virtually unlimited bandwidth via WDM and Photonic networks may potentially offer a solution to the QoS issue, access to such services is not universally available. Label switching offers an efficient mechanism to implement iptraffic engineering Differentiated Services, multi-service functionality and scalability. This paper examines a number of service classifications and solutions which aim to provide realistic QoS solutions. These include important traffic engineering methodologies such as Integrated and Differentiated Services, multi-layer switching, MPLS and constraint-based routing.
traffic engineering (TE) solutions are enabled by the adoption of the path computation element (PCE) architecture. Cooperative inter-PCE communications, in combination with TE information export mechanisms, such as th...
详细信息
traffic engineering (TE) solutions are enabled by the adoption of the path computation element (PCE) architecture. Cooperative inter-PCE communications, in combination with TE information export mechanisms, such as the link state extensions to BGP protocol (BGP-LS) enable TE in heterogeneous networks scenarios with different layers, domains, and technologies. Multilayer networks, such as ip/MPLS over elastic optical networks are a typical example of such scenarios. However, these currently adopted export mechanisms are conceived for limited amount of exchanged information in order to preserve scalability, especially if centralized entities are considered, such as PCEs and controllers. Moreover, some information (e.g., router interfaces and transceiver card association) are not always available at the control plane level. Thus, so far limited deployment of interlayer TE procedures has been experienced. In this paper, we propose a novel network element called open network database. Exploiting the state-of-the-art of database platforms while assuring high scalability and reliability performance, dedicated control and management applications run complex reoptimization procedures with a set of ad hoc queries without relying on complex control infrastructure or without overloading the orchestrators, thus simplifying the implementation of network applications and achieving advanced TE. A YANG-based database for interconnected TE networks is proposed and implemented to enable dedicated applications to perform complex multidomain/layer operations. The database is successfully utilized for effective and extremely scalable maintenance applications in multilayer networks.
We consider a large packet-switched communication network. traffic in such networks is heavily aggregated especially in the network core. Fluid traffic models have been used for this reason and because the individual ...
详细信息
ISBN:
(纸本)081944250X
We consider a large packet-switched communication network. traffic in such networks is heavily aggregated especially in the network core. Fluid traffic models have been used for this reason and because the individual packets are very small compared to the volume of aggregated traffic. Fluid models have also been considered for the network components themselves in order to explore the possibility of simulation speed-up. In the event-driven simulation of Kesidis et al(6) of such a "fluid" network, a "ripple effect" was described to explain the substantial degradation in simulation speed-up as the network size grew, especially when work-conserving bandwidth schedulers were present. Thereafter, studies attempted to identify under what network dimensions and designs and under what traffic conditions the ripple effect is minimized. Hybrids of packet/fluid and event/time-driven simulation strategies were considered. This paper gives an overview of the fluid network modeling approach and surveys recent work on such hybrid approaches.
The emergence of new technologies for Internet content delivery including CDNs, end system multicast, peer-to-peer content exchange (e.g. Napster) and application-level anycast are fundamentally changing the relations...
详细信息
ISBN:
(纸本)081944250X
The emergence of new technologies for Internet content delivery including CDNs, end system multicast, peer-to-peer content exchange (e.g. Napster) and application-level anycast are fundamentally changing the relationships between consumers and producers of digital content. These new technologies enable delivery mechanisms which go far beyond point-to-point connections between a client and a single origin server. For example, CDNs redirect clients to a number of equivalent replica servers, while end system multicast blurs the distinction between client and server by requiring that every participant who wishes to access content serve content as well. In this position paper, we motivate and describe scalable strategies for addressing the challenges and opportunities that distributed content distribution mechanisms will place on reliable transport protocols and distributed scheduling algorithms. Central to our discussion are lightweight reliable transport services designed for maximum flexibility which can accomodate connection preemption, connection migration and connection aggregation built in part on fast forward error correcting (FFEC) codes.
In this paper we introduce a framework for analyzing local properties of Internet connectivity. We compare BGP and probed topology data, finding that currently probed topology data yields much denser coverage of AS-le...
详细信息
ISBN:
(纸本)081944250X
In this paper we introduce a framework for analyzing local properties of Internet connectivity. We compare BGP and probed topology data, finding that currently probed topology data yields much denser coverage of AS-level connectivity. We describe data acquisition and construction of several ip-level graphs derived from a collection of 220M skitter traceroutes. We find that a graph consisting of ip nodes and links contains 90.5% of its 629K nodes in the acyclic subgraph. In particular, 55% of the ip nodes are in trees. Full bidirectional connectivity Is observed for a giant component containing 8.3 % of ip nodes. We analyze the same structures (trees, acyclic part, core, giant component) for other combinatorial models of Internet (ip-level) topology, including arc graphs and placeholder graphs. We also show that Weibull distrbution N{X > x} = a exp(-(x/b)(c)) approximates outdegree distribution with 10-15% relative accuracy in the region of generic object sizes, spanning two to three orders of magnitude up to the point where sizes become unique. The extended version of this paper [BC01b] includes dynamic and functorial properties of Internet topology, including properties of and diffusion on aggregated graphs, invariance of a reachability function's shape regardless of node choice or aggregation level, analysis of topological resilience under wide range of scenarios. We also demonstrate that the Weibull distribution provides a good fit to a variety of local object sizes.
暂无评论