In packet-switched networks, queueing of packets at the switches can result when multiple connections share the same physical link. To accommodate a large number of connections, a switch can employ link-scheduling alg...
详细信息
In packet-switched networks, queueing of packets at the switches can result when multiple connections share the same physical link. To accommodate a large number of connections, a switch can employ link-scheduling algorithms to prioritize the transmission of the queued packets. Due to the high-speed links and small packet sizes, a hardware solution is needed for the priority queue in order to make the link schedulers effective. But for good performance, the switch should also support a large number of priority levels (P) and be able to buffer a large number of packets (N). So a hardware priority queue design must be both fast and scalable (with respect to N and P) in order to be implemented effectively. In this paper we first compare four existing hardware priority queue architectures, and identify scalability limitations on implementing these existing architectures for large N and P. Based on our findings, we propose two new priority queue architectures, and evaluate them using simulation results from Verilog HDL and Epoch implementations.
A Health Care Establishment (HCE) is an establishment where medical services are rendered. The above services are provided by the health care personnel. The infrastructure of a HCE may include Information Technology (...
详细信息
This paper describes the motivations for and main features of Tigger - a framework for the construction of a family of object-support operating systems that can be tailored for use in a variety of different applicatio...
详细信息
This paper considers the programming of passive (cold and warm standbys) and active replicated systems in Ada 95. We show that it is relatively easy to develop systems which act as standbys using the facilities provid...
详细信息
This paper considers the programming of passive (cold and warm standbys) and active replicated systems in Ada 95. We show that it is relatively easy to develop systems which act as standbys using the facilities provided by the language and the distributedsystems Annex. Arguably, active replication in Ada 95 can be supported in a manner which is transparent to the application. However, this is implementation-dependent, requires a complex distributed consensus algorithm (or a carefully chosen subset of the language to be used) and has little flexibility. We therefore consider two extensions to the distributedsystems Annex to help give the application programmer more control. The first is a via a new categorization pragma which specifies that a RCI package can be replicated in more than one partition. The second is through the introduction of a coordinated type which has a single primitive operation. Objects which are created from extensions to coordinated types can be freely replicated across the distributed system. When the primitive operation is called, the call is posted to all sites where a replica resides, effectively providing a broadcast (multicast) facility. We also consider extensions to the partition communication subsystem which implement these new features.
Object-oriented development is a structuring paradigm. It does not provide substantial support for the specification of ‘end to end’ control and data flow. This has implications for hard real-time system development...
详细信息
The paper presents a strategy for the composition of components to meet 'end to end' timing requirements. This is a framework based approach known as transaction integration. A framework is constructed through...
详细信息
The paper presents a strategy for the composition of components to meet 'end to end' timing requirements. This is a framework based approach known as transaction integration. A framework is constructed through the use of transactions. A transaction represents a control and data flow path across a set of component interfaces, or placeholders, that must be completed by a specific deadline. Reusable real time components are 'plugged' into each placeholder. The paper provides techniques to verify that the performance characteristics of each placeholder, and the 'end to end' deadlines associated with each transaction are met.
Discusses some of the problems designers face in building catalogs in large networks and relates them back to the resource discovery problem. Currently many catalogs tend to be built in an ad hoc fashion-which leads t...
详细信息
Discusses some of the problems designers face in building catalogs in large networks and relates them back to the resource discovery problem. Currently many catalogs tend to be built in an ad hoc fashion-which leads to a great variety in the quality of publicly accessible network catalogs. Furthermore, the research surrounding these catalogs tends to focus on narrow technical issues-resulting in difficult-to-use catalogs. Addresses this problem by providing a usability framework based on the library science and human computer interaction literature, and demonstrates some of those principles via an example of a prototype. Results are interesting to resource discovery tool developers in that a framework for understanding the general resource discovery problem is provided and some techniques for dealing with those problems are presented.
This paper is concerned with deadline guarantees of synchronous messages with deadlines equal to periods, in a timed token ring network such as FDDI where the timed token medium access control (MAC) protocol is used. ...
详细信息
This paper is concerned with deadline guarantees of synchronous messages with deadlines equal to periods, in a timed token ring network such as FDDI where the timed token medium access control (MAC) protocol is used. The timed token protocol guarantees a bounded access time and an average bandwidth for synchronous traffic. However, this guarantee alone, though necessary, is insufficient for guaranteeing the transmission of synchronous messages before their deadlines. To ensure timely delivery, the synchronous bandwidth must be carefully allocated to individual nodes. We propose and analyse an efficient and practical local synchronous bandwidth allocation (SBA) scheme. The new scheme performs better than any previously published as it calculates the synchronous bandwidth such that during the message period, the total synchronous transmission time definitely available (when judged only by local information) is exactly equal to the transmission time required. Our scheme also differs significantly from previously reported ones by explicitly taking into account the synchronous bandwidth allocation for message sets whose minimum message deadlines (D/sub min/) are less than twice the target token rotation time (TTRT), and consequently can apply to any synchronous message set (with D/sub min/>TTRT). The feasibility of the allocations produced by the proposed scheme and the worst case achievable utilisation of the scheme are also discussed.
Authentication is a key requirement in the establishment of secure interactions between network entities. Several authentication and key establishment protocols have been proposed in recent years. Most of these protoc...
详细信息
Authentication is a key requirement in the establishment of secure interactions between network entities. Several authentication and key establishment protocols have been proposed in recent years. Most of these protocols were designed for an intra-domain environment (i.e. one where the communicating parties reside in a single domain) and then extrapolated to the inter-domain environment. In this paper, the design of inter-domain protocols is investigated. We present the different design choices that need to be carefully considered when designing inter-domain protocols in large distributedsystems. We propose three different inter-domain protocols with varying degrees of responsibility placed on the client and the trusted servers. In each case, the assumptions made in the design are explicitly stated. This helps to illustrate the rationale behind the choices made. The proposed protocols use symmetric key systems and are based on Kerberos. The arguments, rationales and designs presented in this paper are also applicable to OSF's distributed Computing Environment (DCE).
作者:
I. MiddletonR.I. DamperImage
Speech and Intelligent Systems Research Group Department of Electronics and Computer Science University of Southampton Southampton UK
Segmentation of medical images is an important first step in their interpretation. Thus an automatic segmentation technique would be of great benefit by reducing the manual effort currently required for this task. Thi...
详细信息
Segmentation of medical images is an important first step in their interpretation. Thus an automatic segmentation technique would be of great benefit by reducing the manual effort currently required for this task. This paper reports on the use of neural networks in identifying the lung boundary in magnetic resonance images of the thorax. The networks are able to segment the slices used in training. Improved performance on unseen slices can be achieved using weight elimination and multi-slice training data.
暂无评论