Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Ahmed N. Tantawy

dblp:39/6474 · DBLP profile ↗
← Back
11ranked-venue papers
5as first author
0since 2021 · last 1998
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 10 · 4 first-authorSystems, architecture and hardware · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
5 papers
Internet architecture and protocols · 80% Wireless networking · 12% Network optimization and economics · 9%

Topics — the 14 heaviest of 16, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Internet architecture and protocols › network interconnection
bridging
0.011994
A high performance transparent bridge · IEEE/ACM Trans. Netw. 1994
Internet architecture and protocols › metropolitan area network
distributed queue dual bus
0.011994
A mechanism for implementing preemptive priorities in DQDB subnetworks · IEEE Trans. Commun. 1994
Internet architecture and protocols › high-speed networks
gigabit networking
0.011994
A high performance transparent bridge · IEEE/ACM Trans. Netw. 1994
Internet architecture and protocols
metropolitan area network
0.011994
A mechanism for implementing preemptive priorities in DQDB subnetworks · IEEE Trans. Commun. 1994
Wireless networking › spatial reuse
slot reuse
0.011994
Source Assisted Partial Destination Slot Release in Slotted Networks · INFOCOM 1994
Internet architecture and protocols › local area network
transparent bridge
0.011994
A high performance transparent bridge · IEEE/ACM Trans. Netw. 1994
Internet architecture and protocols › network interconnection
LAN interconnection
0.011993
A Scheme for High-Performance LAN Interconnection Across Public MAN's · IEEE J. Sel. Areas Commun. 1993
Internet architecture and protocols
network interconnection
0.011993
A Scheme for High-Performance LAN Interconnection Across Public MAN's · IEEE J. Sel. Areas Commun. 1993
Wireless networking
medium access control
0.011994
A mechanism for implementing preemptive priorities in DQDB subnetworks · IEEE Trans. Commun. 1994
Internet architecture and protocols › packet scheduling
prioritized multiplexing
0.011994
A mechanism for implementing preemptive priorities in DQDB subnetworks · IEEE Trans. Commun. 1994
Internet architecture and protocols › network architecture design
layered architecture
0.011993
A Model for Flexible High-Performance Communication Subsystems · IEEE J. Sel. Areas Commun. 1993
Internet architecture and protocols › network architecture design
OSI reference model
0.011993
A Scheme for High-Performance LAN Interconnection Across Public MAN's · IEEE J. Sel. Areas Commun. 1993
Internet architecture and protocols › network architecture design › layered architecture
protocol layering
0.011993
A Model for Flexible High-Performance Communication Subsystems · IEEE J. Sel. Areas Commun. 1993
Internet architecture and protocols › network architecture design › layered architecture
protocol stack
0.011993
A Scheme for High-Performance LAN Interconnection Across Public MAN's · IEEE J. Sel. Areas Commun. 1993

Methods — techniques the papers use, named apart from their topics

preemptive priority multiplexing · 0.0hardware partitioning · 0.0concurrent bridging · 0.0functional modules · 0.0
YearPublicationVenuePosition
1998 Credit scheduling: adaptive scheduling with dynamic service quota
Dimitrios Serpanos, Asser N. Tantawi, Ahmed N. Tantawy
Comput. Commun.3
1998 SAILOR: a source assisted partial destination slot release scheme for slotted networks
Ahmed N. Tantawy, Chatschik Bisdikian
Comput. Commun.1
1994 Source Assisted Partial Destination Slot Release in Slotted Networks
abstract
Presents a new scheme that enables destination nodes in a slotted shared medium network to release some received slots, hence making them available for reuse by other downstream nodes in the network. This scheme ensures a significant increase in the effective capacity of the network without any noticeable degradation in node processing delays, or increase of node complexity.>
Ahmed N. Tantawy, Chatschik Bisdikian
INFOCOM1
1994 Editorial
Ahmed N. Tantawy
Comput. Commun.1
1994 A mechanism for implementing preemptive priorities in DQDB subnetworks
abstract
The authors propose a mechanism for implementing priorities in an IEEE 802.6 (DQDB) subnetwork of a metropolitan area network. The mechanism allows the priorities to be preemptively multiplexed among each other, thus, always guaranteeing maximum bandwidth to the highest priority traffic whenever it is requested. The proposed mechanism responds fast in the presence of high priority traffic and it takes full effect within at most one round trip propagation delay.>
Chatschik Bisdikian, Ahmed N. Tantawy
IEEE Trans. Commun.2
1994 A high performance transparent bridge
abstract
The high performance transparent bridge (HPTB) is a multiport bridge interconnecting gigabit networks. The provision of specialized hardware support coupled with proper partitioning of bridging protocol entities makes it possible to process frames at very high rates. The HPTB architecture allows concurrent bridging of asynchronous, synchronous and isochronous traffic among heterogeneous networks. It supports both traditional networks, such as variable packet size local area networks (LANs), and cell-based net works, such as distributed queue dual bus (DQDB) and metropolitan area networks (MANs). This device is capable of interconnecting any combination of high speed LANs of rates up to 800 Mbps and/or MANs of rates up to 622 Mbps.>
Martina Zitterbart, Ahmed N. Tantawy, Dimitrios Serpanos
IEEE/ACM Trans. Netw.2
1993 Language support for flexible, application-tailored protocol configuration
abstract
A framework containing a number of resources, languages, and tools for generating customized protocols that support diverse multimedia applications running on high-performance networks is described. The framework facilitates the configuration of application-tailored, function-based communication protocols that are automatically synthesized from high-level specifications.
Douglas C. Schmidt, Burkhard Stiller, Tatsuya Suda, Ahmed N. Tantawy, Martina Zitterbart
LCN4
1993 A Scheme for High-Performance LAN Interconnection Across Public MAN's
abstract
The proliferation of local area networks (LANs) and the emergence of high-bandwidth public networks will create an environment in which it will become increasingly simple and attractive to communicate among different organizations across a common public networking infrastructure. The open bridging scheme proposed, which employs inherent features of forthcoming cell-based metropolitan area networks (MANs) in order to achieve efficient interenterprise communications is introduced. It uses enhanced remote LAN bridging techniques to ensure router-level functionality with bridge-level simplicity and performance. The practicality of open bridging is shown by describing how it can be incorporated in networks using current standard protocol stacks, such as open systems interconnnection (OSI) and transmission control protocol/internet protocol (TCP/IP).>
Ahmed N. Tantawy, Martina Zitterbart
IEEE J. Sel. Areas Commun.1
1993 A Model for Flexible High-Performance Communication Subsystems
abstract
A function-based communication model that allows applications to request individually tailored services from the communication subsystem is presented. Based on service requirements and available resources, suitable protocol machines are configured to serve the application. This configuration is done using a proper combination of functional modules. The concept of layering is therefore abandoned for both flexibility and efficiency reasons.>
Martina Zitterbart, Burkhard Stiller, Ahmed N. Tantawy
IEEE J. Sel. Areas Commun.3
1992 An Adaptive Scheduling Scheme for Dynamic Service Time Allocation on a Shared Resource
abstract
A scheduling scheme that allows a number of customers to share a common resource in an efficient and fair way is presented. Each customer is allowed to use the resource for an amount of time that does not exceed a certain limit, the limit being a function of the waiting time elapsed between the time of its last request and the time of access to the resource. After expiration of the service time allocated to a customer, if more service is still needed, the customer has to re-enter the request queue and issue a new service request. The scheme combines the advantages of both processor-sharing and first-come, first-served disciplines in a dynamic way. The applicability and the advantages of the scheme in both open and closed system environments are discussed.>
Ahmed N. Tantawy, Asser N. Tantawi, Dimitrios Serpanos
ICDCS1
1992 Analysis of TCP/IP for high performance parallel implementations
abstract
An analysis of potential parallelism in TCP/IP is presented for two purposes. First, it is used as a basis for an implementation on a multiprocessing platform. Second, it reveals the areas where protocol modifications and/or tuning would yield more efficient implementations on multiprocessors. The focus is on the analysis, and detailed dependence graphs among the atomic TCP/IP protocol functions are presented. No specific implementation design is shown, since this highly depends on the particular hardware chosen.>
Odysseas G. Koufopavlou, Ahmed N. Tantawy, Martina Zitterbart
LCN2