Abstract

Admission control in wired networks has been traditionally used as a way to control traffic congestion and guarantee quality of service. Here, we propose an admission control mechanism which aims to keep the power consumption at the lowest possible level by restricting the more energy-demanding users. This work relies on the fact that power consumption of networking devices, and of the network as a whole, is not proportional to the carried traffic, as would be the ideal case [1]. As a result some operating regions may be more efficient than others and “jumps” may arise in power consumption when new traffic is added in the network. The proposed mechanism aims to keep power consumption in the lowest possible power consumption level, hopping to the next level only when necessary. Document type: Part of book or chapter of book

Abstract

In order to provide better Quality-of-Service (QoS) in large networks, several congestion pricing proposals have been made in the last decade. Usually, however, those proposals studied optimal strategies and did not focus on implementation issues. Our main contribution in this paper is to address implementation issues for congestion-sensitive pricing over a single domain of the differentiated-services (diff-serv) architecture of the Internet. We propose a new congestion-sensitive pricing framework Distributed Dynamic Capacity Contracting (Distributed-DCC), which is able to provide a range of fairness (e.g. max-min, proportional) in rate allocation by using pricing as a tool. Within the Distributed-DCC framework, we develop an Edge-to-Edge Pricing Scheme (EEP) and present simulation experiments of it. Document type: Part of book or chapter of book

Abstract

Naval at sea (maritime tactical) networks are characterised by a dynamic, heterogeneous, and low-bandwidth environment. There is a critical need for Traffic Engineering (TE) mechanisms to support traffic prioritisation and resource optimisation in this environment. A desirable management service in this environment is end-to-end guaranteed bandwidth for critical application flows. Solutions such as RSVP are not appropriate for the maritime environment where links are error prone and easily overloaded. This paper describes the Resource Reservation Service (RRS), a policy-enabled flow-based TE management service developed specifically for the low-bandwidth, high-error rate, and mobility of the maritime environment. This service includes several novel features including multi-path probing, bi-directional reservations, and full policy control. The value of multi-path probing is demonstrated by simulation. Document type: Part of book or chapter of book

Abstract

Lots of research works have been performed for about ten years around the QoS problem in the Internet, both but separately at the Transport and at the IP levels. Taking into account the emerging traffic engineering-based QoS solutions (Diffserv-oriented), this paper targets the integration of new Transport services and protocols together with these solutions. Starting from performance measurements performed over a national DiffServ platform, contributions exposed here deal with the proposition and the implementation of a session level protocol allowing the application programmers to be masked with the complexity of choosing the underlying new Transport and IP services, still being provided with a per flow QoS. Document type: Part of book or chapter of book

Abstract

Datacenters provide the infrastructure for cloud computing services used by millions of users everyday. Many such services are distributed over multiple datacenters at geographically distant locations possibly in different continents. These datacenters are then connected through high speed WAN links over private or public networks. To perform data backups or data synchronization operations, many transfers take place over these networks that have to be completed before a deadline in order to provide necessary service guarantees to end users. Upon arrival of a transfer request, we would like the system to be able to decide whether such a request can be guaranteed successful delivery. If yes, it should provide us with transmission schedule in the shortest time possible. In addition, we would like to avoid packet reordering at the destination as it affects TCP performance. Previous work in this area either cannot guarantee that admitted transfers actually finish before the specified deadlines or use techniques that can result in packet reordering. In this paper, we propose DCRoute, a fast and efficient routing and traffic allocation technique that guarantees transfer completion before deadlines for admitted requests. It assigns each transfer a single path to avoid packet reordering. Through simulations, we show that DCRoute is at least 200 times faster than other traffic allocation techniques based on linear programming (LP) while admitting almost the same amount of traffic to the system. Comment: 23rd IEEE International Conference on High Performance Computing (HiPC) Document type: Conference object

Abstract

Smart networks have grown out of the need for stable, reliable, and predictable networks that will guarantee packet delivery under Quality of Service (QoS) constraints. In this article we present a measurement-based admission control algorithm that helps control traffic congestion and guarantee QoS throughout the lifetime of a connection. When a new user requests to enter the network, probe packets are sent from the source to the destination to estimate the impact that the new connection will have on the QoS of both the new and the existing users. The algorithm uses a novel algebra of QoS metrics, inspired by Warshall's algorithm, to look for a path with acceptable QoS values to accommodate the new flow. We describe the underlying mathematical principles and present experimental results obtained by evaluating the method in a large laboratory test-bed operating the Cognitive Packet Network (CPN) protocol.