1
David Lee, S Jamaloddin Golestani, Mark John Karol: Prevention of deadlocks and livelocks in lossless, backpressured packet networks. Lucent Technologies, February 22, 2005: US06859435 (114 worldwide citation)

A packet communication network is arranged so that a backpressure or feedback signal is sent from a receiving node to a node having packets to send to the receiving,node, selectively allowing only certain packets to be considered eligible for transmission. The backpressure is arranged to be lossless ...


2
S Jamaloddin Golestani: Congestion management based on multiple framing strategy. Bell Communications Research, James W Falk, September 17, 1991: US05050161 (75 worldwide citation)

A congestion control strategy for a packet network comprises an admission policy which controls the admission of packets into the network and a stop-and-go queuing strategy at the network nodes. The congestion control strategy utilizes multiple frame sizes so that certain types of connections can be ...


3
S Jamaloddin Golestani: Duration limited statistical multiplexing in packet networks. Bell Communications Research, Leonard Charles Suchyta, June 9, 1992: US05121383 (72 worldwide citation)

A method and associated node structure (11) for the efficient and reliable transmission of delay sensitive traffic in a packet network (10) is disclosed. The method provides bounded end-to-end delay for all delay sensitive traffic and can guarantee loss-free transmission to that part of the delay se ...


4
S Jamaloddin Golestani: Congestion free packet network. Bell Communications Research, James W Falk, September 17, 1991: US05050162 (57 worldwide citation)

A congestion control scheme for a connection oriented packet network is disclosed. The congestion control scheme eliminates buffer overflow and provides congestion free communication by eliminating the clustering of packets. Clustering is eliminated by imposing a smoothness requirement on the packet ...


5
S Jamaloddin Golestani: Scaleable congestion control method for multicast communications over a data network. Lucent Technologies, September 5, 2006: US07102998 (15 worldwide citation)

The operation of a multicast network is enhanced by shifting the responsibility for performing congestion control with regulation for the transmission of multicast data packets from the transmitter to the receivers, such that each receiver computes a congestion control value using particular statist ...


6
S Jamaloddin Golestani: End-to-end internet control. Lucent Technologies, November 15, 2005: US06965943 (11 worldwide citation)

In a class of minimum cost flow control (MCFC) algorithms for adjusting session rates or window sizes congestion control is achieved through consideration of an incremental cost function that addresses link congestion, and an incremental cost function that addresses the cost of providing less than t ...


7
Yigal Bejerano, S Jamaloddin Golestani, Seung Jae Han, Mark Anthony Shawn Smith: Methods and devices for determining the adjacency of access points in a wireless network. Lucent Technologies, September 30, 2008: US07430189 (3 worldwide citation)

The adjacency of access points in a wireless, local area network is used to determine the existence of common overlapping access point coverage areas and to determine maximum distances between access points.


8
Yigal Bejerano, S Jamaloddin Golestani, Seung Jae Han, Mark Anthony Shawn Smith: Methods and devices for associating a mobile device to access points within a WLAN. Alcatel Lucent, Capitol Patent & Trademark Law Firm PLLC, August 28, 2012: US08254347 (1 worldwide citation)

Unique identifiers are assigned to sets of adjacent access points in a wireless, local area network (WLAN). Thereafter, a unique identifier may be forwarded to a mobile device which uses the identifier to associate itself with one of the adjacent access points. Associating a mobile device with an ad ...


9
S Jamaloddin Golestani, Rajeev Rastogi, Mark Anthony Smith: Allocation of channels to wireless LANs. Lucent Technologies, March 20, 2007: US07194271 (1 worldwide citation)

Channels are allocated to one or more cells within a wireless LAN (WLAN) without causing unacceptable interference. The allocation involves dividing an allocation time period into frames, each frame having a substantially short duration, and then allocating one or more channels to one or more WLAN c ...


10
S Jamaloddin Golestani, Rajeev Rastogi, Mark Anthony Smith: Computing optimal channel allocations using decomposition methods and related devices. Alcatel Lucent USA, April 21, 2009: US07522566

By decomposing (i.e., dividing) an interference graph into subgraphs, it becomes feasible to compute close approximations of an optimal channel allocation scheme within a reasonable amount of time. The channel allocation scheme may be used to allocate specific channels to access points (APs) in a wi ...