In this paper, we provide complete end-to-end delay analyses including the relay nodes for instant messages. Message Session Relay Protocol (MSRP) is used to provide congestion control for large messages in the Instant Messaging (IM) service. Large messages are broken into several chunks. These chunks may traverse through a maximum number of two relay nodes before reaching destination according...

Providing end-to-end delay guarantees for delay sensitive applications is an important packet scheduling issue of routers. In this paper, to support end-to-end delay requirements, we propose a novel network scheduling scheme, called the Bulk Scheduling Scheme (BSS), built on top of existing schedulers of intermediate nodes without modifying transmission protocols on both sender and receiver sid...

In this paper we propose an end-to-end approach to scheduling tasks that share resources in a multipro-cessor or distributed systems. In our approach, each task is mapped into a chain of subtasks, depending on its resource accesses. After each subtask is assigned a proper priority, its worst-case response time can be bounded. Consequently the worst-case response time of each task can be obtaine...

In this paper we investigate the relationship between capacity and network topology for Bluetooth scatternets. We start by considering the intrinsic capacity limits of a scatternet structure, and we show that capacity may be approached in the presence of very local traffic only and under specific conditions on the scatternet structure. A worst case analysis is presented, addressing the performa...

Network calculus is an elegant theory which uses envelopes to determine the worst-case performance bounds in a network. Statistical network calculus is the probabilistic version of network calculus, which strives to retain the simplicity of envelope approach from network calculus and use the arguments of statistical multiplexing to determine probabilistic performance bounds in a network. One of...

A recent result in network calculus theory provided statistical delay bounds for exponentially bounded traffic that grow as O(H logH) with the number of nodes on the network path. In this paper we establish the corresponding lower bound which shows that for such such types of traffic, typical end-toend delays can indeed grow as Θ(H logH). The lower bound is obtained by analyzing the end-to-end ...

abstract background: end-to-side esophagojejunostomy has almost always been associated with some degree of dysphagia. to overcome this complication we decided to perform an end-to-end anastomosis and compare it with end-to-side roux-en-y esophagojejunostomy. methods: in this prospective study, between 1998 and 2005, 71 patients with a diagnosis of gastric adenocarcinoma underwent total gastrect...