A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2001; you can also visit the original URL.
The file type is application/pdf.
Filters
Decentralised call admission control for wireless ATM
1999
IEE Proceedings - Communications
Preserved Fulltext
The proposed decentralised CAC is executed partially in the serving access point (AP) and partially at the MS-ATM switch. ...
This new CAC reduces the load on the mobilitysupporting (MS) ATM switch and prevents it from becoming a bottleneck in the system. ...
The sojourn time of every user in a cell T h , is assumed to be exponential with mean T h i i
&&&) represent the sate where there are n 1 active users in cell 1, n 2 active users in cell 2, and n M The ...
doi:10.1049/ip-com:19990757
fatcat:4mmrkige3fgfpmx66zq3mhbtgy
Performance analysis of ATM transmission over a DS-CDMA channel
[chapter]
1998
Broadband Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
This paper presents numerical results for ATM cell transmission over a DS-CDMA satellite link obtained by mathematical analysis. ...
System performance is expressed in terms of link efficiency and relative capacity increase. Initial results show how different transmission rates and loads affect the system performance. ...
Our mathematical analysis has been validated using a cell level network simulator.
SYSTEM DESCRIPTION We assume DS-CDMA uplink, ideal power control and pure ATM (no framing). ...
doi:10.1007/978-0-387-35378-4_8
fatcat:euauxzysd5e4zkfdmlpza6jvva
Enhanced Convolution Approach for Connection Admission Control in ATM Networks
[chapter]
1998
IFIP Advances in Information and Communication Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The convolution algorithm is an accurate approach for Connection Admission Control (CAC) in ATM networks with small buffers. ...
In complex scenarios, with ECA, PC calculation can be carried out in real time while maintaining the desired accuracy. Several experiments have been carried out ...
It can be summarised that the convolution algorithm seems to be a good solution for CAC in ATM networks with relatively small buffers. ...
doi:10.1007/978-0-387-35388-3_10
fatcat:wdxbqhp5dnehfd6bd7tvi3vfhi
An alternative approach to call/connection control in broadband switching systems
1995
IEEE Communications Magazine
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
Using a client-server based signaling protocol, the authors propose a new approach to connection establishment that allows for the easy handling of multiparty connections and improves end-to-end connection ...
The time between the generation of the ACM and ANM messages in Switch 3 is treated as 0 in the analysis presented in the fourth section. ...
Early work on congestion control in high-speed ATM networks indicates that Connection Admission Control (CAC) procedures should be employed at the switches to implement preventive congestion control rather ...
doi:10.1109/35.471264
fatcat:nkjb6djx3vhyxezeftfb23p73q
Discrete-time Models for Connection Admission Control (CAC) in ATM
[chapter]
1995
Performance Modelling and Evaluation of ATM Networks
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
This paper provides two different discrete-time finite-buffer queueing models of the G~xl+G2/D/1/s-type for modelling CAC in ATM. ...
In the G~xl+G2-input, G1 and G2 produce (correlated) interarrival times and the independent LV. X generates the size of the batch arriving, when G1 produces an arrival. ...
Briem, Stuttgart, for some details about an algorithm mentioned in [4] and a literature hint. ...
doi:10.1007/978-0-387-34881-0_6
fatcat:b3kh2v4gwnc7tgte6wy3zmnj2m
CAC investigation for video and data
[chapter]
1998
Broadband Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
A key objective of ATM-based networks is to provide at the same time guaranteed QoS to real time and non-real time services. ...
The main objective of this paper is to investigate CAC in an ATM testbed with real switches and as realistic traffic as possible. ...
Acknowledgements: The achievements being made within the ACTS project EXPERT are only possible with the conscientious co-operation of all partners and the support of the Commission of the European Union ...
doi:10.1007/978-0-387-35378-4_28
fatcat:jzwxzjyepjdf3jvmiywes2p5we
Teletraffic engineering in a broad-band era
1997
Proceedings of the IEEE
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
This paper gives an overview of the methods and models used for the performance evaluation of asynchronous transfer mode (ATM)based broad-band integrated services digital networks (B-ISDN's). ...
This paper concludes with an overview of current topics in B-ISDN teletraffic research: connection admission control, buffer dimensioning, multiquality of service, cell discard schemes, ratebased flow ...
It is important to note that the sojourn time 5 in a state of a CTMC is exponentially distributed, with mean sojourn time equal to mean sojourn time in state (25) where is the diagonal element of the ...
doi:10.1109/5.650182
fatcat:y7mqzmhb4zbhlarngg5opoyutu
The MAPS control paradigm: using chaotic maps to control telecoms networks
[chapter]
1998
Broadband Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
This paper proposes a new control method for telecommunications networks based on chaotic dynamics. Self-similar behaviour has been observed in a variety of services and networks. ...
Conventional control techniques for A TM each address only a single time scale, and hence are less effective as a result of self-similarity in the traffic behaviour. ...
Acknowledgements LGS would like to thank NOR TEL and EPSRC, RJM would like to thank EPSRC and its Applied Mathematics Initiative for its support during the preparation of this work. ...
doi:10.1007/978-0-387-35378-4_29
fatcat:4fy75rj2q5gkndchlflzyhx77y
Capacity of Multiservice WCDMA Networks with Variable GoS
2005
Wireless networks
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
Their meaningful QoS is the average delay (i.e. the sojourn time). ...
We consider best-effort (BE) traffic sharing the network resources with real-time (RT) applications. ...
The variations in expected BE sojourn time due to RT call duration are relatively smaller in the multiple sector analysis. ...
doi:10.1007/s11276-005-5272-0
fatcat:r4irz4dzkjh6jckuadwvxjok5m
High-speed PVC-based handover control in wireless ATM networks
2001
Computer Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is application/pdf.
This might result in being slow and inef®cient. So the proposed scheme removes reestablishment procedure reserving PVCs between neighboring mobility enhanced ATM switches for handover. ...
Handover provisioning is an important function of the mobile wireless ATM network. The reestablishment-based schemes require a new partial path or a completely new connection to be set-up. ...
In near future, ef®cient support for IP will be a major research topic for any new network technology such as wireless ATM. ...
doi:10.1016/s0140-3664(01)00295-x
fatcat:ztbjvkcoyzd2jj7vo5arngzrwm
A new reward model for MDP state aggregation with application to CAC and Routing
2005
Transactions on Emerging Telecommunications Technologies
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
An optimal solution of the call admission control and routing problem in multi-service loss networks, in terms of average reward per time unit, is possible by modeling the network behavior as a Markov ...
In particular, we propose a new model of the expected reward for admitting a call on the network. ...
INTRODUCTION We study the problem of optimal call admission control (CAC) and routing in multi-service loss networks such as ATM and STM networks, and IP networks, provided they are extended with resource ...
doi:10.1002/ett.1007
fatcat:na56nqikgfbehmj2d4sq6bzdhi
ATM traffic analysis and control for ABR service provisioning
[chapter]
1996
Data Communications and their Performance
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In this paper the main traffic analysis and control problems related with the ABR service are addressed, modelled and answered on the basis of effective rates defined for the multiplexed connections. ...
be using those network resources (link bandwidth, in particular) that are left available by other high-priority connections (belonging to the Guaranteed-QoS or G-QoS class). ...
The related function is called Traffic Shaping and is examined in sub-section 3.2. In this case CAC is greatly simplified for both classes. ...
doi:10.1007/978-0-387-34942-8_21
fatcat:nhjc4t6jevhvbdcvkm4nnwmeou
Closed-form expressions on the geometric tail behavior of statistical multiplexers with heterogeneous traffic
1998
IEEE Transactions on Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we consider a statistical multiplexer fed by heterogeneous ON and OFF sources. ...
and second moments of ON and OFF periods for individual sources. ...
is the mean duration of the
remaining sojourn time of the OFF period, and
is the mean duration of the remaining sojourn time of
the ON period in the steady state. ...
doi:10.1109/26.737393
fatcat:qgw35lv3wzb2fcf4lbobiw7v64
Predictive routing to enhance QoS for stream-based flows sharing excess bandwidth
2003
Computer Networks
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
The key idea underlying our approach is to route traffic flows so that they see minimal expected flow-perceived loads during their sojourn in the network. ...
We propose a new routing algorithm based on online estimation of the link load dynamics and prior information on flow holding times. ...
Acknowledgements This work is supported by National Science Foundation Career Grant NCR-9624230, and by an Intel Technology for Education 2000 equipment grant. ...
doi:10.1016/s1389-1286(02)00456-5
fatcat:3lv66mtzf5dufek6yzkv3dxj24
Adaptive importance sampling for fading channels
1994
Electronics Letters
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
Minimal realisations of OMA-based FZs: The proposed circuits are shown in Fig. 2 and like the circuits of [I], realise an FI of value .Z-2 = Z,Z2 /Z3 without requiring any passive component matching conditions ...
From the considerations of [14--16], it follows that the FI configurations of the intended type (i.e. various kinds of FIs in loss- ...
This cell loss formula can he applied as a more accurate component in connection admission control and bandwidth management algorithms for ATM networks. ...
doi:10.1049/el:19940786
fatcat:bghhouckwjfqpgokmuz7ghliia
« Previous
Showing results 1 — 15 out of 34 results