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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是1-10 订阅

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

详细简洁

排序：

Measurement and analysis of handover latencies in IEEE 802.11i secured networks 13

Measurement and analysis of handover latencies in IEEE 802.1...

引用

13th European Wireless Conference: Enabling Technologies for Wireless Multimedia Communications, EW 2007

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

The purpose of the IEEE 802.11i standard is to endue wireless networks with advanced security by leveraging mature and proven security technologies. The concept of a Robust Secure Network (RSN) as a long-term security architecture was defined in order to provide confidentiality of data being transferred over the wireless medium as well as to provide mutual authentication between mobile stations and the network infrastructure. Nonetheless, security provisioning is indubitable time and resource consuming, which poses a problem as far as meeting quality of service demands of forthcoming delay-critical applications (e.g. Voice over WLAN) is concerned. The main objective of this research is to measure and analyze how currently deployed mobile devices perform when joining the RSN as defined by the IEEE 802.11i security amendment. Furthermore, we investigate various state-of-the-art implementations of IEEE 802.11i among different mobile devices providing the answer to what to expect on performance sacrifice by utilizing link-layer protection of IEEE 802.11i. As a result of this work, we find that the price to pay for the IEEE 802.11 security greatly varies among different devices, starting from low latencies such as ≈19 ms up to ≈330 ms and interestingly, computational stronger clients are not a priori the winners. © EW 2007 - 13th European Wireless Conference: Enabling Technologies for Wireless Multimedia Communications. All rights reserved.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

On Delay Bounds and Measurements: A COTS Testbed for Network Performance Experimentation

On Delay Bounds and Measurements: A COTS Testbed for Network...

引用

IEEE Annual International computer Software and Applications Conference (COMPSAC)

作者： Bruno Cattelan Steffen Bondorf TU Kaiserslautern DISCO Distributed Computer Systems Lab Ruhr University Bochum Faculty of Mathematics Center of Computer Science

ISBN: (数字)9781728173030

ISBN: (纸本)9781728173047

In many application domains such as the automotive and the avionics sector, networks need to fulfill different non-functional requirements. Among them is the strict demand to provide predictable and deterministic worst-case communication performance. Without formal verification of this property, an entire system embedding the network may not be certified and thus not be operated. A methodology for formal verification of communication performance is the Deterministic Network Calculus (DNC). DNC is under active development to better model real systems and to reduce pessimism required to provide verifiably correct bounds on communication delays. This previous work is mostly of theoretical nature. In our paper, we aim at providing a testbed design to benchmark bounds against measurements. Our design is composed of off-the-shelf components that we accompany with a custom software stack for taking measurements (network configuration and time stamping) as well as deriving delay bounds with DNC (system modeling and analysis). We also provide lessons-learned as well as first results that compare delay measurements and DNC-derived bounds.

关键词： Delays Aerospace electronics Servers Economic indicators Computational modeling Software Calculus

来源：评论

学校读者我要写书评

暂无评论

Improving Output Bounds in the Stochastic Network Calculus Using Lyapunov’s Inequality

Improving Output Bounds in the Stochastic Network Calculus U...

引用

IFIP Networking Conference

作者： Paul Nikolaus Jens Schmitt Distributed Computer Systems (DISCO) Lab TU Kaiserslautern Germany

ISBN: (纸本)9781538662809;9783903176089

Giving tight estimates for output bounds is key to an accurate network analysis using the stochastic network calculus (SNC) framework. In order to upper bound the delay for a flow of interest in the network, one typically has to calculate output bounds of cross-traffic flows several times. Thus, an improvement in the output bound calculation pays off considerably. In this paper, we propose a new output bound calculation in the SNC framework by making use of Lyapunov's inequality. We prove the bound's validity and also show why it is always at least as accurate as the state-of-the-art method. Numerical evaluations demonstrate that even in small heterogeneous two server topologies, our approach can improve a delay bounds' violation probability by a factor of 340. For a set of randomly generated parameters, the bound is still decreased by a factor of 1.33 on average. Furthermore, our approach can be easily integrated in existing end-to-end analyses.

关键词： Delays Servers Calculus Topology Algebra Standards Upper bound

来源：评论

学校读者我要写书评

暂无评论

The Deterministic Network Calculus Analysis: Reliability Insights and Performance Improvements

The Deterministic Network Calculus Analysis: Reliability Ins...

引用

IEEE International Workshop on computer-Aided Modeling, Analysis, and Design of Communication Links and Networks, CAMAD

作者： Alexander Scheffler Markus Fögen Steffen Bondorf Distributed Computer Systems (DISCO) Lab TU Kaiserslautern Germany

ISBN: (纸本)9781538661529

The cost of delay analysis increases fast with size and complexity of a network. Therefore, many recent research efforts in Deterministic Network Calculus (DNC) focused on the tradeoff between accuracy and cost of its delay-bounding analyses. In this paper, we present insights on reliable, reproducible and performance on both branches of DNC, algebraic analysis and optimization, as well as the tools employed by them. We reveal circumstances causing problems for reliability and reproducibility of DNC's optimization analysis and we investigate the potential to improve computational performance of algebraic DNC. To that end, we present theoretical background on the topic of parallelizing the DNC analyses and an implementation in the open-source discoDNC tool. With our proposed approach, we achieve a speedup of analysis times of one order of magnitude.

关键词： Delays Complexity theory Reliability Java Analytical models computer network reliability Tools

来源：评论

学校读者我要写书评

暂无评论

Integrating Fractional Brownian Motion Arrivals into the Statistical Network Calculus

Integrating Fractional Brownian Motion Arrivals into the Sta...

引用

International Teletraffic Congress, ITC 21

作者： Paul Nikolaus Sebastian Henningsen Michael Beck Jens Schmitt TU Kaiserslautern Distributed Computer Systems (DISCO) Lab Germany Humboldt-Univcrsirär zu Berlin Germany University of Manitoba Canada

Stochastic network calculus (SNC) is a versatile framework to derive probabilistic performance bounds. Recently, it was proposed in [1] to replace the typical a priori assumptions on arrival processes with measurement observations and to incorporate the corresponding statistical uncertainty into calculation of the bounds. This so-called statistical network calculus (StatNC) opens the door for many applications with limited traffic information. However, the important traffic class of self-similar processes such as fractional Brownian Motion (fBm) was left open in [1], thus, e.g., depriving the usage of the StatNC for Internet traffic. In this work, we close this gap by integrating fBm arrivals into the StatNC. To this end, we analyze the impact imposed by the uncertainty on the backlog bound and show in numerical evaluations that the additional inaccuracy is only of moderate size.

关键词： Calculus Brownian motion Upper bound Uncertainty Stochastic processes Estimation Mathematical model

来源：评论

学校读者我要写书评

暂无评论

On per-flow delay bounds in tandem queues under (In)dependent arrivals

On per-flow delay bounds in tandem queues under (In)dependen...

引用

IFIP Networking Conference

作者： Paul Nikolaus Jens Schmitt Distributed Computer Systems (DISCO) Lab University of Kaiserslautern Germany

Tandem queues, i.e., several servers in series, occur in many performance models of networked and distributed systems. In this paper, we derive stochastic delay bounds for a flow of interest from a set of flows that traverses the tandem. To that end, we take an approach based on stochastic network calculus (SNC) using moment-generating functions. Directly applying existing SNC approaches from literature requires to take into account many stochastic dependencies unless we incorporate the pay multiplexing only once (PMOO) principle known from deterministic network calculus (DNC). We derive a general solution for the tandem of n servers. Moreover, we also enable the analysis of stochastic dependencies among flows. In numerical experiments with fractional Brownian motion as a traffic model, we compare the delay bounds obtained by our analysis, following the PMOO principle, with those from existing literature and observe an average improvement of the delay bounds by at least 30%. Furthermore, we observe that by careful parameter optimization, a significant improvement is achieved compared to standard choices for the parameter set. Finally, we evaluate the effect of stochastic dependencies among flows on the delay bounds.

关键词： Delays Servers Stochastic processes Queueing analysis Multiplexing Calculus Numerical models

来源：评论

学校读者我要写书评

暂无评论

Better Bounds by Worse Assumptions - Improving Network Calculus Accuracy by Adding Pessimism to the Network Model

Better Bounds by Worse Assumptions - Improving Network Calcu...

引用

IEEE International Conference on Communications

作者： Steffen Bondorf Distributed Computer Systems (DISCO) Lab University of Kaiserslautern Germany

Safety-critical systems require certification in order to attain permission to operate. Nowadays, these systems routinely embed a communication sub-systems whose performance must be formally verified for certification. Deterministic Network Calculus (DNC) can be employed for this task. It provides a mathematical framework to derive worst-case bounds on the delay of data flows, i.e., deterministic delivery guarantees. Their accuracy is decisive as even small improvements can change the outcome of certification. In general, delay bound accuracy depends on the accuracy of the network model. While previous work assumed that a more accurate model will invariantly yield more accurate delay bounds, we show that the opposite can actually be true. In this paper, we examine a specific weakness of DNC network analysis that leads to this counter-intuitive result. We make use of this insight in a mitigation strategy called flow prolongation. By prolonging the paths of flows, we let them interfere with more other flows but may still get better results. An evaluation in differently sized networks gives information about its impact on delay bound accuracy as well as analysis effort.

关键词： Delays Servers Multiplexing Calculus Interference Aggregates Mathematical model

来源：评论

学校读者我要写书评

暂无评论

Towards the analysis of transient phases with stochastic network calculus

Towards the analysis of transient phases with stochastic net...

引用

NETWORKS International Telecommunications Network Strategy and Planning Symposium

作者： Michael Beck University of Kaiserslautern Germany Distributed Computer Systems Lab (DISCO)

ISBN: (纸本)9781467389921

Current analysis methods for queueing systems mostly aim at steady-state results. However, many applications demand results for systems with a transient behavior. In communication networks such transient phases arise from sleep scheduling or the slow-start phase of TCP. In both examples the service offered is separated into a transient and a steady-state phase. In a larger context also the arrivals to a queueing system can show transient behavior. The demand or availability of energy in smart grids, the pool of data generated after the map phase in big data applications, or the arrivals in public transportation networks are a few examples. Analyzing these kind of systems in a steady-state fashion (for example via queueing theory) ignores their behavior in the transient phases. On the other side the analysis of transient phases bears additional challenges. This paper uses stochastic network calculus to describe the non-stationary behavior of queueing systems. With the help of bivariate arrival- and service envelopes time-variant performance bounds are constructed. Two numerical examples exemplify the framework created by these envelopes and compare it to the time-invariant analysis.

关键词： Transient analysis Queueing analysis Steady-state Calculus Stochastic processes Delays Mathematical model

来源：评论

学校读者我要写书评

暂无评论

Boosting sensor network calculus by thoroughly bounding cross-traffic

Boosting sensor network calculus by thoroughly bounding cros...

引用

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

作者： Steffen Bondorf Jens B. Schmitt Distributed Computer Systems (DISCO) Lab University of Kaiserslautern Germany

Sensor Network Calculus (SensorNC) provides a framework for worst-case analysis of wireless sensor networks. The analysis proceeds in two steps: For a given flow, (1) the network is reduced to a tandem of nodes by computing the arrival bounds of cross-traffic; (2) the flow is separated from the cross-traffic by subtracting cross-flows and concatenating nodes on its path. While the second step has seen much treatment, the first step has not at all. This is in sharp contrast to the fact that arrival bounding takes roughly 80% of the total analysis time and is equally crucial for the tightness of the bounds. Therefore, we turn our attention to this first SensorNC analysis step with the goal to boost the performance and applicability of the overall framework. The main technical contribution is a generalized version of the concatenation theorem within the SensorNC setting. This generalization is instrumental in simplifying and streamlining the cross-traffic arrival bound computations such that run times can be reduced by more than a factor of 5. Even more important, it enables a localization of the information necessary to execute the calculations at the node level, thus enabling a distribution of the SensorNC analysis within a self-modeling WSN.

关键词： Calculus Servers Delays Aggregates Wireless sensor networks Topology computers

来源：评论

学校读者我要写书评

暂无评论

Towards a Statistical Network Calculus-Dealing with Uncertainty in Arrivals

Towards a Statistical Network Calculus-Dealing with Uncertai...

引用

IEEE International Conference on computer Communications

作者： Michael A. Beck Sebastian A. Henningsen Simon B. Birnbach Jens B. Schmitt Distributed Computer Systems (DISCO) Lab University of Kaiserslautern Germany

The stochastic network calculus (SNC) has become an attractive methodology to derive probabilistic performance bounds. So far the SNC is based on (tacitly assumed) exact probabilistic assumptions about the arrival processes. Yet, in practice, these are only true approximately-at best. In many situations it is hard, if possible at all, to make such assumptions a priori. A more practical approach would be to base the SNC operations on measurements of the arrival processes (preferably even on-line). In this paper, we develop this idea and incorporate measurements into the framework of SNC taking the further uncertainty resulting from estimation errors into account. This is a crucial step towards a statistical network calculus (StatNC) eventually lending itself to a self-modelling operation of networks with a minimum of a priori assumptions. In numerical experiments, we are able to substantiate the novel opportunities by StatNC.

关键词： Calculus Probabilistic logic Uncertainty computers Stochastic processes Conferences Random variables

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：