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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

28 篇 会议
1 册 图书
1 篇 期刊文献

馆藏范围

30 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

14 篇 工学
- 11 篇 信息与通信工程
- 11 篇 计算机科学与技术...
- 7 篇 软件工程
- 3 篇 动力工程及工程热...
- 1 篇 机械工程
- 1 篇 电气工程
- 1 篇 建筑学
7 篇 理学
- 7 篇 数学
- 1 篇 统计学（可授理学、...
2 篇 管理学
- 1 篇 管理科学与工程(可...
- 1 篇 图书情报与档案管...
1 篇 艺术学
- 1 篇 设计学（可授艺术学...

主题

12 篇 calculus
8 篇 wireless sensor ...
7 篇 delays
5 篇 servers
4 篇 quality of servi...
4 篇 queueing analysi...
4 篇 delay
4 篇 stochastic proce...
3 篇 aggregates
3 篇 wireless communi...
3 篇 topology
3 篇 uncertainty
3 篇 mathematical mod...
2 篇 communication sy...
2 篇 multiplexing
2 篇 network topology
2 篇 java
2 篇 computers
2 篇 analytical model...
2 篇 sensors

机构

6 篇 distributed comp...
4 篇 disco distribute...
2 篇 distributed comp...
2 篇 disco distribute...
2 篇 disco / distribu...
1 篇 computer science...
1 篇 disco / distribu...
1 篇 computer science...
1 篇 university of ka...
1 篇 distributed comp...
1 篇 disco - distribu...
1 篇 ruhr university ...
1 篇 disco-distribute...
1 篇 distributed comp...
1 篇 tu kaiserslauter...
1 篇 university of ka...
1 篇 multimedia commu...
1 篇 distributed comp...
1 篇 disco / distribu...
1 篇 disco - distribu...

作者

11 篇 schmitt jens b.
8 篇 jens b. schmitt
5 篇 martinovic ivan
5 篇 steffen bondorf
4 篇 ivan martinovic
4 篇 zdarsky frank a.
3 篇 paul nikolaus
3 篇 jens schmitt
3 篇 poe wint yi
2 篇 nicos gollan
2 篇 bachorek adam
2 篇 michael beck
1 篇 f. a. zdarsky
1 篇 alexander scheff...
1 篇 wint yi poe
1 篇 uzun ersin
1 篇 f.a. zdarsky
1 篇 simon b. birnbac...
1 篇 adam bachorek
1 篇 ersin uzun

语言

30 篇 英文

检索条件"机构=Disco Distributed Computer Systems Lab"

共 30 条记录，以下是21-30 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Improving performance bounds in feed-forward networks by paying multiplexing only once

Improving performance bounds in feed-forward networks by pay...

引用

2008 14th GI/ITG Conference on Measuring, Modelling and Evaluation of computer and Communication systems, MMB 2008

作者： Schmitt, Jens B. Zdarsky, Frank A. Martinovic, Ivan Disco Distributed Computer Systems Lab University of Kaiserslautern Germany

ISBN: (纸本)9783800730902

Bounding performance characteristics in communication networks is an important and interesting issue. In this study we assume uncertainty about the way different flows in a network are multiplexed, we even drop the common FIFO assumption. Under so-called arbitrary multiplexing we derive new bounds for the tractable, yet non-trivial case of feed-forward networks. This is accomplished for pragmatic, but general traffic and server models using network calculus. In particular, we derive an end-to-end service curve for a flow of interest under arbitrary multiplexing, establishing what we call the pay multiplexing only once principle. Finally, we present some numerical results to compare our bounds against the best known bounds for networks of arbitrary multiplexing nodes.

关键词： Calculations

来源：评论

学校读者我要写书评

暂无评论

Enabling authentic transmissions in WSNs — turning jamming against the attacker

Enabling authentic transmissions in WSNs — turning jamming ...

引用

IEEE Workshop on Secure Network Protocols (NPSec)

作者： Adam Bachorek Ivan Martinovic Jens B. Schmitt Disco Distributed Computer Systems Lab University of Kaiserslautern Germany

Traditional methods for message authentication are based on the cryptographic verification of received data using some sort of a shared secret. While this task is not critical for traditional networks, Wireless Sensor Networks (WSNs) may pay a high price for the gained protection - sensor nodes are forced to invest their already scarce resources in receiving a message and executing cryptographic computations, only to discard the message afterwards in case of a failed authentication. This work introduces a different, crypto-free approach for enabling authenticated communication by leveraging peculiarities of wireless communication, in particular its broadcast nature and the feasibility of channel capacity jamming. Instead of receiving and then verifying transmitted data, sensor nodes are prevented from receiving fake data at all. This is achieved by coupling physical characteristics of signal propagation with legitimate transmissions. Such a coupling enables the detection and invalidation of impersonation attacks by using short jamming pulses emitted by surrounding WSN nodes. We justify this concept by designing a novel communication protocol explicitly integrating the jamming feature, and analyze factors which impact the efficiency of successful jamming, such as the frame length, transmission timing accuracy, and various other issues identified through extensive empirical measurements.

关键词： Jamming Timing Wireless sensor networks Receivers Wireless communication Cryptography Accuracy

来源：评论

学校读者我要写书评

暂无评论

Firewalling wireless sensor networks: Security by wireless

Firewalling wireless sensor networks: Security by wireless

引用

Conference on Local computer Networks (LCN)

作者： Ivan Martinovic Nicos Gollan Jens B. Schmitt Disco-distributed computer systems lab University of Kaiserslautern Germany

Networked sensors and actuators for purposes from production monitoring and control to home automation are in increasing demand. Until recently, the main focus laid on wired systems, although their deployment requires careful planning and expensive infrastructure that may be difficult to install or modify. Hence, solutions based on wireless sensor networks (WSNs) are gaining popularity to reduce cost and simplify installation. Clearly, one of the key issues rising from the switch to wireless communication lies in security; while an air gap is among the most effective security measures in wired networks, wireless communication is not as easy to isolate from attack. In this paper, we propose a system leveraging the peculiarities of the wireless medium, such as the broadcast nature of wireless communication and the unpredictability of indoor signal propagation to achieve effective protection against attacks based on the injection of fake data. Using a real-world WSN deployment and a realistic implementation of an attacker, we analyze this protection scheme and demonstrate that neither position change, transmission power manipulation, nor complete knowledge of wireless parameters can help an attacker to successfully attack the network. As a result, this work demonstrates how the chaotic nature of radio communication, which is often considered a disadvantage in regard to security objectives, can be used to enhance protection and support implementation of lightweight security mechanisms.

关键词： Wireless sensor networks Wireless communication Sensors Security Communication system security Distance measurement Antenna measurements

来源：评论

学校读者我要写书评

暂无评论

Delay Bounds under Arbitrary Multiplexing: When Network Calculus Leaves You in the Lurch...

Delay Bounds under Arbitrary Multiplexing: When Network Calc...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE computer and Communications Societies

作者： J. B. Schmitt F. A. Zdarsky M. Fidler Distributed Computer Systems Lab (DISCO) University of Kaiserslautern Germany Multimedia Communications Lab (KOM) Darmstadt University of Technology Germany

Network calculus has proven as a valuable and versatile methodology for worst-case analysis of communication networks. One issue in which it is still lacking is the treatment of aggregate multiplexing, in particular if the FIFO property cannot be assumed when flows are merged. In this paper, we address the problem of bounding the delay of individual traffic flows in feed-forward networks under arbitrary multiplexing. Somewhat surprisingly, we find that direct application of network calculus results in loose bounds even in seemingly simple scenarios. The reasons for this "failure" of network calculus are discussed in detail and a method to arrive at tight delay bounds for arbitrary (aggregate) multiplexing is presented. This method is based on the solution of an optimization problem. For the special case of sink-tree networks this optimization problem is solved explicitly, thus arriving at a closed-form expression for the delay bound. Numerical experiments illustrate that in sink-tree networks the improvement over bounds based on direct application of network calculus can be considerable.

关键词： Calculus Aggregates Feedforward systems Queueing analysis Network topology Network servers Delay Telecommunication traffic Traffic control Quality of service

来源：评论

学校读者我要写书评

暂无评论

The disco Network Calculator

The DISCO Network Calculator

引用

14th GI/ITG Conference - Measurement, Modelling and Evalutation of computer and Communication systems

作者： Nicos Gollan Frank A. Zdarsky Ivan Martinovic Jens B. Schmitt Distributed Computer Systems Lab (DISCO) Technische Universität Kaiserslautern p.o. box 3049 67653 Germany

Network calculus was developed for use in IP and ATM networks. It aims to be a system theory for deterministic queuing, allowing to derive deterministic guarantees on throughput and delay, as well as find bounds on buffer sizes and thereby allow for loss-free transfer. Traditional queuing theory analyzes the average or equilibrium behavior of a network, whereas network calculus shows the worst observable case. It describes network traffic and services in terms of curves, wide-sense increasing functions that represent accumulated data. By using a min-plus algebra, replacing the addition and multiplication in (R,+, ·) by minimum and addition (R,min,+), it avoids non-linearities in the required operations on those curves. Similar to traditional system theory, network calculus provides a concatenation result, thereby making it possible to reduce tandems of systems (respective services) to a single equivalent service. An extension of the network calculus, the sensor network calculus, provides results for handling cross-traffic in networks with tree topologies that are typical for sensor networks. More recent results handle effects like data scaling, which is an effect in networks that not only forward data, but also mutate it along the path. This may be the result of compression, aggregation, or other processing.

关键词： Calculus Calculators Java Wireless sensor networks Queueing analysis Analytical models Delay

来源：评论

学校读者我要写书评

暂无评论

The disco network calculator: A toolbox for worst case analysis 06

The DISCO network calculator: A toolbox for worst case analy...

引用

VALUETOOLS: 1st International Conference on Performance Evaluation Methodologies and Tools

作者： Schmitt, Jens B. Zdarsky, Frank A. Disco Distributed Computer Systems Lab. University of Kaiserslautern Germany

ISBN: (纸本)1595935045

In this paper we describe the design, implementation, and analytical background of the disco Network Calculator. The disco Network Calculator is an open-source toolbox written in Java#8482;which we developed for worst-case analyses based on network calculus. To our knowledge it is the first of its kind. It allows to do network analyses regarding performance characteristics such as delay and backlog bounds for piecewise linear arrival and service curves. We illustrate the tool's usefulness by two comprehensive example applications. Copyright 2006 ACM.

关键词： Telecommunication networks

来源：评论

学校读者我要写书评

暂无评论

On lower bounds for MAC layer contention in CSMA/CA-based Wireless networks 05

On lower bounds for MAC layer contention in CSMA/CA-based Wi...

引用

2005 Joint Workshop on Foundations of Mobile Computing, DIALM-POMC 2005

作者： Zdarsky, Frank A. Martinovic, Ivan Schmitt, Jens B. Disco Distributed Computer Systems Lab University of Kaiserslautern Germany

ISBN: (纸本)1595930922

Wireless LANs operating within unlicensed frequency bands require random access schemes such as CSMA/CA, so that wireless networks from different administrative domains (for example wireless community networks) may co-exist without central coordination, even when they happen to operate on the same radio channel. Yet, it is evident that this lack of coordination leads to an inevitable loss in efficiency due to contention on the MAC layer. The interesting question is, which efficiency may be gained by adding coordination to existing, unrelated wireless networks, for example by self-organization. In this paper, we present a methodology based on a mathematical programming formulation to determine the parameters (assignment of stations to access points, signal strengths and channel assignment of both access points and stations) for a scenario of co-existing CSMA/CA-based wireless networks, such that the contention between these networks is minimized. We demonstrate how it is possible to solve this discrete, nonlinear optimization problem exactly for small problems. For larger scenarios, we present a genetic algorithm specifically tuned for finding near-optimal solutions, and compare its results to theoretical lower bounds. Overall, we provide a benchmark on the minimum contention problem for coordination mechanisms in CSMA/CA-based wireless networks. Copyright 2005 ACM.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

Best-effort versus reservations revisited

Best-effort versus reservations revisited

引用

13th International Workshop on Qualityof Service - IWQoS 2005

作者： Heckmann, Oliver Schmitt, Jens B. KOM Multimedia Communications Lab. TU Darmstadt Germany DISCO Distributed Computer Systems Lab. University of Kaiserslautern Germany

In this paper, we walk in the footsteps of the stimulating paper by Lee Breslau and Scott Shenker entitled "Best-effort vs. Reservations: A Simple Comparative Analysis"[1]. In fact, we finally follow their invitation to use their models as a starting point and extend them to reason about the very basic but still very much debated architectural issue whether quality of service (QoS) mechanisms like admission control and service differentiation are necessary or if overprovisioning with a single service class does the job just as well at lower system complexity. We analytically compare two QoS systems: a QoS system using admission control and a reservation mechanism that can guarantee bandwidth for flows respectively offers service differentiation based on priority queueing for two service classes and a system with no admission control and a single best-effort service class. © IFIP International Federation for Information Processing 2005.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

Enhancing mobile QoS based on movement contracts

Enhancing mobile QoS based on movement contracts

引用

International Workshop on Quality of Service

作者： F.A. Zdarsky J.B. Schmitt Distributed Computer Systems (DISCO) Lab Computer Science Department University of Kaiserslautern Germany

Resource management for individual flows can significantly improve quality of service (QoS) in mobile cellular networks. However, its efficiency depends on the availability of information about the movement of mobile terminals. Movement prediction can potentially provide this information, but is costly if performed by the network and usually assumes a certain movement model, which may not adequately reflect each individual user's behavior. Instead, we propose the concept of movement contracts, where a mobile terminal specifies its movement to the network, which in return provides a better QoS as long as the provided specification is sufficiently accurate. We describe approaches to specify the spatial and temporal aspects of movement with a parsimonious parameter set and evaluate these approaches through simulations. We find that movement contracts can significantly reduce both session blocking and handover dropping probability simultaneously, whereas existing approaches have to make a tradeoff between these.

关键词： Contracts Quality of service Resource management Land mobile radio cellular systems Bandwidth Telecommunication traffic computer networks distributed computing computer science Mobile computing

来源：评论

学校读者我要写书评

暂无评论

Measurement, Modelling, and Evaluation of Computing systems and Dependability and Fault Tolerance 1

引用

丛书名： Lecture Notes in computer Science

1000年

作者： Jens B. Schmitt

ISBN: (数字)9783642285400

ISBN: (纸本)9783642285394

This book constitutes the refereed proceedings of the 16th International GI/ITG Conference on Measurement, Modeling and Evaluation of Computing systems and Dependability and Fault Tolerance, MMB & DFT 2012, held in Kaiserslautern, Germany, in March 2012.;The 16 revised full papers presented together with 5 tool papers and 5 selected workshop papers were carefully reviewed and selected from 54 submissions. MMB & DFT 2012 covers diverse aspects of performance and dependability evaluation of systems including networks, computer architectures, distributed systems, software, fault-tolerant and secure systems.

关键词： Software Engineering Programming Languages, Compilers, Interpreters computer Communication Networks Information systems Applications (incl. Internet) Logics and Meanings of Programs Programming Techniques

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共3页 << < 1 2 3 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：