In this paper, we propose a distributed online traffic engineering architecture for MPLS networks. In this architecture, a primary and secondary MPLS LSP are established from an ingress LSR to every other egress LSR. We propose to split the aggregate TCP traffic between the primary and secondary paths using a distributed mechanism based on ECN marking and AIMD-based rate control. Inspired by th...

Modern trading and cluster applications require microsecond latencies and almost no losses in data centers. This paper introduces an algorithm called FineComb that can estimate fine-grain loss and latency at monitoring devices between edges of a data center. Such a mechanism can allow managers to distinguish between latencies and loss singularities caused by servers and those caused by the netw...

In this paper, we attempt to present a comparison through rigorous studies (existing conventional models) following software based modeling and verifications through simulations in terms of various traffic parameters such as packet loss, Recovery Time (Latency), reordering of packets including recovery time for various widely used path recovery models for the purpose of end-to-end recovery of L...

Broadband wireless access supports mobile applications, which may soon extend to Internet Protocol TV (IPTV). IPTV streaming from a localized server is likely to be across a wired path through a metro network before crossing the wireless link. In this scenario, the paper proposes Broadband Video Streaming (BVS), which enhances UDP transport with a single, negatively acknowledged, lost packet re...

We apply recent results in queueing theory to propose a methodology for bounding the buffer depth and packet delay in high radix interconnection networks. While most work in interconnection networks has been focused on the throughput and average latency in such systems, few studies have been done providing statistical guarantees for buffer depth, packet reordering and packet delays. These param...

The performance of TCP in the presence of handoff is effectively enhanced by the two schemes discussed in chapter 5. The EPRN scheme executes immediate recovery of lost packets during handoff and maintains the throughput of protocol by keeping the congestion control parameters unaltered. It also classifies the packet loss using a simple heuristic and by measuring the end-to-end delay encountere...

Among various types of denial of service attacks, “dropping attack” is probably the most difficult one to handle. This paper explores the negative impacts of packet dropping attacks and a method to detect such attacks. First, three dropping patterns are classified and investigated. We demonstrate that attackers can choose different dropping patterns to degrade TCP service to different levels, a...

Given the wide and rapid deployment of “visitor networks” [1], how to authenticate the user and account the usage on the per-packet basis securely and yet efficiently is still a challenging problem. In this paper, we explore the tradeoff between performance and security, and propose a per-datapacket authentication and access control protocol called RBWA (Random-Bit Window-based Authentication)....

Packet reordering is an important property of network traffic that should be captured by analytical models of the Transmission Control Protocol (TCP). We study a combinatorial problem motivated by RESTORED [1], a TCP modeling methodology that incorporates information about packet dynamics. A significant component of this model is a many-to-one mapping B that transforms sequences of packet IDs i...

Abstract Modern datacenters provide a wide variety of application services, which generate mix delay-sensitive short flows and throughput-oriented long flows, transmitting in the multi-path datacenter network. Though existing load balancing designs successfully make full use available parallel paths attain high bisection network bandwidth, they reroute regardless their dissimilar performance re...