CAC controlled services sharing a link with connectionless data services in an ATM network: a performance evaluation study

In the B-ISDN there is a provision for four classes of services, all of them supported by a single transport network (the ATM network). Three of these services, the connected oriented (CO) ones, permit connection access control (CAC) but the fourth, the connectionless oriented (CLO) one, does not. Therefore, when CLO service and CO services have to share the same ATM link, a conflict may arise. This is because a bandwidth allocation to obtain maximum statistical gain can damage the contracted ATM quality of service (QOS); and vice versa, in order to guarantee the contracted QOS, the statistical gain have to be sacrificed. The paper presents a performance evaluation study of the influence of the CLO service on a CO service (a circuit emulation service or a variable bit-rate service) when sharing the same link

An improved method for discovering link criticality in transport networks

Quantitatively assessing the importance or criticality of each link in a network is of practical value to operators, as that can help them to increase the network's resilience, provide more efficient services, or improve some other aspect of the service. Betweenness is a graph-theoretical measure of centrality that can be applied to communication networks to evaluate link importance. However, as we illustrate in this paper, the basic definition of betweenness centrality produces inaccurate estimations as it does not take into account some aspects relevant to networking, such as the heterogeneity in link capacity or the difference between node-pairs in their contribution to the total traffic. A new algorithm for discovering link centrality in transport networks is proposed in this paper. It requires only static or semi-static network and topology attributes, and yet produces estimations of good accuracy, as verified through extensive simulations. Its potential value is demonstrated by an example application. In the example, the simple shortest-path routing algorithm is improved in such a way that it outperforms other more advanced algorithms in terms of blocking ratio

TU Graz: Course: 707.000 Web Science and Web Technology: Lecture 7: Link Analysis and Search

What are ways of searching in graphs? In this class, we will discuss basics of link analysis, including Google's PageRank algorithm as an example. Readings: The PageRank Citation Ranking: Bringing Order to the Web, L. Page and S. Brin and R. Motwani and T. Winograd (1998) Stanford Tecnical Report

Link to ten short video episodes about groupwork

"Rob, Vikki, Shireen, Muzz and Delia have been randomly selected to work together to develop a presentation entitled 'The barriers to learning'. It's not an easy ride. The following 10 episodes show the journey, from their first meeting through to their impressions of the presentation and working together". Produced by the LearnHigher CETL Three areas covered by the site as follows Listening and Interpersonal Skills - the University of Leeds Oral Presentations - Brunel University Group Work - Bradford University

Sustaining Success Week 4 Task: Student Resource Recommendation

Description of student resource recommendation task which you can choose to submit

focus lecture and activities link to videos & posters (Yr2)

Use across a series of lectures to introduce the module, focus on the topic of interdisciplinarity and get to know the group. Contains links to videos to watch

Talent development : exposing the weakest link. 'El desarrollo del talento : sobre el eslabón más débil'.

Resumen basado en el de la publicación. Monográfico con el título: 'Alumnos de altas capacidades : reflexiones sobre educación'

Spanish version of the Link???s Perceived Devaluation and Discrimination Scale

Resumen tomado de la publicaci??n