Learn More
— Input-buffered switches have been widely considered for implementing feasible packet switches. However, their matching process may not be time efficient for switches with high-speed ports. Buffered crossbars are an alternative to relax timing for packet switches with high-speed ports and to provide high-performance switching. Buffered crossbar switches(More)
— We propose a novel architecture, a Combined Input-Crosspoint-Output Buffered (CIXOB-k, where k is the size of the crosspoint buffer) Switch. CIXOB-k architecture provides 100% throughput under uniform and unbalanced traffic. It also provides timing relaxation and scalability. CIXOB-k is based on a switch with Combined Input-Crosspoint Buffering (CIXB-k)(More)
A Clos-network switch architecture is attractive because of its scalability. Previously proposed implementable dispatching schemes from the first stage to the second stage, such as random dispatching (RD), are not able to achieve high throughput unless the internal bandwidth is expanded. This paper presents two round-robin-based dispatching schemes to(More)
— Combined input-crosspoint buffered switches are an alternative to relax arbitration timing and to provide high-performance switching for packet switches with high-speed ports. It has been shown that these switches, with one-cell crosspoint buffer and round-robin arbitration at input and output ports, provide 100% throughput under uniform traffic. However,(More)
SUMMARY This paper considers optical transport and packet networks and discusses the constraints and solutions in computation of traffic engineering paths. We categorize the constraints into prunable or non-prunable classes. The former involves a simple metric which can be applied for filtering to determine the path. The latter requires a methodic(More)
The growth of the Internet and emerging application layer technologies causes numerous changes in network environments. Therefore , it becomes important to achieve adaptive methods of controlling networks in addition to optimizing their performance. To achieve an adaptive network control method, we focus on attractor selection, which models behaviors where(More)
—In a Service Provider (SP) network, routes for external destinations are distributed on iBGP sessions. This traditionally required the establishment of a full-mesh of iBGP sessions in the network. A common practice is now to make use of Route Reflectors (RR). Such a practice is more scalable in the number of iBGP sessions to be configured in a SP network.(More)
—This letter proposes a disjoint path selection scheme for generalized multi-protocol label switching (GMPLS) networks with shared risk link group (SRLG) constraints. It is called the weighted-SRLG (WSRLG) scheme. It treats the number of SRLG members related to a link as part of the link cost when the-shortest path algorithm is executed. In WSRLG, a link(More)
—This letter proposes an innovative pipeline-based maximal-sized matching scheduling approach, called PMM, for input-buffered switches. It dramatically relaxes the timing constraint for arbitration with a maximal matching scheme. In the PMM approach, arbitration operates in a pipelined manner. Each subscheduler is allowed to take more than one time slot for(More)