18,942 research outputs found
Static-Threshold-Limited on-Demand Guaranteed Service for Asynchronous Traffic in Timely-Token Protocol
In this paper, an improved Timely-Token protocol with enhanced best-effort service for improved capacity allocation to the asynchronous (that is, non real-time) traffic is proposed. Through analytical approach and the use of computer simulations, the improved Timely-Token protocol is compared with the existing Timely-Token protocol. In particular, if AT denotes a threshold value, then, when compared to the existing Timely-Token protocol, the improved protocol will allocate additional average of AT time units to the asynchronous traffic in every cycle
Optimal Guaranteed Services Timed Token (OGSTT) Media Access Control (MAC) Protocol for Networks That Support Hard Real-Time and Non Real-Time Traffic
In networks that support real-time traffic and non-real-time traffic over the same physical infrastructure, the challenge to the Media Access Control (MAC) protocol of such network is the ability to support the different traffic without compromising quality of service (QoS) for any of them. Generally, timed-token MAC protocols group the diverse real-time traffic into one category and then dedicate certain portion of the available bandwidth to them. At the same time, some bandwidth are left unassigned but available to the non real-time traffic. The unassigned bandwidth, and in some cases, the unused bandwidth left by the real-time traffic are assigned to the non-real-time traffic on best effort basis. In this paper, Optimal Guaranteed Services Timed Token (OGSTT) MAC protocol is developed and analyzed. In order to provide better support for both real-time traffic and non-real-time on the same local area network, OGSTT employs the timed-token mechanisms in the Timely-Token protocol along with that of Budget Sharing Token (BuST) protocol. Some bounds on the behavior of OGSTT protocol are discussed along with the ability of OGSTT protocol to support real-time and non-real time traffic. In particular, the paper demonstrated that the performance achieved by OGSTT is better than the Timely-Token and BuST. Furthermore, OGSTT protocol can be incorporated into the Ethernet network to provide real-time performance guarantees to multimedia applications and hard and soft real-time traffic
An optimal synchronous bandwidth allocation scheme for guaranteeing synchronous message deadlines with the timed-token MAC protocol
This paper investigates the inherent timing properties of the timed-token medium access control (MAC) protocol necessary to guarantee synchronous message deadlines in a timed token ring network such as, fiber distributed data interface (FDDI), where the timed-token MAC protocol is employed. As a result, an exact upper bound, tighter than previously published, on the elapse time between any number of successive token arrivals at a particular node has been derived. Based on the exact protocol timing property, an optimal synchronous bandwidth allocation (SBA) scheme named enhanced MCA (EMCA) for guaranteeing synchronous messages with deadlines equal to periods in length is proposed. Thm scheme is an enhancement on the previously publiibed MCA scheme
Verifying the distributed real-time network protocol RTnet using Uppaal
RTnet is a distributed real-time network protocol for fully-connected local area networks with a broadcast capability. It supports streaming real-time and non-realtime traffic and on-the-fly addition and removal of network nodes. This paper presents a formal analysis of RTnet using the model checker Uppaal. Besides normal protocol behaviour, the analysis focuses on the fault-handling properties of RTnet, in particular recovery after packet loss. Both qualitative and quantitative properties are presented, together with the verification results and conclusions about the robustness of RTnet
Datacenter Traffic Control: Understanding Techniques and Trade-offs
Datacenters provide cost-effective and flexible access to scalable compute
and storage resources necessary for today's cloud computing needs. A typical
datacenter is made up of thousands of servers connected with a large network
and usually managed by one operator. To provide quality access to the variety
of applications and services hosted on datacenters and maximize performance, it
deems necessary to use datacenter networks effectively and efficiently.
Datacenter traffic is often a mix of several classes with different priorities
and requirements. This includes user-generated interactive traffic, traffic
with deadlines, and long-running traffic. To this end, custom transport
protocols and traffic management techniques have been developed to improve
datacenter network performance.
In this tutorial paper, we review the general architecture of datacenter
networks, various topologies proposed for them, their traffic properties,
general traffic control challenges in datacenters and general traffic control
objectives. The purpose of this paper is to bring out the important
characteristics of traffic control in datacenters and not to survey all
existing solutions (as it is virtually impossible due to massive body of
existing research). We hope to provide readers with a wide range of options and
factors while considering a variety of traffic control mechanisms. We discuss
various characteristics of datacenter traffic control including management
schemes, transmission control, traffic shaping, prioritization, load balancing,
multipathing, and traffic scheduling. Next, we point to several open challenges
as well as new and interesting networking paradigms. At the end of this paper,
we briefly review inter-datacenter networks that connect geographically
dispersed datacenters which have been receiving increasing attention recently
and pose interesting and novel research problems.Comment: Accepted for Publication in IEEE Communications Surveys and Tutorial
- …