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

Job accessibility and employment probability

The objective of this paper is to estimate the impact of residential job accessibility on female employment probability in the metropolitan areas of Barcelona and Madrid. Following a “spatial mismatch” framework, we estimate a female employment probability equation where variables controlling for personal characteristics, residential segregation and employment potential on public transport network are included. Data used come from Microcensus 2001 of INE (National Institute of Statistics). The research focuses on the treatment of endogeneity problems and the measurement of accessibility variables. Our results show that low job accessibility in public transport negatively affects employment probability. The intensity of this effect tends to decrease with individual’s educational attainment. A higher degree of residential segregation also reduces job probability in a significant way..

OnTheBus

El projecte OnTheBus pretén ser un sistema de guiatge gratuït, destinat per a la plataforma mòbil Android, útil com a eina d’ajuda pel desplaçament d’un punt d’origen a un punt de destí dins de la ciutat, utilitzant la xarxa de transport metropolità. Aquesta memòria s’enllaça amb 6 memòries més, dels meus companys amb els qui he realitzat el projecte OnTheBus. Per poder elaborar amb èxit l’aplicació OntheBus, cal donar importància al disseny i a la implementació de la interfície d’usuari. L’objectiu d’aquesta memòria és explicar com s’ha realitzat i dissenyat l’aplicació perquè sigui accessible per a tothom. Ja que pot tenir un rang molt ampli d’edats d’usuaris, la implementació de la interfície està basada en les directrius del Disseny Universal.

OnTheBus

El projecte OnTheBus pretén ser un sistema de guiatge gratuït, destinat per a la plataforma mòbil Android, per desplaçar-se d’un punt origen a un punt destí dins de la ciutat utilitzant la xarxa de transport metropolità. Aquesta memòria s’enllaça amb sis memòries més, dels companys que han realitzat el projecte OnTheBus. Es descriu el Mòdul de Dades (BDD), el qual recol·lecta i proporciona a l’aplicació tota la informació necessària del diferents sistemes d’autobusos, per a que aquesta pugui assolir el guiatge correctament.

OnTheBus

El projecte OnTheBus pretén ser un sistema de guiatge gratuït, destinat per a la plataforma mòbil Android, útil com a eina d’ajuda pel desplaçament d’un punt d’origen a un punt de destí dins de la ciutat, utilitzant la xarxa de transport metropolità. Aquesta memòria s’enllaça amb 6 memòries més, dels meus companys amb els qui he realitzat el projecte OnTheBus. Per poder elaborar amb èxit l’aplicació OntheBus, cal donar importància al disseny i a la implementació de la interfície d’usuari. L’objectiu d’aquesta memòria és explicar com s’ha realitzat i dissenyat l’aplicació perquè sigui accessible per a tothom. Ja que pot tenir un rang molt ampli d’edats d’usuaris, la implementació de la interfície està basada en les directrius del Disseny Universal.

OnTheBus

El projecte OnTheBus pretén ser un sistema de guiatge gratuït, destinat per a la plataforma mòbil Android, útil com a eina d’ajuda pel desplaçament d’un punt d’origen a un punt de destí dins de la ciutat, utilitzant la xarxa de transport metropolità. Aquesta memòria s’enllaça amb 6 memòries més, dels meus companys amb els qui he realitzat el projecte OnTheBus. L’objectiu d’aquesta memòria és explicar la gestió del projecte que s’ha realitzat, consisteix en constatar quina metodologia de desenvolupament s’ha seguit, com s’ha dividit i organitzat la feina i els grups de treball. Així com el mòdul de navegació o guiatge que s’ha desenvolupat.

Kinesin-5/Eg5 is important for transport of CARTS from the trans-Golgi network to the cell surface

Here we report that the kinesin-5 motor Klp61F, which is known for its role in bipolar spindle formation in mitosis, is required for protein transport from the Golgi complex to the cell surface in Drosophila S2 cells. Disrupting the function of its mammalian orthologue, Eg5, in HeLa cells inhibited secretion of a protein called pancreatic adenocarcinoma up-regulated factor (PAUF) but, surprisingly, not the trafficking of vesicular stomatitis virus G protein (VSV-G) to the cell surface. We have previously reported that PAUF is transported from the trans-Golgi network (TGN) to the cell surface in specific carriers called CARTS that exclude VSV-G. Inhibition of Eg5 function did not affect the biogenesis of CARTS; however, their migration was delayed and they accumulated near the Golgi complex. Altogether, our findings reveal a surprising new role of Eg5 in nonmitotic cells in the facilitation of the transport of specific carriers, CARTS, from the TGN to the cell surface.

Technology, business models and network structure in the airline industry

Network airlines have been increasingly focusing their operations on hub airports through the exploitation of connecting traffic, allowing them to take advantage of economies of traffic density, which are unequivocal in the airline industry. Less attention has been devoted to airlines? decisions on point-to-point thin routes, which could be served using different aircraft technologies and different business models. This paper examines, both theoretically and empirically, the impact on airlines ?networks of the two major innovations in the airline industry in the last two decades: the regional jet technology and the low-cost business model. We show that, under certain circumstances, direct services on point-to-point thin routes can be viable and thus airlines may be interested in deviating passengers out of the hub.

Technology, business models and network structure in the airline industry

Network airlines have been increasingly focusing their operations on hub airports through the exploitation of connecting traffic, allowing them to take advantage of economies of traffic density, which are unequivocal in the airline industry. Less attention has been devoted to airlines' decisions on point-to-point thin routes, which could be served using different aircraft technologies and different business models. This paper examines, both theoretically and empirically, the impact on airlines' networks of the two major innovations in the airline industry in the last two decades: the regional jet technology and the low-cost business model. We show that, under certain circumstances, direct services on point-to-point thin routes can be viable and thus airlines may be interested in deviating passengers out of the hub. Keywords: regional jet technology; low-cost business model; point-to-point network; hub-and-spoke network JEL Classi…fication Numbers: L13; L2; L93

An empirical analysis of a merger between a network and low-cost airlines

We use a difference-in-difference estimator to examine the effects of a merger involving three airlines. The novelty lies in the examination of this operation in two distinct scenarios: (1) on routes where two low-cost carriers and (2) on routes where a network and one of the low-cost airlines had previously been competing. We report a reduction in frequencies but no substantial effect on prices in the first scenario, while in the second we report an increase in prices but no substantial effect on frequencies. These results may be attributed to the differences in passenger types flying on these routes.

A linear optimization technique for graph pebbling

Graph pebbling is a network model for studying whether or not a given supply of discrete pebbles can satisfy a given demand via pebbling moves. A pebbling move across an edge of a graph takes two pebbles from one endpoint and places one pebble at the other endpoint; the other pebble is lost in transit as a toll. It has been shown that deciding whether a supply can meet a demand on a graph is NP-complete. The pebbling number of a graph is the smallest t such that every supply of t pebbles can satisfy every demand of one pebble. Deciding if the pebbling number is at most k is NP 2 -complete. In this paper we develop a tool, called theWeight Function Lemma, for computing upper bounds and sometimes exact values for pebbling numbers with the assistance of linear optimization. With this tool we are able to calculate the pebbling numbers of much larger graphs than in previous algorithms, and much more quickly as well. We also obtain results for many families of graphs, in many cases by hand, with much simpler and remarkably shorter proofs than given in previously existing arguments (certificates typically of size at most the number of vertices times the maximum degree), especially for highly symmetric graphs. Here we apply theWeight Function Lemma to several specific graphs, including the Petersen, Lemke, 4th weak Bruhat, Lemke squared, and two random graphs, as well as to a number of infinite families of graphs, such as trees, cycles, graph powers of cycles, cubes, and some generalized Petersen and Coxeter graphs. This partly answers a question of Pachter, et al., by computing the pebbling exponent of cycles to within an asymptotically small range. It is conceivable that this method yields an approximation algorithm for graph pebbling.

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

Availability analysis of GMPLS connections based on physical network topology

This paper presents a study of connection availability in GMPLS over optical transport networks (OTN) taking into account different network topologies. Two basic path protection schemes are considered and compared with the no protection case. The selected topologies are heterogeneous in geographic coverage, network diameter, link lengths, and average node degree. Connection availability is also computed considering the reliability data of physical components and a well-known network availability model. Results show several correspondences between suitable path protection algorithms and several network topology characteristics

Entorn de simulació per a xarxes òptiques de transport

Aquest projecte final de carrera pretén investigar i experimentar una nova línia de desenvolupament d’algorismes dinàmics. A partir de l’algorisme AntNet-QoS [2] s’ incorporen noves mesures a l’algorisme (mesura de l’amplada de banda disponible i jitter), les quals combinant amb la mesura de retard ja feta servir, permet adaptar-se millor a les condicions actuals del trànsit en la xarxa i als requeriments específics de qualitat (QoS) per part del trànsit

A randomized concave programming method for choice network revenue management

Models incorporating more realistic models of customer behavior, as customers choosing froman offer set, have recently become popular in assortment optimization and revenue management.The dynamic program for these models is intractable and approximated by a deterministiclinear program called the CDLP which has an exponential number of columns. However, whenthe segment consideration sets overlap, the CDLP is difficult to solve. Column generationhas been proposed but finding an entering column has been shown to be NP-hard. In thispaper we propose a new approach called SDCP to solving CDLP based on segments and theirconsideration sets. SDCP is a relaxation of CDLP and hence forms a looser upper bound onthe dynamic program but coincides with CDLP for the case of non-overlapping segments. Ifthe number of elements in a consideration set for a segment is not very large (SDCP) can beapplied to any discrete-choice model of consumer behavior. We tighten the SDCP bound by(i) simulations, called the randomized concave programming (RCP) method, and (ii) by addingcuts to a recent compact formulation of the problem for a latent multinomial-choice model ofdemand (SBLP+). This latter approach turns out to be very effective, essentially obtainingCDLP value, and excellent revenue performance in simulations, even for overlapping segments.By formulating the problem as a separation problem, we give insight into why CDLP is easyfor the MNL with non-overlapping considerations sets and why generalizations of MNL posedifficulties. We perform numerical simulations to determine the revenue performance of all themethods on reference data sets in the literature.