This paper considers the support of hard real-time connections in ATM networks. In an ATM network, a set of hard real-time connections can be admitted only if the worst case end-to-end delays of cells belonging to individual connections are less than their deadlines. Although there are several approaches to manage the network resources in order to meet the delay requirements of connections, we ...

It is well known that the output quality of statistical machine translation (SMT) systems increases with more training data. To obtain more parallel text for translation modeling, researchers have turned to the web to mine parallel sentences, but most previous approaches have avoided the difficult problem of pairwise similarity on cross-lingual documents and instead rely on heuristics. In contr...

In this paper, we investigate several distributed real-time applications. The applications are real-time in that they require per-connection end-to-end performance bounds. These bounds, in terms of throughput, delay, and delay-jitter, are provided by the network via two mechanisms: admission control to limit access to the network and priority scheduling to enforce the guarantees. Within this fr...

Autoregressive integrated moving average (ARIMA) models are used in different researches for modelling and forecasting of traffic and Quality of Service (QoS) parameter values in telecommunication networks to make reasonable short, mediumand long-term predictions. We propose methodology to use ARIMA models for QoS prediction in network scenarios based on a preliminary detection and elimination ...

We consider the problem of quality-of-service (QoS) provisioning in modern high-speed, multimedia, communication networks. We quantify QoS by the probabilities of loss and excessive delay of an arbitrary packet, and introduce the model of a multiclass node (switch) which provides network access to users that may belong to multiple service classes. We treat such a node as a stochastic system whi...

A number of recent studies are based on data collected from routing tables of inter-domain routers utilizing Border Gateway Protocol (BGP) and tools, such as traceroute, to probe end-to-end paths. The goal is to infer Internet topological properties. However, as more data is collected, it becomes obvious that data intended to represent the same properties, if gathered at different points within...

Accurate demand forecasting combined with resource planning is critical to a company s performance and profitability. This paper describes ARMS (automated resource management system), an integrated system developed for the customer service operations of British Telecommunications plc to help with the operational/tactical planning and deployment of the company s 20,000-strong field engineer work...

For networks providing QoS guarantees, this paper determines and evaluates the worst case end-to-end delays for strategies based on network coding and multiplexing. It is shown that the end-to-end delay does not depend on the same parameters with the two strategies. This result can be explained by the fact that network coding can cope with congestions better than classical routing because it pr...

Multiplexing gain has been studied extensively in the context of statistical characterizations of traffic streams with quality-of-service criteria such as packet loss probability, mean delay, and delay variance. In this paper, we demonstrate that multiplexing gain can also arise in the context of deterministic traffic constraint functions, service curve scheduling, and qualityof-service require...

In a DiffServ architecture, packets with the same marking are treated as an aggregate at core routers, independently of the flow they belong to. Nevertheless, for the purpose of QoS provisioning, derivation of upper bounds on the delay of individual flows is required. In this paper, we consider the derivation of per-flow end-to-end delay bounds in DiffServ domains where peregress (or sink-tree)...