Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
6,515
Transient Analysis of an Interdependent Forked Tandem Queuing Model with Load Dependent Service Rate
"... In this paper, we develop and analyze an interdependent forked queueing model with state dependent service times. Here, it is assumed that the arrival and service processes are correlated and follows a multivariate poisson process. Using the differencedifferential equations, the joint probability ge ..."
Abstract
- Add to MetaCart
of the model reveals that the dependency parameter and state dependent service rates can reduce congestion in queues and average waiting time of the customer. This model also includes some of the earlier models as particular cases for specific values of the parameters. The forked queueing models are much
Financial Dependence and Growth
- American Economic Review
, 1998
"... This paper examines whether nancial development facilitates economic growth by scrutinizing one rationale for such a relationship; that nancial development reduces the costs of external nance to rms. Speci cally, we ask whether industrial sectors that are relatively more in need of external nance de ..."
Abstract
-
Cited by 1086 (26 self)
- Add to MetaCart
as far back as Joseph A. Schumpeter (1911), emphasizes the positive in uence of the development of a country's nancial sector on the level and the rate of growth of its per capita income. The argument essentially is that the services the nancial sector provides { of reallocating capital
A message ferrying approach for data delivery in sparse mobile ad hoc networks
- In Proc. of ACM Mobihoc
, 2004
"... Mobile Ad Hoc Networks (MANETs) provide rapidly deployable and self-configuring network capacity required in many critical applications, e.g., battlefields, disaster relief and wide area sensing. In this paper we study the problem of efficient data delivery in sparse MANETs where network partitions ..."
Abstract
-
Cited by 498 (14 self)
- Add to MetaCart
can last for a significant period. Previous approaches rely on the use of either long range communication which leads to rapid draining of nodes ’ limited batteries, or existing node mobility which results in low data delivery rates and large delays. In this paper, we describe a Message Ferrying (MF
VL2: Scalable and Flexible Data Center Network”,
- ACM SIGCOMM Computer Communication Review,
, 2009
"... Abstract To be agile and cost e ective, data centers should allow dynamic resource allocation across large server pools. In particular, the data center network should enable any server to be assigned to any service. To meet these goals, we present VL, a practical network architecture that scales t ..."
Abstract
-
Cited by 461 (12 self)
- Add to MetaCart
to support huge data centers with uniform high capacity between servers, performance isolation between services, and Ethernet layer- semantics. VL uses () at addressing to allow service instances to be placed anywhere in the network, () Valiant Load Balancing to spread tra c uniformly across network
A Simple Panel Unit Root Test in the Presence of Cross Section Dependence
- JOURNAL OF APPLIED ECONOMETRICS
, 2006
"... A number of panel unit root tests that allow for cross section dependence have been proposed in the literature that use orthogonalization type procedures to asymptotically eliminate the cross dependence of the series before standard panel unit root tests are applied to the transformed series. In thi ..."
Abstract
-
Cited by 372 (16 self)
- Add to MetaCart
, and their simple averages. It is shown that the individual CADF statistics are asymptotically similar and do not depend on the factor loadings. The limit distribution of the average CADF statistic is shown to exist and its critical values are tabulated. Small sample properties of the proposed test are investigated
A measurement-based admission control algorithm for integrated services packet networks
- IEEE/ACM TRANSACTIONS ON NETWORKING
, 1997
"... Many designs for integrated service networks offer a bounded delay packet delivery service to support real-time applications. To provide bounded delay service, networks must use admission control to regulate their load. Previous work on admission control mainly focused on algorithms that compute the ..."
Abstract
-
Cited by 338 (9 self)
- Add to MetaCart
Many designs for integrated service networks offer a bounded delay packet delivery service to support real-time applications. To provide bounded delay service, networks must use admission control to regulate their load. Previous work on admission control mainly focused on algorithms that compute
On the Placement of Web Server Replicas
- In Proceedings of IEEE INFOCOM
, 2001
"... Abstract—Recently there has been an increasing deployment of content distribution networks (CDNs) that offer hosting services to Web content providers. CDNs deploy a set of servers distributed throughout the Internet and replicate provider content across these servers for better performance and avai ..."
Abstract
-
Cited by 359 (9 self)
- Add to MetaCart
Abstract—Recently there has been an increasing deployment of content distribution networks (CDNs) that offer hosting services to Web content providers. CDNs deploy a set of servers distributed throughout the Internet and replicate provider content across these servers for better performance
Resource allocation and cross-layer control in wireless networks
- Foundations and Trends in Networking
, 2006
"... Information flow in a telecommunication network is accomplished through the interaction of mechanisms at various design layers with the end goal of supporting the information exchange needs of the applications. In wireless networks in particular, the different layers interact in a nontrivial manner ..."
Abstract
-
Cited by 276 (59 self)
- Add to MetaCart
network control policies. Quantitative performance measures that capture the quality of service requirements in these systems depending on the supported applications are discussed, including throughput maximization, energy consumption minimization, rate utility function maximization as well as general
Disk failures in the real world: What does an MTTF of 1,000,000 hours mean to you?
, 2007
"... Component failure in large-scale IT installations is becoming an ever larger problem as the number of components in a single cluster approaches a million. In this paper, we present and analyze field-gathered disk replacement data from a number of large production systems, including high-performance ..."
Abstract
-
Cited by 245 (9 self)
- Add to MetaCart
-performance computing sites and internet services sites. About 100,000 disks are covered by this data, some for an entire lifetime of five years. The data include drives with SCSI and FC, as well as SATA interfaces. The mean time to failure (MTTF) of those drives, as specified in their datasheets, ranges from 1
Effective Bandwidths for Multiclass Markov Fluids and Other ATM Sources
, 1993
"... We show the existence of effective bandwidths for multiclass Markov fluids and other types of sources that are used to model ATM traffic. More precisely,we show that when such sources share a buffer with deterministic service rate, a constraint on the tail of the buffer occupancy distribution is a l ..."
Abstract
-
Cited by 237 (17 self)
- Add to MetaCart
We show the existence of effective bandwidths for multiclass Markov fluids and other types of sources that are used to model ATM traffic. More precisely,we show that when such sources share a buffer with deterministic service rate, a constraint on the tail of the buffer occupancy distribution is a
Results 1 - 10
of
6,515
