The Experts below are selected from a list of 321 Experts worldwide ranked by ideXlab platform
Chengshang Chang - One of the best experts on this subject based on the ideXlab platform.
-
Mailbox switch a scalable two stage switch architecture for conflict resolution of ordered packets
IEEE Transactions on Communications, 2008Co-Authors: Chengshang Chang, Yingju Shih, Chaolin YuAbstract:Traditionally, conflict resolution in an input- buffered switch is solved by finding a matching between inputs and outputs per time slot, which incurs unscalable computation and communication overheads. The main objective of this paper is to propose a scalable solution, called the Mailbox switch, that solves the out-of-sequence problem in the two-stage switch architecture. The key idea of the Mailbox switch is to use a set of symmetric connection patterns to create a feedback path for packet departure times. With the information of packet departure times, the Mailbox switch can schedule packets so that they depart in the order of their arrivals. Despite the simplicity of the Mailbox switch, we show via both the theoretical models and simulations that the throughput of the Mailbox switch can be as high as 75%. With limited resequencing delay, a modified version of the Mailbox switch achieves 95% throughput. We also propose a recursive way to construct the switch fabrics for the set of symmetric connection patterns. If the number of inputs, N, is a power of 2, we show that the switch fabric for the Mailbox switch can be built with y log2 N 2 x 2 switches.
-
Mailbox switch a scalable two stage switch architecture for conflict resolution of ordered packets
International Conference on Computer Communications, 2004Co-Authors: Chengshang Chang, Yingju ShihAbstract:Traditionally, conflict resolution in an input-buffered switch is solved by finding a matching between inputs and outputs per time slot. To do this, a switch not only needs to gather the information of the virtual output queues at the inputs, hut also uses the gathered information to compute a matching. As such, both the communication overhead and the computation overhead make it difficult to scale. Recent works on the two-stage switch architecture in (6|, [7], [12], (8| showed that conflict resolution can be easily solved over time and space without communication and computation overhead. However, the main problem of such a two-stage switch architecture is that packets might be out of sequence. The main objective of this paper is to propose a scalable solution, called the Mailbox switch, that solves the out-of-sequence problem in the two-stage switch architecture. The key idea of the Mailbox switch is to use a set of symmetric connection patterns to create a feedback path for packet departure times. With the information of packet departure times, the Mailbox switch can schedule packets so that they depart in the order of their arrivals. Despite the simplicity of the Mailbox switch, we show via both the theoretical models and simulations that the throughput of the Mailbox switch can be as high as 75%. With limited resequencing delay, a modified version of the Mailbox switch achieves 95% throughput. We also propose a recursive way to construct the switch fabrics for the set of symmetric connection patterns. If the number of inputs, N, is a power of 2, we show that the switch fabric for the Mailbox switch can be built with N/2 log2 N 2times2 switches
-
INFOCOM - Mailbox switch: a scalable two-stage switch architecture for conflict resolution of ordered packets
IEEE INFOCOM 2004, 2004Co-Authors: Chengshang Chang, Yingju ShihAbstract:Traditionally, conflict resolution in an input-buffered switch is solved by finding a matching between inputs and outputs per time slot. To do this, a switch not only needs to gather the information of the virtual output queues at the inputs, hut also uses the gathered information to compute a matching. As such, both the communication overhead and the computation overhead make it difficult to scale. Recent works on the two-stage switch architecture in (6|, [7], [12], (8| showed that conflict resolution can be easily solved over time and space without communication and computation overhead. However, the main problem of such a two-stage switch architecture is that packets might be out of sequence. The main objective of this paper is to propose a scalable solution, called the Mailbox switch, that solves the out-of-sequence problem in the two-stage switch architecture. The key idea of the Mailbox switch is to use a set of symmetric connection patterns to create a feedback path for packet departure times. With the information of packet departure times, the Mailbox switch can schedule packets so that they depart in the order of their arrivals. Despite the simplicity of the Mailbox switch, we show via both the theoretical models and simulations that the throughput of the Mailbox switch can be as high as 75%. With limited resequencing delay, a modified version of the Mailbox switch achieves 95% throughput. We also propose a recursive way to construct the switch fabrics for the set of symmetric connection patterns. If the number of inputs, N, is a power of 2, we show that the switch fabric for the Mailbox switch can be built with N/2 log2 N 2times2 switches
Chaolin Yu - One of the best experts on this subject based on the ideXlab platform.
-
Mailbox switch a scalable two stage switch architecture for conflict resolution of ordered packets
IEEE Transactions on Communications, 2008Co-Authors: Chengshang Chang, Yingju Shih, Chaolin YuAbstract:Traditionally, conflict resolution in an input- buffered switch is solved by finding a matching between inputs and outputs per time slot, which incurs unscalable computation and communication overheads. The main objective of this paper is to propose a scalable solution, called the Mailbox switch, that solves the out-of-sequence problem in the two-stage switch architecture. The key idea of the Mailbox switch is to use a set of symmetric connection patterns to create a feedback path for packet departure times. With the information of packet departure times, the Mailbox switch can schedule packets so that they depart in the order of their arrivals. Despite the simplicity of the Mailbox switch, we show via both the theoretical models and simulations that the throughput of the Mailbox switch can be as high as 75%. With limited resequencing delay, a modified version of the Mailbox switch achieves 95% throughput. We also propose a recursive way to construct the switch fabrics for the set of symmetric connection patterns. If the number of inputs, N, is a power of 2, we show that the switch fabric for the Mailbox switch can be built with y log2 N 2 x 2 switches.
Yingju Shih - One of the best experts on this subject based on the ideXlab platform.
-
Mailbox switch a scalable two stage switch architecture for conflict resolution of ordered packets
IEEE Transactions on Communications, 2008Co-Authors: Chengshang Chang, Yingju Shih, Chaolin YuAbstract:Traditionally, conflict resolution in an input- buffered switch is solved by finding a matching between inputs and outputs per time slot, which incurs unscalable computation and communication overheads. The main objective of this paper is to propose a scalable solution, called the Mailbox switch, that solves the out-of-sequence problem in the two-stage switch architecture. The key idea of the Mailbox switch is to use a set of symmetric connection patterns to create a feedback path for packet departure times. With the information of packet departure times, the Mailbox switch can schedule packets so that they depart in the order of their arrivals. Despite the simplicity of the Mailbox switch, we show via both the theoretical models and simulations that the throughput of the Mailbox switch can be as high as 75%. With limited resequencing delay, a modified version of the Mailbox switch achieves 95% throughput. We also propose a recursive way to construct the switch fabrics for the set of symmetric connection patterns. If the number of inputs, N, is a power of 2, we show that the switch fabric for the Mailbox switch can be built with y log2 N 2 x 2 switches.
-
Mailbox switch a scalable two stage switch architecture for conflict resolution of ordered packets
International Conference on Computer Communications, 2004Co-Authors: Chengshang Chang, Yingju ShihAbstract:Traditionally, conflict resolution in an input-buffered switch is solved by finding a matching between inputs and outputs per time slot. To do this, a switch not only needs to gather the information of the virtual output queues at the inputs, hut also uses the gathered information to compute a matching. As such, both the communication overhead and the computation overhead make it difficult to scale. Recent works on the two-stage switch architecture in (6|, [7], [12], (8| showed that conflict resolution can be easily solved over time and space without communication and computation overhead. However, the main problem of such a two-stage switch architecture is that packets might be out of sequence. The main objective of this paper is to propose a scalable solution, called the Mailbox switch, that solves the out-of-sequence problem in the two-stage switch architecture. The key idea of the Mailbox switch is to use a set of symmetric connection patterns to create a feedback path for packet departure times. With the information of packet departure times, the Mailbox switch can schedule packets so that they depart in the order of their arrivals. Despite the simplicity of the Mailbox switch, we show via both the theoretical models and simulations that the throughput of the Mailbox switch can be as high as 75%. With limited resequencing delay, a modified version of the Mailbox switch achieves 95% throughput. We also propose a recursive way to construct the switch fabrics for the set of symmetric connection patterns. If the number of inputs, N, is a power of 2, we show that the switch fabric for the Mailbox switch can be built with N/2 log2 N 2times2 switches
-
INFOCOM - Mailbox switch: a scalable two-stage switch architecture for conflict resolution of ordered packets
IEEE INFOCOM 2004, 2004Co-Authors: Chengshang Chang, Yingju ShihAbstract:Traditionally, conflict resolution in an input-buffered switch is solved by finding a matching between inputs and outputs per time slot. To do this, a switch not only needs to gather the information of the virtual output queues at the inputs, hut also uses the gathered information to compute a matching. As such, both the communication overhead and the computation overhead make it difficult to scale. Recent works on the two-stage switch architecture in (6|, [7], [12], (8| showed that conflict resolution can be easily solved over time and space without communication and computation overhead. However, the main problem of such a two-stage switch architecture is that packets might be out of sequence. The main objective of this paper is to propose a scalable solution, called the Mailbox switch, that solves the out-of-sequence problem in the two-stage switch architecture. The key idea of the Mailbox switch is to use a set of symmetric connection patterns to create a feedback path for packet departure times. With the information of packet departure times, the Mailbox switch can schedule packets so that they depart in the order of their arrivals. Despite the simplicity of the Mailbox switch, we show via both the theoretical models and simulations that the throughput of the Mailbox switch can be as high as 75%. With limited resequencing delay, a modified version of the Mailbox switch achieves 95% throughput. We also propose a recursive way to construct the switch fabrics for the set of symmetric connection patterns. If the number of inputs, N, is a power of 2, we show that the switch fabric for the Mailbox switch can be built with N/2 log2 N 2times2 switches
Xinyu Feng - One of the best experts on this subject based on the ideXlab platform.
-
GLOBECOM - Adaptive and reliable message delivery for mobile objects
GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489), 2003Co-Authors: Liang Zhang, Xinyu FengAbstract:This paper proposes an adaptive and reliable message delivery protocol for mobile objects. The protocol uses a Mailbox-based scheme, which associates each mobile object with a Mailbox while allowing the decoupling between them. It provides location-independent message passing and overcome message loss caused by mobile object's mobility. It also reduces the reliance on home location sever and relaxes the constraint on mobile object's mobility. The protocol is suitable for different mobility and communication patterns by choosing different Mailbox migration frequency properly. Its applications include mobile agent system, mobile Internet and short message service.
-
Adaptive and reliable message delivery for mobile objects
GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489), 2003Co-Authors: Liang Zhang, Xinyu FengAbstract:This paper proposes an adaptive and reliable message delivery protocol for mobile objects. The protocol uses a Mailbox-based scheme, which associates each mobile object with a Mailbox while allowing the decoupling between them. It provides location-independent message passing and overcome message loss caused by mobile object's mobility. It also reduces the reliance on home location sever and relaxes the constraint on mobile object's mobility. The protocol is suitable for different mobility and communication patterns by choosing different Mailbox migration frequency properly. Its applications include mobile agent system, mobile Internet and short message service.
-
Mailbox based scheme for mobile agent communications
IEEE Computer, 2002Co-Authors: Xinyu Feng, Jian LuAbstract:In various situations, mobile agents at different hosts must cooperate with one another by sharing information and making decisions collectively. To ensure effective interagent communication, communication protocols must track target agent locations and deliver messages reliably. Researchers have proposed a wide range of schemes for agent tracking and reliable message delivery. However, each scheme has its own assumptions, design goals, and methodology. As a result, no uniform or structured methods exist for characterizing current protocols, making it difficult to evaluate their relative effectiveness and performance. The authors propose a Mailbox-based scheme for designing mobile agent communication protocols. This scheme assigns each agent a Mailbox to buffer messages, but decouples the agent and Mailbox to let them reside at different hosts and migrate separately.
-
an efficient Mailbox based algorithm for message delivery in mobile agent systems
Lecture Notes in Computer Science, 2001Co-Authors: Xinyu Feng, Jian Lu, Henry C B ChanAbstract:Agent mobility presents challenges to the design of efficient message transport protocols for mobile agent communications. A practical mobile agent communication protocol should provide location transparency to the programmer and thus need to keep track of the movement of an agent. In addition, because of the asynchronous nature of message passing and agent migration, how to guarantee the delivery of messages to highly mobile agents is still an active research topic in mobile agent systems. In this paper we propose an efficient Mailbox-based algorithm for inter-mobile agent communications. The algorithm decentralizes the role of the origin (home) host in locating an agent. Furthermore, by separating the Mailbox from its owner agent, the algorithm can be made adaptive and is efficient in terms of location updating and message delivery. In the cases that mobile agents migrate frequently but seldom communicate, our algorithm turns out to be preferable.
A. Melnikov - One of the best experts on this subject based on the ideXlab platform.
-
The Sieve Mail-Filtering Language -- Extensions for Checking Mailbox Status and Accessing Mailbox Metadata Status of This Memo This document specifies an Internet standards track protocol for the
2020Co-Authors: A. MelnikovAbstract:This memo defines an extension to the Sieve mail filtering language (RFC 5228) for accessing Mailbox and server annotations, checking for Mailbox existence, and controlling Mailbox creation on "fileinto" action.
-
The Sieve Mail-Filtering Language -- Extensions for Checking Mailbox Status and Accessing Mailbox Metadata
2009Co-Authors: A. MelnikovAbstract:This memo defines an extension to the SIEVE mail filtering language (RFC 5228) for accessing Mailbox and server annotations (variables).
