检索结果-内蒙古大学图书馆

Annual computer Security Applications Conference

作者： N. Weiler Computer Engineering and Networks Laboratory Swiss Federal Institute of Technology Zurich Switzerland

ISBN: (纸本)0769514057

Secure group communication protocols, in particular multi-party key agreement and update algorithms, help promote traditional and new Internet multi-party applications such as video conferencing or distance education. We propose a framework for marrying such approaches with access management mechanisms and applications in real environments. Furthermore, we extend this framework with anonymisation techniques for the sake of the individual's privacy. Our solution combines traditional unicast based approaches for privacy with authenticated and encrypted group communication. Thereby, we are able to build closed groups in which the members are not disclosed to outsiders. The introduced secure and anonymous multicast (SAM) framework can be employed as a scalable, configurable architecture for pseudonym based group communication between qualified entities.

关键词： Internet Privacy Application software IP networks Unicast Cryptography Communication system traffic control Access control Education computer applications

来源：评论

学校读者我要写书评

暂无评论

Pricing and Cost Recovery for Internet Services: Practical Review, Classification, and Application of Relevant Models

引用

Netnomics 2001年第2期3卷 149-171页

作者： Stiller, Burkhard Reichl, Peter Leinen, Simon Computer Engineering and Networks Laboratory TIK ETH Zürich Zürich Switzerland SWITCH Zürich Switzerland

Suitable pricing models for Internet services represent one of the main prerequisites for a successfully running implementation of a charging and accounting system. This paper introduces general aspects influencing the choice of a pricing model in practical situations and presents a survey as well as a classification of relevant and advanced approaches to be found in the scientific literature. First performance results on charging extensions within the Internet are presented, which are completed by a set of market price simulations for dynamic pricing models within the same implementation environment. Based on cost model investigations some detailed insights into price and cost issues from an Internet Service Provider's (ISP) point of view are given. Moreover, current challenges as well as problems are discussed in a practical context as investigated in the Swiss National Science Foundation project Charging and Accounting Technology for the Internet (CATI).

关键词：

来源：评论

学校读者我要写书评

暂无评论

Internal design representations for embedded systems

Internal design representations for embedded systems

引用

IEEE International Conference on computer-Aided Design

作者： L. Thiele Computer Engineering and Networks Laboratory TIK Swiss Federal Institute of Technology Zurich Switzerland

Modern embedded computing systems tend to be heterogeneous assemblages of concurrent subsystems, typically described in different languages and semantics which are well established in the various application fields. For example, the specification of the functional and timing behavior necessitates a mixture of different basic models of computation and communication which come from transformatlive or reactive domains. There is little hope that a single language will replace this heterogeneous set of languages. In fact, experiments with system specification languages show that there is not a unique universal specification language to support the whole life cycle. A similar problem occurs when reused components shall be integrated, possibly described in another language and incompletely documented. Examples would be components of other companies or "legacy code". The lack of coherency of the different languages, methods and toots is a substantial obstacle on the way to higher design productivity and design quality. A design process must be able to bridge the semantic differences for verification and synthesis and should account for limited knowledge of system properties. This paper describes approaches which allow for the common representation of different languages and incomplete specifications. In particular, recent results on the use of internal design representations targeted to scheduling and design space exploration are reviewed. The information useful for methods like allocation of resources, partitioning the design and scheduling must be estimated or extracted from the various input languages and mapped onto internal representations which describe properties of the subsystems and their coordination. Design methods work on these internal representations and eventually refine them by adding components and reducing non-determinism.

关键词： Embedded system Specification languages Embedded computing Assembly systems Timing Computational modeling Productivity Process design Bridges

来源：评论

学校读者我要写书评

暂无评论

Location in distributed ad-hoc wireless sensor networks

Location in distributed ad-hoc wireless sensor networks

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： C. Savarese J.M. Rabaey J. Beutel Berkeley Wireless Research Center USA Computer Engineering and Networks Laboratory ETH Zurich Switzerland

Evolving networks of ad-hoc wireless sensing nodes rely heavily on the ability to establish position information. The algorithms presented herein rely on range measurements between pairs of nodes and the a priori coordinates of sparsely located anchor nodes. Clusters of nodes surrounding anchor nodes cooperatively establish confident position estimates through assumptions, checks, and iterative refinements. Once established, these positions are propagated to more distant nodes, allowing the entire network to create an accurate map of itself. Major obstacles include overcoming inaccuracies in range measurements as great as /spl plusmn/50%, as well as the development of initial guesses for node locations in clusters with few or no anchor nodes. Solutions to these problems are presented and discussed, using position error as the primary metric. Algorithms are compared according to position error, scalability, and communication and computational requirements. Early simulations yield average position errors of 5% in the presence of both range and initial position inaccuracies.

关键词： Intelligent networks Wireless sensor networks Global Positioning System Intelligent sensors Radio navigation Coordinate measuring machines Clustering algorithms Scalability Computational modeling Actuators

来源：评论

学校读者我要写书评

暂无评论

Multiobjective genetic programming: reducing bloat using SPEA2

Multiobjective genetic programming: reducing bloat using SPE...

引用

Congress on Evolutionary Computation

作者： S. Bleuler M. Brack L. Thiele E. Zitzler Computer Engineering and Communication Networks Laboratory TIK Swiss Federal Institute of Technology Zurich Switzerland

ISBN: (纸本)0780366573

This study investigates the use of multiobjective techniques in genetic programming (GP) in order to evolve compact programs and to reduce the effects caused by bloating. The proposed approach considers the program size as a second, independent objective besides the program functionality. In combination with a multiobjective evolutionary technique, SPEA2, this method outperforms four other strategies to reduce bloat with regard to both convergence speed and size of the produced programs on an even-parity problem.

关键词： Genetic programming computer networks Genetic engineering Communication networks Convergence Time measurement Training data Optimization methods

来源：评论

学校读者我要写书评

暂无评论

On layered video fairness on IP networks

On layered video fairness on IP networks

引用

IEEE Conference and Exhibition on Global Telecommunications (GLOBECOM)

作者： A. Matrawy L. Lambadaris Changcheng Huang Broadband Networks Laboratory Department of Systems and Computer Engineering Carleton University Ottawa ONT Canada

In this paper, we present a study of layered video fairness on IP networks. Our study is based on simulation. We investigate some issues that have direct impact on fair allocation of bandwidth between layered video and TCP, in particular: (a) congestion control mechanisms employed by layered video transfer protocols; for this part we studied the interaction of RLM with TCP; (b) the effect of the distribution of video traffic across layers in layered multicast video; (c) the effect of VBR video on fairness to TCP. We show that fairness is affected by all the above factors. We also show that fairness of layered video comes at the expense of instability of the video quality and poor link utilization. We conclude by discussing the performance of layered video protocols in general and recommendations on the design of video transfer systems on IP networks.

关键词： IP networks Internet Bandwidth Delay Scalability TCPIP Video sharing Information technology Broadband communication Laboratories

来源：评论

学校读者我要写书评

暂无评论

Semsomm-a scalable multiple encryption scheme for one-to-many multicast

Semsomm-a scalable multiple encryption scheme for one-to-man...

引用

IEEE International Workshop on Enabling Technologies: Infrastructure for Collaborative Enterprises (WET ICE)

作者： N. Weiler Computer Engineering and Networks Laboratory (TIK) Swiss Federal Institute of Technology ETH Zurich Switzerland

Many traditional and new Internet multi-party applications require a scalable, secure group communication infrastructure. Some of these applications such as video conferencing involve many-to-many communication while others such as stock exchange systems engage in one-to-many data distribution. In this paper, we present a novel solution for the latter area. Our approach, which we call Semsomm, relies on two main ideas: First, we use intermediate nodes of the multicast distribution tree as entrusted relaying nodes in order to overcome the need to re-key the entire group upon each membership change. Second, the session key is periodically renewed and redistributed to legitimate group members, thus inhibiting any collusion attack. Semsomm scales to very large groups while preserving perfect forward secrecy of the multicasted data information because of its multiple encryption method. Furthermore, we show how our approach can be extended first to few-to-many and then to many-to-many scenarios with the appropriate network based infrastructural enhancements such as active networks.

关键词： Cryptography Scalability Application software Security computer networks Laboratories IP networks Videoconference Relays Tires

来源：评论

学校读者我要写书评

暂无评论

A multipath routing approach for secure data delivery

A multipath routing approach for secure data delivery

引用

MILCOM, Military Communications Conference

作者： Wenjing Lou Yuguang Fang Wireless Networks Laboratory WINET Department of Electrical and Computer Engineering University of Florida Gainesville FL USA

ISBN: (纸本)0780372255

In this paper, we propose a novel approach to enhance data confidentiality when transmitting across insecure networks. The idea is to take advantage of the distributed nature of networks such as Internet or wireless networks and combine the secret sharing scheme and multipath routing. With a (T,N) secret sharing scheme, the secure message is divided into N shares such that from any T or more shares, we can easily recover the message, while from any T-1 or less shares, it is computationally impossible to recover the message. Then using the multipath routing algorithm, the shares are delivered across the network via N different paths, where no T or more paths can share a single node. The destination node reconstructs the original message upon receiving T or more shares. However, any intermediate node does not intercept T shares necessary for the message recovery. In this paper, we present the basic idea, then, we describe a distributed multipath routing algorithm to find the desired N different paths. The algorithm takes path independence, path quantity, as well as path cost into consideration. With comparably low complexity, the algorithm is able to find, between any source-destination pair, sets of node disjoint paths. The algorithm is compared with another disjoint path finding algorithm and the result shows that our algorithm has better performance in terms of number of paths found.

关键词： Routing Cryptography Data security National security IP networks Wireless networks Costs Protection Internetworking engineering profession

来源：评论

学校读者我要写书评

暂无评论

Active pipes: service composition for programmable networks

Active pipes: service composition for programmable networks

引用

MILCOM, Military Communications Conference

作者： R. Keller J. Ramamirtham T. Wolf B. Plattner Computer Engineering and Networks Laboratory Swiss Federal Institute of Technology Switzerland Department of Computer Science Washington University of Saint Louis USA

ISBN: (纸本)0780372255

Active networks allow customized processing of data traffic within the network which can be used by applications to improve the quality of their sessions. To simplify the development of active applications in a heterogeneous environment, we propose "active pipes" as a programming abstraction to specify transmission and processing requirements. We describe how an active pipe can be mapped onto network resources by a shortest path algorithm, and how optimal processing sites and a route through the network can be determined. Additionally, we propose a scalable network software architecture implementing the functionality required for active pipes.

关键词： Application software Resource management Routing protocols Communication system traffic control Transcoding Monitoring Bandwidth Availability Large-scale systems Costs

来源：评论

学校读者我要写书评

暂无评论

Fair bandwidth allocations through queue management in core-stateless networks

Fair bandwidth allocations through queue management in core-...

引用

IEEE Conference and Exhibition on Global Telecommunications (GLOBECOM)

作者： Zha Mingyu Gu Guanqun Yuan Yuan Department of Computer Science & Engineering South-East University Nanjing China The Key Laboratory for Computer Networks and Information Integration Ministry of Education China

We present queue length based fair queueing (QLFQ), a scheme to approximate fair bandwidth allocation without per-flow state. We have evaluated QLFQ together with CSFQ (core-stateless fair queueing) (see Stoica, I., Proc. ACM SIGCOMM'98, p.119-30, 1998) and RFQ (rainbow fair queueing) (see Cao, Z., Proc. IEEE Infocom, 2000) with several different configurations and traffic sources. The simulation results show that QLFQ is able to achieve approximately fair bandwidth sharing in all of these scenarios. The performance of QLFQ is comparable to that of CSFQ and it performs much better than RFQ. The simulations also show that in an environment with bursty traffic sources, QLFQ provides much better fairness than CSFQ.

关键词： Bandwidth Intelligent networks

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：