oalib
Search Results: 1 - 10 of 100 matches for " "
All listed articles are free for downloading (OA Articles)
Page 1 /100
Display every page Item
Overview of IP Network Survivability
IP网络生存性研究综述

WU Jing,GUO Cheng-Cheng,YAN Pi-Liu,
吴静
,郭成城,晏蒲柳

计算机科学 , 2007,
Abstract: Optical network survivability has been a hot topic of research for a long time. However, it is only recently that network survivability has attracted the attention of large research community. The growth of business-critical applications is the primary driver behind this increased interest in network protection and restoration. MPLS network is connection-oriented and is the protection and restoration mechanism is easy to be configured. But most IP networks are not updated to support MPLS, so it is meaningful to study the survivability of pure IP network. There are many challenges for IP network survivability which are generalized in the paper above all. And then research on different IP network survivability and the coordination with lower layer survivability are concluded, especially the state of the art for pure IP network is introduced in detail. Finally it is indicated that IP fast rerouting is potentially efficient for implementation, the recovery and QoS considered together in MPLS network is preferred and multi-layer resilience would be the hot topic in the future.
An Overview to IP QoS Architectures
IP QoS体系结构综述

徐昌彪
重庆邮电大学学报(自然科学版) , 2001,
Abstract: 简要说明了IP QoS含义,针对集成业务、区分业务、多协议标签交换、业务量工程以及约束路由等 方案,重点探讨了在IP网络上支持IP QoS的体系结构,提出了今后的发展动向。
Quantum walks and their algorithmic applications  [PDF]
Andris Ambainis
Computer Science , 2004,
Abstract: Quantum walks are quantum counterparts of Markov chains. In this article, we give a brief overview of quantum walks, with emphasis on their algorithmic applications.
Packet Classification by Multilevel Cutting of the Classification Space: An Algorithmic-Architectural Solution for IP Packet Classification in Next Generation Networks  [PDF]
Motasem Aldiab,Emi Garcia-Palacios,Danny Crookes,Sakir Sezer
Journal of Computer Networks and Communications , 2008, DOI: 10.1155/2008/603860
Abstract: Traditionally, the Internet provides only a “best-effort” service, treating all packets going to the same destination equally. However, providing differentiated services for different users based on their quality requirements is increasingly becoming a demanding issue. For this, routers need to have the capability to distinguish and isolate traffic belonging to different flows. This ability to determine the flow each packet belongs to is called packet classification. Technology vendors are reluctant to support algorithmic solutions for classification due to their nondeterministic performance. Although content addressable memories (CAMs) are favoured by technology vendors due to their deterministic high-lookup rates, they suffer from the problems of high-power consumption and high-silicon cost. This paper provides a new algorithmic-architectural solution for packet classification that mixes CAMs with algorithms based on multilevel cutting of the classification space into smaller spaces. The provided solution utilizes the geometrical distribution of rules in the classification space. It provides the deterministic performance of CAMs, support for dynamic updates, and added flexibility for system designers.
IETF Standardization in the Field of the Internet of Things (IoT): A Survey  [PDF]
Isam Ishaq,David Carels,Girum K. Teklemariam,Jeroen Hoebeke,Floris Van den Abeele,Eli De Poorter,Ingrid Moerman,Piet Demeester
Journal of Sensor and Actuator Networks , 2013, DOI: 10.3390/jsan2020235
Abstract: Smart embedded objects will become an important part of what is called the Internet of Things. However, the integration of embedded devices into the Internet introduces several challenges, since many of the existing Internet technologies and protocols were not designed for this class of devices. In the past few years, there have been many efforts to enable the extension of Internet technologies to constrained devices. Initially, this resulted in proprietary protocols and architectures. Later, the integration of constrained devices into the Internet was embraced by IETF, moving towards standardized IP-based protocols. In this paper, we will briefly review the history of integrating constrained devices into the Internet, followed by an extensive overview of IETF standardization work in the 6LoWPAN, ROLL and CoRE working groups. This is complemented with a broad overview of related research results that illustrate how this work can be extended or used to tackle other problems and with a discussion on open issues and challenges. As such the aim of this paper is twofold: apart from giving readers solid insights in IETF standardization work on the Internet of Things, it also aims to encourage readers to further explore the world of Internet-connected objects, pointing to future research opportunities.
Adaptive Communication Techniques for the Internet of Things  [PDF]
Peng Du,George Roussos
Journal of Sensor and Actuator Networks , 2013, DOI: 10.3390/jsan2010122
Abstract: The vision for the Internet of Things (IoT) demands that material objects acquire communications and computation capabilities and become able to automatically identify themselves through standard protocols and open systems, using the Internet as their foundation. Yet, several challenges still must be addressed for this vision to become a reality. A core ingredient in such development is the ability of heterogeneous devices to communicate adaptively so as to make the best of limited spectrum availability and cope with competition which is inevitable as more and more objects connect to the system. This survey provides an overview of current developments in this area, placing emphasis on wireless sensor networks that can provide IoT capabilities for material objects and techniques that can be used in the context of systems employing low-power versions of the Internet Protocol (IP) stack. The survey introduces a conceptual model that facilitates the identification of opportunities for adaptation in each layer of the network stack. After a detailed discussion of specific approaches applicable to particular layers, we consider how sharing information across layers can facilitate further adaptation. We conclude with a discussion of future research directions.
Authentication Systems in Internet of Things  [PDF]
Tuhin Borgohain,Amardeep Borgohain,Uday Kumar,Sugata Sanyal
Computer Science , 2015,
Abstract: This paper analyses the various authentication systems implemented for enhanced security and private re-position of an individual's log-in credentials. The first part of the paper describes the multi-factor authentication (MFA) systems, which, though not applicable to the field of Internet of Things, provides great security to a user's credentials. MFA is followed by a brief description of the working mechanism of interaction of third party clients with private resources over the OAuth protocol framework and a study of the delegation based authentication system in IP-based IoT.
An Overview of Quality of Service Multicast Routing for IP-networks:Problems and Solutions
IP网络的QoS多播路由问题与解决方法综述

吴小泉,冀鑫泉,桂志波
计算机科学 , 2004,
Abstract: 本文在IP网络的QoS模型、加权图模型和QoS度量的基础上,讨论了IP网络QoS多播路由的主要问题及解决方法。文中进一步详细描述了在不同路由规则下相关的路由算法.并对该领域内需要进一步研究的热点问题进行了探索。
Can Selfish Groups be Self-Enforcing?  [PDF]
Guillaume Ducoffe,Dorian Mazauric,Augustin Chaintreau
Computer Science , 2012,
Abstract: Algorithmic graph theory has thoroughly analyzed how, given a network describing constraints between various nodes, groups can be formed among these so that the resulting configuration optimizes a \emph{global} metric. In contrast, for various social and economic networks, groups are formed \emph{de facto} by the choices of selfish players. A fundamental problem in this setting is the existence and convergence to a \emph{self-enforcing} configuration: assignment of players into groups such that no player has an incentive to move into another group than hers. Motivated by information sharing on social networks -- and the difficult tradeoff between its benefits and the associated privacy risk -- we study the possible emergence of such stable configurations in a general selfish group formation game. Our paper considers this general game for the first time, and it completes its analysis. We show that convergence critically depends on the level of \emph{collusions} among the players -- which allow multiple players to move simultaneously as long as \emph{all of them} benefit. Solving a previously open problem we exactly show when, depending on collusions, convergence occurs within polynomial time, non-polynomial time, and when it never occurs. We also prove that previously known bounds on convergence time are all loose: by a novel combinatorial analysis of the evolution of this game we are able to provide the first \emph{asymptotically exact} formula on its convergence. Moreover, we extend these results by providing a complete analysis when groups may \emph{overlap}, and for general utility functions representing \emph{multi-modal} interactions. Finally, we prove that collusions have a significant and \emph{positive} effect on the \emph{efficiency} of the equilibrium that is attained.
Algorithmic Randomness as Foundation of Inductive Reasoning and Artificial Intelligence  [PDF]
Marcus Hutter
Mathematics , 2011,
Abstract: This article is a brief personal account of the past, present, and future of algorithmic randomness, emphasizing its role in inductive inference and artificial intelligence. It is written for a general audience interested in science and philosophy. Intuitively, randomness is a lack of order or predictability. If randomness is the opposite of determinism, then algorithmic randomness is the opposite of computability. Besides many other things, these concepts have been used to quantify Ockham's razor, solve the induction problem, and define intelligence.
Page 1 /100
Display every page Item


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.