893 resultados para ARPANET (Computer network)


Relevância:

80.00% 80.00%

Publicador:

Resumo:

En el contexto universitario estamos asistiendo a un proceso de cambio a diferentes niveles. Los nuevos grados nos inclinan hacia una enseñanza-aprendizaje por competencias y a la evaluación continua en la que el alumno debe ser el protagonista y sujeto activo de su aprendizaje. Ante esta situación nos preguntamos, ¿conoce el profesor cómo acceden a la información los jóvenes de hoy? ¿Sabe cuáles son sus estrategias y recursos? Si el alumno es el protagonista de su aprendizaje, es propio que el docente conozca los nuevos modos del estudiante tanto de acceder a la información como a gestarla. Si enseñar es un acto de empatía, cabe pensar cómo podemos conectar con los estudiantes ante sus nuevas formas de buscar, procesar y sintetizar la información. En este trabajo presentamos una experiencia que realizamos en la Facultat de Formació del Professorat de la Universitat de Barcelona en la asignatura de Didáctica de la educación visual y plástica. La particularidad estriba en que utilizamos una herramienta muy popular en el entorno cotidiano de los jóvenes de hoy: el fotolog. Adecuamos los contenidos a las nuevas formas de recepción e interacción de los estudiantes en un proceso de descubrimiento, exploración y creación donde el fotolog fue el medio para desarrollar los contenidos. Contenidos, por otra parte, también creados de acuerdo a los intereses que se iban presentando en el día a día

Relevância:

80.00% 80.00%

Publicador:

Resumo:

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

Relevância:

80.00% 80.00%

Publicador:

Resumo:

Este trabajo analiza cómo se puede crear valor a través del uso de las TIC. Para ello se utiliza el Modelo de creación de valor en e-business desarrollado por Amit y Zott (2001) y se aplica a una tipología de nuevos intermediarios que opera en el sector de los contenidos digitales: gregadores de noticias. Para lograr este objetivo, se ha realizado un estudio exploratorio y un estudio de casos a través de entrevistas personales con informadores estratégicos y un análisis del contenido de las páginas web de 56 empresas relacionadas con el sector y cuestionarios, principalmente Se han analizado empresas de EEUU, Canadá, España, Francia, Alemania, Reino Unido y Suiza

Relevância:

80.00% 80.00%

Publicador:

Resumo:

In this paper, we define a new scheme to develop and evaluate protection strategies for building reliable GMPLS networks. This is based on what we have called the network protection degree (NPD). The NPD consists of an a priori evaluation, the failure sensibility degree (FSD), which provides the failure probability, and an a posteriori evaluation, the failure impact degree (FID), which determines the impact on the network in case of failure, in terms of packet loss and recovery time. Having mathematical formulated these components, experimental results demonstrate the benefits of the utilization of the NPD, when used to enhance some current QoS routing algorithms in order to offer a certain degree of protection

Relevância:

80.00% 80.00%

Publicador:

Resumo:

In this paper a novel methodology aimed at minimizing the probability of network failure and the failure impact (in terms of QoS degradation) while optimizing the resource consumption is introduced. A detailed study of MPLS recovery techniques and their GMPLS extensions are also presented. In this scenario, some features for reducing the failure impact and offering minimum failure probabilities at the same time are also analyzed. Novel two-step routing algorithms using this methodology are proposed. Results show that these methods offer high protection levels with optimal resource consumption

Relevância:

80.00% 80.00%

Publicador:

Resumo:

TCP flows from applications such as the web or ftp are well supported by a Guaranteed Minimum Throughput Service (GMTS), which provides a minimum network throughput to the flow and, if possible, an extra throughput. We propose a scheme for a GMTS using Admission Control (AC) that is able to provide different minimum throughput to different users and that is suitable for "standard" TCP flows. Moreover, we consider a multidomain scenario where the scheme is used in one of the domains, and we propose some mechanisms for the interconnection with neighbor domains. The whole scheme uses a small set of packet classes in a core-stateless network where each class has a different discarding priority in queues assigned to it. The AC method involves only edge nodes and uses a special probing packet flow (marked as the highest discarding priority class) that is sent continuously from ingress to egress through a path. The available throughput in the path is obtained at the egress using measurements of flow aggregates, and then it is sent back to the ingress. At the ingress each flow is detected using an implicit way and then it is admission controlled. If it is accepted, it receives the GMTS and its packets are marked as the lowest discarding priority classes; otherwise, it receives a best-effort service. The scheme is evaluated through simulation in a simple "bottleneck" topology using different traffic loads consisting of "standard" TCP flows that carry files of varying sizes

Relevância:

80.00% 80.00%

Publicador:

Resumo:

In this paper, a method for enhancing current QoS routing methods by means of QoS protection is presented. In an MPLS network, the segments (links) to be protected are predefined and an LSP request involves, apart from establishing a working path, creating a specific type of backup path (local, reverse or global). Different QoS parameters, such as network load balancing, resource optimization and minimization of LSP request rejection should be considered. QoS protection is defined as a function of QoS parameters, such as packet loss, restoration time, and resource optimization. A framework to add QoS protection to many of the current QoS routing algorithms is introduced. A backup decision module to select the most suitable protection method is formulated and different case studies are analyzed

Relevância:

80.00% 80.00%

Publicador:

Resumo:

Most network operators have considered reducing Label Switched Routers (LSR) label spaces (i.e. the number of labels that can be used) as a means of simplifying management of underlaying Virtual Private Networks (VPNs) and, hence, reducing operational expenditure (OPEX). This letter discusses the problem of reducing the label spaces in Multiprotocol Label Switched (MPLS) networks using label merging - better known as MultiPoint-to-Point (MP2P) connections. Because of its origins in IP, MP2P connections have been considered to have tree- shapes with Label Switched Paths (LSP) as branches. Due to this fact, previous works by many authors affirm that the problem of minimizing the label space using MP2P in MPLS - the Merging Problem - cannot be solved optimally with a polynomial algorithm (NP-complete), since it involves a hard- decision problem. However, in this letter, the Merging Problem is analyzed, from the perspective of MPLS, and it is deduced that tree-shapes in MP2P connections are irrelevant. By overriding this tree-shape consideration, it is possible to perform label merging in polynomial time. Based on how MPLS signaling works, this letter proposes an algorithm to compute the minimum number of labels using label merging: the Full Label Merging algorithm. As conclusion, we reclassify the Merging Problem as Polynomial-solvable, instead of NP-complete. In addition, simulation experiments confirm that without the tree-branch selection problem, more labels can be reduced

Relevância:

80.00% 80.00%

Publicador:

Resumo:

Traffic Engineering objective is to optimize network resource utilization. Although several works have been published about minimizing network resource utilization in MPLS networks, few of them have been focused in LSR label space reduction. This letter studies Asymmetric Merged Tunneling (AMT) as a new method for reducing the label space in MPLS network. The proposed method may be regarded as a combination of label merging (proposed in the MPLS architecture) and asymmetric tunneling (proposed recently in our previous works). Finally, simulation results are performed by comparing AMT with both ancestors. They show a great improvement in the label space reduction factor

Relevância:

80.00% 80.00%

Publicador:

Resumo:

Most network operators have considered reducing LSR label spaces (number of labels used) as a way of simplifying management of underlaying virtual private networks (VPNs) and therefore reducing operational expenditure (OPEX). The IETF outlined the label merging feature in MPLS-allowing the configuration of multipoint-to-point connections (MP2P)-as a means of reducing label space in LSRs. We found two main drawbacks in this label space reduction a)it should be separately applied to a set of LSPs with the same egress LSR-which decreases the options for better reductions, and b)LSRs close to the edge of the network experience a greater label space reduction than those close to the core. The later implies that MP2P connections reduce the number of labels asymmetrically

Relevância:

80.00% 80.00%

Publicador:

Resumo:

All-optical label swapping (AOLS) forms a key technology towards the implementation of all-optical packet switching nodes (AOPS) for the future optical Internet. The capital expenditures of the deployment of AOLS increases with the size of the label spaces (i.e. the number of used labels), since a special optical device is needed for each recognized label on every node. Label space sizes are affected by the way in which demands are routed. For instance, while shortest-path routing leads to the usage of fewer labels but high link utilization, minimum interference routing leads to the opposite. This paper studies all-optical label stacking (AOLStack), which is an extension of the AOLS architecture. AOLStack aims at reducing label spaces while easing the compromise with link utilization. In this paper, an integer lineal program is proposed with the objective of analyzing the softening of the aforementioned trade-off due to AOLStack. Furthermore, a heuristic aiming at finding good solutions in polynomial-time is proposed as well. Simulation results show that AOLStack either a) reduces the label spaces with a low increase in the link utilization or, similarly, b) uses better the residual bandwidth to decrease the number of labels even more

Relevância:

80.00% 80.00%

Publicador:

Resumo:

This paper focuses on QoS routing with protection in an MPLS network over an optical layer. In this multi-layer scenario each layer deploys its own fault management methods. A partially protected optical layer is proposed and the rest of the network is protected at the MPLS layer. New protection schemes that avoid protection duplications are proposed. Moreover, this paper also introduces a new traffic classification based on the level of reliability. The failure impact is evaluated in terms of recovery time depending on the traffic class. The proposed schemes also include a novel variation of minimum interference routing and shared segment backup computation. A complete set of experiments proves that the proposed schemes are more efficient as compared to the previous ones, in terms of resources used to protect the network, failure impact and the request rejection ratio

Relevância:

80.00% 80.00%

Publicador:

Resumo:

A recent study defines a new network plane: the knowledge plane. The incorporation of the knowledge plane over the network allows having more accurate information of the current and future network states. In this paper, the introduction and management of the network reliability information in the knowledge plane is proposed in order to improve the quality of service with protection routing algorithms in GMPLS over WDM networks. Different experiments prove the efficiency and scalability of the proposed scheme in terms of the percentage of resources used to protect the network

Relevância:

80.00% 80.00%

Publicador:

Resumo:

En los últimos años se ha producido un incremento del uso de la telefonía móvil e Internet con fines intimidatorios o simplemente para amenazar a los iguales en los centros escolares de nuestro país. Con la voluntad de aportar datos que puedan ayudar a su prevención, se ha realizado un estudio de encuesta en el que se ha obtenido información relativa a las amenazas recibidas a través de los nuevos medios de comunicación, es decir, Internet y la telefonía móvil. Los resultados indican que un 23.3% de los estudiantes de los centros públicos de Enseñanza Secundaria Obligatoria de la ciudad de Girona (Cataluña), durante el curso escolar, han recibido vía Internet o telefonía móvil algún mensaje que, por su contenido, ha supuesto una amenaza para su bienestar. Se analizan las consecuencias emocionales y las estrategias de afrontamiento utilizadas por parte de estos adolescentes

Relevância:

80.00% 80.00%

Publicador:

Resumo:

Como consecuencia de la realización del curso 'Aplicaciones de la Web 2.0 en la Investigación y la Docencia' organizado por La Fundación General Universidad de Granada-Empresa en el curso académico 2009-2010, los autores del presente trabajo presentamos el Proyecto de Innovación Docente concedido por el Vicerrectorado para la Garantía de la calidad de la Universidad de Granada,titulado 'Utilización de la herramienta “Google Docs” en la Docencia Universitaria dentro del marco del EEES. Creemos que el proyecto tiene un diseño aplicable a cualquier asignatura de la actual Licenciatura y/o Grado de Farmacia. En este trabajo se expone la experiencia piloto llevada a cabo en la asignatura de Química Farmacéutica, incluyendo el desarrollo, objetivos, metodología, resultados y las conclusiones que se están obteniendo en el trascurso del mismo