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

D-LBSB: A DISTRIBUTED LOAD BALANCING ALGORITHM FOR CHANNEL ASSIGNMENT IN CELLULAR MOBILE NETWORKS

Journal of Interconnection Networks 2000年第3期1卷 195-220页

作者： SAJAL K. DAS SANJOY K. SEN RAJEEV JAYARAM Center for Research in Wireless Mobility and Networking (CReWMaN) Department of Computer Science and Engineering The University of Texas at Arlington Arlington TX 76019-0015 USA Service Provider & Carrier Group Nortel Networks Richardson TX 75083 USA TDMA Systems Ericsson Inc Richardson TX 75081 USA

We propose a novel distributed load balancing algorithm (D-LBSB) for the hot cell problem in cellular mobile networks. As an underlying approach, we start with a fixed channel assignment scheme where each cell is initially allocated a set of C (local) channels, each to be assigned on demand to a user in the cell. A cell is classified as 'hot', if the degree of coldness of a cell (defined as the ratio of the number of available channels to the total number of channels for that cell) is less than or equal to some threshold value, h. Otherwise the cell is 'cold'. D-LBSB proposes to migrate unused channels from suitable cold cells to the hot ones through a distributed channel borrowing algorithm. A Markov model for an individual cell is developed, where the state is determined by the number of occupied channels in the cell. The probability of a cell being hot and the call blocking probability in a cell are derived. Detailed simulation experiments are carried out in order to evaluate our proposed methodology. The performance of D-LBSB is compared with the fixed channel assignment, simple borrowing, and three existing strategies with load balancing (namely, directed retry, CBWL and centralized LBSB). By a rigorous analysis in terms of running time and message complexity, it is shown that D-LBSB performs better than centralized LBSB in an overloaded system. Also D-LBSB performs significantly better than all the other schemes in terms of call blocking probability under moderate and heavy loads.

关键词： Cellular networks channel assignment channel borrowing hot cells load balancing mobile communication

来源：评论

学校读者我要写书评

暂无评论

Implementing enhanced network maintenance for transaction access services: tools and applications

Implementing enhanced network maintenance for transaction ac...

引用

IEEE International Conference on Communications (ICC)

作者： S. Papavassiliou M. Pace A. Zawadzki L. Ho New Jersey Institute of Technology New Jersey Center for Multimedia Research Electrical and Computer Engineering Department University Heights Newark NJ USA AT&T Network Architecture Department AT and T Laboratories Middletown NJ USA Networking Research Laboratory Bell Laboratories Lucent Technologies Inc. Holmdel NJ USA

We describe the design and implementation of automated methodologies and tools that facilitate the implementation of an enhanced maintenance process in order to provide improved quality of service offered to the customers for the transaction access services (TAS) network. The emphasis of our work is placed on the identification, filtering and correlation of event occurrences that indicate problems that do not necessarily generate alarmed conditions on the conventional network management systems, and on the proactive service/fault management and detection based on dynamically defined violations of the base-lined performance profiles. Such an approach enhances considerably the network management and maintenance process, by identifying possible situations/incidents that may affect the network performance, and by correlating those incidents to the potentially affected elements, services and customer applications.

关键词： Filtering Humans Fault diagnosis Application software Quality of service Wide area networks Switches Laboratories computer architecture Event detection

来源：评论

学校读者我要写书评

暂无评论

An algorithm for multipath computation using distance-vectors with predecessor information 8

An algorithm for multipath computation using distance-vector...

引用

8th International Conference on computer Communications and Networks, ICCCN 1999

作者： Vutukury, Srinivas Garcia-Luna-Aceves, J.J. Computer Sciences Department University of California Santa CruzCA95064 United States Computer Engineering Department University of California Santa CruzCA95064 United States Networking and Security Center Sun Microsystems Laboratories Palo AltoCA94303 United States

ISBN: (纸本)0780357949

Routing algorithms in the IP Internet provide a single path between each source-destination pair and where more than one path is provided, they are paths of equal length. Single-path routing is inherently slow in responding to congestion and temporary traffic bursts;multiple paths are better suited to handle congestion. Also the paths provided in RIP and OSPF are not free of loops during times of network transition, which can be debilitating to network performance. We present a distributed routing algorithm for computing multiple paths that need not have equal length between each source-destination pair in a computer network such that they are loop-free at every instant - in steady state as well as during network transitions. The algorithm is scalable to large networks as it uses only one-hop synchronization which is unlike diffusing computations that require internodal synchronization spanning multiple hops. The safety and liveness properties of the algorithm are proven and its complexity is analyzed. © 1999 IEEE.

关键词： Internet protocols

来源：评论

学校读者我要写书评

暂无评论

A scalable architecture for providing deterministic guarantees 8

A scalable architecture for providing deterministic guarante...

引用

8th International Conference on computer Communications and Networks, ICCCN 1999

ISBN: (纸本)0780357949

The Internet community has proposed the integrated services architecture (Intserv) and the signaling protocol RSVP to provide deterministic guarantees (bandwidth, delay and jitter) to individual flows. However, experience with practical systems has revealed the severe scalability problems of the Intserv model due to the amount of routing and reservation state that is required to he maintained in the routers. A natural approach to improving scalability of the Intserv architecture is through a reduction of the number of states in the routers by using aggregated flow state instead of per-flow state. We present a novel architecture that uses very few states in the routers, while still providing the deterministic guarantees of the Intserv model. © 1999 IEEE.

关键词： Scalability

来源：评论

学校读者我要写书评

暂无评论

Link-state routing in networks with unidirectional links 8

Link-state routing in networks with unidirectional links

引用

8th International Conference on computer Communications and Networks, ICCCN 1999

作者： Bao, Lichun Garcia-Luna-Aceves, J.J. Computer Science Department University of California Santa CruzCA95064 United States Computer Engineering Department University of California Santa CruzCA95064 United States Networking and Security Center Sun Microsystems Laboratories Palo AltoCA94303 United States

ISBN: (纸本)0780357949

It is shown that a unidirectional link of a network can be used for routing only if it has an inclusive cycle, which provides a path to carry routing updates from the downstream node to the upstream node joint by the unidirectional link. A new routing algorithm for networks with unidirectional links is then presented, which incrementally disseminates link-state information and selectively utilizes unidirectional links in networks. The new algorithm is verified to be correct and its complexity is analyzed. Simulations on a 20-node unidirectional network show that the new algorithm is more efficient than topology broadcasting. © 1999 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Offered load estimation in a multimedia cable network system

Offered load estimation in a multimedia cable network system

引用

1999 IEEE International Conference on Communications, ICC 1999

作者： Abi-Nassif, Firass Lee, Whay Chiou Stavrakakis, Ioannis Motorola Inc. Internet and Networking Group MansfieldMA02048-1193 United States Department of Electrical and Computer Engineering Northeastern University BostonMA02115 United States

ISBN: (纸本)078035284X

In this paper, the problem of traffic load estimation in a shared-medium contention-based network is investigated and applied to a hybrid fiber coaxial (HFC) cable network. In particular, an estimator that utilizes channel feedback to estimate network traffic load is presented. The performance of this estimator is investigated and is enhanced by introducing modifications which provide for a better reaction to load variations. © 1999 IEEE.

关键词： Cables

来源：评论

学校读者我要写书评

暂无评论

A new approach to on-demand loop-free multipath routing 8

A new approach to on-demand loop-free multipath routing

引用

8th International Conference on computer Communications and Networks, ICCCN 1999

作者： Raju, Jyoti Garcia-Luna-Aceves, J.J. Computer Science Dept. University of California Santa CruzCA95064 United States Computer Engineering Department University of California Santa CruzCA95064 United States Networking and Security Center Sun Microsystems Laboratories Palo AltoCA94303 United States

ISBN: (纸本)0780357949

We present and verify ROAM, an on-demand routing algorithm that maintains multiple loop-free paths to destinations. Each router maintains entries only for those destinations for which data flows through the router which reduces storage space requirements and the amount of bandwidth needed to maintain correct routing tables. In ROAM, routes are established and maintained on demand using diffusing computations. A router does not send updates for active destinations, unless its distance to them increases beyond a given threshold. ROAM maintains a state that informs routers when a destination is unreachable and prevents routers from sending unnecessary search packets attempting to find paths to an unreachable destination. ROAM is shown to converge in a finite time after an arbitrary sequence of topological changes and is shown to be loop-free at every instant. The time and communication complexities of ROAM are analyzed. © 1999 IEEE.

关键词： Digital storage

来源：评论

学校读者我要写书评

暂无评论

Risk management in software development: a technology overview and the riskit method

Risk management in software development: a technology overvi...

引用

International Conference on Software engineering (ICSE)

作者： J. Kontio Nokia Telecommunications IP Networking Finland Department of Computer Science and Engineering Helsinki University of Technology Finland

来源：评论

学校读者我要写书评

暂无评论

Unifying the secure DoD network and public ATM network infrastructure

Unifying the secure DoD network and public ATM network infra...

引用

MILCOM, Military Communications Conference

作者： H.J. Schumacher S. Ghosh Networking and Distributed Algorithms Lab Department of Computer Science & Engineering Arizona State University Tempe AZ USA

The desire to transport classified traffic securely utilizing the current network security paradigm has led the US department of Defense (DoD) to maintain its own, isolated network, distinct from the public ATM network infrastructure. Internally, the DoD maintains four completely separate and isolated networks to carry top-secret, secret, confidential, and unclassified traffic, respectively. A public ATM network may be viewed as carrying unclassified or non-secure traffic. While the cost of maintaining four separate networks is becoming increasingly prohibitive to the DoD, the inability of the public and DoD to utilize each other's network resources runs counter to the current atmosphere of dual use and economies of scale. This paper introduces the concept of a "mixed use" network, wherein the four DoD networks and the public ATM network are coalesced into a single, unified network that transports all four types of traffic, efficiently and without compromising their respective security. In "mixed use", the ATM nodes and links that are common between the DoD and public networks are labeled "joint use" and fall under the jurisdiction of the military for obvious protection of the security assets. The concept of mixed use is the direct result of the user-level, security on demand principle that is enabled by the fundamental security framework and the basic characteristic of ATM networks. This paper models a representative 32-node public ATM network, a 40-node DoD network, and the coalesced 50-node "mixed use" network, and executes accurate simulations on a testbed that, in turn, executes on a network of Linux workstations configured as a loosely-coupled parallel processor.

关键词： US department of Defense Telecommunication traffic Information security Costs Testing Defense industry Government Distributed algorithms computer science Maintenance engineering

来源：评论

学校读者我要写书评

暂无评论

Multiple-channel multicast scheduling for scalable bulk-data transport

Multiple-channel multicast scheduling for scalable bulk-data...

引用

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

作者： M.J. Donahoo M.H. Ammar E.W. Zegura Department of Computer Science School of Engineering and Computer Science Baylor University Waco TX USA Networking and Telecommunications Group College of Computing Georgia Institute of Technology Atlanta GA USA

A key technique for allowing servers to handle a large volume of requests for file transfers is to multicast the data to the set of requesting clients. Typically the paths from the server to the clients will be heterogeneous in bandwidth availability. Multiple-channel multicast (MCM) is an approach that can be used to handle this heterogeneity. In this approach the data is multicast over multiple channels, each addressed as a separate multicast group. Each receiver subscribes to a set of channels (i.e., joins the corresponding multicast groups) commensurate with its own rate capabilities. Of particular interest in the design of MCM schemes is the scheduling of data transmission across the multiple channels to accommodate asynchronous requests from clients. In this paper we present and analyze a new multiple-channel multicast approach called partition organization scheduling. The scheme is designed to result in good reception efficiency when compared to existing proposals while improving on their performance when other measures of interest are considered.

关键词： Processor scheduling Feedback computer science Availability Delay Data engineering Data communication Proposals Bandwidth Degradation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：