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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

4,788 篇 会议
146 册 图书

馆藏范围

4,934 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,239 篇 工学
- 1,743 篇 计算机科学与技术...
- 1,549 篇 信息与通信工程
- 941 篇 电气工程
- 14 篇 软件工程
- 8 篇 电子科学与技术（可...
- 5 篇 仪器科学与技术
- 4 篇 控制科学与工程
- 3 篇 网络空间安全
- 2 篇 动力工程及工程热...
- 2 篇 安全科学与工程
- 1 篇 机械工程
- 1 篇 环境科学与工程（可...
92 篇 管理学
- 90 篇 管理科学与工程(可...
- 4 篇 图书情报与档案管...
- 2 篇 工商管理
9 篇 理学
- 9 篇 数学
- 2 篇 统计学（可授理学、...
- 1 篇 系统科学
3 篇 法学
- 1 篇 法学
- 1 篇 社会学
- 1 篇 公安学

主题

479 篇 bandwidth
396 篇 delay
384 篇 computer science
367 篇 routing
337 篇 throughput
334 篇 quality of servi...
315 篇 protocols
302 篇 telecommunicatio...
278 篇 internet
268 篇 wireless sensor ...
260 篇 traffic control
234 篇 network topology
225 篇 ip networks
222 篇 routing protocol...
205 篇 intelligent netw...
199 篇 computer network...
188 篇 ad hoc networks
181 篇 costs
171 篇 switches
145 篇 performance anal...

机构

19 篇 department of co...
15 篇 chinese acad sci...
14 篇 temple univ dept...
13 篇 univ calif santa...
13 篇 tsinghua univ de...
12 篇 palo alto resear...
11 篇 univ texas dept ...
10 篇 nanjing univ sta...
10 篇 computer enginee...
10 篇 department of el...
10 篇 department of el...
10 篇 department of co...
10 篇 univ massachuset...
9 篇 iowa state univ ...
9 篇 univ notre dame ...
9 篇 penn state univ ...
8 篇 georgia state un...
8 篇 univ chinese aca...
8 篇 department of co...
8 篇 school of comput...

作者

19 篇 wu jie
19 篇 shen haiying
16 篇 j.j. garcia-luna...
14 篇 zaigham mahmood
11 篇 haiying shen
11 篇 garcia-luna-acev...
10 篇 jie wu
10 篇 garcia-luna-acev...
10 篇 dharm singh jat
10 篇 wolf tilman
10 篇 tilman wolf
9 篇 jianping wu
9 篇 j. j. garcia-lun...
9 篇 k. makki
8 篇 m. gerla
8 篇 chunming qiao
8 篇 j. harms
8 篇 yu wei
8 篇 choi baek-young
8 篇 yang yy

语言

4,903 篇 英文
30 篇 中文
1 篇 其他

检索条件"丛书名=Computer Communications and Networks"

共 4934 条记录，以下是4831-4840 订阅

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

详细简洁

排序：

Bandwidth allocation for VBR video traffic in ATM networks

Bandwidth allocation for VBR video traffic in ATM networks

引用

International Conference on computer communications and networks (ICCCN)

作者： Hon-Wai Chu D.H.K. Tsang Tao Yang Department of Electrical & Electronic Engineering Hong Kong University of Science and Technology Kowloon Hong Kong China Department of Industrial Engineering Technical University of Nova Scotia Halifax NS Canada

In this paper, we study the bandwidth allocation problem for an ATM multiplexer loaded with compressed VBR video sources. To estimate the bandwidth required by a VBR video source, we characterize its traffic by five parameters: peak rate, bottom rate, mean rate, standard deviation, and the coefficient of the autocorrelation function. The aggregate traffic of a number of VBR video sources is modelled by a discrete-time Markov modulated deterministic process (D-MMDP) which is approximately equal to the superposition of a number of identical and independent two-active-state mini-sources. Based on the effective bandwidth approach and the Gaussian approximation, we derive simple formulas for estimating the required bandwidth.

关键词： Channel allocation Telecommunication traffic Video compression Bandwidth Asynchronous transfer mode Traffic control Multiplexing Autocorrelation Aggregates Gaussian approximation

来源：评论

学校读者我要写书评

暂无评论

A modular growth architecture for an ATM switch

A modular growth architecture for an ATM switch

引用

International Conference on computer communications and networks (ICCCN)

作者： Jin Li Chuanlin Wu Department of Electrical and Computer Engineering University of Texas Austin Austin TX USA

ISBN: (纸本)0818671807

A growable ATM switch architecture is desired for constructing a large scale ATM switch. All the current ATM switch architectures are based on uniform connections of unit switch elements. When the switch size becomes large, the uniform switch architecture is no longer suitable for the nonuniform traffic conditions. In this paper, we propose a nonuniform modular growth ATM switch architecture by using a knockout switch as the basic unit. All the internal traffic of the proposed switch has the best delay and throughput performance. An analysis is also presented to study the relationship between the cell-loss performance and the switch parameters. The knockout principle proves to be very efficient for the nonuniform concentration in the proposed switch architecture. The proposed switch architecture is cost-effective compared with the growable switch architecture which employs the uniform connection pattern.

关键词： Asynchronous transfer mode Switches computer architecture Very large scale integration Delay Throughput Performance analysis B-ISDN Telecommunication traffic Probability

来源：评论

学校读者我要写书评

暂无评论

A "persistent connection" model for mobile and distributed systems

A "persistent connection" model for mobile and distributed s...

引用

International Conference on computer communications and networks (ICCCN)

作者： Yongguang Zhang Son Dao Hughes Research Laboratories Inc. Malibu CA USA

ISBN: (纸本)0818671807

This paper describes a mechanism, called "persistent connection" to preserve stream connections after the communicating peer exits and till it restarts. Such connections have many applications: to survive failures that crash one party, network partitions that cut off the two parties, and temporary disconnection in a mobile computing environment. They can also facilitate suspension of process execution in a limited resource environment and maintain connectivity when one party migrates from one machine to another. Persistent connection uses logical endpoints to hide disconnection from applications and to achieve location independence. It can be constructed from the normal "transient" connection that goes down with processes. Prototypes have been developed on Unix to provide persistent connections in both the TCP-socket level and the DCE RPC level. Many existing programs can benefit from this software to achieve transparence to disconnection and relocation. We conclude that persistent connection is a convenient communication abstraction for reliable, adaptable, and reconfigurable applications.

关键词： Application software computer crashes Mobile computing computer networks Laboratories Software prototyping Prototypes Mobile communication Batteries Cloning

来源：评论

学校读者我要写书评

暂无评论

The maximum dimensional fault-free subcube allocatable in faulty hypercube

The maximum dimensional fault-free subcube allocatable in fa...

引用

International Conference on computer communications and networks (ICCCN)

作者： H. Masuyama T. Sasama H. Hashimoto Information and Knowledge Engineering Tottori University Tottori Japan Graduate School Tottori University Tottori Japan

The maximum dimensional subcube located in faulty hypercubes is studied in this paper. Most parallel algorithms can be formulated with the dimension n of the hypercube being a parameter of the algorithm. The reconfiguration problem in a hypercube reduces to finding the maximum dimensional fault-free subcube in the hypercube, that is, helps in achieving graceful and the most effective degradation of the system. The paper presents the maximum number of faults on an n-cube on which there always exists at least one fault-free (n-2)-subcube.

关键词： Hypercubes Fault tolerance Binary trees Knowledge engineering Degradation Parallel algorithms Partitioning algorithms Fault diagnosis computer networks

来源：评论

学校读者我要写书评

暂无评论

Video quality control under cell-discarding algorithms in an ATM network supporting layer-encoded video streams

Video quality control under cell-discarding algorithms in an...

引用

International Conference on computer communications and networks (ICCCN)

作者： I. Rubin K.K. Chang Electrical Engineering Department University of California Los Angeles CA USA AT and T Bell Laboratories Inc. Holmdel NJ USA

We consider a multiplexer station which supports ATM video traffic streams. The system model also applies to the multiplexing operation carried out at the output queue of each output-queueing ATM switch. We assume that video signals are encoded by a two-level layered encoding algorithm under which each ATM cell is properly marked as a high-priority (HP) or low-priority (LP) cell according to the significance of the information carried by the cell. The video multiplexer implements a congestion-control based cell-discarding algorithm under which, when high congestion conditions an observed, the LP cells an discarded. We take into account the high burstiness embedded in the video traffic as observed by the multiplexer at the cell-level and the frame-level time scales. We show that, if not carefully designed, a cell-discarding algorithm can cause both inter-frame and infra-frame short-term video quality degradations. To correct this situation, we introduce new cell-discarding algorithms which incorporate a probabilistic mechanism into their cell discarding scheme and which take into account the features of the bursty inter-frame and intra-frame processes. Two video degradation indicators are introduced to measure the short-term inter-frame and intra-frame video quality degradation features experienced by a video stream. Through numerical examples, we identify and compare the system performance behaviour under the introduced cell-discarding algorithms.

关键词： Quality control Asynchronous transfer mode Multiplexing Degradation Traffic control Streaming media Switches Encoding Algorithm design and analysis System performance

来源：评论

学校读者我要写书评

暂无评论

Buying and selling computational power over the network

Buying and selling computational power over the network

引用

International Conference on computer communications and networks (ICCCN)

作者： O. Kremien Department of Math&Computer Science Bar-llan University Ramat-Gan Israel

Powerful processors and high-bandwidth communications which are available provide a very large amount of cycles at supercomputer speeds. This can serve emerging data-intensive applications which require extremely high data rates. Workstations equipped with such processors are often utilized for a fraction of the time and sit idle otherwise. It may become possible to sell and buy computational power over the network in the same way that electrical power is sold and bought by utilities over the power grid today. Potential buyers are users in need of more cycles than those provided by their own workstations. A request made by a potential buyer can be directed to any of the sellers and a best match of buyer and seller (trading) has to be made. For scalability, traders use an extended version of the adaptive partitioning algorithm which may be applicable whenever mutual interest is clearly defined, i.e. a seller is interested in finding a buyer and vice versa. It is shown that server or client selection for buying or selling computation power over the network using adaptive partitioning is simple and efficient.

关键词： computer networks Partitioning algorithms Supercomputers Network servers Grid computing Power grids Workstations Costs Scalability Adaptive systems

来源：评论

学校读者我要写书评

暂无评论

Transient analysis of cell loss control mechanisms in ATM networks

Transient analysis of cell loss control mechanisms in ATM ne...

引用

International Conference on computer communications and networks (ICCCN)

作者： K.K. Lee S.T. Chanson Department of Computer Science Hong Kong University of Science and Technology Hong Kong China

A new technique is developed to analyze the cell loss behavior of individual connections in finite intervals for ATM networks. The technique is applied to partial buffer sharing (PBS) in deriving formulae for calculating cell loss rate and queue length distributions for each cell class in a single connection in finite intervals. To maximize network utilization, a new and more flexible cell loss control mechanism called threshold-based loss balancing (TLB) is proposed which restricts the violation probability of each cell class. Comparisons of TLB and PBS on selected operating conditions reveal that TLB can accept more connections under the same workload conditions. PBS is shown to be a special case of TLB.

关键词： Transient analysis Intelligent networks Asynchronous transfer mode Delay Kelvin computer science Probability Bandwidth Jitter Steady-state

来源：评论

学校读者我要写书评

暂无评论

Deadlock detection in communicating finite state machines by even reachability analysis

Deadlock detection in communicating finite state machines by...

引用

International Conference on computer communications and networks (ICCCN)

作者： Wuxu Peng Department of Computer Science Southwest Texas State University San Marcos TX USA

ISBN: (纸本)0818671807

Fair reachability is a very useful technique in detecting errors of deadlocks and unspecified receptions in networks of communicating finite state machines (CFSMs) consisting of two machines. The paper extends the classical fair reachability technique, which is only applicable to the class of two-machine CFSMs, to the general class of CFSMs. For bounded CFSMs, the extended fair reachability technique reduces by more than one half the total number of reachable global states that have to be searched in verifying freedom from deadlocks. The usefulness of the new reachability technique, called even reachability, is demonstrated through two examples.

关键词： System recovery Automata Reachability analysis Explosions Protocols Intelligent networks computer science computer errors Concurrent computing State-space methods

来源：评论

学校读者我要写书评

暂无评论

Performance analysis of PCS mobility management database system

Performance analysis of PCS mobility management database sys...

引用

International Conference on computer communications and networks (ICCCN)

作者： Xiaoxin Qiu V.O.K. Li Communication Sciences Institute Department of Electrical Engineering-Systems University of Southern California Los Angeles CA USA

A queueing model is developed for the database system which supports mobility management in personal communication systems (PCS). The end-to-end service delay is defined as the performance metric. The accuracy of the analytical model is validated by simulation. It is found that the analytical results show a close agreement to those from simulation over a significant range of system parameters. Three database system architectures proposed for PCS are studied, namely, the flat database system in GSM, the two-level hierarchical architecture, and the three-level hierarchical architecture. Based on the queueing model, the delay performance of these three architectures are compared. It is observed that the hierarchical architecture provides the best system performance and supports the highest user density. This is because the service arrival rate to the higher level large database is significantly reduced, due to the localized nature of calls and users in PCS.

关键词： Performance analysis Personal communication networks Mobile radio mobility management Database systems Delay FCC Frequency Costs Measurement GSM

来源：评论

学校读者我要写书评

暂无评论

Unicast, multicast, and broadcast in enhanced Fibonacci cubes

Unicast, multicast, and broadcast in enhanced Fibonacci cube...

引用

International Conference on computer communications and networks (ICCCN)

作者： Haifeng Qian Jie Wu Department of Computer Science and Engineering Florida Atlantic University Boca Raton FL USA

ISBN: (纸本)0818671807

The enhanced Fibonacci cube (EFC) is defined based on the sequence F/sub n/=2F/sub n-2/+2F/sub n-4/. It contains the Fibonacci cube as a subgraph and maintains virtually all the desirable properties of the Fibonacci cube, and it also possesses properties such as the Hamiltonian property that the Fibonacci cube does not have. In this paper, we study data routing, namely, unicast, multicast and broadcast in the enhanced Fibonacci cube. The time and traffic steps are used to measure the efficiency of the routing algorithms. The unicast algorithm, which uses a Hamming distance path for any two nodes in EFC, is time and traffic optimal. The broadcast algorithm which employs the enhanced Fibonacci tree is traffic optimal and near time optimal. Two heuristic multicast algorithms are proposed which are based on an enhanced Fibonacci tree and a Hamiltonian cycle, respectively.

关键词： Unicast Broadcasting Hypercubes Multicast algorithms Routing Telecommunication traffic computer science Time measurement Hamming distance Multiprocessor interconnection networks

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共494页 << < 480 481 482 483 484 485 486 487 488 489 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：