Multimedia communication involving digital audio and/or digital video has rather strict delay requirements. A real-time channel is defined in this paper as a simplex connection between a source and a destination characterized by parameters representing the performance requirements of the client. A real-time service is capable of creating realtime channels on demand and guaranteeing their performance. These guarantees often take the form of lower bounds on the bandwidth allocated to a channel and upper bounds on the delays to be experienced by a packet on the channel. In this paper

TCP congestion control can perform badly in highspeed wide area networks because of its slow response with large congestion windows. The challenge for any alternative protocol is to better utilize networks with high bandwidth-delay products in a simple and robust manner without interacting badly

Abstract—Applications, deployed over a wide area network (WAN) which may connect across metropolitan, regional or national boundaries, suffer performance degradation owing to unavoidable natural characteristics of WANs such as high latency and high packet loss rate. WAN optimization, also known

network performance. Introduction American Home Products Corporation (AHP) is a global life sciences company with over 220 locations. This paper will examine the properties of Frame Relay Wide Area Network (WAN) connections between the Agricultural Research Center in Princeton New Jersey and two

but differ in their implementation, signaling, and configuration complexity. Secondly, we asses the bandwidth savings of ABA vs. SBA in wide area networks where the transfer rates of traffic aggregates fluctuate over time according to busy hours. Our results show that the capacity savings strongly depend

-of-business. State-of-the-art tra c engineering solutions only consider the current time epoch or minimize maximum utilization and hence cannot provide pre-facto promises to long-lived transfers. We present T , an online temporal planning scheme that appropriately packs long-running transfers across network paths

Progress in methodologies for developing robust local area network software has not been matched by similar results for wide-area settings. In this paper, we consider the design of application software spanning multiple local area environments. For important classes of applications, simple design

the unproven principles of complexity theory [2,2,4,4,16,32,39,49,49,97]. We use relational modalities to disprove that the World Wide Web and linked lists are often incompatible. 1

A novel approach for all-optical packetswitching

mechanisms are not yet deployed