The Experts below are selected from a list of 1254 Experts worldwide ranked by ideXlab platform
Mantung T Hsiao - One of the best experts on this subject based on the ideXlab platform.
-
optimal control of arrivals to Token Ring Networks with exhaustive service discipline
Operations Research, 1995Co-Authors: Kent Tseng, Mantung T HsiaoAbstract:The optimal control of arrivals to a two-station Token Ring Network is analyzed in this paper. By adopting a maximum system throughput under a system time-delay constraint optimality criterion, we study a Network optimality problem with the assumption that both stations have global information i.e., the number of packets at each station. The controlled arrivals are assumed to be state-dependent Poisson streams and have exponentially distributed service time. The optimality problem will be formulated using dynamic programming with a convex cost function. Combining with duality theory, we then show that the optimal control is almost bang-bang and in the special case when both queues have the same service rate and sufficiently large buffers, the optimal control is further shown to be switchover. A nonlinear program is used to numerically determine the optimal local control for the purpose of comparison. The results obtained under global and local information can be used to provide a measure of the tradeoff between maximum throughput efficiency and protocol complexity. Numerical examples illustrating the theoretical results are also provided.
Alan Burns - One of the best experts on this subject based on the ideXlab platform.
-
An efficient and practical local synchronous bandwidth allocation scheme for the timed-Token MAC protocol
Proceedings of IEEE INFOCOM '96. Conference on Computer Communications, 1996Co-Authors: Sijing Zhang, Alan Burns, A. WellingsAbstract: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.
-
an optimal synchronous bandwidth allocation scheme for guaranteeing synchronous message deadlines with the timed Token mac protocol
IEEE ACM Transactions on Networking, 1995Co-Authors: Sijing Zhang, Alan BurnsAbstract:This paper investigates the inherent timing properties of the timed-Token medium access control (MAC) protocol necessary to guarantee synchronous message deadlines in a timed Token Ring Network such as, fiber distributed data interface (FDDI), where the timed-Token MAC protocol is employed. As a result, an exact upper bound, tighter than previously published, on the elapse time between any number of successive Token arrivals at a particular node has been derived. Based on the exact protocol timing property, an optimal synchronous bandwidth allocation (SBA) scheme named enhanced MCA (EMCA) for guaranteeing synchronous messages with deadlines equal to periods in length is proposed. This scheme is an enhancement on the previously published MCA scheme.
Sijing Zhang - One of the best experts on this subject based on the ideXlab platform.
-
An efficient and practical local synchronous bandwidth allocation scheme for the timed-Token MAC protocol
Proceedings of IEEE INFOCOM '96. Conference on Computer Communications, 1996Co-Authors: Sijing Zhang, Alan Burns, A. WellingsAbstract: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.
-
an optimal synchronous bandwidth allocation scheme for guaranteeing synchronous message deadlines with the timed Token mac protocol
IEEE ACM Transactions on Networking, 1995Co-Authors: Sijing Zhang, Alan BurnsAbstract:This paper investigates the inherent timing properties of the timed-Token medium access control (MAC) protocol necessary to guarantee synchronous message deadlines in a timed Token Ring Network such as, fiber distributed data interface (FDDI), where the timed-Token MAC protocol is employed. As a result, an exact upper bound, tighter than previously published, on the elapse time between any number of successive Token arrivals at a particular node has been derived. Based on the exact protocol timing property, an optimal synchronous bandwidth allocation (SBA) scheme named enhanced MCA (EMCA) for guaranteeing synchronous messages with deadlines equal to periods in length is proposed. This scheme is an enhancement on the previously published MCA scheme.
Kent Tseng - One of the best experts on this subject based on the ideXlab platform.
-
optimal control of arrivals to Token Ring Networks with exhaustive service discipline
Operations Research, 1995Co-Authors: Kent Tseng, Mantung T HsiaoAbstract:The optimal control of arrivals to a two-station Token Ring Network is analyzed in this paper. By adopting a maximum system throughput under a system time-delay constraint optimality criterion, we study a Network optimality problem with the assumption that both stations have global information i.e., the number of packets at each station. The controlled arrivals are assumed to be state-dependent Poisson streams and have exponentially distributed service time. The optimality problem will be formulated using dynamic programming with a convex cost function. Combining with duality theory, we then show that the optimal control is almost bang-bang and in the special case when both queues have the same service rate and sufficiently large buffers, the optimal control is further shown to be switchover. A nonlinear program is used to numerically determine the optimal local control for the purpose of comparison. The results obtained under global and local information can be used to provide a measure of the tradeoff between maximum throughput efficiency and protocol complexity. Numerical examples illustrating the theoretical results are also provided.
A. Wellings - One of the best experts on this subject based on the ideXlab platform.
-
An efficient and practical local synchronous bandwidth allocation scheme for the timed-Token MAC protocol
Proceedings of IEEE INFOCOM '96. Conference on Computer Communications, 1996Co-Authors: Sijing Zhang, Alan Burns, A. WellingsAbstract: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.