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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

2,861 篇 会议
33 册 图书
29 篇 期刊文献

馆藏范围

2,923 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,831 篇 工学
- 1,590 篇 计算机科学与技术...
- 665 篇 软件工程
- 486 篇 信息与通信工程
- 443 篇 电气工程
- 127 篇 控制科学与工程
- 64 篇 生物工程
- 55 篇 网络空间安全
- 49 篇 电子科学与技术（可...
- 41 篇 动力工程及工程热...
- 37 篇 仪器科学与技术
- 30 篇 机械工程
- 28 篇 建筑学
- 28 篇 测绘科学与技术
- 26 篇 环境科学与工程（可...
- 23 篇 生物医学工程（可授...
- 22 篇 安全科学与工程
- 20 篇 土木工程
276 篇 理学
- 130 篇 数学
- 68 篇 生物学
- 49 篇 系统科学
- 42 篇 物理学
- 25 篇 统计学（可授理学、...
- 15 篇 化学
261 篇 管理学
- 185 篇 管理科学与工程(可...
- 94 篇 图书情报与档案管...
- 92 篇 工商管理
44 篇 法学
- 30 篇 社会学
30 篇 医学
- 25 篇 基础医学(可授医学...
- 22 篇 临床医学
28 篇 经济学
- 27 篇 应用经济学
15 篇 教育学
14 篇 文学
8 篇 农学
6 篇 军事学
1 篇 哲学
1 篇 历史学
1 篇 艺术学

主题

297 篇 cloud computing
225 篇 distributed comp...
119 篇 computer archite...
105 篇 protocols
103 篇 social networkin...
86 篇 servers
86 篇 mobile computing
84 篇 computational mo...
77 篇 security
73 篇 distributed data...
69 篇 resource managem...
66 篇 internet of thin...
65 篇 mobile communica...
64 篇 computer science
63 篇 peer to peer com...
62 篇 edge computing
60 篇 peer-to-peer com...
59 篇 grid computing
58 篇 routing
57 篇 internet

机构

27 篇 state key labora...
20 篇 school of inform...
17 篇 shandong provinc...
17 篇 daffodil interna...
12 篇 beijing univ pos...
7 篇 school of comput...
6 篇 the 54th researc...
5 篇 aalto univ dept ...
5 篇 grid computing a...
5 篇 university of ch...
5 篇 cent s univ sch ...
5 篇 department of co...
5 篇 school of inform...
4 篇 xidian universit...
4 篇 web intelligence...
4 篇 graduate univers...
4 篇 school of comput...
4 篇 eth zurich
4 篇 international sc...
4 篇 web intelligence...

作者

12 篇 dustdar schahram
10 篇 syed akhter hoss...
10 篇 wang hong
9 篇 sheikh abujar
8 篇 hong wang
8 篇 buyya rajkumar
8 篇 rothermel kurt
7 篇 yang yang
6 篇 xu jie
6 篇 wang wei
6 篇 parashar manish
6 篇 zheng yan
6 篇 yan zheng
5 篇 duerr frank
5 篇 yang fangchun
5 篇 truong hong-linh
5 篇 huo yonghua
5 篇 de pietro giusep...
5 篇 debajyoti mukhop...
5 篇 abu kaisar moham...

语言

2,874 篇 英文
23 篇 其他
20 篇 中文
5 篇 俄文
2 篇 乌克兰文

检索条件"任意字段=10th International Conference on Distributed Computing and Networking"

共 2923 条记录，以下是2751-2760 订阅

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

详细简洁

排序：

distributed collaborative key agreement protocols for dynamic peer groups

Distributed collaborative key agreement protocols for dynami...

引用

international conference on Network Protocols

作者： P.P.C. Lee J.C.S. Lui D.K.Y. Yau Department of Computer Science & Engineering Chinese University of Hong Kong Hong Kong China Department of Computer Sciences Purdue University West Lafayette IN USA

We consider several distributed collaborative key agreement protocols for dynamic peer groups. this problem has several important characteristics which make it different from traditional secure group communication. they are (1) the distributed nature in which there is no centralized key server, (2) collaborative nature in which the group key is contributory; i.e., each group member will collaboratively contribute its part to the global group key, and (3) the dynamic nature in which existing members can leave the group while new members may join. Instead of performing individual rekey operations, i.e., recomputing the group key after every join or leave request, we consider an interval-based approach of rekeying. In particular, we consider three distributed algorithms for updating the group key: (1) the rebuild algorithm, (2) the batch algorithm, and (3) the queue-batch algorithm. Performance of these distributed algorithms under different settings, such as different join and leave probabilities, is analyzed. We show that these three distributed algorithms significantly outperform the individual rekey algorithm, and that the queue-batch algorithm performs the best among the three distributed algorithms. Moreover the queue-batch algorithm has the intrinsic property of balancing the computation/communication workload such that the dynamic peer group can quickly begin secure group communication. this provides a fundamental understanding about establishing a collaborative group key for a distributed dynamic peer group.

关键词： Protocols Peer to peer computing distributed algorithms Computer science international collaboration Data privacy Ad hoc networks Character generation distributed computing Global communication

来源：评论

学校读者我要写书评

暂无评论

IP traceback-based intelligent packet filtering: a novel technique for defending against Internet DDoS attacks

IP traceback-based intelligent packet filtering: a novel tec...

引用

international conference on Network Protocols

作者： Minho Sung Jun Xu College of Computing Georgia Institute of Technology Atlanta GA USA

ISBN: (纸本)0769518567

distributed denial of service (DDoS) is one of the most difficult security problems to address. While many existing techniques (e.g., IP traceback) focus on tracking the location of the attackers after-the-fact, little is done to mitigate the effect of an attack while it is raging on. We present a novel technique that can effectively filter out the majority of DDoS traffic, thus improving the overall throughput of the legitimate traffic. the proposed scheme leverages on and generalizes the IP traceback schemes to obtain the information concerning whether a network edge is on the attacking path of an attacker ("infected") or not ("clean"). We observe that while an attacker will have all the edges on its path marked as "infected", edges on the path of a legitimate client will mostly be "clean". By preferentially filtering out packets that are inscribed with the marks of "infected" edges, the proposed scheme removes most of the DDoS traffic while affecting legitimate traffic only slightly. Simulation results based on real-world network topologies (e.g., Skitter) all demonstrate that the proposed technique can improve the throughput of legitimate traffic by 3 to 7 times during DDoS attacks.

关键词： Information filtering Information filters Telecommunication traffic Computer crime throughput Traffic control Web and internet services Educational institutions distributed computing Security

来源：评论

学校读者我要写书评

暂无评论

A multicast transport protocol for cooperative media distribution

A multicast transport protocol for cooperative media distrib...

引用

international conference on Network Protocols

作者： D. Vyzovitis A. Lippman MIT Media Laboratory USA

this paper describes the main ideas of DRMTP (distributed Real-time Multicast Transport Protocol), an adaptive application-level protocol which allows cooperative multicast of real-time streams. Our protocol is designed for peer-to-peer operation, where multiple sources residing on end-user machines may be present in the network, and is based on a dynamic stream aggregation and congestion control scheme. the protocol solves the problem of network asymmetry that plagues residential broadband networks and allows for fast fail-over and adaptation to departure of source nodes, mitigating the reliability and upstream capacity problems of end-user nodes. Coupled with traffic localization, stream patching, and TCP-friendly congestion control, we design a protocol that enables scalable soft real-time media distribution in a completely decentralised, serverless fashion.

关键词： Multicast protocols Transport protocols Peer to peer computing Streaming media Network servers Scalability Laboratories Broadband communication Communication system traffic control Bandwidth

来源：评论

学校读者我要写书评

暂无评论

An analysis of a router-based loss detection service for active reliable multicast protocols

An analysis of a router-based loss detection service for act...

引用

IEEE international conference on Networks

作者： M. Maimour C.-D. Pham RESAM University Lyon 1-LIP-INRIA RESO Lyon France

Group communications (multicast) are foreseen to be one of the most critical yet challenging technologies to meet the exponentially growing demands for data distribution in a large variety of applications of the Internet (grid computing, Web applications, distributed simulations, etc.). When reliability is required, there are no straightforward solutions and meeting the objectives of reliable multicast is not an easy task. Active networks open a new perspective in providing more efficient solutions for the problem of reliability. In this context, routers are able to perform customized computations on the packets flowing through them. In this paper, we propose a new service consisting of an early loss detection service to be deployed into routers. We also show how the loss detection service can improve the performances of the DyRAM active reliable multicast protocol in term of the recovery delays making DyRAM suitable for applications requiring low latencies.

关键词： Multicast protocols Delay Computational modeling Internet Grid computing Telecommunication network reliability Context-aware services Feedback Data security

来源：评论

学校读者我要写书评

暂无评论

A multicast routing protocol supporting multiple QoS constraints

A multicast routing protocol supporting multiple QoS constra...

引用

IEEE international conference on Networks

作者： Jinquan Dai Hung Keng Pung Touchai Angchuan Department of Computer Science School of Computing National University of Singapore Singapore

ISBN: (纸本)0780375335

the main goal of QoS multicast routing is to construct a multicast connection (usually in the form of a shared tree) meeting multiple QoS constraints. Unfortunately, QoS routing is generally a NP-complete problem when there are multiple routing objectives to meet. In this paper, we propose a new QoS multicast routing protocol, in which a multicast tree meeting multiple QoS constraints can be constructed in a distributed fashion using local network states at routers. We compare the performance of our scheme with other QoS multicast routing protocols through extensive simulations, and find that our protocol always performs better than them in terms of blocking probability and set-up latency, and it generates fewer overheads at heavy network loads.

关键词： Multicast protocols Routing protocols Unicast NP-complete problem Delay Multicast algorithms Computer networks Computer science Multimedia communication Bandwidth

来源：评论

学校读者我要写书评

暂无评论

Enhancing TCP energy efficiency for mobile hosts

Enhancing TCP energy efficiency for mobile hosts

引用

IEEE international conference on Networks

作者： W. Lilakiatsakun A. Seneviratne Department of Computer Engineering Mahanakom University of Technology Bangkok Thailand Department of Electrical Engineering and Telecommunications University of New South Wales Sydney Australia

ISBN: (纸本)0780375335

We present the finding of an investigation into an energy and performance enhancing technique for TCP operating in wireless networking environments. this technique, in contrast to other schemes that have been studied to date, is based on the concept of minimizing the probability of packet loss in wireless links rather than on error recovery. the scheme we propose intelligently suspends transmissions when the wireless link displays poor error characteristics and resumes when the error condition abates, to minimize packet loss without TCP modification. through simulation, in a LAN environment it is shown that intelligently suspension and resumption is possible to get better TCP performance and energy efficiency when the error is persistent, with long duration of a bad period and a high error rate. On the other hand, in a WAN environment it is worth doing in all situations as it can improve the energy efficiency up to 40% and and the TCP performance up to 35%. this study leads to improve TCP performance and energy efficiency by deploying lower layer information efficiently.

关键词： Energy efficiency Base stations Proposals Energy consumption throughput Probes Computer networks Telecommunication computing Power engineering and energy Australia

来源：评论

学校读者我要写书评

暂无评论

A reliable multipath routing protocol for ad-hoc network

A reliable multipath routing protocol for ad-hoc network

引用

IEEE international conference on Networks

作者： Li-Ping Chou Chin-Chi Hsu Fan Wu Department of Computer Science and Information Engineering National Taiwan University Taipei Taiwan Department of Information Management National Chung Cheng University Chiayi Taiwan

ISBN: (纸本)0780375335

Ad-hoc networks are a new wireless networking paradigm for mobile hosts. Unlike conventional wireless networks, ad-hoc networks have no fixed network infrastructure or administrative support. the topology of the network changes dynamically as mobile nodes join or depart the network or radio links between nodes become unusable. We propose some efficient multipath approaches that provide more secure routing schemes for ad-hoc network than previous ones. Within these approaches, more than one routing paths are selected. With the underlying coding technique, it can guarantee security against some malicious parties (it depends on how robust system is). Moreover, we apply these schemes into existing ad-hoc network routing protocols, table-driven and on-demand routing algorithms. Finally, we derive the relation between some probabilities on our algorithms.

关键词： Routing protocols Ad hoc networks Network topology Switches Image reconstruction Computer network reliability Computer science Reliability engineering Mobile computing Wireless networks

来源：评论

学校读者我要写书评

暂无评论

A topology for service discovery over multiple administrative domains

A topology for service discovery over multiple administrativ...

引用

IEEE international conference on Networks

作者： P. Sookavatana A. Seneviratne W. Lilakiatsakun School of Electrical Engineering and Telecommunication University of New South Wales Sydney NSW Australia Department of Computer Engineering Mahanakom University of Technology Bangkok Thailand

ISBN: (纸本)0780375335

the emerging heterogeneous network environments and the wide widespread deploying Internet applications introduce an interesting requirement: how to use any type of Internet application with any type of device, on any type of network. To this end, previous researchers have introduced concepts of adaptive network architectures. they address problems associated with the heterogeneity by using distributed entities to adapt the system and the applications to the current operating conditions. However, a major problem of these architectures is the discovery of the entities that are used for adaptation. Most proposed discovery mechanisms mainly concentrate on one administrative domain, or a single network operator. To solve this problem, we introduce an alternative enhancement feature for an existing service discovery architecture using peer-to-peer protocol. We also evaluate our architecture by comparison with other potential solutions. Finally, we confirm the viability of our proposal through simulation.

关键词： Aggregates Contracts Protocols Displays Relays Streaming media Telecommunication network topology Australia Telecommunication computing Computer architecture

来源：评论

学校读者我要写书评

暂无评论

Prefix-preserving IP address anonymization: measurement-based security evaluation and a new cryptography-based scheme

Prefix-preserving IP address anonymization: measurement-base...

引用

international conference on Network Protocols

作者： Jun Xu Jinliang Fan M.H. Ammar S.B. Moon College of Computing Georgia Institute of Technology Atlanta GA USA Sprint Advanced Technology Laboratory Burlingame CA USA

ISBN: (纸本)0769518567

Real-world traffic traces are crucial for Internet research, but only a very small percentage of traces collected are made public. One major reason why traffic trace owners hesitate to make the traces publicly available is the concern that confidential and private information may be inferred from the trace. We focus on the problem of anonymizing IP addresses in a trace. More specifically, we are interested in prefix-preserving anonymization in which the prefix relationship among IP addresses is preserved in the anonymized trace, making such a trace usable in situations where prefix relationships are important. the goal of our work is two fold. First, we develop a cryptography-based, prefix-preserving anonymization technique that is provably as secure as the existing well-known TCPdpriv scheme, and unlike TCPdpriv, provides consistent prefix-preservation in large scale distributed setting. Second, we evaluate the security properties inherent in all prefix-preserving IP address anonymization schemes (including TCPdpriv). through the analysis of Internet backbone traffic traces, we investigate the effect of some types of attacks on the security of any prefix-preserving anonymization algorithm. We also derive results for the optimum manner in which an attack should proceed, which provides a bound on the effectiveness of attacks in general.

关键词： Cryptography Binary trees Cryptographic protocols Stress Decision making

来源：评论

学校读者我要写书评

暂无评论

A case for TCP Vegas in high-performance computational grids

A case for TCP Vegas in high-performance computational grids

引用

10th Annual IEEE international Symposium on High Performance distributed computing

作者： Weigle, E Feng, WC Los Alamos Natl Lab Res & Dev Adv Network Technol RADIANT Los Alamos NM 87545 USA

ISBN: (纸本)0769512968

Computational grids such as the Information Power Grid [1], Particle Physics Data Grid [2], and Earth System Grid [3] depend on TCP to provide reliable communication between nodes across a wide-area network (WAN). Of the available TCP implementations, TCP Reno and its variants are the most widely deployed;however;Reno's performance in computational grids is mediocre at best. Due to conflicting results in the evaluation of TCP implementations [4, 5, 6, 7, 8, 9, 10, 11, 12, 13], we present a detailed simulation study that unifies the conflicting results and demonstrates the limitations of earlier work. We focus on the two most debated versions of TCP - Reno and Vegas. Using real traffic distributions, we show that Vegas performs well over modern high-performance links and better than Reno with the proper selection of the Vegas parameters a and. Our results exhibit ways to significantly enhance the performance of distributed computational grids that rely, on TCP.

关键词： computational grid distributed computing networking TCP Reno Vegas

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共293页 << < 272 273 274 275 276 277 278 279 280 281 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：